{"assessment":{"class":"C","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":321869,"passages":[{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":5,"queries":5,"sha256":"b3887596a2a3e275fc013804584764c10c5446f6c887bd4c25d7243c73b7bc29"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #2c3fc535","item":"In-text #2c3fc535","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"61206b17fc0ce40b83abf9a23f925c74ef2e7d5ccf69a69c839b889f70945a84","prominence":"central","quote":{"exact":"It is an error-correcting code capable of correcting up to three errors"},"quote_capped":true,"section":["History of coding theory"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"It is an error-correcting code capable of correcting up to three errors in each 24-bit word, and detecting a fourth.","segments":[{"text":"It is an error-correcting code capable of correcting up to three errors in each 24-bit word, and detecting a fourth."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"3a1713d84519e3017d08db26f64cb1dda0120e3f8978fef09d2987a3bbbdac73"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #ad758efc","item":"In-text #ad758efc","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"08f9852119db5fb8737bc705f7e02ac6ee7f101828963b5131746bfd9e6aaad4","prominence":"central","quote":{"exact":"Data can be seen as a random variable X : Ω →"},"quote_capped":true,"section":["Source coding","Definition"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Data can be seen as a random variable X : Ω → X {\\displaystyle X:\\Omega \\to {\\mathcal {X}}} , where x ∈ X {\\displaystyle x\\in {\\mathcal {X}}} appears with probability P [ X = x ] {\\displaystyle \\mathbb {P} [X=x]} .","segments":[{"text":"Data can be seen as a random variable "},{"tex":"X:\\Omega \\to {\\mathcal {X}}"},{"text":" , where "},{"tex":"x\\in {\\mathcal {X}}"},{"text":" appears with probability "},{"tex":"\\mathbb {P} [X=x]"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"43bb80cc3daf7bef67d40961e30e503a5fa227dc8f10624e5d143e37eca12aef","coverage":null,"id":"enwiki-321869-1374936394::In-text #f1fc89ed","item":"In-text #f1fc89ed","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List","end_line":3123,"library":"lean-core","line":3116,"location_key":"43bb80cc3daf7bef67d40961e30e503a5fa227dc8f10624e5d143e37eca12aef","module":"Init.Prelude","note":"Lean carries a word over the alphabet as a finite sequence of its symbols, which is the object the article writes with a star; nothing else differs.","pair_key":"d078b1b47e35692b3bf1746732b4c35aa0c81519ec45dafc11c54bbd10417091","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"inductive List : Type u → Type u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FreeMonoid","end_line":65,"library":"mathlib","line":65,"location_key":"3a59e568af4a11f7914e7e4326df7da440b9f1813c66100ccce8bb4162f1170e","module":"Mathlib.Algebra.FreeMonoid.Basic","note":"Mathlib packages the words over an alphabet together with their concatenation as a monoid, its underlying elements being the finite sequences of symbols the article denotes with a star.","pair_key":"65fe9877199ffe8867e8488f322c2bc26c645ab5defe3384188e41db45dfbb8a","path":"Mathlib/Algebra/FreeMonoid/Basic.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FreeMonoid : Type u_6 → Type u_6"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dc00c82e414caafa4c9ef5b3642ae2bb8e81c3f52b84dcd82d13d5f130b6b0e8","prominence":"supporting","quote":{"exact":"Data are encoded by strings (words) over an alphabet Σ {\\displaystyle \\Sigma"},"quote_capped":true,"section":["Source coding","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Data are encoded by strings (words) over an alphabet Σ {\\displaystyle \\Sigma } .","segments":[{"text":"Data are encoded by strings (words) over an alphabet "},{"tex":"\\Sigma"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"5efb328cd7873ec8dd1e829fe0bdb4544b19cfe4c86c8fa1b274b9fad6472caf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #310dc570","item":"In-text #310dc570","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"abe60492aea3be71964d0e009196e5a3993722410dbe8927ed059580ac9c370d","prominence":"central","quote":{"exact":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} (or"},"quote_capped":true,"section":["Source coding","Definition"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"before":{"layer":"A code is a function ","lead_in":true,"segments":[{"text":"A code is a function "}]},"layer":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} (or Σ + {\\displaystyle \\Sigma ^{+}} if the empty string is not part of the alphabet).","segments":[{"tex":"C:{\\mathcal {X}}\\to \\Sigma ^{*}"},{"text":" (or "},{"tex":"\\Sigma ^{+}"},{"text":" if the empty string is not part of the alphabet)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"e9f449d7c9a814467e65f72f68981c00cea1e4f9dd3ea36bc2e8935ef18d2afd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #c3db39dc","item":"In-text #c3db39dc","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"60c1756075ca3a9062c01435be74ab1df5dc5d661c9c2c36b87148e5843ca917","prominence":"supporting","quote":{"exact":"C ( x ) {\\displaystyle C(x)} is the code word associated with"},"quote_capped":true,"section":["Source coding","Definition"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"C ( x ) {\\displaystyle C(x)} is the code word associated with x {\\displaystyle x} .","segments":[{"tex":"C(x)"},{"text":" is the code word associated with "},{"tex":"x"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"95ce4b53687fd2c8db92670be7003b0aa6e36af452651018e391df66f61a4f80","coverage":null,"id":"enwiki-321869-1374936394::In-text #e060dac0","item":"In-text #e060dac0","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List.length","end_line":3203,"library":"lean-core","line":3201,"location_key":"95ce4b53687fd2c8db92670be7003b0aa6e36af452651018e391df66f61a4f80","module":"Init.Prelude","note":"Lean writes the symbol count of a word in postfix form on the word itself, with words of the alphabet carried as finite sequences of symbols.","pair_key":"ede2c949f107750e546b8548039ee04f38f56311d93a63e52e479a4389f0378c","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def List.length {α : Type u_1} : List α → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e29351200b730f75b4016f01ccb640b4edd470b7f0e23c7e0ed226dade161859","prominence":"supporting","quote":{"exact":"Length of the code word is written as l ( C ("},"quote_capped":true,"section":["Source coding","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Length of the code word is written as l ( C ( x ) ) . {\\displaystyle l(C(x)).}","segments":[{"text":"Length of the code word is written as "},{"tex":"l(C(x))."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"7858f4f9b14dfb02848a4f63fa038d0ef89af57b703842caf810b69dd1ddcd68"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #e09ee56c","item":"In-text #e09ee56c","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b59cbe6766c1e5895837e5f5614ab03262d2742792043645159adcd765d0c2ce","prominence":"central","quote":{"exact":"Expected length of a code is l ( C ) = ∑"},"quote_capped":true,"section":["Source coding","Definition"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Expected length of a code is l ( C ) = ∑ x ∈ X l ( C ( x ) ) P [ X = x ] . {\\displaystyle l(C)=\\sum _{x\\in {\\mathcal {X}}}l(C(x))\\mathbb {P} [X=x].}","segments":[{"text":"Expected length of a code is "},{"tex":"l(C)=\\sum _{x\\in {\\mathcal {X}}}l(C(x))\\mathbb {P} [X=x]."}]},"unresolved":null},{"absence":null,"basis":"6b4e8d402e199f5bbfa5b58660f0eded099a2ace0fac51a9e0b8e5ec46dbb942","coverage":null,"id":"enwiki-321869-1374936394::In-text #30965e9b","item":"In-text #30965e9b","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List.flatMap","end_line":3332,"library":"lean-core","line":3332,"location_key":"6b4e8d402e199f5bbfa5b58660f0eded099a2ace0fac51a9e0b8e5ec46dbb942","module":"Init.Prelude","note":"Lean's operation sends each entry of a sequence through the given map and joins the resulting words end to end, with words carried as finite sequences of symbols.","pair_key":"62735fe804d2a1d66fb44cb551880eb6001462dec1a286e938246e123032dfe1","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def List.flatMap {α : Type u} {β : Type v} : (α → List β) → List α → List β"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FreeMonoid.lift","end_line":314,"library":"mathlib","line":309,"location_key":"39408bf2417d36fe6ec1f88e62560c456cde611a2336195d402f26c72d77f3d1","module":"Mathlib.Algebra.FreeMonoid.Basic","note":"Mathlib states the extension for an arbitrary monoid target and bundles it as a homomorphism together with the claim that this extension is the only one, which is beyond the single equation the passage records.","pair_key":"603809cf09b4d79a7fb6bdbe0e77ee5fdd74844b9e21f9c4aab7ce1d977ab6f1","path":"Mathlib/Algebra/FreeMonoid/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FreeMonoid.lift {α : Type*} {M : Type*} [Monoid M] : (α → M) ≃ (FreeMonoid α →* M)"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Cslib.Algorithms.Lean.HuffmanTree.encode_codeOfLeaf","library":"atlas","line":344,"location_key":"a1b39321b1c28bf6302e08d32ec237970d07cadce4afbcc50b96bcce25f3ceae","module":"CSLibExt.Algorithms.Lean.Greedy.Huffman","note":"This is the passage's extension equation written for one particular family of codes, with the encoder's result wrapped as an optional value.","pair_key":"415f58633b67954305ae2dd9aa4626521ff8138db6d93e47b52be674f7ddf263","path":"CSLibExt/Algorithms/Lean/Greedy/Huffman.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Cslib.Algorithms.Lean.HuffmanTree.encode_codeOfLeaf {α : Type u} [DecidableEq α] (tree : Cslib.Algorithms.Lean.HuffmanTree α) (message : List tree.LeafSymbol) : tree.encode? (List.map Subtype.val message) = Option.some (List.flatMap tree.codeOfLeaf message)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"422e85f7e2820dfb828a4c308281fc610d56577f4b978e817bdc4c73f03257a8","prominence":"supporting","quote":{"exact":"The concatenation of code words C ( x 1 , … ,"},"quote_capped":true,"section":["Source coding","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The concatenation of code words C ( x 1 , … , x k ) = C ( x 1 ) C ( x 2 ) ⋯ C ( x k ) {\\displaystyle C(x_{1},\\ldots ,x_{k})=C(x_{1})C(x_{2})\\cdots C(x_{k})} .","segments":[{"text":"The concatenation of code words "},{"tex":"C(x_{1},\\ldots ,x_{k})=C(x_{1})C(x_{2})\\cdots C(x_{k})"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"6fd34a901a2147bc5b59a7c7da2a315550643c2c87dd98b173ecc0236c846f8c","coverage":null,"id":"enwiki-321869-1374936394::In-text #05f527be","item":"In-text #05f527be","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List.flatMap_nil","end_line":679,"library":"lean-core","line":679,"location_key":"6fd34a901a2147bc5b59a7c7da2a315550643c2c87dd98b173ecc0236c846f8c","module":"Init.Data.List.Basic","note":"Lean core states the equation for any map from symbols to words, with the empty source string written as the empty list.","pair_key":"f4bbddb045eef2ef07e9382111bfb659f42b566d21b5e4d9eda604a0659a8eeb","path":"src/Init/Data/List/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem List.flatMap_nil {α : Type u} {β : Type v} {f : α → List β} : List.flatMap f [] = []"},"statement":false},{"challenge":"downgraded","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"low","declaration":"List.flatten_nil","end_line":662,"library":"lean-core","line":662,"location_key":"223ae144c7467cb86f063ea305a306c4914e6318a8d50479dd9dc7f2314ae410","module":"Init.Data.List.Basic","note":"Lean core states that concatenating no words at all gives the empty word, without mentioning a code.","pair_key":"1b0b3b3bda978aebc4f281d8ac1ce973ab0aeb312c49daa6223597027cf929fd","path":"src/Init/Data/List/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem List.flatten_nil {α : Type u} : [].flatten = []"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7bdbd5cd111ca4c7af6823fa8451f91630a076859611e36f3869f015ba16942f","prominence":"supporting","quote":{"exact":"The code word of the empty string is the empty string itself:"},"quote_capped":true,"section":["Source coding","Definition"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The code word of the empty string is the empty string itself: C ( ϵ ) = ϵ {\\displaystyle C(\\epsilon )=\\epsilon }","segments":[{"text":"The code word of the empty string is the empty string itself: "},{"tex":"C(\\epsilon )=\\epsilon"}]},"unresolved":null},{"absence":null,"basis":"444a90aad5e8e3bda4409b9a4aa54c1334c099636b51ff05365946a509f9a74e","coverage":null,"id":"enwiki-321869-1374936394::In-text #5b440168","item":"In-text #5b440168","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Function.Injective","end_line":54,"library":"lean-core","line":53,"location_key":"444a90aad5e8e3bda4409b9a4aa54c1334c099636b51ff05365946a509f9a74e","module":"Init.Data.Function","note":"Lean core fixes the notion for a function between arbitrary sorts, under the name injective rather than non-singular.","pair_key":"1bced5ffd38a6d17a2864a7a96d820e41b97f6a3d3d76e2d2da4b2dfc39be92f","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cd2bb874bae448e4c1f4488aa7ff1da74102ae5e5d8d2146a82cb945c85c4f72","prominence":"central","quote":{"exact":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} is","prefix":"s "},"quote_capped":true,"section":["Source coding","Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} is non-singular if injective.","segments":[{"tex":"C:{\\mathcal {X}}\\to \\Sigma ^{*}"},{"text":" is non-singular if injective."}]},"unresolved":null},{"absence":null,"basis":"061f865cb3c026587f4b3537b759b841153f9a4f7c641f6bf8843827d03c1f61","coverage":null,"id":"enwiki-321869-1374936394::In-text #9dd58375","item":"In-text #9dd58375","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Function.Injective","end_line":54,"library":"lean-core","line":53,"location_key":"061f865cb3c026587f4b3537b759b841153f9a4f7c641f6bf8843827d03c1f61","module":"Init.Data.Function","note":"Lean core fixes the notion for a map between arbitrary sorts, under the name injective.","pair_key":"5a29a387d97aa5abf214af3396d7b438b9ce6eacd0311ff5a796c504a97e684e","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Injective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"InformationTheory.IsUniquelyDecodable","end_line":42,"library":"mathlib","line":39,"location_key":"5cb8ebd4fa699e103442c7bf9e11878ffbd151aade9871b768a7633a9bcbbd1b","module":"Mathlib.InformationTheory.Coding.UniquelyDecodable","note":"Mathlib carries the code by the set of its code words and asks that distinct sequences of those words concatenate to distinct strings.","pair_key":"18389ee8ef41992f3f4f66873356a726e51127dcb36f006e337bd48fc551ce28","path":"Mathlib/InformationTheory/Coding/UniquelyDecodable.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def InformationTheory.IsUniquelyDecodable {α : Type*} : Set (List α) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dc0a389b259fd69bfde521692c844cbe802764a7a0ea8a512eaab97556a79ba6","prominence":"central","quote":{"exact":"C : X ∗ → Σ ∗ {\\displaystyle C:{\\mathcal {X}}^{*}\\to \\Sigma ^{*}}"},"quote_capped":true,"section":["Source coding","Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"C : X ∗ → Σ ∗ {\\displaystyle C:{\\mathcal {X}}^{*}\\to \\Sigma ^{*}} is uniquely decodable if injective.","segments":[{"tex":"C:{\\mathcal {X}}^{*}\\to \\Sigma ^{*}"},{"text":" is uniquely decodable if injective."}]},"unresolved":null},{"absence":null,"basis":"2d96c6f553cd037d8061c977a1a5984d723d866e86d839ef146f6f8ba2987c63","coverage":null,"id":"enwiki-321869-1374936394::In-text #91ec1820","item":"In-text #91ec1820","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.InformationTheory.IsPrefixFree","library":"atlas","line":20,"location_key":"2d96c6f553cd037d8061c977a1a5984d723d866e86d839ef146f6f8ba2987c63","module":"MathlibExt.InformationTheory.PrefixFree","note":"Atlas gives the property the name prefix-free and quantifies over ordered pairs of distinct symbols; its prefix relation admits equality, so distinct symbols also receive distinct words.","pair_key":"0e6994fb8a946bd6ff1b06beaf49d6b68a26d8b2448a17dfec394c083d2686e7","path":"MathlibExt/InformationTheory/PrefixFree.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MathlibExt.InformationTheory.IsPrefixFree {α : Type*} {β : Type*} : (α → List β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"InformationTheory.IsPrefixFree","end_line":37,"library":"mathlib","line":36,"location_key":"9dd57b787f592de393b2c334af818717f7a2ccb33b4a5d982bbefdf7b4ce0a72","module":"Mathlib.InformationTheory.Coding.PrefixFree","note":"Mathlib states the property of the set of code words rather than of the indexed map, and its words are lists over the alphabet.","pair_key":"aebcbb5057d2e6b5fd805ea8177b5416fa9aaf8a9b7d3fcea74c768ab5b0288a","path":"Mathlib/InformationTheory/Coding/PrefixFree.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def InformationTheory.IsPrefixFree {α : Type*} : Set (List α) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dc75ffb15729cf13617bf49fb5978095256896e6c204965f563a953745057983","prominence":"central","quote":{"exact":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} is","prefix":". "},"quote_capped":true,"section":["Source coding","Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} is instantaneous if C ( x 1 ) {\\displaystyle C(x_{1})} is not a proper prefix of C ( x 2 ) {\\displaystyle C(x_{2})} (and vice versa).","segments":[{"tex":"C:{\\mathcal {X}}\\to \\Sigma ^{*}"},{"text":" is instantaneous if "},{"tex":"C(x_{1})"},{"text":" is not a proper prefix of "},{"tex":"C(x_{2})"},{"text":" (and vice versa)."}]},"unresolved":null},{"absence":null,"basis":"100d69629a7505bbb2c620e6164b17a1a2726529e527f5d5710982dec9112f01","coverage":null,"id":"enwiki-321869-1374936394::In-text #a5a066ef","item":"In-text #a5a066ef","kind":"definition","locations":[{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"InformationTheory.shannonEntropyBits","end_line":67,"library":"formal-conjectures","line":65,"location_key":"100d69629a7505bbb2c620e6164b17a1a2726529e527f5d5710982dec9112f01","module":"FormalConjecturesForMathlib.InformationTheory.FiniteEntropy","note":"The declaration fixes a finite value alphabet and base-two logarithms, and gives zero weight to values of probability zero.","pair_key":"22af97383eda56fb397d5955b2cf71688a548808c42b683366cda6bc8f54db26","path":"FormalConjecturesForMathlib/InformationTheory/FiniteEntropy.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def InformationTheory.shannonEntropyBits {Ω : Type*} [MeasurableSpace Ω] {α : Type*} [Fintype α] : MeasureTheory.Measure Ω → (Ω → α) → ℝ"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"low","declaration":"CourtadeKumar.entropy","end_line":107,"library":"formal-conjectures","line":106,"location_key":"6cf56fceb6981a747992cc6bec3c74087819dc6752758942618ff4720531e907","module":"FormalConjectures.Paper.CourtadeKumar","note":"The declaration takes the distribution itself as argument and measures entropy in bits over a finite type.","pair_key":"8ab4a7c1dffe12717fb360b017815bd25142e7a8359897a57a28d0bcab590ec2","path":"FormalConjectures/Paper/CourtadeKumar.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def CourtadeKumar.entropy {α : Type*} [Fintype α] : (α → ℝ) → ℝ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"636b62eeb3c02b187584f3157592199fde51072e36fc78f5e0443d8f4eb4cf02","prominence":"central","quote":{"exact":"Entropy of a source is the measure of information."},"quote_capped":false,"section":["Source coding","Principle"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Entropy of a source is the measure of information.","segments":[{"text":"Entropy of a source is the measure of information."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"f43b697def6010efe864414fe47f91a567f45e03b12198d377e6ff322ccb0d5e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #a752a889","item":"In-text #a752a889","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1cb483953d7b719032ec6a9ce2dea700b264791d6ec804c787cca8cb3facf1a7","prominence":"central","quote":{"exact":"Data compression which explicitly tries to minimize the average length of messages"},"quote_capped":true,"section":["Source coding","Principle"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Data compression which explicitly tries to minimize the average length of messages according to a particular assumed probability model is called entropy encoding.","segments":[{"text":"Data compression which explicitly tries to minimize the average length of messages according to a particular assumed probability model is called entropy encoding."}]},"unresolved":null},{"absence":null,"basis":"81c98f8a4f61d55747cece2a823c8da131da49f8c3cb8bc2adc35d247c0d6e2b","coverage":null,"id":"enwiki-321869-1374936394::In-text #5a0714d9","item":"In-text #5a0714d9","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.InformationTheory.ShannonSourceCodingWanted.shannon_source_coding_lower_bound","library":"atlas","line":150,"location_key":"81c98f8a4f61d55747cece2a823c8da131da49f8c3cb8bc2adc35d247c0d6e2b","module":"MathlibExt.InformationTheory.ShannonSourceCoding","note":"Atlas restricts to finite alphabets, strictly positive probabilities and uniquely decodable codes, and measures entropy in units set by the size of the code alphabet rather than in bits.","pair_key":"0700daed7d45f44fc8fc6731ccda9406365f4c0b8490adafc41b49c28410b8c3","path":"MathlibExt/InformationTheory/ShannonSourceCoding.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.InformationTheory.ShannonSourceCodingWanted.shannon_source_coding_lower_bound {α : Type*} {β : Type*} [Fintype α] [Fintype β] (p : α → ℝ) : (∀ (a : α), 0 < p a) → ∑ a, p a = 1 → 2 ≤ Fintype.card β → ∀ (code : α → List β), Function.Injective code → InformationTheory.IsUniquelyDecodable (Set.range code) → (-∑ a, p a * Real.log (p a)) / Real.log ↑(Fintype.card β) ≤ ∑ a, p a * ↑(code a).length"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"72b2bd7e266128cf864a188a49dce815a367858c54c63cacb5c066bacec0a456","prominence":"central","quote":{"exact":"C(x) ≥ H(x), where H(x) is entropy of source (bitrate), and C(x)"},"quote_capped":true,"section":["Source coding","Principle"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"C(x) ≥ H(x), where H(x) is entropy of source (bitrate), and C(x) is the bitrate after compression.","segments":[{"text":"C(x) ≥ H(x), where H(x) is entropy of source (bitrate), and C(x) is the bitrate after compression."}]},"unresolved":null},{"absence":null,"basis":"ebe2116eae3b8e72253873112cf84a0230784be747378c80d6af68929f54bd03","coverage":null,"id":"enwiki-321869-1374936394::In-text #26c471f9","item":"In-text #26c471f9","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.InformationTheory.ShannonSourceCodingWanted.shannon_source_coding_lower_bound","library":"atlas","line":150,"location_key":"ebe2116eae3b8e72253873112cf84a0230784be747378c80d6af68929f54bd03","module":"MathlibExt.InformationTheory.ShannonSourceCoding","note":"Atlas covers the coding schemes given by uniquely decodable injective codes on finite alphabets, with entropy in units set by the code alphabet.","pair_key":"875bd37b6ffc10f5e45306af07e87f2b50811608b42d634e53a1f2702641c0f6","path":"MathlibExt/InformationTheory/ShannonSourceCoding.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.InformationTheory.ShannonSourceCodingWanted.shannon_source_coding_lower_bound {α : Type*} {β : Type*} [Fintype α] [Fintype β] (p : α → ℝ) : (∀ (a : α), 0 < p a) → ∑ a, p a = 1 → 2 ≤ Fintype.card β → ∀ (code : α → List β), Function.Injective code → InformationTheory.IsUniquelyDecodable (Set.range code) → (-∑ a, p a * Real.log (p a)) / Real.log ↑(Fintype.card β) ≤ ∑ a, p a * ↑(code a).length"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"be1d47e15040ae24aff3f265d21c84cb0eb60a067d0317441f61d97532be2ed2","prominence":"central","quote":{"exact":"In particular, no source coding scheme can be better than the entropy"},"quote_capped":true,"section":["Source coding","Principle"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"In particular, no source coding scheme can be better than the entropy of the source.","segments":[{"text":"In particular, no source coding scheme can be better than the entropy of the source."}]},"unresolved":null},{"absence":null,"basis":"d312413fd2aea70bf9f906eaf1af8ca5c4cc552164eed87601bca25d88550861","coverage":null,"id":"enwiki-321869-1374936394::In-text #4ea3522c","item":"In-text #4ea3522c","kind":"definition","locations":[{"challenge":"downgraded","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.LinearCode","end_line":31,"library":"tauceti","line":31,"location_key":"d312413fd2aea70bf9f906eaf1af8ca5c4cc552164eed87601bca25d88550861","module":"TauCeti.InformationTheory.Coding.Basic","note":"TauCeti writes a linear code as a submodule of the word space of functions from coordinates to alphabet symbols, so the set of code words is carried together with the proofs that it holds zero and is closed under sums and scalar multiples.","pair_key":"5de63df5a9c98a7fcb0f4bf2e9ebe8ba32afadb288ab65865718e5ca081eea87","path":"TauCeti/InformationTheory/Coding/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"abbrev TauCeti.LinearCode (F : Type u_1) : Type u_2 → [Field F] → Type (max u_1 u_2)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Submodule.add_mem","end_line":210,"library":"mathlib","line":209,"location_key":"507eeb51edcd6d3548fc1c9c5d2f6a3dd9ede35ad4aab1e9938b2d67086b89fa","module":"Mathlib.Algebra.Module.Submodule.Defs","note":"Mathlib states the closure of a submodule under addition for any module, and a linear block code is one such submodule of its word space.","pair_key":"0937a19b80c14be5d4a7ff110935187c109d4671a83247213df2b001e09a6dba","path":"Mathlib/Algebra/Module/Submodule/Defs.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Submodule.add_mem {R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] {module_M : _root_.Module R M} (p : Submodule R M) {x y : M} : x ∈ p → y ∈ p → x + y ∈ p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b3c80d9a9ffeec6cff63ebf23d9ee881453276ee0770c5782961b74422495c08","prominence":"central","quote":{"exact":"Linear block codes have the property of linearity, i.e. the sum of"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"after":{"layer":", and they are applied to the source bits in blocks, hence the name linear block codes.","segments":[{"text":", and they are applied to the source bits in blocks, hence the name linear block codes."}]},"layer":"Linear block codes have the property of linearity, i.e. the sum of any two codewords is also a code word","segments":[{"text":"Linear block codes have the property of linearity, i.e. the sum of any two codewords is also a code word"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"c3f5c99da6df131cd5a7bf67dc429d96ac089c6351ab82695249f6502d0afe05"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #be2c3b61","item":"In-text #be2c3b61","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5e3ea54b7b8217cf887d0af0222c7076729ca710fbebc09141b5200d87bea95f","prominence":"supporting","quote":{"exact":"There are block codes that are not linear, but it is difficult"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"There are block codes that are not linear, but it is difficult to prove that a code is a good one without this property.","segments":[{"text":"There are block codes that are not linear, but it is difficult to prove that a code is a good one without this property."}]},"unresolved":null},{"absence":null,"basis":"9e145ec650471e242062129c3a1fe096b5a996b8a0b5dd48e407a6bcb9937c83","coverage":null,"id":"enwiki-321869-1374936394::In-text #cc648cbd","item":"In-text #cc648cbd","kind":"notation","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.BinaryGolay.parameters_punctureAt_code","end_line":64,"library":"tauceti","line":59,"location_key":"9e145ec650471e242062129c3a1fe096b5a996b8a0b5dd48e407a6bcb9937c83","module":"TauCeti.InformationTheory.Coding.Binary.Golay.Punctured","note":"TauCeti forms the parameter triple only for this one code, with the alphabet carried by the code's type rather than named beside the triple.","pair_key":"c4f163f1989f2b7a105a190938c4e0f93d9260e13d5d2cb66ceb57ae70ea953c","path":"TauCeti/InformationTheory/Coding/Binary/Golay/Punctured.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.BinaryGolay.parameters_punctureAt_code (i : Fin 24) : (Fintype.card ↑{i}ᶜ, Module.finrank (ZMod 2) ↥(TauCeti.punctureAt TauCeti.BinaryGolay.code i), (↑(TauCeti.punctureAt TauCeti.BinaryGolay.code i)).hammingMinDist) = (23, 12, 7)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"13dd5514ddf0e8738904b0e556517cf9236f770f598aea61dd60088db182ece8","prominence":"central","quote":{"exact":"Linear block codes are summarized by their symbol alphabets (e.g., binary or"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Linear block codes are summarized by their symbol alphabets (e.g., binary or ternary) and parameters (n,m,dmin)[5] where","segments":[{"text":"Linear block codes are summarized by their symbol alphabets (e.g., binary or ternary) and parameters (n,m,dmin)"},{"ref":"[5]"},{"text":" where"}]},"unresolved":null},{"absence":null,"basis":"c4573ffdc11fb6a0dfa6ebd81fc625bb076b8ece9095d0886f57b08021268b73","coverage":null,"id":"enwiki-321869-1374936394::In-text #edb9cb3c","item":"In-text #edb9cb3c","kind":"definition","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Set.hammingMinDist","end_line":46,"library":"tauceti","line":45,"location_key":"c4573ffdc11fb6a0dfa6ebd81fc625bb076b8ece9095d0886f57b08021268b73","module":"TauCeti.InformationTheory.Coding.MinimumDistance.Basic","note":"TauCeti defines this for any set of words over a finite coordinate set, with position-dependent symbol types, and returns zero when the set holds no two distinct words.","pair_key":"aeb592cd99babed3718fa5e504624fd30738bab3c0016f6c5dc065bc37df912c","path":"TauCeti/InformationTheory/Coding/MinimumDistance/Basic.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def Set.hammingMinDist {ι : Type*} {β : ι → Type*} [Fintype ι] [(i : ι) → DecidableEq (β i)] : Set ((i : ι) → β i) → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.Combinatorics.GoodLTCodesWanted.GoodLTC.BinaryCode","library":"atlas","line":64,"location_key":"ae9074c37ad5e4e2ac82a508be39f0d5ab65ca307ac8bca1c60049fd629f0522","module":"WantedExt.Combinatorics.GoodLTCodesWanted","note":"Its alphabet is pinned to the two-element field, where the passage leaves the symbol alphabet open.","pair_key":"04d0b902d929187d027faf6c5c6a88254b62f495f84107f512b796fb7156f4bc","path":"WantedExt/Combinatorics/GoodLTCodesWanted.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"abbrev MathlibExt.Combinatorics.GoodLTCodesWanted.GoodLTC.BinaryCode : ℕ → Type"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.LinearCode.IsGeneratorMatrix.encodingEquiv","end_line":389,"library":"tauceti","line":387,"location_key":"080ee92941de5e2b4a4a9700478ffb6d8a7d57c88b46239bc52c77e7c75706c6","module":"TauCeti.InformationTheory.Coding.Matrix","note":"It assumes a chosen generator matrix whose rows are independent, a choice every linear block code admits.","pair_key":"0e285cd89b51f9aead82127d76c9869094cca52f2fa4d753b7169b4f3b4dce30","path":"TauCeti/InformationTheory/Coding/Matrix.lean","proof_status":"definition","rank":3,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.LinearCode.IsGeneratorMatrix.encodingEquiv {F : Type*} {ι : Type*} {ρ : Type*} [Field F] [Fintype ρ] {C : TauCeti.LinearCode F ι} {G : Matrix ρ ι F} : C.IsGeneratorMatrix G → LinearIndependent F G.row → (ρ → F) ≃ₗ[F] ↥C"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a5e7ee357638380617b4d8cfa3f9e5a7a92f0785525bbd2ccf3692b8f6d5999b","prominence":"supporting","quote":{"exact":"n is the length of the codeword, in symbols, m is the"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"before":{"layer":"Linear block codes are summarized by their symbol alphabets (e.g., binary or ternary) and parameters (n,m,dmin)[5] where ","lead_in":true,"segments":[{"text":"Linear block codes are summarized by their symbol alphabets (e.g., binary or ternary) and parameters (n,m,dmin)"},{"ref":"[5]"},{"text":" where "}]},"layer":"n is the length of the codeword, in symbols, m is the number of source symbols that will be used for encoding at once, dmin is the minimum hamming distance for the code.","segments":[{"text":"n is the length of the codeword, in symbols, m is the number of source symbols that will be used for encoding at once, dmin is the minimum hamming distance for the code."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"d99bb6cbb86851224a1146b856a42db90d292559397138b4be17ad7b9841228f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #7b149b04","item":"In-text #7b149b04","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5368b1a80ff8d0d3f68c1a7de4a6b9f2eaf01f4c2e09fb3003a2c9b7aee3073c","prominence":"supporting","quote":{"exact":"The result is a hexagon pattern like a bee's nest."},"quote_capped":false,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The result is a hexagon pattern like a bee's nest.","segments":[{"text":"The result is a hexagon pattern like a bee's nest."}]},"unresolved":null},{"absence":null,"basis":"303749c3a6d0267a0752e749c66dc06edef0c568c7aa863a5da92134e162fb44","coverage":null,"id":"enwiki-321869-1374936394::In-text #7dbe5b26","item":"In-text #7dbe5b26","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.BinaryGolay.finrank_code","end_line":138,"library":"tauceti","line":136,"location_key":"303749c3a6d0267a0752e749c66dc06edef0c568c7aa863a5da92134e162fb44","module":"TauCeti.InformationTheory.Coding.Binary.Golay.Basic","note":"Lean carries the block length as the index type of 24 coordinates in the code's type rather than as a numeral, and the declaration states the remaining parameter, the dimension twelve.","pair_key":"e4374710e903b73487b527cc126e150f8eb1cc6d6057a25f4c71eb1e0aaeb2c5","path":"TauCeti/InformationTheory/Coding/Binary/Golay/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.BinaryGolay.finrank_code : Module.finrank (ZMod 2) ↥TauCeti.BinaryGolay.code = 12"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"TauCeti.BinaryGolay.finrank_constructionALattice","end_line":66,"library":"tauceti","line":64,"location_key":"8c338e247b6b0e9f86e67996e6a9096a9e7fbe022733703335d42ddd71a5eae4","module":"TauCeti.LinearAlgebra.IntegralLattice.ConstructionA.Golay.Basic","note":"It gives rank 24 for the integral lattice built from the Golay code, a neighbouring fact about the same 24 coordinates.","pair_key":"cc88bbd9797534fa189881b9fe1c5a86ff5cf6e6db8094d3fd48b0136d62e425","path":"TauCeti/LinearAlgebra/IntegralLattice/ConstructionA/Golay/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.BinaryGolay.finrank_constructionALattice : Module.finrank ℤ ↥TauCeti.BinaryGolay.constructionALattice.carrier = 24"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"03d57ac5c63b0bb590b6ce4066c133bb78c6f5830e8c62524abd9b70d524879a","prominence":"central","quote":{"exact":"The powerful (24,12) Golay code used in deep space communications uses 24"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The powerful (24,12) Golay code used in deep space communications uses 24 dimensions.","segments":[{"text":"The powerful (24,12) Golay code used in deep space communications uses 24 dimensions."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"fb58df7eb3caaca3d156cd79d4c9fce98583fd4db2fb4fc1f89b8f781a0652f5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #7149a132","item":"In-text #7149a132","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f69fc6c5fdf58fe87a88d2c09ca258e30433c0ff48bdd7f683e229b5c24ad15b","prominence":"supporting","quote":{"exact":"For example, hexagon packing into the constraint of a rectangular box will"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"For example, hexagon packing into the constraint of a rectangular box will leave empty space at the corners.","segments":[{"text":"For example, hexagon packing into the constraint of a rectangular box will leave empty space at the corners."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"d9906a225947d3b434602bba746c3632f05f53ff15574fc58ed2467b0597ca42"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #ae575220","item":"In-text #ae575220","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"870a2f5ab5fa41dca5d910d3b4f038b4945e50cf9481a36801423b4916cd1bb9","prominence":"supporting","quote":{"exact":"As the dimensions get larger, the percentage of empty space grows smaller."},"quote_capped":false,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"As the dimensions get larger, the percentage of empty space grows smaller.","segments":[{"text":"As the dimensions get larger, the percentage of empty space grows smaller."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"0bcdc4cbbe57d762baaca5d52436a21b75fcd75082d41bd9ba0d3f0e77de0586"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #9921a6db","item":"In-text #9921a6db","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Combinatorics.Coding.HammingSpherePacking.hamming_sphere_packing_bound","library":"atlas","line":34,"location_key":"3555aef87a8f5e5199618fc0d707d1360123842528217bde022b3efbe728b8a8","module":"MathlibExt.Combinatorics.Coding.HammingSpherePacking","note":"The declaration bounds the size of a code by a counting argument on disjoint Hamming balls; it never asserts that those balls exhaust the ambient space in any dimension.","pair_key":"2aad1c947f3acb11e6a31a1a6c974ef7a0645d28bdb50e1befee26c5a8d9ccb6","path":"MathlibExt/Combinatorics/Coding/HammingSpherePacking.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Combinatorics.Coding.HammingSpherePacking.hamming_sphere_packing_bound {α : Type*} [Fintype α] [DecidableEq α] {n t : ℕ} (C : Finset (Fin n → α)) : 2 ≤ Fintype.card α → (∀ c₁ ∈ C, ∀ c₂ ∈ C, c₁ ≠ c₂ → 2 * t + 1 ≤ hammingDist c₁ c₂) → C.card * ∑ i ∈ Finset.range (t + 1), n.choose i * (Fintype.card α - 1) ^ i ≤ Fintype.card α ^ n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"af5a3d104d55f518524bf4002cab7a614acce6e53013052a1c2f4d815ce3e32d","prominence":"central","quote":{"exact":"But at certain dimensions, the packing uses all the space and these"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"But at certain dimensions, the packing uses all the space and these codes are the so-called \"perfect\" codes.","segments":[{"text":"But at certain dimensions, the packing uses all the space and these codes are the so-called \"perfect\" codes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"c6a211a900ad4d3832cf7bfad312bbde4b88f04a2a765436729f1d83c1c4a98c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #e902fa25","item":"In-text #e902fa25","kind":"theorem","locations":[{"challenge":"downgraded","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.BinaryGolay.parameters_punctureAt_code","end_line":64,"library":"tauceti","line":59,"location_key":"63bf7e72b9754e7f510260597171b4d3730baefc06700a7287df36bc3ee31502","module":"TauCeti.InformationTheory.Coding.Binary.Golay.Punctured","note":"It fixes the parameters the passage attributes to the binary Golay code, but it does not say that this code is perfect and it does not state the classification itself.","pair_key":"1e4d1a6142c7c61eb21354c3cb50f2730288fa18ccdcdffc86820706ddb17fdb","path":"TauCeti/InformationTheory/Coding/Binary/Golay/Punctured.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.BinaryGolay.parameters_punctureAt_code (i : Fin 24) : (Fintype.card ↑{i}ᶜ, Module.finrank (ZMod 2) ↥(TauCeti.punctureAt TauCeti.BinaryGolay.code i), (↑(TauCeti.punctureAt TauCeti.BinaryGolay.code i)).hammingMinDist) = (23, 12, 7)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.TernaryGolay.hammingMinDist_code","end_line":220,"library":"tauceti","line":210,"location_key":"04935929a15e6cfc7f4003f0742507ae200b26cc69708d48e0c829c6ba01f68f","module":"TauCeti.InformationTheory.Coding.TernaryGolay","note":"The library's ternary Golay code sits on twelve coordinates with minimum distance six, so it is the extended code and not the eleven-coordinate one the passage lists.","pair_key":"3e2eb85da0e3ddad694bc32156eecdf4a4d9106f560b1c956fbfced1ba5245e5","path":"TauCeti/InformationTheory/Coding/TernaryGolay.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.TernaryGolay.hammingMinDist_code : (↑TauCeti.TernaryGolay.code).hammingMinDist = 6"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Combinatorics.Coding.HammingSpherePacking.hamming_sphere_packing_bound","library":"atlas","line":34,"location_key":"5806ba0812f869954c675371baddfcbd2ed6260b06bfa62be58969765d736b51","module":"MathlibExt.Combinatorics.Coding.HammingSpherePacking","note":"It bounds the size of a block code, while the passage enumerates which codes attain that bound.","pair_key":"03a4c2de0068247e11299da520eb1f085150147463258a0636a8f3260d1340fe","path":"MathlibExt/Combinatorics/Coding/HammingSpherePacking.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Combinatorics.Coding.HammingSpherePacking.hamming_sphere_packing_bound {α : Type*} [Fintype α] [DecidableEq α] {n t : ℕ} (C : Finset (Fin n → α)) : 2 ≤ Fintype.card α → (∀ c₁ ∈ C, ∀ c₂ ∈ C, c₁ ≠ c₂ → 2 * t + 1 ≤ hammingDist c₁ c₂) → C.card * ∑ i ∈ Finset.range (t + 1), n.choose i * (Fintype.card α - 1) ^ i ≤ Fintype.card α ^ n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d8e48b50ca31bf49bcf12131d60b4082fcaac1d5e4a7592d1576231f8680022c","prominence":"central","quote":{"exact":"The only nontrivial and useful perfect codes are the distance-3 Hamming codes"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The only nontrivial and useful perfect codes are the distance-3 Hamming codes with parameters satisfying (2r – 1, 2r – 1 – r, 3), and the [23,12,7] binary and [11,6,5] ternary Golay codes.","segments":[{"text":"The only nontrivial and useful perfect codes are the distance-3 Hamming codes with parameters satisfying (2r – 1, 2r – 1 – r, 3), and the [23,12,7] binary and [11,6,5] ternary Golay codes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"3e51585a06e384031f86b779119d24b9c702f1af7a5c3497f1e7a15dfba85ded"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #e331518d","item":"In-text #e331518d","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.IntegralLattice.kissingNumber","end_line":199,"library":"tauceti","line":198,"location_key":"0b47cc46e9f19786c3fc3a717e4d3936f063b010caae5befbb030778564aa930","module":"TauCeti.LinearAlgebra.IntegralLattice.PosDef.Minimum","note":"The library counts minimal vectors of an integral lattice in a rational quadratic space, an invariant of lattices rather than a property attached to a code word of a block code.","pair_key":"96754a4b827634624a1f2062b4577f76475dbd6c1464db8d860b0be70c0aef73","path":"TauCeti/LinearAlgebra/IntegralLattice/PosDef/Minimum.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.IntegralLattice.kissingNumber {V : Type u} [AddCommGroup V] [_root_.Module ℚ V] : TauCeti.IntegralLattice V → ℕ"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"533a6406f73bf3962a09783d3a78d7828125c006d20d823587006cd2097e0c62","prominence":"central","quote":{"exact":"Another code property is the number of neighbors that a single codeword"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Another code property is the number of neighbors that a single codeword may have.[6]","segments":[{"text":"Another code property is the number of neighbors that a single codeword may have."},{"ref":"[6]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"cdd3439b1ca40ee7a7c8a7df224ac69955b2bd0eead45a381d9f12edb2f786b2"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #c04fe5d7","item":"In-text #c04fe5d7","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d111c5e04affb23b209155e4bdb5283f99f555dad7212b42000fe302085e9817","prominence":"supporting","quote":{"exact":"Each penny will have 4 near neighbors (and 4 at the corners"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Each penny will have 4 near neighbors (and 4 at the corners which are farther away).","segments":[{"text":"Each penny will have 4 near neighbors (and 4 at the corners which are farther away)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"32f8e0e9692a0cb799e415d38a4bde8627779fa187a7846645d478a620efaa79"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #9977d371","item":"In-text #9977d371","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.IntegralLattice.typeARootLattice","end_line":107,"library":"tauceti","line":106,"location_key":"87b266fdcdbb8c82ad93f947b429cf472afabc38fa45cda7f93fc8acaa2edebd","module":"TauCeti.LinearAlgebra.IntegralLattice.RootLattice.TypeA.Basic","note":"At the parameter two this is the lattice underlying the hexagonal arrangement, but the declaration only builds the lattice and counts none of its nearest neighbours.","pair_key":"0bfb42d118e46c3081a2b6c3a4e0bbeea6b7ae78a51448dc45755fa254fa991b","path":"TauCeti/LinearAlgebra/IntegralLattice/RootLattice/TypeA/Basic.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.IntegralLattice.typeARootLattice (n : ℕ) : TauCeti.IntegralLattice (Fin n → ℚ)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"97463d918bdb33859dc6b29546de268b9ffd733fea91f7511fd73385f03e5263","prominence":"supporting","quote":{"exact":"In a hexagon, each penny will have 6 near neighbors."},"quote_capped":false,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"In a hexagon, each penny will have 6 near neighbors.","segments":[{"text":"In a hexagon, each penny will have 6 near neighbors."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"1092a35b63df34d3b5ffa28bb50e82f7665becb1f0aa9404dbc14e914e7728cf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #b1ded028","item":"In-text #b1ded028","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cdd70defdae2ae11194e20ac6d2654871298f9e987d2f871160fde8104ce235f","prominence":"supporting","quote":{"exact":"When we increase the dimensions, the number of near neighbors increases very"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"When we increase the dimensions, the number of near neighbors increases very rapidly.","segments":[{"text":"When we increase the dimensions, the number of near neighbors increases very rapidly."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #790484ac","item":"In-text #790484ac","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"244410891e38328d2547d884e7d8e3760d6901dc04a719ec5ad01d017bd93f66","prominence":"supporting","quote":{"exact":"The result is the number of ways for noise to make the"},"quote_capped":true,"section":["Channel coding","Linear codes","Linear block codes"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The result is the number of ways for noise to make the receiver choose a neighbor (hence an error) grows as well.","segments":[{"text":"The result is the number of ways for noise to make the receiver choose a neighbor (hence an error) grows as well."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"eb413d19a20ae707a7972f6e40c24a98413a09d9b7623b10dea3ebbc95b28942"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #7b8259e1","item":"In-text #7b8259e1","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.LinearCode.IsGeneratorMatrix.vecMul_encodingEquiv_symm_apply","end_line":404,"library":"tauceti","line":401,"location_key":"2e7474dde992b63c53f35a6d7abeaa6df922104ce336c37ab388f7309250baf1","module":"TauCeti.InformationTheory.Coding.Matrix","note":"The declaration encodes a message of fixed finite length by multiplying it into a generator matrix, so its code words are blocks rather than the running output of an encoder with memory.","pair_key":"6ce57b3e58dcee0a7babeba17945211aa688d23260bb1bce81b492d05d94e5cf","path":"TauCeti/InformationTheory/Coding/Matrix.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.LinearCode.IsGeneratorMatrix.vecMul_encodingEquiv_symm_apply {F : Type*} {ι : Type*} {ρ : Type*} [Field F] [Fintype ρ] {C : TauCeti.LinearCode F ι} {G : Matrix ρ ι F} (hG : C.IsGeneratorMatrix G) (hli : LinearIndependent F G.row) (x : ↥C) : Matrix.vecMul ((hG.encodingEquiv hli).symm x) G = ↑x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"12e4be6ecdddcd0d286f1f3ce786555b52d60770acf9c4b95d902201f1507b38","prominence":"central","quote":{"exact":"The idea behind a convolutional code is to make every codeword symbol"},"quote_capped":true,"section":["Channel coding","Linear codes","Convolutional codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The idea behind a convolutional code is to make every codeword symbol be the weighted sum of the various input message symbols.","segments":[{"text":"The idea behind a convolutional code is to make every codeword symbol be the weighted sum of the various input message symbols."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"86bb321bf36885f1439ad6e9f9cd0eae1d753a38b103918d2711ccfa6ee73dee"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #7a618aa6","item":"In-text #7a618aa6","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c62ef2c67bc61b1542f2d48bf1a7117c179b6b6a4c2339689d918fdf52190fa9","prominence":"central","quote":{"exact":"The Viterbi algorithm is the optimum algorithm used to decode convolutional codes."},"quote_capped":false,"section":["Channel coding","Linear codes","Convolutional codes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"The Viterbi algorithm is the optimum algorithm used to decode convolutional codes.","segments":[{"text":"The Viterbi algorithm is the optimum algorithm used to decode convolutional codes."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"71f90fd0f4113262a8ae689dc9bec6e385e6245f5cb45cc6a183e35e233f10ec"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #4fbd20dc","item":"In-text #4fbd20dc","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"53f7c7488f6a6ffc5d31ad2fad74e78ef31b0026ada203132510ff5724716b14","prominence":"supporting","quote":{"exact":"These schemes are therefore termed computationally secure"},"quote_capped":false,"section":["Cryptographic coding"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"after":{"layer":"; theoretical advances, e.g., improvements in integer factorization algorithms, and faster computing technology require these solutions to be continually adapted.","segments":[{"text":"; theoretical advances, e.g., improvements in integer factorization algorithms, and faster computing technology require these solutions to be continually adapted."}]},"layer":"These schemes are therefore termed computationally secure","segments":[{"text":"These schemes are therefore termed computationally secure"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"f065951d0856587426652609861464bb09fa6fb83f9972058e6caf29868daf32"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #77eda250","item":"In-text #77eda250","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"674d2e8e4f1cf2142b15f79870276c7de4a5e0ace7f61ae6a7430700fca448b6","prominence":"central","quote":{"exact":"There exist information-theoretically secure schemes that provably cannot be broken even with"},"quote_capped":true,"section":["Cryptographic coding"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"There exist information-theoretically secure schemes that provably cannot be broken even with unlimited computing power—an example is the one-time pad—but these schemes are more difficult to implement than the best theoretically breakable but computationally secure mechanisms.","segments":[{"text":"There exist information-theoretically secure schemes that provably cannot be broken even with unlimited computing power—an example is the one-time pad—but these schemes are more difficult to implement than the best theoretically breakable but computationally secure mechanisms."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"96d0995a98a62669122e21463248e696966d109cdd406dcc1d47f6378b8d6d23"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-321869-1374936394::In-text #9b7bbf74","item":"In-text #9b7bbf74","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8689c03eb66ec64d6eb3497c9eb1ace8c553daf9d5c9b07380c9edc1430665ed","prominence":"central","quote":{"exact":"Consider a large group of items in which a very few are"},"quote_capped":true,"section":["Other applications of coding theory","Group testing"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","text":{"layer":"Consider a large group of items in which a very few are different in a particular way (e.g., defective products or infected test subjects). The idea of group testing is to determine which items are \"different\" by using as few tests as possible.","segments":[{"text":"Consider a large group of items in which a very few are different in a particular way (e.g., defective products or infected test subjects). The idea of group testing is to determine which items are \"different\" by using as few tests as possible."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":152632,"images":[{"author":"Dsmurat, penubag","file":"Ambox_important.svg","licence":"Public domain","licence_url":null,"project":"en"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"https://phabricator.wikimedia.org/diffusion/GOJU/browse/master/AUTHORS.txt","file":"OOjs_UI_icon_edit-ltr-progressive.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"Original: Unknown Vector: [[:User:|Vectorized by User:Booyabazooka from original small PD raster image Telecom-icon.jpg]]","file":"Telecom-icon.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Josiedraus","file":"Two-dimensional_visualization_of_Hamming_distance.jpg","licence":"Public domain","licence_url":null,"project":"commons"}],"marks":121,"passages":35,"sha256":"88895776e79b1cadc7a720869bea8092a3f444c3bc9496a1a6fe014f08abd4c5","unplaced":["enwiki-321869-1374936394::In-text #790484ac"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"2da1cfeb4a9b11ba4a2d5de990e150ad7968e85b42bf0f8360150d19095c007b","revision":1374936394,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","renderer":"web-html/3"},"source_id":"enwiki-321869-1374936394","summary":{"by_library":{"atlas":{"complete":5,"incomplete":0,"locations":5,"passages":5,"related":2},"formal-conjectures":{"complete":2,"incomplete":0,"locations":2,"passages":1,"related":0},"lean-core":{"complete":6,"incomplete":0,"locations":6,"passages":6,"related":1},"mathlib":{"complete":4,"incomplete":0,"locations":4,"passages":4,"related":1},"tauceti":{"complete":5,"incomplete":0,"locations":5,"passages":4,"related":6}},"by_prominence":{"central":{"by_status":{"formalized":5,"not_formalized":12,"partial":4,"statement_only":0,"unresolved":0},"passages":21},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":0},"supporting":{"by_status":{"formalized":3,"not_formalized":9,"partial":2,"statement_only":0,"unresolved":1},"passages":15}},"by_proof_status":{"definition":18,"proved":14},"by_relation":{"broadMatch":6,"closeMatch":7,"hasPart":3,"narrowMatch":6,"relatedMatch":10},"by_status":{"formalized":8,"not_formalized":21,"partial":6,"statement_only":0,"unresolved":1},"locations":22,"passages":36,"related":10},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Coding theory","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q602136"}
