Triple
T15066752
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Raj Jain |
E379774
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | Jain’s fairness index |
E1134681
|
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: Jain’s fairness index | Statement: [Raj Jain, notableConcept, Jain’s fairness index]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Jain’s fairness index Context triple: [Raj Jain, notableConcept, Jain’s fairness index]
-
A.
Jain’s fairness index
chosen
Jain’s fairness index is a widely used quantitative metric in networking and resource allocation that measures how evenly resources are shared among multiple users or flows.
-
B.
On the Composition of Ratios
On the Composition of Ratios is a mathematical treatise by Thabit ibn Qurra that develops and extends Greek theories of ratios and proportions within the framework of early Islamic mathematics.
-
C.
Pareto efficiency
Pareto efficiency is an economic concept describing an allocation of resources where no individual can be made better off without making someone else worse off.
-
D.
Yao’s minimax principle
Yao’s minimax principle is a fundamental result in computational complexity and randomized algorithms that relates the performance of randomized algorithms to the performance of deterministic algorithms against a worst-case input distribution.
-
E.
Azuma–Hoeffding inequality
The Azuma–Hoeffding inequality is a concentration inequality that bounds the probability of large deviations for martingales with bounded differences, generalizing Hoeffding’s inequality to dependent sequences.
- 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_69d85cd7683881908d405c1b5d7b4f7f |
completed | April 10, 2026, 2:13 a.m. |
| NER | Named-entity recognition | batch_69dedeea750c819082d8823c9ab6c5a2 |
completed | April 15, 2026, 12:42 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69feae11d6648190bc9b5d4f520d694b |
completed | May 9, 2026, 3:46 a.m. |
Created at: April 10, 2026, 3:02 a.m.