Triple

T2416886
Position Surface form Disambiguated ID Type / Status
Subject Max Dehn E52324 entity
Predicate notableConcept P201 FINISHED
Object Dehn’s decision problems E265414 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’s decision problems | Statement: [Max Dehn, notableConcept, Dehn’s decision problems]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Dehn’s decision problems
Context triple: [Max Dehn, notableConcept, Dehn’s decision problems]
  • A. Dehn’s decision problems in group theory chosen
    Dehn’s decision problems in group theory are foundational early 20th-century problems that introduced algorithmic questions about the solvability of word, conjugacy, and isomorphism problems in finitely presented groups, helping launch the field of algorithmic group theory.
  • B. 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.
  • 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 function
    The Dehn function is a mathematical tool in geometric group theory that measures the complexity of filling loops with discs in a space or group, quantifying the difficulty of solving the word problem.
  • E. 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.
  • 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_69aef09efc108190b309dfe993526a26 completed March 9, 2026, 4:09 p.m.
Created at: March 6, 2026, 9:42 p.m.