Triple

T15990324
Position Surface form Disambiguated ID Type / Status
Subject Kazimierz Kuratowski E387805 entity
Predicate hasTheoremNamedAfter P29208 FINISHED
Object Kuratowski’s theorem E1187536 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: Kuratowski’s theorem | Statement: [Kazimierz Kuratowski, hasTheoremNamedAfter, Kuratowski’s theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Kuratowski’s theorem
Context triple: [Kazimierz Kuratowski, hasTheoremNamedAfter, Kuratowski’s theorem]
  • A. Kuratowski’s theorem on planar graphs chosen
    Kuratowski’s theorem on planar graphs is a fundamental result in graph theory that characterizes planar graphs by stating that a finite graph is planar if and only if it contains no subgraph that is a subdivision of the complete graph K₅ or the complete bipartite graph K₃,₃.
  • B. Menger theorem in graph theory
    Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
  • C. 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.
  • D. Jordan curve theorem
    The Jordan curve theorem is a fundamental result in topology stating that any simple closed curve in the plane divides the plane into exactly two distinct regions, an "inside" and an "outside."
  • E. Kruskal's tree theorem
    Kruskal's tree theorem is a fundamental result in combinatorics and mathematical logic stating that finite trees are well-quasi-ordered under homeomorphic embedding, with deep implications in proof theory and computer science.
  • 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_69d86daa562c81908aacc179c0fe8fb5 completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e157835cac81909e979f9be281f328 completed April 16, 2026, 9:41 p.m.
NED1 Entity disambiguation (via context triple) batch_69ffcf1cb1388190b1ebccc6705e5974 completed May 10, 2026, 12:19 a.m.
Created at: April 10, 2026, 4:54 a.m.