Triple
T1116749
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Learning representations by back-propagating errors |
E11117
|
entity |
| Predicate | title |
P38
|
FINISHED |
| Object | Learning representations by back-propagating errors |
E11117
|
NE FINISHED |
How this triple was built (2 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: Learning representations by back-propagating errors | Statement: [Learning representations by back-propagating errors, title, Learning representations by back-propagating errors]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Learning representations by back-propagating errors Context triple: [Learning representations by back-propagating errors, title, Learning representations by back-propagating errors]
-
A.
“Learning representations by back-propagating errors”
chosen
“Learning representations by back-propagating errors” is a landmark 1986 research paper that popularized the backpropagation algorithm for training multi-layer neural networks, helping to launch the modern field of deep learning.
-
B.
Gradient-based learning applied to document recognition
"Gradient-based learning applied to document recognition" is a seminal 1998 paper by Yann LeCun and colleagues that introduced and demonstrated the effectiveness of convolutional neural networks for tasks like handwritten digit recognition, helping to lay the foundations of modern deep learning.
-
C.
“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.
-
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.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69a493252a648190ac48f8742474a5e8 |
completed | March 1, 2026, 7:27 p.m. |
| NER | Named-entity recognition | batch_69a4bba2b550819081f8a100638d2fba |
completed | March 1, 2026, 10:20 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ac53999b3c8190aff1cf84a3c16909 |
completed | March 7, 2026, 4:34 p.m. |
Created at: March 1, 2026, 7:43 p.m.