Triple
T7115758
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David Slepian |
E165814
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Slepian–Wolf coding theorem
The Slepian–Wolf coding theorem is a fundamental result in information theory that characterizes the limits of lossless data compression for correlated sources encoded separately but decoded jointly.
|
E641830
|
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: Slepian–Wolf coding theorem | Statement: [David Slepian, notableWork, Slepian–Wolf coding theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Slepian–Wolf coding theorem Context triple: [David Slepian, notableWork, Slepian–Wolf coding theorem]
-
A.
Wozencraft ensemble in coding theory
The Wozencraft ensemble in coding theory is a family of randomly constructed linear codes introduced by John Wozencraft that plays a key role in analyzing the performance limits of coding schemes, particularly for achieving capacity on noisy channels.
-
B.
noisy-channel coding theorem
The noisy-channel coding theorem is a fundamental result in information theory that establishes the maximum rate at which information can be transmitted over a noisy communication channel with arbitrarily low error using appropriate encoding schemes.
-
C.
Fano inequality
Fano inequality is a fundamental result in information theory that provides a lower bound on the probability of classification or decoding error in terms of conditional entropy.
-
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.
source coding theorem
The source coding theorem is a fundamental result in information theory that establishes the minimum average number of bits needed to losslessly encode symbols from a given information source, linking this limit to the source’s entropy.
- 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: Slepian–Wolf coding theorem Triple: [David Slepian, notableWork, Slepian–Wolf coding theorem]
Generated description
The Slepian–Wolf coding theorem is a fundamental result in information theory that characterizes the limits of lossless data compression for correlated sources encoded separately but decoded jointly.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Slepian–Wolf coding theorem Target entity description: The Slepian–Wolf coding theorem is a fundamental result in information theory that characterizes the limits of lossless data compression for correlated sources encoded separately but decoded jointly.
-
A.
Wozencraft ensemble in coding theory
The Wozencraft ensemble in coding theory is a family of randomly constructed linear codes introduced by John Wozencraft that plays a key role in analyzing the performance limits of coding schemes, particularly for achieving capacity on noisy channels.
-
B.
noisy-channel coding theorem
The noisy-channel coding theorem is a fundamental result in information theory that establishes the maximum rate at which information can be transmitted over a noisy communication channel with arbitrarily low error using appropriate encoding schemes.
-
C.
Fano inequality
Fano inequality is a fundamental result in information theory that provides a lower bound on the probability of classification or decoding error in terms of conditional entropy.
-
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.
source coding theorem
The source coding theorem is a fundamental result in information theory that establishes the minimum average number of bits needed to losslessly encode symbols from a given information source, linking this limit to the source’s entropy.
- 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_69c6888227bc8190a1394679e3116f90 |
completed | March 27, 2026, 1:39 p.m. |
| NER | Named-entity recognition | batch_69c6e5f401b881909ef4c2ab1e0750db |
completed | March 27, 2026, 8:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c79cbfc7a08190ab07f3d65aa79f16 |
completed | March 28, 2026, 9:17 a.m. |
| NEDg | Description generation | batch_69c79d0215888190b0e59c2584358a05 |
completed | March 28, 2026, 9:18 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c79d63b6dc8190b3b52ef6566ba490 |
completed | March 28, 2026, 9:20 a.m. |
Created at: March 27, 2026, 2:43 p.m.