Triple

T3393992
Position Surface form Disambiguated ID Type / Status
Subject Felix Bernstein E71484 entity
Predicate notableWork P4 FINISHED
Object Bernstein inequalities
Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
E354909 NE FINISHED

How this triple was built (4 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: Bernstein inequalities | Statement: [Felix Bernstein, notableWork, Bernstein inequalities]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Bernstein inequalities
Context triple: [Felix Bernstein, notableWork, Bernstein inequalities]
  • A. Khinchin–Kahane type inequalities
    Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
  • B. Carathéodory–Fejér interpolation
    Carathéodory–Fejér interpolation is a classical result in complex analysis and approximation theory that concerns constructing analytic functions, typically with bounded or positive real part, that match prescribed initial Taylor coefficients.
  • C. Hadamard three-circle theorem
    The Hadamard three-circle theorem is a result in complex analysis that describes how the maximum modulus of a holomorphic function behaves logarithmically between three concentric circles in the complex plane.
  • D. 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.
  • E. Chebyshev functions
    Chebyshev functions are arithmetic functions in number theory that encode information about the distribution of prime numbers and play a key role in analytic approaches to the prime number theorem.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Bernstein inequalities
Triple: [Felix Bernstein, notableWork, Bernstein inequalities]
Generated description
Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Bernstein inequalities
Target entity description: Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
  • A. Khinchin–Kahane type inequalities
    Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
  • B. Carathéodory–Fejér interpolation
    Carathéodory–Fejér interpolation is a classical result in complex analysis and approximation theory that concerns constructing analytic functions, typically with bounded or positive real part, that match prescribed initial Taylor coefficients.
  • C. Hadamard three-circle theorem
    The Hadamard three-circle theorem is a result in complex analysis that describes how the maximum modulus of a holomorphic function behaves logarithmically between three concentric circles in the complex plane.
  • D. 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.
  • E. Chebyshev functions
    Chebyshev functions are arithmetic functions in number theory that encode information about the distribution of prime numbers and play a key role in analytic approaches to the prime number theorem.
  • F. None of above. chosen

Provenance (5 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_69ad85a9c4a88190a854019341cb3b60 completed March 8, 2026, 2:20 p.m.
NER Named-entity recognition batch_69adb853746c8190bfa1447e6ebbefb3 completed March 8, 2026, 5:56 p.m.
NED1 Entity disambiguation (via context triple) batch_69b34bc8a75c8190ab4f652272d33576 completed March 12, 2026, 11:27 p.m.
NEDg Description generation batch_69b34e46b2b48190aedee8dabf5285bd completed March 12, 2026, 11:37 p.m.
NED2 Entity disambiguation (via description) batch_69b34fc0b830819082b50ebd14b6490b completed March 12, 2026, 11:44 p.m.
Created at: March 8, 2026, 3:14 p.m.