Triple
T2993559
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Simon Osindero |
E81011
|
entity |
| Predicate | hasPublication |
P80
|
FINISHED |
| Object |
Modeling image patches with a directed hierarchy of Markov random fields
"Modeling image patches with a directed hierarchy of Markov random fields" is a research paper that introduces a probabilistic hierarchical model for capturing complex statistical structure in image patches using directed Markov random fields.
|
E317508
|
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: Modeling image patches with a directed hierarchy of Markov random fields | Statement: [Simon Osindero, hasPublication, Modeling image patches with a directed hierarchy of Markov random fields]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Modeling image patches with a directed hierarchy of Markov random fields Context triple: [Simon Osindero, hasPublication, Modeling image patches with a directed hierarchy of Markov random fields]
-
A.
Markov random fields
Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
-
B.
Probabilistic Graphical Models: Principles and Techniques
Probabilistic Graphical Models: Principles and Techniques is a foundational textbook that systematically presents the theory, algorithms, and applications of probabilistic graphical models in machine learning and artificial intelligence.
-
C.
Lucas–Kanade optical flow algorithm
The Lucas–Kanade optical flow algorithm is a widely used computer vision method for estimating the motion of features between consecutive images by assuming locally constant motion and solving a least-squares problem.
-
D.
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.
-
E.
Long-term Recurrent Convolutional Networks for Visual Recognition and Description
"Long-term Recurrent Convolutional Networks for Visual Recognition and Description" is a research paper that introduces a deep learning architecture combining convolutional and recurrent neural networks to perform tasks like video recognition and automatic image or video captioning.
- 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: Modeling image patches with a directed hierarchy of Markov random fields Triple: [Simon Osindero, hasPublication, Modeling image patches with a directed hierarchy of Markov random fields]
Generated description
"Modeling image patches with a directed hierarchy of Markov random fields" is a research paper that introduces a probabilistic hierarchical model for capturing complex statistical structure in image patches using directed Markov random fields.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Modeling image patches with a directed hierarchy of Markov random fields Target entity description: "Modeling image patches with a directed hierarchy of Markov random fields" is a research paper that introduces a probabilistic hierarchical model for capturing complex statistical structure in image patches using directed Markov random fields.
-
A.
Markov random fields
Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
-
B.
Probabilistic Graphical Models: Principles and Techniques
Probabilistic Graphical Models: Principles and Techniques is a foundational textbook that systematically presents the theory, algorithms, and applications of probabilistic graphical models in machine learning and artificial intelligence.
-
C.
Dirichlet process models
Dirichlet process models are a class of Bayesian nonparametric models that allow flexible, potentially infinite mixture modeling without fixing the number of components in advance.
-
D.
Lucas–Kanade optical flow algorithm
The Lucas–Kanade optical flow algorithm is a widely used computer vision method for estimating the motion of features between consecutive images by assuming locally constant motion and solving a least-squares problem.
-
E.
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.
- 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_69ad8b187fc8819085914d3c9ea3142d |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69ad99e291e0819089f81c0a7d7a6cd9 |
completed | March 8, 2026, 3:46 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b109061684819086777d3b871c94f8 |
completed | March 11, 2026, 6:17 a.m. |
| NEDg | Description generation | batch_69b1196399e881908887513a3bdf7f98 |
completed | March 11, 2026, 7:27 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b119d306208190b53b059f0ff57712 |
completed | March 11, 2026, 7:29 a.m. |
Created at: March 8, 2026, 2:59 p.m.