Triple
T22423341
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Erdős discrepancy problem |
E554302
|
entity |
| Predicate | studiedIn |
P770
|
FINISHED |
| Object | Polymath5 project |
—
|
NE NERFINISHED |
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: Polymath5 project | Statement: [Erdős discrepancy problem, studiedIn, Polymath5 project]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Polymath5 project Context triple: [Erdős discrepancy problem, studiedIn, Polymath5 project]
-
A.
Polymath Project
chosen
The Polymath Project is a large-scale online collaboration in which mathematicians and enthusiasts worldwide work together openly to solve difficult mathematical problems.
-
B.
Erdős discrepancy problem
The Erdős discrepancy problem is a famous question in combinatorial number theory that asks whether every infinite ±1 sequence has arbitrarily large discrepancy along some homogeneous arithmetic progression.
-
C.
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.
-
D.
Gowers blog on mathematics
Gowers blog on mathematics is a widely read online mathematics blog by Fields Medalist Timothy Gowers, featuring expository posts, research discussions, and commentary on mathematical practice and culture.
-
E.
Ahlswede–Khachatrian complete intersection theorem
The Ahlswede–Khachatrian complete intersection theorem is a fundamental result in extremal set theory that fully characterizes the largest intersecting families of k-element subsets for all parameter ranges, extending and sharpening the Erdős–Ko–Rado theorem.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69e11e4f2d0c819091aa3558ea2ee630 |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f15a2af620819083338127e78137dc |
completed | April 29, 2026, 1:08 a.m. |
Created at: April 16, 2026, 8:47 p.m.