Triple
T37328818
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Imre Bárány |
E926682
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Bárány’s theorem on the Carathéodory number of convex sets
Bárány’s theorem on the Carathéodory number of convex sets is a fundamental result in discrete and convex geometry that provides sharp bounds on how many points are needed to represent elements of a convex set as convex combinations.
|
E2222199
|
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: Bárány’s theorem on the Carathéodory number of convex sets | Statement: [Imre Bárány, notableWork, Bárány’s theorem on the Carathéodory number of convex sets]
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: Bárány’s theorem on the Carathéodory number of convex sets Triple: [Imre Bárány, notableWork, Bárány’s theorem on the Carathéodory number of convex sets]
Generated description
Bárány’s theorem on the Carathéodory number of convex sets is a fundamental result in discrete and convex geometry that provides sharp bounds on how many points are needed to represent elements of a convex set as convex combinations.
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_69f76eb386d88190a8d511aa11540dfc |
completed | May 3, 2026, 3:50 p.m. |
| NER | Named-entity recognition | batch_69fb5b68fa3c8190832230e7c8a4e463 |
completed | May 6, 2026, 3:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a4063a1da78819096c4e8f053b76854 |
completed | June 27, 2026, 11:58 p.m. |
| NEDg | Description generation | batch_6a40649da7188190907f2c12b6a9ce1e |
completed | June 28, 2026, 12:02 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a40655bd8d881908a0824fbd19562cd |
completed | June 28, 2026, 12:05 a.m. |
Created at: May 3, 2026, 4:16 p.m.