Triple

T10038364
Position Surface form Disambiguated ID Type / Status
Subject Hellinger distance E205229 entity
Predicate relatedTo P37 FINISHED
Object Fisher–Rao metric
The Fisher–Rao metric is a fundamental Riemannian metric on statistical manifolds that quantifies the intrinsic geometric structure of families of probability distributions via the Fisher information.
E837390 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–Rao metric | Statement: [Hellinger distance, relatedTo, Fisher–Rao metric]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Fisher–Rao metric
Context triple: [Hellinger distance, relatedTo, Fisher–Rao metric]
  • A. 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.
  • B. 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.
  • C. Bhattacharyya distance
    Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
  • D. Kobayashi metric
    The Kobayashi metric is an intrinsic pseudometric in complex analysis that measures hyperbolic distance on complex manifolds and generalizes the Poincaré metric to higher dimensions.
  • 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–Rao metric
Triple: [Hellinger distance, relatedTo, Fisher–Rao metric]
Generated description
The Fisher–Rao metric is a fundamental Riemannian metric on statistical manifolds that quantifies the intrinsic geometric structure of families of probability distributions via the Fisher information.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Fisher–Rao metric
Target entity description: The Fisher–Rao metric is a fundamental Riemannian metric on statistical manifolds that quantifies the intrinsic geometric structure of families of probability distributions via the Fisher information.
  • A. 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.
  • B. 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.
  • C. Bhattacharyya distance
    Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
  • D. Kobayashi metric
    The Kobayashi metric is an intrinsic pseudometric in complex analysis that measures hyperbolic distance on complex manifolds and generalizes the Poincaré metric to higher dimensions.
  • 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_69ca834f70e88190b2d74828b7767ec1 completed March 30, 2026, 2:06 p.m.
NER Named-entity recognition batch_69cdcee04afc8190904704d66e23a432 completed April 2, 2026, 2:05 a.m.
NED1 Entity disambiguation (via context triple) batch_69d282608d688190832c37442f53099a completed April 5, 2026, 3:40 p.m.
NEDg Description generation batch_69d2840bb2e881908a7e7a40229769e0 completed April 5, 2026, 3:47 p.m.
NED2 Entity disambiguation (via description) batch_69d2847c9bb881908a6330dfe2c2c1a4 completed April 5, 2026, 3:49 p.m.
Created at: March 30, 2026, 8:55 p.m.