Triple

T1908298
Position Surface form Disambiguated ID Type / Status
Subject Ronald A. Fisher E38051 entity
Predicate knownFor P22 FINISHED
Object Fisher information
Fisher information is a fundamental concept in statistics that quantifies how much information an observable random variable carries about an unknown parameter, playing a key role in estimation theory and the Cramér–Rao bound.
E212219 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: Fisher information | Statement: [Ronald A. Fisher, knownFor, Fisher information]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Fisher information
Context triple: [Ronald A. Fisher, knownFor, Fisher information]
  • A. Cramér–Rao bound
    The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
  • B. Chernoff information
    Chernoff information is a measure in information theory and statistics that quantifies the exponential rate at which the error probability decays when optimally distinguishing between two probability distributions.
  • C. Rényi entropy
    Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
  • D. Kullback–Leibler divergence
    Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
  • E. Rényi divergence
    Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
  • 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: Fisher information
Triple: [Ronald A. Fisher, knownFor, Fisher information]
Generated description
Fisher information is a fundamental concept in statistics that quantifies how much information an observable random variable carries about an unknown parameter, playing a key role in estimation theory and the Cramér–Rao bound.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Fisher information
Target entity description: Fisher information is a fundamental concept in statistics that quantifies how much information an observable random variable carries about an unknown parameter, playing a key role in estimation theory and the Cramér–Rao bound.
  • A. Cramér–Rao bound
    The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
  • B. Chernoff information
    Chernoff information is a measure in information theory and statistics that quantifies the exponential rate at which the error probability decays when optimally distinguishing between two probability distributions.
  • C. Rényi entropy
    Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
  • D. Kullback–Leibler divergence
    Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
  • E. Rényi divergence
    Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
  • 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_69a8862a26088190aae5243695aeefc0 completed March 4, 2026, 7:21 p.m.
NER Named-entity recognition batch_69abb1b55edc8190bce8ac97196939a9 completed March 7, 2026, 5:03 a.m.
NED1 Entity disambiguation (via context triple) batch_69adeafdad3c8190be7aeaed8bdeac43 completed March 8, 2026, 9:32 p.m.
NEDg Description generation batch_69adeb6f7f208190af892c3c25961438 completed March 8, 2026, 9:34 p.m.
NED2 Entity disambiguation (via description) batch_69adec2a928881909a1059ea5d4fc72b completed March 8, 2026, 9:37 p.m.
Created at: March 4, 2026, 7:35 p.m.