Triple

T16571013
Position Surface form Disambiguated ID Type / Status
Subject Bronisław Knaster E402583 entity
Predicate notableWork P4 FINISHED
Object Knaster–Tarski theorem E353628 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: Knaster–Tarski theorem | Statement: [Bronisław Knaster, notableWork, Knaster–Tarski theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Knaster–Tarski theorem
Context triple: [Bronisław Knaster, notableWork, Knaster–Tarski theorem]
  • A. Tarski’s fixed point theorem chosen
    Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
  • B. Glicksberg fixed-point theorem
    The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
  • C. Kakutani fixed-point theorem
    The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
  • D. Brouwer fixed-point theorem
    The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
  • E. Mazurkiewicz–Sierpiński theorem
    The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
  • 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_69d8838648088190acf97ef11fc3f61b completed April 10, 2026, 4:58 a.m.
NER Named-entity recognition batch_69e35958d49c8190b995188240fb355b completed April 18, 2026, 10:13 a.m.
NED1 Entity disambiguation (via context triple) batch_6a006ee8812c81908ef74636bf39d44a completed May 10, 2026, 11:41 a.m.
Created at: April 10, 2026, 5:16 a.m.