Triple

T12574039
Position Surface form Disambiguated ID Type / Status
Subject Timothy Gowers E271119 entity
Predicate notableWork P4 FINISHED
Object Gowers norms in additive number theory E989311 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: Gowers norms in additive number theory | Statement: [Timothy Gowers, notableWork, Gowers norms in additive number theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Gowers norms in additive number theory
Context triple: [Timothy Gowers, notableWork, Gowers norms in additive number theory]
  • A. Gowers inverse theorem in additive combinatorics
    The Gowers inverse theorem in additive combinatorics is a fundamental result that characterizes functions with large Gowers uniformity norms by showing they must correlate with structured objects such as polynomial phase functions, underpinning much of modern higher-order Fourier analysis.
  • B. Gowers uniformity norms chosen
    Gowers uniformity norms are a family of higher-order norms in additive combinatorics used to measure the uniformity of functions and sequences, playing a central role in results such as Szemerédi’s theorem on arithmetic progressions.
  • C. Gowers–Hatami stability theorem
    The Gowers–Hatami stability theorem is a result in functional analysis and group theory that characterizes when approximate representations of finite groups are close to genuine representations, providing a quantitative form of stability for such structures.
  • D. 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.
  • E. 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.
  • 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_69d7bde87b648190bcd0266e9efde098 completed April 9, 2026, 2:55 p.m.
NER Named-entity recognition batch_69d954a629fc8190a1c3b6777aad4527 completed April 10, 2026, 7:51 p.m.
NED1 Entity disambiguation (via context triple) batch_69f6686395c081909410b429fce6ebf8 completed May 2, 2026, 9:10 p.m.
Created at: April 9, 2026, 4:42 p.m.