{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #2c3fc535","passage_key":"61206b17fc0ce40b83abf9a23f925c74ef2e7d5ccf69a69c839b889f70945a84","prominence":"central","receipt":{"candidates":5,"queries":5,"sha256":"b3887596a2a3e275fc013804584764c10c5446f6c887bd4c25d7243c73b7bc29"},"section":["History of coding theory"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #2c3fc535","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[3467,3583],"span_sha256":"64abe9ca61e93df429d57eb69cc237f05e111bfd5c3da94afcdc8058906e1c8b"}},"location":{"quote":{"exact":"It is an error-correcting code capable of correcting up to three errors"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #ad758efc","passage_key":"08f9852119db5fb8737bc705f7e02ac6ee7f101828963b5131746bfd9e6aaad4","prominence":"central","receipt":{"candidates":4,"queries":4,"sha256":"3a1713d84519e3017d08db26f64cb1dda0120e3f8978fef09d2987a3bbbdac73"},"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #ad758efc","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[4237,4451],"span_sha256":"72f03162733d4195b0e2df6f00b1b395936cb229c3f20aec7a52f72084cba44c"}},"location":{"quote":{"exact":"Data can be seen as a random variable X : Ω →"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #f1fc89ed","location_key":"43bb80cc3daf7bef67d40961e30e503a5fa227dc8f10624e5d143e37eca12aef","pair_key":"d078b1b47e35692b3bf1746732b4c35aa0c81519ec45dafc11c54bbd10417091","passage_key":"dc00c82e414caafa4c9ef5b3642ae2bb8e81c3f52b84dcd82d13d5f130b6b0e8","prominence":"supporting","rank":1,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #f1fc89ed","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":3123,"library":"lean-core","line":3116,"path":"src/Init/Prelude.lean","proof_status":"definition"}},"location":{"declaration":"List","module":"Init.Prelude"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[4452,4532],"span_sha256":"8ee6228eefa262934625b6b72462fc36c153797b4d328de0cae6bc0cdbdc7034"}},"location":{"quote":{"exact":"Data are encoded by strings (words) over an alphabet Σ {\\displaystyle \\Sigma"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #f1fc89ed","location_key":"3a59e568af4a11f7914e7e4326df7da440b9f1813c66100ccce8bb4162f1170e","pair_key":"65fe9877199ffe8867e8488f322c2bc26c645ab5defe3384188e41db45dfbb8a","passage_key":"dc00c82e414caafa4c9ef5b3642ae2bb8e81c3f52b84dcd82d13d5f130b6b0e8","prominence":"supporting","rank":2,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #f1fc89ed","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":65,"library":"mathlib","line":65,"path":"Mathlib/Algebra/FreeMonoid/Basic.lean","proof_status":"definition"}},"location":{"declaration":"FreeMonoid","module":"Mathlib.Algebra.FreeMonoid.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[4452,4532],"span_sha256":"8ee6228eefa262934625b6b72462fc36c153797b4d328de0cae6bc0cdbdc7034"}},"location":{"quote":{"exact":"Data are encoded by strings (words) over an alphabet Σ {\\displaystyle \\Sigma"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #310dc570","passage_key":"abe60492aea3be71964d0e009196e5a3993722410dbe8927ed059580ac9c370d","prominence":"central","receipt":{"candidates":4,"queries":4,"sha256":"5efb328cd7873ec8dd1e829fe0bdb4544b19cfe4c86c8fa1b274b9fad6472caf"},"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #310dc570","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[4554,4699],"span_sha256":"2c12962dbfcca8acef8269478b200621b174f658b00d37e7638c8dab158d015c"}},"location":{"quote":{"exact":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} (or"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #c3db39dc","passage_key":"60c1756075ca3a9062c01435be74ab1df5dc5d661c9c2c36b87148e5843ca917","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"e9f449d7c9a814467e65f72f68981c00cea1e4f9dd3ea36bc2e8935ef18d2afd"},"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #c3db39dc","kind":"notation","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[4700,4783],"span_sha256":"efac7adb07afe71dd591c39001571893b6e282e6665ee1791e747371c69330dc"}},"location":{"quote":{"exact":"C ( x ) {\\displaystyle C(x)} is the code word associated with"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #e060dac0","location_key":"95ce4b53687fd2c8db92670be7003b0aa6e36af452651018e391df66f61a4f80","pair_key":"ede2c949f107750e546b8548039ee04f38f56311d93a63e52e479a4389f0378c","passage_key":"e29351200b730f75b4016f01ccb640b4edd470b7f0e23c7e0ed226dade161859","prominence":"supporting","rank":1,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e060dac0","kind":"notation","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":3203,"library":"lean-core","line":3201,"path":"src/Init/Prelude.lean","proof_status":"definition"}},"location":{"declaration":"List.length","module":"Init.Prelude"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[4784,4862],"span_sha256":"4644a47873339fe236b4f505e5a211440a2127340a567b6a67821b435ef2059c"}},"location":{"quote":{"exact":"Length of the code word is written as l ( C ("}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #e09ee56c","passage_key":"b59cbe6766c1e5895837e5f5614ab03262d2742792043645159adcd765d0c2ce","prominence":"central","receipt":{"candidates":4,"queries":4,"sha256":"7858f4f9b14dfb02848a4f63fa038d0ef89af57b703842caf810b69dd1ddcd68"},"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e09ee56c","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[4863,5011],"span_sha256":"755332539304cd518919004368e2feecf649e617535822d0d94c5fc83f85bf55"}},"location":{"quote":{"exact":"Expected length of a code is l ( C ) = ∑"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #30965e9b","location_key":"6b4e8d402e199f5bbfa5b58660f0eded099a2ace0fac51a9e0b8e5ec46dbb942","pair_key":"62735fe804d2a1d66fb44cb551880eb6001462dec1a286e938246e123032dfe1","passage_key":"422e85f7e2820dfb828a4c308281fc610d56577f4b978e817bdc4c73f03257a8","prominence":"supporting","rank":1,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #30965e9b","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":3332,"library":"lean-core","line":3332,"path":"src/Init/Prelude.lean","proof_status":"definition"}},"location":{"declaration":"List.flatMap","module":"Init.Prelude"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5012,5170],"span_sha256":"9f03a778e2e5f5114ee79e0c1eb8b0d4defdd23adfafb83aa56f649f2e280809"}},"location":{"quote":{"exact":"The concatenation of code words C ( x 1 , … ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #30965e9b","location_key":"39408bf2417d36fe6ec1f88e62560c456cde611a2336195d402f26c72d77f3d1","pair_key":"603809cf09b4d79a7fb6bdbe0e77ee5fdd74844b9e21f9c4aab7ce1d977ab6f1","passage_key":"422e85f7e2820dfb828a4c308281fc610d56577f4b978e817bdc4c73f03257a8","prominence":"supporting","rank":2,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #30965e9b","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":314,"library":"mathlib","line":309,"path":"Mathlib/Algebra/FreeMonoid/Basic.lean","proof_status":"definition"}},"location":{"declaration":"FreeMonoid.lift","module":"Mathlib.Algebra.FreeMonoid.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5012,5170],"span_sha256":"9f03a778e2e5f5114ee79e0c1eb8b0d4defdd23adfafb83aa56f649f2e280809"}},"location":{"quote":{"exact":"The concatenation of code words C ( x 1 , … ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #30965e9b","location_key":"a1b39321b1c28bf6302e08d32ec237970d07cadce4afbcc50b96bcce25f3ceae","pair_key":"415f58633b67954305ae2dd9aa4626521ff8138db6d93e47b52be674f7ddf263","passage_key":"422e85f7e2820dfb828a4c308281fc610d56577f4b978e817bdc4c73f03257a8","prominence":"supporting","rank":3,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #30965e9b","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":344,"path":"CSLibExt/Algorithms/Lean/Greedy/Huffman.lean","proof_status":"proved"}},"location":{"declaration":"Cslib.Algorithms.Lean.HuffmanTree.encode_codeOfLeaf","module":"CSLibExt.Algorithms.Lean.Greedy.Huffman"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"narrowMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5012,5170],"span_sha256":"9f03a778e2e5f5114ee79e0c1eb8b0d4defdd23adfafb83aa56f649f2e280809"}},"location":{"quote":{"exact":"The concatenation of code words C ( x 1 , … ,"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #05f527be","location_key":"6fd34a901a2147bc5b59a7c7da2a315550643c2c87dd98b173ecc0236c846f8c","pair_key":"f4bbddb045eef2ef07e9382111bfb659f42b566d21b5e4d9eda604a0659a8eeb","passage_key":"7bdbd5cd111ca4c7af6823fa8451f91630a076859611e36f3869f015ba16942f","prominence":"supporting","rank":1,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #05f527be","kind":"definition","note":"Lean core states the equation for any map from symbols to words, with the empty source string written as the empty list.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":679,"library":"lean-core","line":679,"path":"src/Init/Data/List/Basic.lean","proof_status":"proved"}},"location":{"declaration":"List.flatMap_nil","module":"Init.Data.List.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"broadMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5171,5283],"span_sha256":"3322fd68a7bae9982f2d65a248af5099ad931aa3ebb72940fb25910e6abce17e"}},"location":{"quote":{"exact":"The code word of the empty string is the empty string itself:"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"low","item":"In-text #05f527be","location_key":"223ae144c7467cb86f063ea305a306c4914e6318a8d50479dd9dc7f2314ae410","pair_key":"1b0b3b3bda978aebc4f281d8ac1ce973ab0aeb312c49daa6223597027cf929fd","passage_key":"7bdbd5cd111ca4c7af6823fa8451f91630a076859611e36f3869f015ba16942f","prominence":"supporting","rank":2,"section":["Source coding","Definition"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #05f527be","kind":"definition","note":"Lean core states that concatenating no words at all gives the empty word, without mentioning a code.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":662,"library":"lean-core","line":662,"path":"src/Init/Data/List/Basic.lean","proof_status":"proved"}},"location":{"declaration":"List.flatten_nil","module":"Init.Data.List.Basic"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"relatedMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5171,5283],"span_sha256":"3322fd68a7bae9982f2d65a248af5099ad931aa3ebb72940fb25910e6abce17e"}},"location":{"quote":{"exact":"The code word of the empty string is the empty string itself:"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #5b440168","location_key":"444a90aad5e8e3bda4409b9a4aa54c1334c099636b51ff05365946a509f9a74e","pair_key":"1bced5ffd38a6d17a2864a7a96d820e41b97f6a3d3d76e2d2da4b2dfc39be92f","passage_key":"cd2bb874bae448e4c1f4488aa7ff1da74102ae5e5d8d2146a82cb945c85c4f72","prominence":"central","rank":1,"section":["Source coding","Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #5b440168","kind":"definition","note":"Lean core fixes the notion for a function between arbitrary sorts, under the name injective rather than non-singular.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":54,"library":"lean-core","line":53,"path":"src/Init/Data/Function.lean","proof_status":"definition","statement":true}},"location":{"declaration":"Function.Injective","module":"Init.Data.Function"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5295,5384],"span_sha256":"db72b379c2a82405d05a5323d3cdc71de06c3c8e4083575b126724441c64a4cd"}},"location":{"quote":{"exact":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} is","prefix":"s "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #9dd58375","location_key":"061f865cb3c026587f4b3537b759b841153f9a4f7c641f6bf8843827d03c1f61","pair_key":"5a29a387d97aa5abf214af3396d7b438b9ce6eacd0311ff5a796c504a97e684e","passage_key":"dc0a389b259fd69bfde521692c844cbe802764a7a0ea8a512eaab97556a79ba6","prominence":"central","rank":1,"section":["Source coding","Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #9dd58375","kind":"definition","note":"Lean core fixes the notion for a map between arbitrary sorts, under the name injective.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":54,"library":"lean-core","line":53,"path":"src/Init/Data/Function.lean","proof_status":"definition","statement":true}},"location":{"declaration":"Function.Injective","module":"Init.Data.Function"},"role":"key","type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5385,5486],"span_sha256":"264872369209b73be43241caa5323b15b7cb5e71440d7f7ae7323dda3b5846a9"}},"location":{"quote":{"exact":"C : X ∗ → Σ ∗ {\\displaystyle C:{\\mathcal {X}}^{*}\\to \\Sigma ^{*}}"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #9dd58375","location_key":"5cb8ebd4fa699e103442c7bf9e11878ffbd151aade9871b768a7633a9bcbbd1b","pair_key":"18389ee8ef41992f3f4f66873356a726e51127dcb36f006e337bd48fc551ce28","passage_key":"dc0a389b259fd69bfde521692c844cbe802764a7a0ea8a512eaab97556a79ba6","prominence":"central","rank":2,"section":["Source coding","Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #9dd58375","kind":"definition","note":"Mathlib carries the code by the set of its code words and asks that distinct sequences of those words concatenate to distinct strings.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":42,"library":"mathlib","line":39,"path":"Mathlib/InformationTheory/Coding/UniquelyDecodable.lean","proof_status":"definition","statement":true}},"location":{"declaration":"InformationTheory.IsUniquelyDecodable","module":"Mathlib.InformationTheory.Coding.UniquelyDecodable"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5385,5486],"span_sha256":"264872369209b73be43241caa5323b15b7cb5e71440d7f7ae7323dda3b5846a9"}},"location":{"quote":{"exact":"C : X ∗ → Σ ∗ {\\displaystyle C:{\\mathcal {X}}^{*}\\to \\Sigma ^{*}}"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #91ec1820","location_key":"2d96c6f553cd037d8061c977a1a5984d723d866e86d839ef146f6f8ba2987c63","pair_key":"0e6994fb8a946bd6ff1b06beaf49d6b68a26d8b2448a17dfec394c083d2686e7","passage_key":"dc75ffb15729cf13617bf49fb5978095256896e6c204965f563a953745057983","prominence":"central","rank":1,"section":["Source coding","Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #91ec1820","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":20,"path":"MathlibExt/InformationTheory/PrefixFree.lean","proof_status":"definition","statement":true}},"location":{"declaration":"MathlibExt.InformationTheory.IsPrefixFree","module":"MathlibExt.InformationTheory.PrefixFree"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5487,5680],"span_sha256":"947067aa62a634063257f8a05305e40e559d847352f83c578ff36786ddeeffda"}},"location":{"quote":{"exact":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} is","prefix":". "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #91ec1820","location_key":"9dd57b787f592de393b2c334af818717f7a2ccb33b4a5d982bbefdf7b4ce0a72","pair_key":"aebcbb5057d2e6b5fd805ea8177b5416fa9aaf8a9b7d3fcea74c768ab5b0288a","passage_key":"dc75ffb15729cf13617bf49fb5978095256896e6c204965f563a953745057983","prominence":"central","rank":2,"section":["Source coding","Properties"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #91ec1820","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":37,"library":"mathlib","line":36,"path":"Mathlib/InformationTheory/Coding/PrefixFree.lean","proof_status":"definition","statement":true}},"location":{"declaration":"InformationTheory.IsPrefixFree","module":"Mathlib.InformationTheory.Coding.PrefixFree"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5487,5680],"span_sha256":"947067aa62a634063257f8a05305e40e559d847352f83c578ff36786ddeeffda"}},"location":{"quote":{"exact":"C : X → Σ ∗ {\\displaystyle C:{\\mathcal {X}}\\to \\Sigma ^{*}} is","prefix":". "}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #a5a066ef","location_key":"100d69629a7505bbb2c620e6164b17a1a2726529e527f5d5710982dec9112f01","pair_key":"22af97383eda56fb397d5955b2cf71688a548808c42b683366cda6bc8f54db26","passage_key":"636b62eeb3c02b187584f3157592199fde51072e36fc78f5e0443d8f4eb4cf02","prominence":"central","rank":1,"section":["Source coding","Principle"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #a5a066ef","kind":"definition","note":"The declaration fixes a finite value alphabet and base-two logarithms, and gives zero weight to values of probability zero.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":67,"library":"formal-conjectures","line":65,"path":"FormalConjecturesForMathlib/InformationTheory/FiniteEntropy.lean","proof_status":"definition"}},"location":{"declaration":"InformationTheory.shannonEntropyBits","module":"FormalConjecturesForMathlib.InformationTheory.FiniteEntropy"},"role":"key","type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5691,5741],"span_sha256":"a4b9501ce585fdd8b7dc87ba917960e2ded623d62564bde1fbab3793807f7f12"}},"location":{"quote":{"exact":"Entropy of a source is the measure of information."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"low","item":"In-text #a5a066ef","location_key":"6cf56fceb6981a747992cc6bec3c74087819dc6752758942618ff4720531e907","pair_key":"8ab4a7c1dffe12717fb360b017815bd25142e7a8359897a57a28d0bcab590ec2","passage_key":"636b62eeb3c02b187584f3157592199fde51072e36fc78f5e0443d8f4eb4cf02","prominence":"central","rank":2,"section":["Source coding","Principle"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #a5a066ef","kind":"definition","note":"The declaration takes the distribution itself as argument and measures entropy in bits over a finite type.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":107,"library":"formal-conjectures","line":106,"path":"FormalConjectures/Paper/CourtadeKumar.lean","proof_status":"definition"}},"location":{"declaration":"CourtadeKumar.entropy","module":"FormalConjectures.Paper.CourtadeKumar"},"role":"key","type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5691,5741],"span_sha256":"a4b9501ce585fdd8b7dc87ba917960e2ded623d62564bde1fbab3793807f7f12"}},"location":{"quote":{"exact":"Entropy of a source is the measure of information."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #a752a889","passage_key":"1cb483953d7b719032ec6a9ce2dea700b264791d6ec804c787cca8cb3facf1a7","prominence":"central","receipt":{"candidates":2,"queries":4,"sha256":"f43b697def6010efe864414fe47f91a567f45e03b12198d377e6ff322ccb0d5e"},"section":["Source coding","Principle"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #a752a889","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[5888,6050],"span_sha256":"7efeca4608d8cc22201a535d1085146ed6e3082f7cf00f4dd72906b379e7587c"}},"location":{"quote":{"exact":"Data compression which explicitly tries to minimize the average length of messages"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #5a0714d9","location_key":"81c98f8a4f61d55747cece2a823c8da131da49f8c3cb8bc2adc35d247c0d6e2b","pair_key":"0700daed7d45f44fc8fc6731ccda9406365f4c0b8490adafc41b49c28410b8c3","passage_key":"72b2bd7e266128cf864a188a49dce815a367858c54c63cacb5c066bacec0a456","prominence":"central","rank":1,"section":["Source coding","Principle"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #5a0714d9","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":150,"path":"MathlibExt/InformationTheory/ShannonSourceCoding.lean","proof_status":"proved"}},"location":{"declaration":"MathlibExt.InformationTheory.ShannonSourceCodingWanted.shannon_source_coding_lower_bound","module":"MathlibExt.InformationTheory.ShannonSourceCoding"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[6151,6249],"span_sha256":"877cbc12f5f30b09ae40f9fd867a70ae8e69f0238f64dc5ab5362bdc2f7ee3ff"}},"location":{"quote":{"exact":"C(x) ≥ H(x), where H(x) is entropy of source (bitrate), and C(x)"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #26c471f9","location_key":"ebe2116eae3b8e72253873112cf84a0230784be747378c80d6af68929f54bd03","pair_key":"875bd37b6ffc10f5e45306af07e87f2b50811608b42d634e53a1f2702641c0f6","passage_key":"be1d47e15040ae24aff3f265d21c84cb0eb60a067d0317441f61d97532be2ed2","prominence":"central","rank":1,"section":["Source coding","Principle"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #26c471f9","kind":"theorem","note":"Atlas covers the coding schemes given by uniquely decodable injective codes on finite alphabets, with entropy in units set by the code alphabet.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":150,"path":"MathlibExt/InformationTheory/ShannonSourceCoding.lean","proof_status":"proved"}},"location":{"declaration":"MathlibExt.InformationTheory.ShannonSourceCodingWanted.shannon_source_coding_lower_bound","module":"MathlibExt.InformationTheory.ShannonSourceCoding"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[6250,6334],"span_sha256":"15028e12a4fc596f8cd44b3b9d777c87fe4c277c0163cedb329a6310c32e0942"}},"location":{"quote":{"exact":"In particular, no source coding scheme can be better than the entropy"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"high","item":"In-text #4ea3522c","location_key":"d312413fd2aea70bf9f906eaf1af8ca5c4cc552164eed87601bca25d88550861","pair_key":"5de63df5a9c98a7fcb0f4bf2e9ebe8ba32afadb288ab65865718e5ca081eea87","passage_key":"b3c80d9a9ffeec6cff63ebf23d9ee881453276ee0770c5782961b74422495c08","prominence":"central","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #4ea3522c","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":31,"library":"tauceti","line":31,"path":"TauCeti/InformationTheory/Coding/Basic.lean","proof_status":"definition"}},"location":{"declaration":"TauCeti.LinearCode","module":"TauCeti.InformationTheory.Coding.Basic"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[9215,9319],"span_sha256":"115d892ee4b9fc412f4adc3ccd30652aad26ea46045ec28e10d58dafaac91ac8"}},"location":{"quote":{"exact":"Linear block codes have the property of linearity, i.e. the sum of"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #4ea3522c","location_key":"507eeb51edcd6d3548fc1c9c5d2f6a3dd9ede35ad4aab1e9938b2d67086b89fa","pair_key":"0937a19b80c14be5d4a7ff110935187c109d4671a83247213df2b001e09a6dba","passage_key":"b3c80d9a9ffeec6cff63ebf23d9ee881453276ee0770c5782961b74422495c08","prominence":"central","rank":2,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #4ea3522c","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":210,"library":"mathlib","line":209,"path":"Mathlib/Algebra/Module/Submodule/Defs.lean","proof_status":"proved"}},"location":{"declaration":"Submodule.add_mem","module":"Mathlib.Algebra.Module.Submodule.Defs"},"role":"key","type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"}],"relation":"broadMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[9215,9319],"span_sha256":"115d892ee4b9fc412f4adc3ccd30652aad26ea46045ec28e10d58dafaac91ac8"}},"location":{"quote":{"exact":"Linear block codes have the property of linearity, i.e. the sum of"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #be2c3b61","passage_key":"5e3ea54b7b8217cf887d0af0222c7076729ca710fbebc09141b5200d87bea95f","prominence":"supporting","receipt":{"candidates":3,"queries":4,"sha256":"c3f5c99da6df131cd5a7bf67dc429d96ac089c6351ab82695249f6502d0afe05"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #be2c3b61","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[9407,9527],"span_sha256":"d6c06ebaa8cda5d437a06951f4cbcbb40d57f38106e0e766137d0eb429a16457"}},"location":{"quote":{"exact":"There are block codes that are not linear, but it is difficult"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #cc648cbd","location_key":"9e145ec650471e242062129c3a1fe096b5a996b8a0b5dd48e407a6bcb9937c83","pair_key":"c4f163f1989f2b7a105a190938c4e0f93d9260e13d5d2cb66ceb57ae70ea953c","passage_key":"13dd5514ddf0e8738904b0e556517cf9236f770f598aea61dd60088db182ece8","prominence":"central","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #cc648cbd","kind":"notation","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":64,"library":"tauceti","line":59,"path":"TauCeti/InformationTheory/Coding/Binary/Golay/Punctured.lean","proof_status":"proved"}},"location":{"declaration":"TauCeti.BinaryGolay.parameters_punctureAt_code","module":"TauCeti.InformationTheory.Coding.Binary.Golay.Punctured"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"narrowMatch","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[9531,9651],"span_sha256":"ed2414212efcb9933fc6eb80d7e807039061307e1638a0efbdccdc93ad6221a2"}},"location":{"quote":{"exact":"Linear block codes are summarized by their symbol alphabets (e.g., binary or"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"high","item":"In-text #edb9cb3c","location_key":"c4573ffdc11fb6a0dfa6ebd81fc625bb076b8ece9095d0886f57b08021268b73","pair_key":"aeb592cd99babed3718fa5e504624fd30738bab3c0016f6c5dc065bc37df912c","passage_key":"a5e7ee357638380617b4d8cfa3f9e5a7a92f0785525bbd2ccf3692b8f6d5999b","prominence":"supporting","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #edb9cb3c","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":46,"library":"tauceti","line":45,"path":"TauCeti/InformationTheory/Coding/MinimumDistance/Basic.lean","proof_status":"definition"}},"location":{"declaration":"Set.hammingMinDist","module":"TauCeti.InformationTheory.Coding.MinimumDistance.Basic"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[9652,9821],"span_sha256":"e7b4a7badbdaedb73fc63fc318929e0e0606508dda6700e05f9f547c64315695"}},"location":{"quote":{"exact":"n is the length of the codeword, in symbols, m is the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #edb9cb3c","location_key":"ae9074c37ad5e4e2ac82a508be39f0d5ab65ca307ac8bca1c60049fd629f0522","pair_key":"04d0b902d929187d027faf6c5c6a88254b62f495f84107f512b796fb7156f4bc","passage_key":"a5e7ee357638380617b4d8cfa3f9e5a7a92f0785525bbd2ccf3692b8f6d5999b","prominence":"supporting","rank":2,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #edb9cb3c","kind":"definition","note":"Its alphabet is pinned to the two-element field, where the passage leaves the symbol alphabet open.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":64,"path":"WantedExt/Combinatorics/GoodLTCodesWanted.lean","proof_status":"definition"}},"location":{"declaration":"MathlibExt.Combinatorics.GoodLTCodesWanted.GoodLTC.BinaryCode","module":"WantedExt.Combinatorics.GoodLTCodesWanted"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[9652,9821],"span_sha256":"e7b4a7badbdaedb73fc63fc318929e0e0606508dda6700e05f9f547c64315695"}},"location":{"quote":{"exact":"n is the length of the codeword, in symbols, m is the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","confidence":"medium","item":"In-text #edb9cb3c","location_key":"080ee92941de5e2b4a4a9700478ffb6d8a7d57c88b46239bc52c77e7c75706c6","pair_key":"0e285cd89b51f9aead82127d76c9869094cca52f2fa4d753b7169b4f3b4dce30","passage_key":"a5e7ee357638380617b4d8cfa3f9e5a7a92f0785525bbd2ccf3692b8f6d5999b","prominence":"supporting","rank":3,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #edb9cb3c","kind":"definition","note":"It assumes a chosen generator matrix whose rows are independent, a choice every linear block code admits.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":389,"library":"tauceti","line":387,"path":"TauCeti/InformationTheory/Coding/Matrix.lean","proof_status":"definition"}},"location":{"declaration":"TauCeti.LinearCode.IsGeneratorMatrix.encodingEquiv","module":"TauCeti.InformationTheory.Coding.Matrix"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"hasPart","status":"partial","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[9652,9821],"span_sha256":"e7b4a7badbdaedb73fc63fc318929e0e0606508dda6700e05f9f547c64315695"}},"location":{"quote":{"exact":"n is the length of the codeword, in symbols, m is the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #7b149b04","passage_key":"5368b1a80ff8d0d3f68c1a7de4a6b9f2eaf01f4c2e09fb3003a2c9b7aee3073c","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"d99bb6cbb86851224a1146b856a42db90d292559397138b4be17ad7b9841228f"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #7b149b04","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[10288,10338],"span_sha256":"ee815fd60e036c54ed4ea8f2556ce388dca25261d4989516d9ff5ea217b1f04a"}},"location":{"quote":{"exact":"The result is a hexagon pattern like a bee's nest."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #7dbe5b26","location_key":"303749c3a6d0267a0752e749c66dc06edef0c568c7aa863a5da92134e162fb44","pair_key":"e4374710e903b73487b527cc126e150f8eb1cc6d6057a25f4c71eb1e0aaeb2c5","passage_key":"03d57ac5c63b0bb590b6ce4066c133bb78c6f5830e8c62524abd9b70d524879a","prominence":"central","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #7dbe5b26","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":138,"library":"tauceti","line":136,"path":"TauCeti/InformationTheory/Coding/Binary/Golay/Basic.lean","proof_status":"proved"}},"location":{"declaration":"TauCeti.BinaryGolay.finrank_code","module":"TauCeti.InformationTheory.Coding.Binary.Golay.Basic"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"closeMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[10414,10499],"span_sha256":"2d7551455aa4281bc95d9cd46fd66d2ab9af7c596262746e1a74f590746fca6d"}},"location":{"quote":{"exact":"The powerful (24,12) Golay code used in deep space communications uses 24"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"low","item":"In-text #7dbe5b26","location_key":"8c338e247b6b0e9f86e67996e6a9096a9e7fbe022733703335d42ddd71a5eae4","pair_key":"cc88bbd9797534fa189881b9fe1c5a86ff5cf6e6db8094d3fd48b0136d62e425","passage_key":"03d57ac5c63b0bb590b6ce4066c133bb78c6f5830e8c62524abd9b70d524879a","prominence":"central","rank":2,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #7dbe5b26","kind":"theorem","note":"It gives rank 24 for the integral lattice built from the Golay code, a neighbouring fact about the same 24 coordinates.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":66,"library":"tauceti","line":64,"path":"TauCeti/LinearAlgebra/IntegralLattice/ConstructionA/Golay/Basic.lean","proof_status":"proved"}},"location":{"declaration":"TauCeti.BinaryGolay.finrank_constructionALattice","module":"TauCeti.LinearAlgebra.IntegralLattice.ConstructionA.Golay.Basic"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"relatedMatch","status":"formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[10414,10499],"span_sha256":"2d7551455aa4281bc95d9cd46fd66d2ab9af7c596262746e1a74f590746fca6d"}},"location":{"quote":{"exact":"The powerful (24,12) Golay code used in deep space communications uses 24"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #7149a132","passage_key":"f69fc6c5fdf58fe87a88d2c09ca258e30433c0ff48bdd7f683e229b5c24ad15b","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"fb58df7eb3caaca3d156cd79d4c9fce98583fd4db2fb4fc1f89b8f781a0652f5"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #7149a132","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[10861,10969],"span_sha256":"5b6ed9b896cd085193701a9b0c03a29b6d59f3dec8065dec19cab8f30b151ee8"}},"location":{"quote":{"exact":"For example, hexagon packing into the constraint of a rectangular box will"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #ae575220","passage_key":"870a2f5ab5fa41dca5d910d3b4f038b4945e50cf9481a36801423b4916cd1bb9","prominence":"supporting","receipt":{"candidates":3,"queries":3,"sha256":"d9906a225947d3b434602bba746c3632f05f53ff15574fc58ed2467b0597ca42"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #ae575220","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[10970,11044],"span_sha256":"ae57522030ac03a57e69a6ea963f2a3e41f43caf2a4fde7d145cbfc6248551fa"}},"location":{"quote":{"exact":"As the dimensions get larger, the percentage of empty space grows smaller."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #9921a6db","location_key":"3555aef87a8f5e5199618fc0d707d1360123842528217bde022b3efbe728b8a8","pair_key":"2aad1c947f3acb11e6a31a1a6c974ef7a0645d28bdb50e1befee26c5a8d9ccb6","passage_key":"af5a3d104d55f518524bf4002cab7a614acce6e53013052a1c2f4d815ce3e32d","prominence":"central","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #9921a6db","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":34,"path":"MathlibExt/Combinatorics/Coding/HammingSpherePacking.lean","proof_status":"proved"}},"location":{"declaration":"MathlibExt.Combinatorics.Coding.HammingSpherePacking.hamming_sphere_packing_bound","module":"MathlibExt.Combinatorics.Coding.HammingSpherePacking"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11045,11153],"span_sha256":"56a8f994303c45a574700a17fd88af402922b4c8174e67e746afb24027089412"}},"location":{"quote":{"exact":"But at certain dimensions, the packing uses all the space and these"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #9921a6db","passage_key":"af5a3d104d55f518524bf4002cab7a614acce6e53013052a1c2f4d815ce3e32d","prominence":"central","receipt":{"candidates":3,"queries":5,"sha256":"0bcdc4cbbe57d762baaca5d52436a21b75fcd75082d41bd9ba0d3f0e77de0586"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #9921a6db","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11045,11153],"span_sha256":"56a8f994303c45a574700a17fd88af402922b4c8174e67e746afb24027089412"}},"location":{"quote":{"exact":"But at certain dimensions, the packing uses all the space and these"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"downgraded","confidence":"medium","item":"In-text #e902fa25","location_key":"63bf7e72b9754e7f510260597171b4d3730baefc06700a7287df36bc3ee31502","pair_key":"1e4d1a6142c7c61eb21354c3cb50f2730288fa18ccdcdffc86820706ddb17fdb","passage_key":"d8e48b50ca31bf49bcf12131d60b4082fcaac1d5e4a7592d1576231f8680022c","prominence":"central","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e902fa25","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":64,"library":"tauceti","line":59,"path":"TauCeti/InformationTheory/Coding/Binary/Golay/Punctured.lean","proof_status":"proved"}},"location":{"declaration":"TauCeti.BinaryGolay.parameters_punctureAt_code","module":"TauCeti.InformationTheory.Coding.Binary.Golay.Punctured"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11154,11342],"span_sha256":"6873338021cfa2fac261cd7d7c78651a4234d715cc2e080957d3996efc013aa9"}},"location":{"quote":{"exact":"The only nontrivial and useful perfect codes are the distance-3 Hamming codes"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #e902fa25","location_key":"04935929a15e6cfc7f4003f0742507ae200b26cc69708d48e0c829c6ba01f68f","pair_key":"3e2eb85da0e3ddad694bc32156eecdf4a4d9106f560b1c956fbfced1ba5245e5","passage_key":"d8e48b50ca31bf49bcf12131d60b4082fcaac1d5e4a7592d1576231f8680022c","prominence":"central","rank":2,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e902fa25","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":220,"library":"tauceti","line":210,"path":"TauCeti/InformationTheory/Coding/TernaryGolay.lean","proof_status":"proved"}},"location":{"declaration":"TauCeti.TernaryGolay.hammingMinDist_code","module":"TauCeti.InformationTheory.Coding.TernaryGolay"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11154,11342],"span_sha256":"6873338021cfa2fac261cd7d7c78651a4234d715cc2e080957d3996efc013aa9"}},"location":{"quote":{"exact":"The only nontrivial and useful perfect codes are the distance-3 Hamming codes"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #e902fa25","location_key":"5806ba0812f869954c675371baddfcbd2ed6260b06bfa62be58969765d736b51","pair_key":"03a4c2de0068247e11299da520eb1f085150147463258a0636a8f3260d1340fe","passage_key":"d8e48b50ca31bf49bcf12131d60b4082fcaac1d5e4a7592d1576231f8680022c","prominence":"central","rank":3,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e902fa25","kind":"theorem","note":"It bounds the size of a block code, while the passage enumerates which codes attain that bound.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"library":"atlas","line":34,"path":"MathlibExt/Combinatorics/Coding/HammingSpherePacking.lean","proof_status":"proved"}},"location":{"declaration":"MathlibExt.Combinatorics.Coding.HammingSpherePacking.hamming_sphere_packing_bound","module":"MathlibExt.Combinatorics.Coding.HammingSpherePacking"},"role":"key","type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11154,11342],"span_sha256":"6873338021cfa2fac261cd7d7c78651a4234d715cc2e080957d3996efc013aa9"}},"location":{"quote":{"exact":"The only nontrivial and useful perfect codes are the distance-3 Hamming codes"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #e902fa25","passage_key":"d8e48b50ca31bf49bcf12131d60b4082fcaac1d5e4a7592d1576231f8680022c","prominence":"central","receipt":{"candidates":0,"queries":3,"sha256":"c6a211a900ad4d3832cf7bfad312bbde4b88f04a2a765436729f1d83c1c4a98c"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e902fa25","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11154,11342],"span_sha256":"6873338021cfa2fac261cd7d7c78651a4234d715cc2e080957d3996efc013aa9"}},"location":{"quote":{"exact":"The only nontrivial and useful perfect codes are the distance-3 Hamming codes"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #e331518d","location_key":"0b47cc46e9f19786c3fc3a717e4d3936f063b010caae5befbb030778564aa930","pair_key":"96754a4b827634624a1f2062b4577f76475dbd6c1464db8d860b0be70c0aef73","passage_key":"533a6406f73bf3962a09783d3a78d7828125c006d20d823587006cd2097e0c62","prominence":"central","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e331518d","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":199,"library":"tauceti","line":198,"path":"TauCeti/LinearAlgebra/IntegralLattice/PosDef/Minimum.lean","proof_status":"definition"}},"location":{"declaration":"TauCeti.IntegralLattice.kissingNumber","module":"TauCeti.LinearAlgebra.IntegralLattice.PosDef.Minimum"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11349,11433],"span_sha256":"29d79f7ad94c14713a9f2c5218001047d394fdb13e0777a6feca04681e2b485f"}},"location":{"quote":{"exact":"Another code property is the number of neighbors that a single codeword"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #e331518d","passage_key":"533a6406f73bf3962a09783d3a78d7828125c006d20d823587006cd2097e0c62","prominence":"central","receipt":{"candidates":2,"queries":3,"sha256":"3e51585a06e384031f86b779119d24b9c702f1af7a5c3497f1e7a15dfba85ded"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #e331518d","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11349,11433],"span_sha256":"29d79f7ad94c14713a9f2c5218001047d394fdb13e0777a6feca04681e2b485f"}},"location":{"quote":{"exact":"Another code property is the number of neighbors that a single codeword"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #c04fe5d7","passage_key":"d111c5e04affb23b209155e4bdb5283f99f555dad7212b42000fe302085e9817","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"cdd3439b1ca40ee7a7c8a7df224ac69955b2bd0eead45a381d9f12edb2f786b2"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #c04fe5d7","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11522,11606],"span_sha256":"ab71abe600ec8b40fd7c2c230767b479bdb9f6d0648208e68ba6f1f13fb4065b"}},"location":{"quote":{"exact":"Each penny will have 4 near neighbors (and 4 at the corners"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"medium","item":"In-text #9977d371","location_key":"87b266fdcdbb8c82ad93f947b429cf472afabc38fa45cda7f93fc8acaa2edebd","pair_key":"0bfb42d118e46c3081a2b6c3a4e0bbeea6b7ae78a51448dc45755fa254fa991b","passage_key":"97463d918bdb33859dc6b29546de268b9ffd733fea91f7511fd73385f03e5263","prominence":"supporting","rank":1,"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #9977d371","kind":"theorem","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":107,"library":"tauceti","line":106,"path":"TauCeti/LinearAlgebra/IntegralLattice/RootLattice/TypeA/Basic.lean","proof_status":"definition"}},"location":{"declaration":"TauCeti.IntegralLattice.typeARootLattice","module":"TauCeti.LinearAlgebra.IntegralLattice.RootLattice.TypeA.Basic"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11607,11659],"span_sha256":"28ece564639d431e4d695bb9bbc112f87e894ec07c933a4415e13974a05a95b6"}},"location":{"quote":{"exact":"In a hexagon, each penny will have 6 near neighbors."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #9977d371","passage_key":"97463d918bdb33859dc6b29546de268b9ffd733fea91f7511fd73385f03e5263","prominence":"supporting","receipt":{"candidates":2,"queries":4,"sha256":"32f8e0e9692a0cb799e415d38a4bde8627779fa187a7846645d478a620efaa79"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #9977d371","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11607,11659],"span_sha256":"28ece564639d431e4d695bb9bbc112f87e894ec07c933a4415e13974a05a95b6"}},"location":{"quote":{"exact":"In a hexagon, each penny will have 6 near neighbors."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #b1ded028","passage_key":"cdd70defdae2ae11194e20ac6d2654871298f9e987d2f871160fde8104ce235f","prominence":"supporting","receipt":{"candidates":2,"queries":3,"sha256":"1092a35b63df34d3b5ffa28bb50e82f7665becb1f0aa9404dbc14e914e7728cf"},"section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #b1ded028","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11660,11745],"span_sha256":"992bdd1a300cc721e1a5038dda624b92632131202aeb71e965b2af513d6a66e8"}},"location":{"quote":{"exact":"When we increase the dimensions, the number of near neighbors increases very"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"sampled_out","item":"In-text #790484ac","passage_key":"244410891e38328d2547d884e7d8e3760d6901dc04a719ec5ad01d017bd93f66","prominence":"supporting","section":["Channel coding","Linear codes","Linear block codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #790484ac","kind":"theorem","object":[],"subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[11746,11859],"span_sha256":"0712fb324af11424f5a3e849aead73acea9645c9b2965f4686811c91df50a1bd"}},"location":{"quote":{"exact":"The result is the number of ways for noise to make the"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","confidence":"high","item":"In-text #7b8259e1","location_key":"2e7474dde992b63c53f35a6d7abeaa6df922104ce336c37ab388f7309250baf1","pair_key":"6ce57b3e58dcee0a7babeba17945211aa688d23260bb1bce81b492d05d94e5cf","passage_key":"12e4be6ecdddcd0d286f1f3ce786555b52d60770acf9c4b95d902201f1507b38","prominence":"central","rank":1,"section":["Channel coding","Linear codes","Convolutional codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #7b8259e1","kind":"definition","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.","object":[{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"end_line":404,"library":"tauceti","line":401,"path":"TauCeti/InformationTheory/Coding/Matrix.lean","proof_status":"proved"}},"location":{"declaration":"TauCeti.LinearCode.IsGeneratorMatrix.vecMul_encodingEquiv_symm_apply","module":"TauCeti.InformationTheory.Coding.Matrix"},"role":"key","type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"relatedMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[12347,12474],"span_sha256":"ea3145120cbed64dff8d1fd95e31acba50a2dca0151c932609f63afe70e97746"}},"location":{"quote":{"exact":"The idea behind a convolutional code is to make every codeword symbol"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #7b8259e1","passage_key":"12e4be6ecdddcd0d286f1f3ce786555b52d60770acf9c4b95d902201f1507b38","prominence":"central","receipt":{"candidates":2,"queries":4,"sha256":"eb413d19a20ae707a7972f6e40c24a98413a09d9b7623b10dea3ebbc95b28942"},"section":["Channel coding","Linear codes","Convolutional codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #7b8259e1","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[12347,12474],"span_sha256":"ea3145120cbed64dff8d1fd95e31acba50a2dca0151c932609f63afe70e97746"}},"location":{"quote":{"exact":"The idea behind a convolutional code is to make every codeword symbol"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #7a618aa6","passage_key":"c62ef2c67bc61b1542f2d48bf1a7117c179b6b6a4c2339689d918fdf52190fa9","prominence":"central","receipt":{"candidates":2,"queries":4,"sha256":"86bb321bf36885f1439ad6e9f9cd0eae1d753a38b103918d2711ccfa6ee73dee"},"section":["Channel coding","Linear codes","Convolutional codes"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #7a618aa6","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[13148,13230],"span_sha256":"7a618aa69e6f2891e62e31374680799119fe797cb7ed34a5cd4a8f0648fe1e7d"}},"location":{"quote":{"exact":"The Viterbi algorithm is the optimum algorithm used to decode convolutional codes."}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #4fbd20dc","passage_key":"53f7c7488f6a6ffc5d31ad2fad74e78ef31b0026ada203132510ff5724716b14","prominence":"supporting","receipt":{"candidates":1,"queries":3,"sha256":"71f90fd0f4113262a8ae689dc9bec6e385e6245f5cb45cc6a183e35e233f10ec"},"section":["Cryptographic coding"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #4fbd20dc","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[15145,15202],"span_sha256":"3e6411dd6378ef4b1aca201635c7971bbbcccd9a67783493916f80e95b00d969"}},"location":{"quote":{"exact":"These schemes are therefore termed computationally secure"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #77eda250","passage_key":"674d2e8e4f1cf2142b15f79870276c7de4a5e0ace7f61ae6a7430700fca448b6","prominence":"central","receipt":{"candidates":2,"queries":5,"sha256":"f065951d0856587426652609861464bb09fa6fb83f9972058e6caf29868daf32"},"section":["Cryptographic coding"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #77eda250","kind":"theorem","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[15365,15642],"span_sha256":"e5e5bdc2effe3658f01653f8f1a07cd98fbe2e244fd03a6c41b98a8e8ea63562"}},"location":{"quote":{"exact":"There exist information-theoretically secure schemes that provably cannot be broken even with"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
{"extensions":{"org.mathlib-initiative.formal-companion.locate":{"challenge":"survived","item":"In-text #9b7bbf74","passage_key":"8689c03eb66ec64d6eb3497c9eb1ace8c553daf9d5c9b07380c9edc1430665ed","prominence":"central","receipt":{"candidates":2,"queries":5,"sha256":"96d0995a98a62669122e21463248e696966d109cdd406dcc1d47f6378b8d6d23"},"section":["Other applications of coding theory","Group testing"],"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"}},"id":"enwiki-321869-1374936394::In-text #9b7bbf74","kind":"definition","object":[{"type":"lean","uri":"https://github.com/facebookresearch/atlas-lean","version":"64c2773ffad3e5453b9f40c62e693b3669ade83f"},{"type":"lean","uri":"https://github.com/leanprover-community/batteries","version":"4453b52d2468f4c346a8711d728c0742e7483c9b"},{"type":"lean","uri":"https://github.com/FormalFrontier/adic-modules","version":"05c5fb3a18264c48431da00d2865806f15e86337"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-direct-limits","version":"3e93fec5a0e0edaa3deda7a0acfa2b6f7a582fb4"},{"type":"lean","uri":"https://github.com/FormalFrontier/algebraic-groups","version":"01267a46f5990e3b935378bb1fb7fe19990c7d82"},{"type":"lean","uri":"https://github.com/FormalFrontier/coherent-modules","version":"20b0f3edd46adb3275a2d6bdad5ec512ec2766c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/complex-analysis","version":"2c0ad1d2ce6d2f815930d64428d66618cb9f122d"},{"type":"lean","uri":"https://github.com/FormalFrontier/continuous-group-cohomology","version":"89b5f52cbcacb712a3de32f529fa4afba4ec5751"},{"type":"lean","uri":"https://github.com/FormalFrontier/dedekind-ideal-arithmetic","version":"136eb5854609e10bef1d1ea6bd6121e60ea37111"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-etale-algebras","version":"4cd253af5e6ac472644ac7058c1ce00a8ee3a2bf"},{"type":"lean","uri":"https://github.com/FormalFrontier/finite-group-tate-cohomology","version":"4c36b89fcd406c7dd90e82f5a00a3b1cae2cc253"},{"type":"lean","uri":"https://github.com/FormalFrontier/formal-power-series","version":"9bb57357300e4fad20d074ee4cd95e8317a34c81"},{"type":"lean","uri":"https://github.com/FormalFrontier/fundamental-groupoids","version":"0cf9736b1e58bdd81e5f5c98599b3224158322e6"},{"type":"lean","uri":"https://github.com/FormalFrontier/general-linear-groups","version":"1baa8c4d54789c073c785d454e2124ec582bd10a"},{"type":"lean","uri":"https://github.com/FormalFrontier/graded-rings","version":"05143eb425d31ab18c726dc431b2314834ab8094"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-rings","version":"34e519d14163b35563234161b8bd9c0302dcd201"},{"type":"lean","uri":"https://github.com/FormalFrontier/group-theory","version":"e217d21d8e1fa0d1613a7e9bfb035517b1b90d14"},{"type":"lean","uri":"https://github.com/FormalFrontier/homological-algebra","version":"a5be50b47616208cb759994ccb170476a991bdad"},{"type":"lean","uri":"https://github.com/FormalFrontier/ideal-completion","version":"40e07d50b85ca7b3ad89a4cc19f50972998a2c94"},{"type":"lean","uri":"https://github.com/FormalFrontier/integral-closure","version":"3951c14b1fa0d56eb2c2cbc2acf390794676c055"},{"type":"lean","uri":"https://github.com/FormalFrontier/iwasawa-modules","version":"e0dd6173b75ab5d05e29b93da83a9f463b4e7d3f"},{"type":"lean","uri":"https://github.com/FormalFrontier/minimal-primes","version":"537058e2a3f4610d3126f22af057a1f6cd96c886"},{"type":"lean","uri":"https://github.com/FormalFrontier/morphism-properties","version":"a6202aad89e5c381a79f0c869125da7ea660d2eb"},{"type":"lean","uri":"https://github.com/FormalFrontier/multivariate-polynomials","version":"6060ee7f0534f2d3cbe90cc42ecaa54511bd8d63"},{"type":"lean","uri":"https://github.com/FormalFrontier/norm-forms","version":"2d4f3696c4f104cb0b79c8cca70002e04862e8e4"},{"type":"lean","uri":"https://github.com/FormalFrontier/polynomial-root-stability","version":"ceae7822f6151ec6626678db1653054d3398cff3"},{"type":"lean","uri":"https://github.com/FormalFrontier/profinite-groups","version":"d21abb3f7fedd7241f3dbcb91ba8eed73d2caf9c"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-modules","version":"aeca3cece59c8cd48c1ef3f82852ae919c108051"},{"type":"lean","uri":"https://github.com/FormalFrontier/projective-space","version":"3d39919aac0def769a0ff8b44e62a1317d4c84fe"},{"type":"lean","uri":"https://github.com/FormalFrontier/quadratic-algebras","version":"85a6b1bc79989b524a4ecdae6cce17b712a7bd2d"},{"type":"lean","uri":"https://github.com/FormalFrontier/restricted-product-duality","version":"fbdc1f29cfc71cc859ad58b626c847d162be6632"},{"type":"lean","uri":"https://github.com/FormalFrontier/ringed-spaces","version":"f5e2fa019c2b1904b41efae2f5bf20e17ff28871"},{"type":"lean","uri":"https://github.com/FormalFrontier/scheme-properties","version":"b9f054b13c4560f70a88e3a66866aa24e741b5c2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sequence-growth","version":"7b7db3df8a043a09d037de4ff1eced6873404fb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/sheaf-cohomology","version":"93674a2a8f1ad19b2c87b20c3f5e0898b7e38f43"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-objects","version":"1b954263ff5b9b93adc4b08a72ce870d08f33128"},{"type":"lean","uri":"https://github.com/FormalFrontier/simplicial-rings","version":"79a68e78417cb591897f5d8cfdb56c81334e365e"},{"type":"lean","uri":"https://github.com/FormalFrontier/smooth-regularity","version":"091bee79f991c96723ebf3625070967e30943eb2"},{"type":"lean","uri":"https://github.com/FormalFrontier/spectral-stone-duality","version":"78b803577679fc37120fa3406833af653fe12018"},{"type":"lean","uri":"https://github.com/FormalFrontier/sphere-topology","version":"53c126528f9206380a3cb862895d3202646a99ee"},{"type":"lean","uri":"https://github.com/FormalFrontier/stable-range","version":"c283b01ed9ebc33c7eefcdb4f3d2ca45141f469e"},{"type":"lean","uri":"https://github.com/FormalFrontier/supernatural-numbers","version":"f85ab1d43595fe7fb16c523682d06b031e889555"},{"type":"lean","uri":"https://github.com/FormalFrontier/toric-ideals","version":"b91a7be3aab7ee857dfe6d3c0450f0a2af454027"},{"type":"lean","uri":"https://github.com/FormalFrontier/valuation-integers","version":"c6f47c37bbcc61810e55d5727fcc6d97202325c1"},{"type":"lean","uri":"https://github.com/google-deepmind/formal-conjectures","version":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39"},{"type":"lean","uri":"https://github.com/leanprover/lean4","version":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e"},{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","version":"3dfb8e22b67042b31fac228dee0e1169a1a7820f"},{"type":"lean","uri":"https://github.com/TauCetiProject/TauCeti","version":"83245abb3e4a4377e8d779ac045363a90c7e3a86"}],"relation":"noMatch","status":"not_formalized","subject":[{"citation":{"URL":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","container-title":"Wikipedia","id":"enwiki-321869-1374936394","title":"Coding theory","type":"webpage"},"extensions":{"org.mathlib-initiative.formal-companion.locate":{"html_sha256":"27866a4bddb94c6d2aa290b565b58d6ec267c5204130884824b363b940511464","layer_sha256":"cb52df9bd27991b60fd9efbe487a086d3a9b091d754acac09f7abe76e0f0109c","licence":"CC-BY-SA-4.0","pageid":321869,"renderer":"web-html/3","span":[18295,18539],"span_sha256":"28d68e8ec0066ec5cfa773a019a95e1aba1f86ea5d5f5eb2fbd19fe9890f92af"}},"location":{"quote":{"exact":"Consider a large group of items in which a very few are"}},"type":"html","uri":"https://en.wikipedia.org/w/index.php?curid=321869&oldid=1374936394","version":"1374936394"}]}
