Triple
T6833698
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cramér–Rao bound |
E157397
|
entity |
| Predicate | relatesTo |
P37
|
FINISHED |
| Object | Fisher information |
E212219
|
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: Fisher information | Statement: [Cramér–Rao bound, relatesTo, Fisher information]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fisher information Context triple: [Cramér–Rao bound, relatesTo, Fisher information]
-
A.
Fisher information
chosen
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.
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.
-
D.
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.
-
E.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
- 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_69c6882c53608190b99aebef079b23bd |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d67936288190829fedc3729aadd8 |
completed | March 27, 2026, 7:11 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c723fd50c88190af005fd58ca0aee6 |
completed | March 28, 2026, 12:42 a.m. |
Created at: March 27, 2026, 2:18 p.m.