Triple
T2373510
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Terrence Sejnowski |
E46141
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Helmholtz machine
The Helmholtz machine is a pioneering generative neural network model that learns internal representations by using separate recognition and generative pathways to perform unsupervised learning.
|
E260031
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Helmholtz machine | Statement: [Terrence Sejnowski, knownFor, Helmholtz machine]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Helmholtz machine Context triple: [Terrence Sejnowski, knownFor, Helmholtz machine]
-
A.
Boltzmann machines
Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
-
B.
“A fast learning algorithm for deep belief nets”
“A fast learning algorithm for deep belief nets” is a seminal 2006 paper by Geoffrey Hinton that introduced an efficient unsupervised pretraining method for deep neural networks using stacked restricted Boltzmann machines.
-
C.
Deep belief networks
Deep belief networks are a class of deep generative neural network models composed of stacked layers of latent variables, typically built from restricted Boltzmann machines, used for unsupervised feature learning and representation.
-
D.
Hopfield networks
Hopfield networks are recurrent artificial neural networks that serve as content-addressable memory systems, storing patterns as stable states and retrieving them through dynamics that minimize an energy function.
-
E.
Auto-Encoding Variational Bayes
Auto-Encoding Variational Bayes is the foundational 2013 paper by Kingma and Welling that introduced variational autoencoders, a generative model framework combining deep learning with variational Bayesian inference.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Helmholtz machine Triple: [Terrence Sejnowski, knownFor, Helmholtz machine]
Generated description
The Helmholtz machine is a pioneering generative neural network model that learns internal representations by using separate recognition and generative pathways to perform unsupervised learning.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Helmholtz machine Target entity description: The Helmholtz machine is a pioneering generative neural network model that learns internal representations by using separate recognition and generative pathways to perform unsupervised learning.
-
A.
Boltzmann machines
Boltzmann machines are stochastic recurrent neural networks used for learning complex probability distributions, foundational in unsupervised learning and energy-based models.
-
B.
“A fast learning algorithm for deep belief nets”
“A fast learning algorithm for deep belief nets” is a seminal 2006 paper by Geoffrey Hinton that introduced an efficient unsupervised pretraining method for deep neural networks using stacked restricted Boltzmann machines.
-
C.
Deep belief networks
Deep belief networks are a class of deep generative neural network models composed of stacked layers of latent variables, typically built from restricted Boltzmann machines, used for unsupervised feature learning and representation.
-
D.
Hopfield networks
Hopfield networks are recurrent artificial neural networks that serve as content-addressable memory systems, storing patterns as stable states and retrieving them through dynamics that minimize an energy function.
-
E.
Auto-Encoding Variational Bayes
Auto-Encoding Variational Bayes is the foundational 2013 paper by Kingma and Welling that introduced variational autoencoders, a generative model framework combining deep learning with variational Bayesian inference.
- F. None of above. chosen
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69a88a145268819083e2736cb835c696 |
completed | March 4, 2026, 7:37 p.m. |
| NER | Named-entity recognition | batch_69abc791c4688190a4b8f0e540e84eb4 |
completed | March 7, 2026, 6:37 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69aea8a8c2b88190a18dbf35d745958f |
completed | March 9, 2026, 11:02 a.m. |
| NEDg | Description generation | batch_69aea92cc66c81909a46b83200960fe2 |
completed | March 9, 2026, 11:04 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69aea9b8dff08190a09f0c965dfd6738 |
completed | March 9, 2026, 11:06 a.m. |
Created at: March 4, 2026, 7:56 p.m.