Triple
T17020154
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Young's inequality |
E412926
|
entity |
| Predicate | isSpecialCaseOf |
P2372
|
FINISHED |
| Object | Fenchel–Young inequality |
E412926
|
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: Fenchel–Young inequality | Statement: [Young's inequality, isSpecialCaseOf, Fenchel–Young inequality]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fenchel–Young inequality Context triple: [Young's inequality, isSpecialCaseOf, Fenchel–Young inequality]
-
A.
Kantorovich duality
Kantorovich duality is a fundamental result in optimal transport theory that characterizes the optimal transport cost as the supremum of a dual variational problem over suitable test functions.
-
B.
Azuma–Hoeffding inequality
The Azuma–Hoeffding inequality is a concentration inequality that bounds the probability of large deviations for martingales with bounded differences, generalizing Hoeffding’s inequality to dependent sequences.
-
C.
Young's inequality
chosen
Young's inequality is a fundamental result in mathematical analysis that provides an upper bound for the product of two nonnegative numbers in terms of their powers, playing a key role in convex analysis and functional inequalities.
-
D.
Csiszár f-divergence
Csiszár f-divergence is a broad class of statistical distance measures between probability distributions defined via convex functions, encompassing many well-known divergences such as Kullback–Leibler and total variation as special cases.
-
E.
Grothendieck inequality
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.
- 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_69d886cc4170819093deddc7b8b4b6a7 |
completed | April 10, 2026, 5:12 a.m. |
| NER | Named-entity recognition | batch_69e3d482c3a0819099e6ea4acb0a08ee |
completed | April 18, 2026, 6:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a011b4f9dfc819085639edb5cda1cca |
completed | May 10, 2026, 11:57 p.m. |
Created at: April 10, 2026, 5:33 a.m.