Triple

T22964555
Position Surface form Disambiguated ID Type / Status
Subject James Joseph Sylvester E571001 entity
Predicate notableConcept P201 FINISHED
Object Sylvester–Gallai theorem NE NERFINISHED

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: Sylvester–Gallai theorem | Statement: [James Joseph Sylvester, notableConcept, Sylvester–Gallai theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Sylvester–Gallai theorem
Context triple: [James Joseph Sylvester, notableConcept, Sylvester–Gallai theorem]
  • A. Sylvester–Gallai theorem chosen
    The Sylvester–Gallai theorem is a result in incidence geometry stating that for any finite set of points in the Euclidean plane not all on a single line, there exists a line that passes through exactly two of the points.
  • B. Szemerédi–Trotter theorem
    The Szemerédi–Trotter theorem is a fundamental result in combinatorial geometry that gives near-optimal upper bounds on the number of incidences between points and lines in the plane.
  • C. de Bruijn–Erdős theorem
    The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
  • D. Erdős–Szekeres theorem
    The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
  • E. Helly’s theorem
    Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (2 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_69e245b212a88190b5259caf51606084 completed April 17, 2026, 2:37 p.m.
NER Named-entity recognition batch_69f181f763688190aab8f444a1a71577 completed April 29, 2026, 3:58 a.m.
Created at: April 17, 2026, 3:47 p.m.