Triple

T2416899
Position Surface form Disambiguated ID Type / Status
Subject Max Dehn E52324 entity
Predicate hasEponym P12247 FINISHED
Object 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.
E265418 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: Dehn function | Statement: [Max Dehn, hasEponym, Dehn function]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Dehn function
Context triple: [Max Dehn, hasEponym, Dehn function]
  • A. Menger curvature
    Menger curvature is a geometric concept that quantifies the curvature of a set or curve in metric spaces by using the reciprocal of the radius of the circle passing through three points.
  • B. Ackermann function
    The Ackermann function is a classic example of a computable function that grows faster than any primitive recursive function, often used in theoretical computer science to illustrate extreme computational complexity.
  • C. geometrization conjecture
    The geometrization conjecture is a fundamental statement in 3-dimensional topology that classifies all closed 3-manifolds into pieces each admitting one of eight canonical geometric structures, a result proven by Grigori Perelman.
  • D. Kleinian group
    A Kleinian group is a discrete subgroup of Möbius transformations acting on hyperbolic 3-space, central to the study of Riemann surfaces, complex dynamics, and low-dimensional topology.
  • E. Perelman’s entropy functionals
    Perelman’s entropy functionals are analytic quantities introduced by Grigori Perelman to study the behavior and singularities of the Ricci flow, playing a central role in his proof of the Poincaré and geometrization conjectures.
  • 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: Dehn function
Triple: [Max Dehn, hasEponym, Dehn function]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Dehn function
Target entity description: 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.
  • A. Menger curvature
    Menger curvature is a geometric concept that quantifies the curvature of a set or curve in metric spaces by using the reciprocal of the radius of the circle passing through three points.
  • B. Ackermann function
    The Ackermann function is a classic example of a computable function that grows faster than any primitive recursive function, often used in theoretical computer science to illustrate extreme computational complexity.
  • C. geometrization conjecture
    The geometrization conjecture is a fundamental statement in 3-dimensional topology that classifies all closed 3-manifolds into pieces each admitting one of eight canonical geometric structures, a result proven by Grigori Perelman.
  • D. Kleinian group
    A Kleinian group is a discrete subgroup of Möbius transformations acting on hyperbolic 3-space, central to the study of Riemann surfaces, complex dynamics, and low-dimensional topology.
  • E. Perelman’s entropy functionals
    Perelman’s entropy functionals are analytic quantities introduced by Grigori Perelman to study the behavior and singularities of the Ricci flow, playing a central role in his proof of the Poincaré and geometrization conjectures.
  • 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_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_69aebf4dcf6c8190a51f26af7e7a9b9c completed March 9, 2026, 12:38 p.m.
NEDg Description generation batch_69aec2b3291c8190966344cd20963660 completed March 9, 2026, 12:53 p.m.
NED2 Entity disambiguation (via description) batch_69aec30f9ef481909b83f3cf9fd6e998 completed March 9, 2026, 12:54 p.m.
Created at: March 6, 2026, 9:42 p.m.