Triple

T1862419
Position Surface form Disambiguated ID Type / Status
Subject Helmut Hasse E34844 entity
Predicate notableWork P4 FINISHED
Object Hasse diagram (in lattice theory)
A Hasse diagram is a simplified graphical representation of a finite partially ordered set that shows the order relations by connecting elements with upward lines without drawing implied transitive relations.
E207316 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: Hasse diagram (in lattice theory) | Statement: [Helmut Hasse, notableWork, Hasse diagram (in lattice theory)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hasse diagram (in lattice theory)
Context triple: [Helmut Hasse, notableWork, Hasse diagram (in lattice theory)]
  • A. DAG
    DAG is the National Rail station code for Dalgety Bay railway station in Fife, Scotland.
  • B. Sperner's lemma
    Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
  • C. Tucker’s lemma
    Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
  • D. Hertzsprung–Russell diagram
    The Hertzsprung–Russell diagram is a fundamental astronomical chart that plots stars’ luminosities against their temperatures or spectral types, revealing key patterns of stellar evolution and classification.
  • E. 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.
  • 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: Hasse diagram (in lattice theory)
Triple: [Helmut Hasse, notableWork, Hasse diagram (in lattice theory)]
Generated description
A Hasse diagram is a simplified graphical representation of a finite partially ordered set that shows the order relations by connecting elements with upward lines without drawing implied transitive relations.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hasse diagram (in lattice theory)
Target entity description: A Hasse diagram is a simplified graphical representation of a finite partially ordered set that shows the order relations by connecting elements with upward lines without drawing implied transitive relations.
  • A. DAG
    DAG is the National Rail station code for Dalgety Bay railway station in Fife, Scotland.
  • B. Sperner's lemma
    Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
  • C. Tucker’s lemma
    Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
  • D. Hertzsprung–Russell diagram
    The Hertzsprung–Russell diagram is a fundamental astronomical chart that plots stars’ luminosities against their temperatures or spectral types, revealing key patterns of stellar evolution and classification.
  • E. 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.
  • 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_69a88600b2f88190bc09303e68ab517e completed March 4, 2026, 7:20 p.m.
NER Named-entity recognition batch_69abb09e714881909cef0f7e77b5b3b9 completed March 7, 2026, 4:59 a.m.
NED1 Entity disambiguation (via context triple) batch_69add1d026748190a507872de85c908d completed March 8, 2026, 7:45 p.m.
NEDg Description generation batch_69add27390b08190942b1fa6fcab1e44 completed March 8, 2026, 7:48 p.m.
NED2 Entity disambiguation (via description) batch_69add305bd108190b5e7e0f3d30a2c58 completed March 8, 2026, 7:50 p.m.
Created at: March 4, 2026, 7:34 p.m.