Triple
T364407
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Herbrand Award |
E7926
|
entity |
| Predicate | notableRecipient |
P108
|
FINISHED |
| Object |
Bruno Buchberger
Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
|
E47796
|
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: Bruno Buchberger | Statement: [Herbrand Award, notableRecipient, Bruno Buchberger]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bruno Buchberger Context triple: [Herbrand Award, notableRecipient, Bruno Buchberger]
-
A.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
B.
Paul Gordan
Paul Gordan was a 19th-century German mathematician known as the "king of invariant theory" for his foundational work in algebraic invariants.
-
C.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
D.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
E.
Jacques Herbrand
Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
- 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: Bruno Buchberger Triple: [Herbrand Award, notableRecipient, Bruno Buchberger]
Generated description
Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bruno Buchberger Target entity description: Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
-
A.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
B.
Paul Gordan
Paul Gordan was a 19th-century German mathematician known as the "king of invariant theory" for his foundational work in algebraic invariants.
-
C.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
D.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
E.
Jacques Herbrand
Jacques Herbrand was a French mathematician and logician known for his foundational contributions to proof theory and mathematical logic, particularly Herbrand's theorem.
- 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_69a2e7e880008190a6ad7e06e5d03007 |
completed | Feb. 28, 2026, 1:04 p.m. |
| NER | Named-entity recognition | batch_69a2ebe6c1b4819083335e880c205ed6 |
completed | Feb. 28, 2026, 1:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a3f4d8e8688190a35d50b99b85bb7f |
completed | March 1, 2026, 8:12 a.m. |
| NEDg | Description generation | batch_69a3f73a9f588190a45d55f29cdbe65d |
completed | March 1, 2026, 8:22 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69a3f7ece1a081908c899a2b4ff12e89 |
completed | March 1, 2026, 8:25 a.m. |
Created at: Feb. 28, 2026, 1:08 p.m.