Triple
T29562849
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Turán's theorem |
E750082
|
entity |
| Predicate | statementInformal |
P4223
|
FINISHED |
| Object | Among all n-vertex graphs with no K_r subgraph, the Turán graph T_{r-1}(n) has the maximum number of edges |
—
|
LITERAL FINISHED |
How this triple was built (1 step)
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: Among all n-vertex graphs with no K_r subgraph, the Turán graph T_{r-1}(n) has the maximum number of edges | Statement: [Turán's theorem, statementInformal, Among all n-vertex graphs with no K_r subgraph, the Turán graph T_{r-1}(n) has the maximum number of edges]
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_69f0bd4919e48190942b2a13d5b97d03 |
completed | April 28, 2026, 1:59 p.m. |
| NER | Named-entity recognition | batch_69f66d1e64e8819080579603e5bcdeb7 |
completed | May 2, 2026, 9:31 p.m. |
Created at: April 28, 2026, 5:21 p.m.