Triple
T15741711
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Frank P. Ramsey |
E381616
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Ramsey theory |
E381617
|
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: Ramsey theory | Statement: [Frank P. Ramsey, notableWork, Ramsey theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ramsey theory Context triple: [Frank P. Ramsey, notableWork, Ramsey theory]
-
A.
Ramsey theory
chosen
Ramsey theory is a branch of combinatorics that studies the conditions under which order or structure must appear within sufficiently large or complex mathematical objects.
-
B.
Graham–Rothschild theorem
The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
-
C.
Erdős–Ko–Rado theorem
The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
-
D.
Erdős–Stone theorem
The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
-
E.
Szemerédi's theorem
Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
- 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_69d86d9cdb648190bf3171be0bd7d872 |
completed | April 10, 2026, 3:25 a.m. |
| NER | Named-entity recognition | batch_69e04fd97d6c8190b2fa6ca422bfe512 |
completed | April 16, 2026, 2:56 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ff83056aa0819098b757ed125e61fe |
completed | May 9, 2026, 6:55 p.m. |
Created at: April 10, 2026, 4:46 a.m.