{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"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)","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.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"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.","section":"What the work establishes","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core scope of the theory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Entropy H = -∑ p_i log p_i quantifies average information per symbol from a discrete source.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Central mathematical definition enabling all later results.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The noisy channel coding theorem states that rates below channel capacity permit arbitrarily low error probability with suitable coding.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Proves reliable transmission is possible despite noise.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Weaver states that the theory's concept of information has nothing to do with meaning.","section":"Core results and primary passages","tier":"anecdotal","source_ids":["s3"],"source_status":"sourced","why_material":"Marks the explicit limit on semantics.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model produces flow networks that maintain order against noise through coding.","section":"Convergence patterns touched","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly evidences noise-resistant structured flow.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The work reaches only the level of abstract symbol transmission and does not address biological memory, life, or observer inclusion.","section":"Distance from the full synthesis","tier":"mechanistic","source_ids":["s4"],"source_status":"sourced","why_material":"Honest boundary on scope.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"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","quote":"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.","summary":"Shannon's original 1948 paper text establishing the problem definition.","claim_ids":["c1","c5"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"44cf2f7ed13f72cf3a72e96836a4d87a4597b0646ea74d9751e51cf945d91a0c"},{"id":"s2","type":"other","url":"https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf","title":"A Mathematical Theory of Communication","quote":"H = -∑ p_i log p_i; noisy channel coding theorem statements and proofs.","summary":"Primary source for entropy definition and channel theorems.","claim_ids":["c2","c3"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"44cf2f7ed13f72cf3a72e96836a4d87a4597b0646ea74d9751e51cf945d91a0c","hash":"f7ff042b204541cd0e3867888b168d0bfb619fd43ced28c1081237acde8e0aa5"},{"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","quote":"The concept of information developed in this theory at first seems disappointing and bizarre... because it has nothing to do with meaning.","summary":"Weaver introduction in the 1949/1963 book edition.","claim_ids":["c4"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"f7ff042b204541cd0e3867888b168d0bfb619fd43ced28c1081237acde8e0aa5","hash":"5847f1cfd79eb0d0f153934a57ef717e91171d94d5135b38759303007e8efd29"},{"id":"s4","type":"other","url":"https://en.wikipedia.org/wiki/A_Mathematical_Theory_of_Communication","title":"A Mathematical Theory of Communication","quote":"It was later published in 1949 as a book titled The Mathematical Theory of Communication.","summary":"Confirms publication details and scope limits noted in secondary descriptions.","claim_ids":["c6"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"5847f1cfd79eb0d0f153934a57ef717e91171d94d5135b38759303007e8efd29","hash":"b0865df3e0488f771df4334d4d98b34ea3c8e327d1381ceb357f694882a53b42"}],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T08:42:06.861Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"Shannon and Weaver: The Mathematical Theory of Communication (1949)","register":"standard","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":"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.","section":"What the work establishes","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core scope of the theory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Entropy H = -∑ p_i log p_i quantifies average information per symbol from a discrete source.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Central mathematical definition enabling all later results.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The noisy channel coding theorem states that rates below channel capacity permit arbitrarily low error probability with suitable coding.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Proves reliable transmission is possible despite noise.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Weaver states that the theory's concept of information has nothing to do with meaning.","section":"Core results and primary passages","tier":"anecdotal","source_ids":["s3"],"source_status":"sourced","why_material":"Marks the explicit limit on semantics.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model produces flow networks that maintain order against noise through coding.","section":"Convergence patterns touched","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly evidences noise-resistant structured flow.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The work reaches only the level of abstract symbol transmission and does not address biological memory, life, or observer inclusion.","section":"Distance from the full synthesis","tier":"mechanistic","source_ids":["s4"],"source_status":"sourced","why_material":"Honest boundary on scope.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"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","quote":"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.","link_status":"ok","quote_status":"unverified"},{"id":"s2","type":"other","url":"https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf","title":"A Mathematical Theory of Communication","quote":"H = -∑ p_i log p_i; noisy channel coding theorem statements and proofs.","link_status":"ok","quote_status":"unverified"},{"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","quote":"The concept of information developed in this theory at first seems disappointing and bizarre... because it has nothing to do with meaning.","link_status":"ok","quote_status":"unverified"},{"id":"s4","type":"other","url":"https://en.wikipedia.org/wiki/A_Mathematical_Theory_of_Communication","title":"A Mathematical Theory of Communication","quote":"It was later published in 1949 as a book titled The Mathematical Theory of Communication.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":11951,"tokens_out":3004,"cost":0.02244875,"prev_hash":"genesis","hash":"d647be4811ead2035f98a8143aaaaa2c57da142dc611ddff4423bf1fa8d35928"}],"provenance":[{"ts":"2026-07-10T08:42:06.861Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"Shannon, C.E. and Weaver, W. (1949). The Mathematical Theory of Communication. University of Illinois Press.\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nReprints and expands the 1948 paper with Weaver's introduction; foundational text linking information theory to ordered structures, noise-resistant flow networks, and bounded complexity across scales.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain syn","response":"{\n  \"slug\": \"shannon-weaver-mathematical-theory-of-communication\",\n  \"title\": \"Shannon and Weaver: The Mathematical Theory of Communication (1949)\",\n  \"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 resi","tokens_in":11951,"tokens_out":3004,"cost":0,"prev":"genesis","hash":"a30fae82a0c4f6db2f094e113476e96fdfc9b27ede9420fd94c3ac35a6eccc74"},{"ts":"2026-07-10T08:48:23.198Z","model":"scorer","action":"score","prompt":"","input":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"a30fae82a0c4f6db2f094e113476e96fdfc9b27ede9420fd94c3ac35a6eccc74","hash":"1e643ba7975bd6b64ecfc7de17669df4fcde1e2f97909e00305e88d8b76a4bae"},{"ts":"2026-07-17T02:37:35.829Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","response":"22 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"1e643ba7975bd6b64ecfc7de17669df4fcde1e2f97909e00305e88d8b76a4bae","hash":"56aabc88a6dd0fb00885b818fc4cbf4b834006c09966a1897d4d31bd74a10be1"}],"energy":{"passes":3,"tokens_in":11951,"tokens_out":3004,"tokens_total":14955,"cost_usd":0,"models":{"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"56aabc88a6dd0fb00885b818fc4cbf4b834006c09966a1897d4d31bd74a10be1"},"posted_at":"2026-07-10T08:42:06.861Z","created_at":"2026-07-10T08:42:06.861Z","updated_at":"2026-07-17T02:37:35.829Z","machine":{"shape":"article.machine/v1","slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","json":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","bundle":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":6,"sources":4,"contributions":1,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","json":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","markdown":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown","skill":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/skill","topology":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/topology","versions":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/revisions","invocations":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"f75f9ed05ab2fae405c34c04a173e2b6756bf66b3c024c0a132e694cc27a524a","object":{"object_type":"article-object","identity":{"id":"article:paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","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)"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","role":"explain","audience":"human"},"skill":{"route":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/skill","role":"direct behavior","audience":"model","content":"---\nname: paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-\ndescription: Apply the Shannon and Weaver: The Mathematical Theory of Communication (1949) article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# Shannon and Weaver: The Mathematical Theory of Communication (1949)\n\nThis Skill is the behavioral expression of [the canonical article](/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-.\n- Read claims and relationships at /api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\nWhat the work establishes Claude 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\n\n## Representations\n\n- Human: /a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-\n- JSON: /api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-\n- Relationships: /api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-/topology\n- History: /api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-/revisions\n"},"json":{"route":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: the owner says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","philosophy","paper","paper","shannon","c","e","and","weaver","w","1949","the","mathematical","theory","of","communication","universit"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/invocations?status=success","failure_events":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"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)","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.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"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.","section":"What the work establishes","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core scope of the theory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Entropy H = -∑ p_i log p_i quantifies average information per symbol from a discrete source.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Central mathematical definition enabling all later results.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The noisy channel coding theorem states that rates below channel capacity permit arbitrarily low error probability with suitable coding.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Proves reliable transmission is possible despite noise.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Weaver states that the theory's concept of information has nothing to do with meaning.","section":"Core results and primary passages","tier":"anecdotal","source_ids":["s3"],"source_status":"sourced","why_material":"Marks the explicit limit on semantics.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model produces flow networks that maintain order against noise through coding.","section":"Convergence patterns touched","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly evidences noise-resistant structured flow.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The work reaches only the level of abstract symbol transmission and does not address biological memory, life, or observer inclusion.","section":"Distance from the full synthesis","tier":"mechanistic","source_ids":["s4"],"source_status":"sourced","why_material":"Honest boundary on scope.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"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","quote":"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.","summary":"Shannon's original 1948 paper text establishing the problem definition.","claim_ids":["c1","c5"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"44cf2f7ed13f72cf3a72e96836a4d87a4597b0646ea74d9751e51cf945d91a0c"},{"id":"s2","type":"other","url":"https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf","title":"A Mathematical Theory of Communication","quote":"H = -∑ p_i log p_i; noisy channel coding theorem statements and proofs.","summary":"Primary source for entropy definition and channel theorems.","claim_ids":["c2","c3"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"44cf2f7ed13f72cf3a72e96836a4d87a4597b0646ea74d9751e51cf945d91a0c","hash":"f7ff042b204541cd0e3867888b168d0bfb619fd43ced28c1081237acde8e0aa5"},{"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","quote":"The concept of information developed in this theory at first seems disappointing and bizarre... because it has nothing to do with meaning.","summary":"Weaver introduction in the 1949/1963 book edition.","claim_ids":["c4"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"f7ff042b204541cd0e3867888b168d0bfb619fd43ced28c1081237acde8e0aa5","hash":"5847f1cfd79eb0d0f153934a57ef717e91171d94d5135b38759303007e8efd29"},{"id":"s4","type":"other","url":"https://en.wikipedia.org/wiki/A_Mathematical_Theory_of_Communication","title":"A Mathematical Theory of Communication","quote":"It was later published in 1949 as a book titled The Mathematical Theory of Communication.","summary":"Confirms publication details and scope limits noted in secondary descriptions.","claim_ids":["c6"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T08:42:02.489Z","link_status":"ok","quote_status":"unverified","prev":"5847f1cfd79eb0d0f153934a57ef717e91171d94d5135b38759303007e8efd29","hash":"b0865df3e0488f771df4334d4d98b34ea3c8e327d1381ceb357f694882a53b42"}],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T08:42:06.861Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"Shannon and Weaver: The Mathematical Theory of Communication (1949)","register":"standard","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":"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.","section":"What the work establishes","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core scope of the theory.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Entropy H = -∑ p_i log p_i quantifies average information per symbol from a discrete source.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Central mathematical definition enabling all later results.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The noisy channel coding theorem states that rates below channel capacity permit arbitrarily low error probability with suitable coding.","section":"Core results and primary passages","tier":"mechanistic","source_ids":["s2"],"source_status":"sourced","why_material":"Proves reliable transmission is possible despite noise.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Weaver states that the theory's concept of information has nothing to do with meaning.","section":"Core results and primary passages","tier":"anecdotal","source_ids":["s3"],"source_status":"sourced","why_material":"Marks the explicit limit on semantics.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model produces flow networks that maintain order against noise through coding.","section":"Convergence patterns touched","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Directly evidences noise-resistant structured flow.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c6","text":"The work reaches only the level of abstract symbol transmission and does not address biological memory, life, or observer inclusion.","section":"Distance from the full synthesis","tier":"mechanistic","source_ids":["s4"],"source_status":"sourced","why_material":"Honest boundary on scope.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T01:42:06-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"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","quote":"The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.","link_status":"ok","quote_status":"unverified"},{"id":"s2","type":"other","url":"https://people.math.harvard.edu/~ctm/home/text/others/shannon/entropy/entropy.pdf","title":"A Mathematical Theory of Communication","quote":"H = -∑ p_i log p_i; noisy channel coding theorem statements and proofs.","link_status":"ok","quote_status":"unverified"},{"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","quote":"The concept of information developed in this theory at first seems disappointing and bizarre... because it has nothing to do with meaning.","link_status":"ok","quote_status":"unverified"},{"id":"s4","type":"other","url":"https://en.wikipedia.org/wiki/A_Mathematical_Theory_of_Communication","title":"A Mathematical Theory of Communication","quote":"It was later published in 1949 as a book titled The Mathematical Theory of Communication.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":11951,"tokens_out":3004,"cost":0.02244875,"prev_hash":"genesis","hash":"d647be4811ead2035f98a8143aaaaa2c57da142dc611ddff4423bf1fa8d35928"}],"provenance":[{"ts":"2026-07-10T08:42:06.861Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"Shannon, C.E. and Weaver, W. (1949). The Mathematical Theory of Communication. University of Illinois Press.\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nReprints and expands the 1948 paper with Weaver's introduction; foundational text linking information theory to ordered structures, noise-resistant flow networks, and bounded complexity across scales.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain syn","response":"{\n  \"slug\": \"shannon-weaver-mathematical-theory-of-communication\",\n  \"title\": \"Shannon and Weaver: The Mathematical Theory of Communication (1949)\",\n  \"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 resi","tokens_in":11951,"tokens_out":3004,"cost":0,"prev":"genesis","hash":"a30fae82a0c4f6db2f094e113476e96fdfc9b27ede9420fd94c3ac35a6eccc74"},{"ts":"2026-07-10T08:48:23.198Z","model":"scorer","action":"score","prompt":"","input":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"a30fae82a0c4f6db2f094e113476e96fdfc9b27ede9420fd94c3ac35a6eccc74","hash":"1e643ba7975bd6b64ecfc7de17669df4fcde1e2f97909e00305e88d8b76a4bae"},{"ts":"2026-07-17T02:37:35.829Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","response":"22 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"1e643ba7975bd6b64ecfc7de17669df4fcde1e2f97909e00305e88d8b76a4bae","hash":"56aabc88a6dd0fb00885b818fc4cbf4b834006c09966a1897d4d31bd74a10be1"}],"energy":{"passes":3,"tokens_in":11951,"tokens_out":3004,"tokens_total":14955,"cost_usd":0,"models":{"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"56aabc88a6dd0fb00885b818fc4cbf4b834006c09966a1897d4d31bd74a10be1"},"posted_at":"2026-07-10T08:42:06.861Z","created_at":"2026-07-10T08:42:06.861Z","updated_at":"2026-07-17T02:37:35.829Z","machine":{"shape":"article.machine/v1","slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","json":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","bundle":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":6,"sources":4,"contributions":1,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","json":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","markdown":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/bundle?format=markdown","skill":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/skill","topology":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/topology","versions":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/revisions","invocations":"/api/articles/paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-shannon-c-e-and-weaver-w-1949-the-mathematical-theory-of-communication-universit","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"f75f9ed05ab2fae405c34c04a173e2b6756bf66b3c024c0a132e694cc27a524a"}}}