Triple

T7150363
Position Surface form Disambiguated ID Type / Status
Subject Nyquist theorem E166675 entity
Predicate relatedConcept P37 FINISHED
Object Shannon–Hartley theorem
The Shannon–Hartley theorem is a fundamental result in information theory that quantifies the maximum error-free data transmission rate over a communication channel with a given bandwidth and signal-to-noise ratio.
E645105 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: Shannon–Hartley theorem | Statement: [Nyquist theorem, relatedConcept, Shannon–Hartley theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Shannon–Hartley theorem
Context triple: [Nyquist theorem, relatedConcept, Shannon–Hartley theorem]
  • A. 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.
  • 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. Nyquist theorem
    The Nyquist theorem is a fundamental principle in signal processing that states a continuous signal can be perfectly reconstructed from its samples if it is sampled at more than twice its highest frequency component.
  • D. 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.
  • E. 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.
  • 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: Shannon–Hartley theorem
Triple: [Nyquist theorem, relatedConcept, Shannon–Hartley theorem]
Generated description
The Shannon–Hartley theorem is a fundamental result in information theory that quantifies the maximum error-free data transmission rate over a communication channel with a given bandwidth and signal-to-noise ratio.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Shannon–Hartley theorem
Target entity description: The Shannon–Hartley theorem is a fundamental result in information theory that quantifies the maximum error-free data transmission rate over a communication channel with a given bandwidth and signal-to-noise ratio.
  • A. 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.
  • 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. Nyquist theorem
    The Nyquist theorem is a fundamental principle in signal processing that states a continuous signal can be perfectly reconstructed from its samples if it is sampled at more than twice its highest frequency component.
  • D. 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.
  • E. 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.
  • 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_69c68886779c8190a8e3fbabffe68253 completed March 27, 2026, 1:39 p.m.
NER Named-entity recognition batch_69c6e7f28b188190b1732ca711666531 completed March 27, 2026, 8:26 p.m.
NED1 Entity disambiguation (via context triple) batch_69c7ada940e08190b16e97e363801e75 completed March 28, 2026, 10:30 a.m.
NEDg Description generation batch_69c7ae5767408190860c1c7bc3a769fa completed March 28, 2026, 10:32 a.m.
NED2 Entity disambiguation (via description) batch_69c7aeb68c3481909c6dff8ee51349ab completed March 28, 2026, 10:34 a.m.
Created at: March 27, 2026, 2:46 p.m.