Triple

T10773257
Position Surface form Disambiguated ID Type / Status
Subject Grothendieck inequality E254132 entity
Predicate relatedTo P37 FINISHED
Object Little Grothendieck theorem E254132 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: Little Grothendieck theorem | Statement: [Grothendieck inequality, relatedTo, Little Grothendieck theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Little Grothendieck theorem
Context triple: [Grothendieck inequality, relatedTo, Little Grothendieck theorem]
  • A. Grothendieck inequality chosen
    The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
  • B. Gauss’s lemma in number theory
    Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
  • C. Chevalley–Warning theorem
    The Chevalley–Warning theorem is a result in number theory and algebraic geometry that gives conditions under which systems of polynomial equations over finite fields must have nontrivial solutions.
  • D. Deuring reduction theorem
    The Deuring reduction theorem is a result in number theory that relates the reduction of elliptic curves with complex multiplication modulo primes to the theory of quaternion algebras and endomorphism rings.
  • E. Szekeres–Lindström theorem
    The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
  • 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_69d6aa5f54f4819082d0bbcb6f8797e6 completed April 8, 2026, 7:19 p.m.
NER Named-entity recognition batch_69d7329b27748190bd0e2569c7972fd1 completed April 9, 2026, 5:01 a.m.
NED1 Entity disambiguation (via context triple) batch_69de238559b48190abc759e744ab0f8e completed April 14, 2026, 11:22 a.m.
Created at: April 8, 2026, 9:16 p.m.