Triple

T13444178
Position Surface form Disambiguated ID Type / Status
Subject Per Martin-Löf E320437 entity
Predicate familyName P18 FINISHED
Object Martin-Löf E320437 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: Martin-Löf | Statement: [Per Martin-Löf, familyName, Martin-Löf]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Martin-Löf
Context triple: [Per Martin-Löf, familyName, Martin-Löf]
  • A. Per Martin-Löf chosen
    Per Martin-Löf is a Swedish logician and philosopher known for developing intuitionistic type theory, a foundational system that underpins much of modern constructive mathematics and type theory in computer science.
  • B. Martin-Löf type theory
    Martin-Löf type theory is a foundational system for constructive mathematics and computer science that integrates logic and computation through dependent types and serves as a basis for proof assistants and functional programming languages.
  • C. Thierry Coquand
    Thierry Coquand is a French logician and computer scientist known for his work on type theory, constructive mathematics, and the development of the calculus of constructions.
  • D. Gerhard Gentzen
    Gerhard Gentzen was a German mathematician and logician best known for founding structural proof theory and introducing natural deduction and sequent calculus.
  • E. Brouwer–Heyting–Kolmogorov interpretation
    The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
  • 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_69d80761e6cc8190a90c844589998ecc completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbaee881888190811ddf01bc699864 completed April 12, 2026, 2:40 p.m.
NED1 Entity disambiguation (via context triple) batch_69f74621474c8190b96a8f8561451bed completed May 3, 2026, 12:57 p.m.
Created at: April 9, 2026, 9:40 p.m.