Triple

T10773240
Position Surface form Disambiguated ID Type / Status
Subject Grothendieck inequality E254132 entity
Predicate hasVariant P455 FINISHED
Object real Grothendieck inequality 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: real Grothendieck inequality | Statement: [Grothendieck inequality, hasVariant, real Grothendieck inequality]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: real Grothendieck inequality
Context triple: [Grothendieck inequality, hasVariant, real Grothendieck inequality]
  • 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. Hadamard inequality
    The Hadamard inequality is a fundamental result in linear algebra and analysis that bounds the absolute value of a determinant by the product of the Euclidean norms of its row or column vectors.
  • C. Korn inequality
    Korn inequality is a fundamental result in functional analysis and the mathematical theory of elasticity that provides bounds relating the full gradient of a vector field to its symmetric part, ensuring control of deformations by their strains.
  • D. Koksma–Hlawka inequality
    The Koksma–Hlawka inequality is a fundamental result in numerical analysis and discrepancy theory that bounds the error of quasi-Monte Carlo integration by the product of a function’s variation and the discrepancy of the sampling points.
  • E. Gale’s theorem on linear inequalities
    Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
  • 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.