Triple
T10060490
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tsallis divergence |
E212974
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
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.
|
E841827
|
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: Csiszár f-divergence | Statement: [Tsallis divergence, relatedTo, Csiszár f-divergence]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Csiszár f-divergence Context triple: [Tsallis divergence, relatedTo, Csiszár f-divergence]
-
A.
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 α.
-
B.
Tsallis divergence
Tsallis divergence is a generalized measure of statistical distance between probability distributions derived from Tsallis entropy, often used in nonextensive statistical mechanics and information theory.
-
C.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
D.
Jensen–Shannon divergence
Jensen–Shannon divergence is a symmetrized and smoothed measure of dissimilarity between probability distributions, widely used in information theory and machine learning.
-
E.
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.
- 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: Csiszár f-divergence Triple: [Tsallis divergence, relatedTo, Csiszár f-divergence]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Csiszár f-divergence Target entity description: 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.
-
A.
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 α.
-
B.
Tsallis divergence
Tsallis divergence is a generalized measure of statistical distance between probability distributions derived from Tsallis entropy, often used in nonextensive statistical mechanics and information theory.
-
C.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
D.
Jensen–Shannon divergence
Jensen–Shannon divergence is a symmetrized and smoothed measure of dissimilarity between probability distributions, widely used in information theory and machine learning.
-
E.
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.
- 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_69ca83977128819084084eb7d1d8c52a |
completed | March 30, 2026, 2:07 p.m. |
| NER | Named-entity recognition | batch_69cdcfd0d23081909510785ef8a186a3 |
completed | April 2, 2026, 2:09 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d2cbb441388190bf01925b8624377d |
completed | April 5, 2026, 8:53 p.m. |
| NEDg | Description generation | batch_69d2cd8d611c81909085b3290eb54d16 |
completed | April 5, 2026, 9:01 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69d2ce686da48190b32a2053b94f1d48 |
completed | April 5, 2026, 9:04 p.m. |
Created at: March 30, 2026, 8:57 p.m.