Triple

T3380932
Position Surface form Disambiguated ID Type / Status
Subject Alfred Tarski E71180 entity
Predicate knownFor P22 FINISHED
Object Tarski’s high school algebra problem E353634 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: Tarski’s high school algebra problem | Statement: [Alfred Tarski, knownFor, Tarski’s high school algebra problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Tarski’s high school algebra problem
Context triple: [Alfred Tarski, knownFor, Tarski’s high school algebra problem]
  • A. Tarski’s theorem on the completeness of elementary algebra and geometry
    Tarski’s theorem on the completeness of elementary algebra and geometry is a foundational result in mathematical logic showing that the first-order theory of real closed fields (capturing elementary algebra and Euclidean geometry) is complete, decidable, and admits quantifier elimination.
  • B. “A Decision Method for Elementary Algebra and Geometry” chosen
    “A Decision Method for Elementary Algebra and Geometry” is Alfred Tarski’s influential work that presents a procedure for deciding the truth of statements in elementary algebra and geometry, laying foundations for decision theory in mathematical logic.
  • C. Tarski–Mostowski–Robinson theorem
    The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
  • D. Hilbert’s Nullstellensatz
    Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
  • E. Recherches sur la théorie de la démonstration
    Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69ad85a7f80c8190a05e43013f298942 completed March 8, 2026, 2:20 p.m.
NER Named-entity recognition batch_69adb5e7c7f48190afb78c311b424c93 completed March 8, 2026, 5:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69b34bc17dd881908fc5fb0d4a23f40f completed March 12, 2026, 11:26 p.m.
Created at: March 8, 2026, 3:14 p.m.