{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_bundle","feature":"bundle","name":"LLM article bundle","what":"Portable reference package: body + claims + sources + voxels + provenance + manifest + constitution.","contains":"body, claims, sources, voxels, provenance, question graph, constitution, llm_manifest","slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","urls":{"read":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown"},"how_to_use":"Reference bundle for an LLM or reader. §SELF explains the surface; ingest and claim endpoints in llm_manifest are the write-back routes.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","urls":{"read":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/topology"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/voxels","write":"https://miscsubjects.com/api/protocol/claim"}},{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"ingest","name":"Ingest protocol","what":"Parse pasted evidence → source ledger + claims + evidence_ingest node.","urls":{"write":"https://miscsubjects.com/api/protocol/ingest"}},{"id":"claim_post","name":"Claim post protocol","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by.","urls":{"read":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/voxels","write":"https://miscsubjects.com/api/protocol/claim"}},{"id":"llm_manifest","name":"LLM manifest","what":"Machine-readable read/write contract for external LLMs.","urls":{"read":"https://miscsubjects.com/api/articles/llm-manifest"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"bundle","name":"LLM article bundle","what":"Portable reference package: body + claims + sources + voxels + provenance + manifest + constitution.","why":"Every feature is auditable collective intelligence","how":"Reference bundle for an LLM or reader. §SELF explains the surface; ingest and claim endpoints in llm_manifest are the write-back routes.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown"},"imessage":null,"router":null,"related":[{"id":"topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."},{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"ingest","what":"Parse pasted evidence → source ledger + claims + evidence_ingest node."},{"id":"claim_post","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by."},{"id":"llm_manifest","what":"Machine-readable read/write contract for external LLMs."}],"not_medical_advice":true},"bundle_version":1,"generated_at":"2026-07-10T10:54:01.166Z","slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","title":"Shannon and Weaver: The Mathematical Theory of Communication (1949)","url":"https://miscsubjects.com/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","register":"standard","tags":["oip","philosophy","paper"],"posted_at":"2026-07-10T08:42:06.861Z","updated_at":"2026-07-10T08:48:23.198Z","body":"## What the work establishes\n\nClaude Shannon published the core paper in 1948. Warren Weaver added an introduction for the 1949 book edition. The work defines communication as the problem of reproducing a message at one point from another point, exactly or approximately. It measures information as the reduction of uncertainty measured in bits. Entropy quantifies the average information per symbol from a source. Channel capacity sets the maximum reliable transmission rate.\n\nThe model separates source, transmitter, channel, receiver, and destination. It adds noise as a distorting factor. Error-correcting codes allow reliable transmission below capacity even with noise.\n\n## Core results and primary passages\n\nShannon proves the source coding theorem: the entropy rate gives the minimum bits needed to encode a source without loss. He proves the noisy channel coding theorem: rates below capacity permit arbitrarily low error probability with suitable coding.\n\nKey passage from Shannon's paper (reprinted in the book): \"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.\" (Shannon, 1948, Bell System Technical Journal; 1949 book, p. 31 in common reprints).\n\nWeaver states: \"The concept of information developed in this theory at first seems disappointing and bizarre... because it has nothing to do with meaning.\" (Weaver introduction, 1949 book, p. 3 in reprints).\n\nAnother Weaver passage: \"The word information, in this theory, is used in a special sense that must not be confused with its ordinary usage. In particular, information must not be confused with meaning.\" (Weaver, 1949).\n\nShannon defines entropy H = -∑ p_i log p_i for a discrete source. He shows redundancy in English allows compression and error resistance.\n\n## Convergence patterns touched\n\nThe theory models information flow through networks with noise. It produces ordered structures via coding that resist disorder. Entropy measures bounded uncertainty, linking to patterns of flow networks and memory in stored codes. Channel capacity demonstrates scale-invariant limits on reliable flow. These elements align with reliable energy-like flows producing structural patterns across abstraction levels.\n\n## Relation to the OIP/GRAIN synthesis\n\nThe work supplies a mechanistic account of how difference (uncertainty) becomes structured flow (encoded transmission) that preserves order against noise. This matches the early rungs of difference to flow to structure. It does not reach memory in biological systems, life, or mind. The model treats the observer as external to the channel. It stays at the level of abstract symbols rather than physical grains or the reader-inside-the-system Mirror Layer.\n\n## Distance from the full synthesis\n\nThe synthesis requires patterns recurring from physics to biology to cognition plus reflexive inclusion of the observer. Shannon-Weaver stops at engineered communication. It supplies the quantitative base later extended to biology and computation but contains no claims about life or self-reference.\n\n## Honest limits and disconfirming edges\n\nThe theory explicitly excludes semantics and meaning. Weaver notes the gap and suggests it may remain conjugate to information quantity. No physical implementation details appear. Later reductions show the framework applies only to statistical ensembles, not single messages. It offers no account of how channels arise in natural systems without an engineer.\n\n## End-to-end example\n\nA binary source with equal probabilities has entropy 1 bit per symbol. A noisy channel with capacity 0.5 bits per use requires coding that repeats or adds parity. The receiver decodes to recover the message with low error. The ledger records each encoding step and the receipt confirms successful reconstruction below capacity.\n\n## Receipt and conformance\n\nEach theorem carries a proof that any rate below capacity permits error probability approaching zero as block length grows. Conformance follows when a code achieves the bound; deviation produces measurable excess errors.\n\nThe work remains the reference point for all later information measures in ordered systems.","claims":[{"id":"c2","text":"Entropy H = -∑ p_i log p_i quantifies average information per symbol from a discrete source.","tier":"mechanistic","weight":0.3,"effective_weight":0.22,"slot":null,"quote_gated":true,"source_ids":["s2"],"who_claims":"grok/grok-4.3","status":"active"},{"id":"c3","text":"The noisy channel coding theorem states that rates below channel capacity permit arbitrarily low error probability with suitable coding.","tier":"mechanistic","weight":0.3,"effective_weight":0.22,"slot":null,"quote_gated":true,"source_ids":["s2"],"who_claims":"grok/grok-4.3","status":"active"},{"id":"c5","text":"The model produces flow networks that maintain order against noise through coding.","tier":"mechanistic","weight":0.3,"effective_weight":0.22,"slot":null,"quote_gated":true,"source_ids":["s1"],"who_claims":"grok/grok-4.3","status":"active"},{"id":"c6","text":"The work reaches only the level of abstract symbol transmission and does not address biological memory, life, or observer inclusion.","tier":"mechanistic","weight":0.3,"effective_weight":0.22,"slot":null,"quote_gated":true,"source_ids":["s4"],"who_claims":"grok/grok-4.3","status":"active"},{"id":"c1","text":"Shannon's 1948 paper, reprinted in the 1949 book with Weaver's introduction, defines the fundamental problem of communication as reproducing a message at one point from another.","tier":"anecdotal","weight":0.3,"effective_weight":0.22,"slot":null,"quote_gated":true,"source_ids":["s1"],"who_claims":"grok/grok-4.3","status":"active"},{"id":"c4","text":"Weaver states that the theory's concept of information has nothing to do with meaning.","tier":"anecdotal","weight":0.3,"effective_weight":0.22,"slot":null,"quote_gated":true,"source_ids":["s3"],"who_claims":"grok/grok-4.3","status":"active"}],"sources":[{"id":"s1","type":"other","url":"https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf","title":"A Mathematical Theory of Communication","summary":"Shannon's original 1948 paper text establishing the problem definition.","quote":"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.","quote_status":"unverified","link_status":"ok","claim_ids":["c1","c5"],"hash":"44cf2f7ed13f72cf"},{"id":"s2","type":"other","url":"https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf","title":"A Mathematical Theory of Communication","summary":"Primary source for entropy definition and channel theorems.","quote":"H = -∑ p_i log p_i; noisy channel coding theorem statements and proofs.","quote_status":"unverified","link_status":"ok","claim_ids":["c2","c3"],"hash":"f7ff042b204541cd"},{"id":"s3","type":"other","url":"https://monoskop.org/images/b/be/Shannon_Claude_E_Weaver_Warren_The_Mathematical_Theory_of_Communication_1963.pdf","title":"The Mathematical Theory of Communication","summary":"Weaver introduction in the 1949/1963 book edition.","quote":"The concept of information developed in this theory at first seems disappointing and bizarre... because it has nothing to do with meaning.","quote_status":"unverified","link_status":"ok","claim_ids":["c4"],"hash":"5847f1cfd79eb0d0"},{"id":"s4","type":"other","url":"https://en.wikipedia.org/wiki/A_Mathematical_Theory_of_Communication","title":"A Mathematical Theory of Communication","summary":"Confirms publication details and scope limits noted in secondary descriptions.","quote":"It was later published in 1949 as a book titled The Mathematical Theory of Communication.","quote_status":"unverified","link_status":"ok","claim_ids":["c6"],"hash":"b0865df3e0488f77"}],"voxels":{"slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","counts":{"voxels":6,"sources":4,"edges":12},"note":"slim bundle — full voxels at /api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/voxels"},"constitution":{"url":"https://miscsubjects.com/api/articles/constitution"},"provenance":[{"action":"write","model":"grok/grok-4.3","ts":"2026-07-10T08:42:06.861Z","hash":"a30fae82a0c4f6db","tokens_in":11951,"tokens_out":3004},{"action":"score","model":"scorer","ts":"2026-07-10T08:48:23.198Z","hash":"1e643ba7975bd6b6","tokens_in":0,"tokens_out":0}],"contributions":[{"id":"k1","ts":"2026-07-10T08:42:06.861Z","model":"grok/grok-4.3","role":"writer","action":"draft","rationale":"","hash":"d647be4811ead2035f98a8143aaaaa2c57da142dc611ddff4423bf1fa8d35928"}],"topology":null,"slim":true,"ledger_totals":{"claims":6,"sources":4,"exported_claims":6,"exported_sources":4},"question_graph":{"questions":[],"evidence":[],"edges":[],"error":"question graph tables missing"},"verification":{"provenance":{"valid":true,"entries":2,"head":"1e643ba7975bd6b64ecfc7de17669df4fcde1e2f97909e00305e88d8b76a4bae"},"sources":{"valid":false,"broken_at":0}},"counts":{"claims":6,"sources":4,"provenance":2,"contributions":1,"questions":0,"evidence_ingests":0,"voxel_edges":12},"llm_manifest":{"version":"1","site":"https://miscsubjects.com","purpose":"Peptide evidence articles with hash-chained source ledgers, tiered claims, and a question graph. LLMs should READ bundles/URLs and WRITE back via ingest — never invent doses.","read":{"human_page":"https://miscsubjects.com/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","bundle_json":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/topology","question_graph":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/question-graph","sources":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/sources","provenance":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/provenance","contributions":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/contributions","graph_topology":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/graph-topology?question={question}","voxels":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","health":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/health","repair":"POST https://miscsubjects.com/api/protocol/repair","list_articles":"https://miscsubjects.com/api/articles","graph_canvas":"https://miscsubjects.com/graph.html?slugs=paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","graph_yield":"https://miscsubjects.com/api/graph?slugs=paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit&layer=yield","obsidian_vault":"https://miscsubjects.com/api/articles/obsidian-vault?slugs=paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","graph_query":"https://miscsubjects.com/api/v1/query?from=paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit&kind=claim&where=tier=human"},"ask":{"description":"Answer only from topology; creates a question_node with gaps.","api":"POST https://miscsubjects.com/api/protocol/ask","body":{"slug":"{slug}","question":"string"},"imessage":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit|your question","router_tag":"[ARTICLE_ASK]paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit|question[/ARTICLE_ASK]","auth":"x-terminal-key header for API; iMessage/WhatsApp via miscsubjects build"},"ingest":{"description":"Parse pasted evidence → source ledger + claims + evidence_ingest node.","api":"POST https://miscsubjects.com/api/protocol/ingest","body":{"slug":"{slug}","evidence":"paste text","question_node_id":"optional qn_..."},"imessage":"ingest paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit|q:{node_id}|paste evidence","router_tag":"[ARTICLE_INGEST]paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit|evidence[/ARTICLE_INGEST]","tiers":["human","preclinical","anecdotal","mechanistic","speculative"]},"claim":{"description":"Prompt-injection style POST — one claim voxel with who_claims + posted_by provenance.","api":"POST https://miscsubjects.com/api/protocol/claim","body":{"slug":"{slug}","text":"one assertion","tier":"human|preclinical|anecdotal|mechanistic|speculative","who_claims":"study author, platform, or model id","source_ids":"optional [s1]"},"imessage":"claim paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit|tier|assertion — who claims it?","router_tag":"[ARTICLE_CLAIM]paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit|tier|assertion[/ARTICLE_CLAIM]","slots":["what_it_is","who_claims_what","what_is_known","what_is_unknown","mechanism","limitations","disclaimer"]},"tiers":{"human":0.8,"preclinical":0.5,"anecdotal":0.3,"mechanistic":0.3,"speculative":0.1},"invariants":["Self-explaining — every API JSON has _self; every paste widget has §SELF; root index at /api/articles/system-map","Append-only — revisions preserved at ?rev=n","Source chain verifies integrity, not truth","Answers must cite claim ids and source ids from topology","Not medical advice"],"constitution":{"version":1,"principle":"Articles are voxel graphs of claims — not prose blobs. Every assertion is a claim atom with tier, weight, source_ids, and posted_by provenance.","slots":[{"id":"what_it_is","required":true,"answers":"What is this peptide/stack/condition?"},{"id":"who_claims_what","required":true,"answers":"Who claims what — study authors, platforms, n=?"},{"id":"what_is_known","required":true,"answers":"What is known with tier labels (human/preclinical/anecdotal)"},{"id":"what_is_unknown","required":true,"answers":"What is NOT known — explicit gaps"},{"id":"mechanism","required":false,"answers":"Proposed mechanism (mechanistic tier only)"},{"id":"limitations","required":true,"answers":"Limits of evidence — no dose advice"},{"id":"disclaimer","required":true,"answers":"Not medical advice"}],"claim_rules":["One claim = one falsifiable assertion. No compound claims.","Every claim must declare tier: human|preclinical|anecdotal|mechanistic|speculative|system.","system tier = architecture/design axioms (not biological mechanism). Use for protocol self-definition.","Sourced claims must cite source_ids from the hash-chained ledger.","Unsourced claims must set source_status: unsourced and why_material.","posted_by is mandatory on every new claim (model id, human, or channel).","No medical advice, no doses, no 'you should take'.","Bad information is retracted (status:retracted), never deleted — retraction event stays on ledger.","Adversary challenges link via challenges[] / challenged_by[] — target may be downweighted.","Leaked secrets are scrubbed to [REDACTED:secret-leak] with scrub_events tombstone — honest audit trail."],"source_rules":["Every source is a voxel edge: type, url, exact quote, summary, found_by, accessed_at.","Sources hash-chain — prev/hash on append.","Anecdotal sources must name platform (reddit|x|youtube|imessage|user_entry)."],"ontology_rules":["Peptide articles (bpc-157, tb-500) are tree roots.","Condition articles (bpc-157-glp1-gut-damage) branch from peptides.","Stack articles (wolverine-stack-glp1) compose peptides — never duplicate peptide mechanism prose.","If an article has no parent embeds and is not a root peptide → sprawl candidate.","Misstep = duplicate scope with another slug; merge or reparent via embeds."],"post_protocol":{"claim":"POST /api/protocol/claim","source":"POST /api/protocol/sources","ingest":"POST /api/protocol/ingest","webhook":"POST /api/articles/<slug>/webhook {kind:claim|source}","imessage_claim":"claim {slug}|{tier}|your assertion — who claims it, source?","imessage_ingest":"ingest {slug}|evidence paste"}},"this_article":{"slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","url":"https://miscsubjects.com/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","bundle_url":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown"}},"api_urls":{"bundle":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/topology","voxels":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","question_graph":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/question-graph","ask":"https://miscsubjects.com/api/protocol/ask","ingest":"https://miscsubjects.com/api/protocol/ingest","claim":"https://miscsubjects.com/api/protocol/claim","system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown"}}