Triple
T17386367
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Andrei Suslin |
E422696
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Suslin rigidity theorem |
—
|
NE NERFINISHED |
How this triple was built (3 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: Suslin rigidity theorem | Statement: [Andrei Suslin, knownFor, Suslin rigidity theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Suslin rigidity theorem Context triple: [Andrei Suslin, knownFor, Suslin rigidity theorem]
-
A.
Lusin–Souslin theorem
The Lusin–Souslin theorem is a fundamental result in descriptive set theory stating that the continuous injective image of a Borel set in a Polish space is again a Borel set.
-
B.
Tychonoff theorem for products of compact spaces
The Tychonoff theorem for products of compact spaces is a fundamental result in topology stating that any product of compact topological spaces is compact, a statement that is equivalent in strength to the axiom of choice.
-
C.
Szekeres–Lindström theorem
The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
-
D.
Tarski–Mostowski–Robinson theorem
The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
-
E.
Łoś–Tarski preservation theorem
The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Suslin rigidity theorem Target entity description: The Suslin rigidity theorem is a fundamental result in algebraic K-theory asserting strong invariance (rigidity) properties of K-theory for certain rings or schemes under extensions or deformations.
-
A.
Lusin–Souslin theorem
The Lusin–Souslin theorem is a fundamental result in descriptive set theory stating that the continuous injective image of a Borel set in a Polish space is again a Borel set.
-
B.
Tychonoff theorem for products of compact spaces
The Tychonoff theorem for products of compact spaces is a fundamental result in topology stating that any product of compact topological spaces is compact, a statement that is equivalent in strength to the axiom of choice.
-
C.
Szekeres–Lindström theorem
The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
-
D.
Tarski–Mostowski–Robinson theorem
The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
-
E.
Łoś–Tarski preservation theorem
The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
- F. None of above. chosen
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_69d889d710288190bf0f4762801fefae |
completed | April 10, 2026, 5:25 a.m. |
| NER | Named-entity recognition | batch_69e43a89c5008190a277a68e5cfe67b7 |
completed | April 19, 2026, 2:14 a.m. |
Created at: April 10, 2026, 5:45 a.m.