Triple
T22366351
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ralph Hartley |
E552913
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Hartley law of information |
—
|
NE NERFINISHED |
How this triple was built (3 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: Hartley law of information | Statement: [Ralph Hartley, notableWork, Hartley law of information]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hartley law of information Context triple: [Ralph Hartley, notableWork, Hartley law of information]
-
A.
Shannon–Khinchin axioms
The Shannon–Khinchin axioms are a set of fundamental conditions that uniquely characterize Shannon entropy as the standard measure of information and uncertainty in probability theory and information theory.
-
B.
Kluge's law
Kluge's law is a proposed sound law in Proto-Germanic historical linguistics that explains the development of certain geminate consonants from earlier consonant clusters.
-
C.
Aitken’s Law
Aitken’s Law is a phonological rule in Scots and Scottish English that governs when vowels are pronounced long or short depending on their phonetic and morphological environment.
-
D.
Mathematical Foundations of Information Theory
Mathematical Foundations of Information Theory is a seminal monograph by Aleksandr Khinchin that rigorously develops the probabilistic and mathematical basis of Shannon’s information theory.
-
E.
Atkinson theorem
Atkinson theorem is a fundamental result in functional analysis that characterizes Fredholm operators as precisely those bounded linear operators that are invertible modulo compact operators.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hartley law of information Target entity description: Hartley law of information is a foundational principle in information theory that quantifies the amount of information as proportional to the logarithm of the number of possible symbol sequences.
-
A.
Shannon–Khinchin axioms
The Shannon–Khinchin axioms are a set of fundamental conditions that uniquely characterize Shannon entropy as the standard measure of information and uncertainty in probability theory and information theory.
-
B.
Kluge's law
Kluge's law is a proposed sound law in Proto-Germanic historical linguistics that explains the development of certain geminate consonants from earlier consonant clusters.
-
C.
Aitken’s Law
Aitken’s Law is a phonological rule in Scots and Scottish English that governs when vowels are pronounced long or short depending on their phonetic and morphological environment.
-
D.
Mathematical Foundations of Information Theory
Mathematical Foundations of Information Theory is a seminal monograph by Aleksandr Khinchin that rigorously develops the probabilistic and mathematical basis of Shannon’s information theory.
-
E.
Atkinson theorem
Atkinson theorem is a fundamental result in functional analysis that characterizes Fredholm operators as precisely those bounded linear operators that are invertible modulo compact operators.
- F. None of above. chosen
Provenance (2 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_69e11e4affcc8190ba7c27d29062558d |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f1580074dc819091305ac7017000d3 |
completed | April 29, 2026, 12:59 a.m. |
Created at: April 16, 2026, 8:44 p.m.