Triple
T13061798
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jitendra Malik |
E329214
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Normalized Cuts for image segmentation
Normalized Cuts for image segmentation is a graph-based computer vision technique that partitions an image into meaningful regions by optimizing a global criterion balancing inter-group dissimilarity and intra-group similarity.
|
E1017405
|
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: Normalized Cuts for image segmentation | Statement: [Jitendra Malik, knownFor, Normalized Cuts for image segmentation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Normalized Cuts for image segmentation Context triple: [Jitendra Malik, knownFor, Normalized Cuts for image segmentation]
-
A.
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.
-
B.
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.
-
C.
Shi–Tomasi corner detector
The Shi–Tomasi corner detector is a computer vision algorithm that identifies good feature points (corners) in images for robust tracking and recognition tasks.
-
D.
Proceedings of Imaging Understanding Workshop
Proceedings of Imaging Understanding Workshop is a research conference publication focused on advances in computer vision and image understanding.
-
E.
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.
- 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: Normalized Cuts for image segmentation Triple: [Jitendra Malik, knownFor, Normalized Cuts for image segmentation]
Generated description
Normalized Cuts for image segmentation is a graph-based computer vision technique that partitions an image into meaningful regions by optimizing a global criterion balancing inter-group dissimilarity and intra-group similarity.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Normalized Cuts for image segmentation Target entity description: Normalized Cuts for image segmentation is a graph-based computer vision technique that partitions an image into meaningful regions by optimizing a global criterion balancing inter-group dissimilarity and intra-group similarity.
-
A.
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.
-
B.
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.
-
C.
Shi–Tomasi corner detector
The Shi–Tomasi corner detector is a computer vision algorithm that identifies good feature points (corners) in images for robust tracking and recognition tasks.
-
D.
Proceedings of Imaging Understanding Workshop
Proceedings of Imaging Understanding Workshop is a research conference publication focused on advances in computer vision and image understanding.
-
E.
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.
- 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_69d80771749c81909a6d9197b9504872 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69d980e7ee548190b4b18bdb1357c359 |
completed | April 10, 2026, 10:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f6cbe45c8c819080fbdf1d94376feb |
completed | May 3, 2026, 4:15 a.m. |
| NEDg | Description generation | batch_69f6cd3d5090819091b65f544ad139fd |
completed | May 3, 2026, 4:21 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69f6cdc8d52c819083717a455d589646 |
completed | May 3, 2026, 4:23 a.m. |
Created at: April 9, 2026, 8:59 p.m.