Triple

T2416880
Position Surface form Disambiguated ID Type / Status
Subject Max Dehn E52324 entity
Predicate notableConcept P201 FINISHED
Object Dehn filling E265411 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: Dehn filling | Statement: [Max Dehn, notableConcept, Dehn filling]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Dehn filling
Context triple: [Max Dehn, notableConcept, Dehn filling]
  • A. Dehn surgery chosen
    Dehn surgery is a fundamental operation in 3-manifold topology that modifies a 3-dimensional manifold by cutting out a solid torus and gluing it back in a different way, playing a central role in the classification and study of 3-manifolds.
  • B. Dehn lemma
    The Dehn lemma is a fundamental result in 3-manifold topology that gives conditions under which a loop on the boundary of a 3-manifold bounds an embedded disk in the manifold.
  • C. Dehn complex
    The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
  • D. Dehn invariant
    The Dehn invariant is a mathematical quantity in geometry that helps determine whether two polyhedra are scissors-congruent, playing a key role in the solution of Hilbert’s third problem.
  • E. Dehn algorithm
    The Dehn algorithm is a decision procedure in combinatorial group theory that solves the word problem for certain groups by systematically reducing words using defining relations.
  • 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_69ab495622948190bc6bc6e4cddaf645 completed March 6, 2026, 9:38 p.m.
NER Named-entity recognition batch_69abc94eafd481909eeff689e5bf5960 completed March 7, 2026, 6:44 a.m.
NED1 Entity disambiguation (via context triple) batch_69af1f7f0738819091d06a7279f45d61 completed March 9, 2026, 7:29 p.m.
Created at: March 6, 2026, 9:42 p.m.