Triple
T1390478
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Surreal numbers |
E29943
|
entity |
| Predicate | alternativeName |
P39
|
FINISHED |
| Object | Conway numbers |
E29943
|
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: Conway numbers | Statement: [Surreal numbers, alternativeName, Conway numbers]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Conway numbers Context triple: [Surreal numbers, alternativeName, Conway numbers]
-
A.
Conway groups
Conway groups are a set of three closely related sporadic simple groups discovered by John H. Conway in the study of symmetries of the Leech lattice in group theory.
-
B.
Surreal numbers
chosen
Surreal numbers are a class of numbers introduced by John H. Conway that form an extensive ordered field encompassing the real numbers, infinite quantities, and infinitesimals within a unified framework.
-
C.
Conway’s Game of Sprouts
Conway’s Game of Sprouts is a pencil-and-paper topological game in which players alternately connect dots with lines under simple rules, leading to rich combinatorial and mathematical analysis.
-
D.
Conway notation for knots
Conway notation for knots is a mathematical system introduced by John H. Conway that encodes knot and link diagrams into concise symbolic expressions to classify and study them.
-
E.
Look-and-say sequence
The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
- 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_69a498dc92f8819094a1108f8ac90f43 |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c35e023c8190b45688796d90534b |
completed | March 1, 2026, 10:53 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69acde24d1d88190bd6d602923270cd1 |
completed | March 8, 2026, 2:25 a.m. |
Created at: March 1, 2026, 7:59 p.m.