Triple
T8669854
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Pál Turán |
E205766
|
entity |
| Predicate | hasMethodNamedAfter |
P83998
|
FINISHED |
| Object | Turán's method |
E750084
|
NE FINISHED |
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: Turán's method | Statement: [Pál Turán, hasMethodNamedAfter, Turán's method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Turán's method Context triple: [Pál Turán, hasMethodNamedAfter, Turán's method]
-
A.
Turán's method
chosen
Turán's method is a powerful technique in analytic and probabilistic number theory that uses inequalities for power sums of sequences to derive bounds for arithmetic functions and related quantities.
-
B.
Turán's theorem
Turán's theorem is a fundamental result in extremal graph theory that determines the maximum number of edges a graph can have without containing a complete subgraph of a given size.
-
C.
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.
-
D.
Turán–Kubilius inequality
The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
-
E.
Erdős on Graphs: His Legacy
Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasMethodNamedAfter Context triple: [Pál Turán, hasMethodNamedAfter, Turán's method]
-
A.
hasSymbolNamedAfter
Indicates that one entity has a symbol whose name is derived from or dedicated to another entity.
-
B.
hasCollectionNamedAfter
Indicates that an entity has a collection (e.g., of works, items, or artifacts) that is named in honor of or after another entity.
-
C.
hasTestNamedAfterHer
Indicates that a person is the namesake of a test, meaning a test is named in honor of or after her.
-
D.
hasMethodType
Indicates that an entity is associated with, or characterized by, a specific type or category of method used or applied in its context.
-
E.
hasEffectNamedAfter
Indicates that an entity has an effect or phenomenon that is named after another entity.
- F. None of above. chosen
Provenance (5 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_69ca83516ae88190aefe034b3bc589e3 |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cc4917cb9881909a73b74e54250613 |
completed | March 31, 2026, 10:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cef3898bf88190959b361638d032de |
completed | April 2, 2026, 10:54 p.m. |
| PD | Predicate disambiguation | batch_69cc4564e018819081036722f3e42a71 |
completed | March 31, 2026, 10:06 p.m. |
| PDg | Predicate description generation | batch_69cc46c330bc8190a9b644078881c6ff |
completed | March 31, 2026, 10:12 p.m. |
Created at: March 30, 2026, 6:31 p.m.