Triple
T18930713
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Wigner–Seitz cell |
E463100
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Voronoi diagram |
—
|
NE NERFINISHED |
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: Voronoi diagram | Statement: [Wigner–Seitz cell, relatedConcept, Voronoi diagram]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Voronoi diagram Context triple: [Wigner–Seitz cell, relatedConcept, Voronoi diagram]
-
A.
Voronoi diagram
chosen
A Voronoi diagram is a partition of space into regions based on distance to a specified set of points, where each region contains all locations closest to one particular point.
-
B.
Voronoy
Voronoy is a surname most notably associated with Ukrainian mathematician Georgy Voronoy, known for his pioneering work in number theory and the development of Voronoi diagrams.
-
C.
Voronoi partition
A Voronoi partition is a geometric decomposition of space into regions around a set of points such that each region consists of all locations closer to its defining point than to any other.
-
D.
Delaunay
Delaunay is a French surname most notably associated with Henri Delaunay, the football administrator who conceived the idea of the UEFA European Championship.
-
E.
Chebyshev center
The Chebyshev center is a concept in geometry and optimization referring to the center of the smallest-radius ball that encloses a given set.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8dcfdbbb881909964fa5a75bd0b48 |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5c9bfaee881908d701c5a05528939 |
completed | April 20, 2026, 6:37 a.m. |
Created at: April 10, 2026, 11:59 a.m.