{"assessment":{"class":"C","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":4839019,"passages":[{"absence":null,"basis":"7b1e9ce123274d400d45d9b93af4818c005ea3b0bd8ef44d0b82fc669b7608b6","coverage":null,"id":"enwiki-4839019-1376154580::In-text #cf5b6af0","item":"In-text #cf5b6af0","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Function.occCount","end_line":44,"library":"tauceti","line":44,"location_key":"7b1e9ce123274d400d45d9b93af4818c005ea3b0bd8ef44d0b82fc669b7608b6","module":"TauCeti.Data.Fintype.Fiber","note":"Lean counts the fibre of the record map, so the data are written as a family of trials rather than as a running tally.","pair_key":"2809ac49a6d5b89fefb38477a3f65ef29c1ad6370b40380fda9b23b815434cf7","path":"TauCeti/Data/Fintype/Fiber.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def Function.occCount {X : Type*} {S : Type*} : (X → S) → S → ℕ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multiset.count","end_line":124,"library":"mathlib","line":123,"location_key":"4d7e9e71d0d20c8d3070ada4ee08fd0676e83fd9819f62c587e6141882a1e127","module":"Mathlib.Data.Multiset.Count","note":"Lean writes the recorded data as a multiset and the frequency as the multiplicity of the event inside it.","pair_key":"261fc3f6cfdb56720470da0536817b3824ff591306f0a29e63fc7ce529953c76","path":"Mathlib/Data/Multiset/Count.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multiset.count {α : Type*} [DecidableEq α] : α → Multiset α → ℕ"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List.count","end_line":1812,"library":"lean-core","line":1812,"location_key":"e0fc47a342e23d711418550accbd2a14d1cd98fd88136e4bc66fbab32e91c454","module":"Init.Data.List.Basic","note":"Lean takes the record as a list and compares entries with a boolean equality test.","pair_key":"8c0c03f421599cf6f975589d42eda264eb5fd5fe68132df2a4c61c80c167cbd9","path":"src/Init/Data/List/Basic.lean","proof_status":"definition","rank":3,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def List.count {α : Type u} [BEq α] : α → List α → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bd0e76a53434b98ede874b81821e2fa9b7253fb6c56b81327236c5261913a5c8","prominence":"subject","quote":{"exact":"In statistics, the frequency or absolute frequency of an event i {\\displaystyle"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"In statistics, the frequency or absolute frequency of an event i {\\displaystyle i} is the number n i {\\displaystyle n_{i}} of times the observation has occurred or been recorded in an experiment or study.[1]: 12–19","segments":[{"text":"In statistics, the frequency or absolute frequency of an event "},{"tex":"i"},{"text":" is the number "},{"tex":"n_{i}"},{"text":" of times the observation has occurred or been recorded in an experiment or study."},{"ref":"[1]: 12–19"}]},"unresolved":null},{"absence":null,"basis":"096b4e0d67f22e6cfb43e3a958c9b84d4782270667f9a30d4cad667ed2150eb5","coverage":null,"id":"enwiki-4839019-1376154580::In-text #2faab277","item":"In-text #2faab277","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.empiricalMeasureOfFintype","end_line":60,"library":"tauceti","line":55,"location_key":"096b4e0d67f22e6cfb43e3a958c9b84d4782270667f9a30d4cad667ed2150eb5","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"Lean packages the ratio as a probability measure, carrying its additivity and unit total mass along with the value.","pair_key":"d88ae69b50d56c6fbe2d541ac6dac678cd04f01cf9d93babac90c4643fb958cb","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Probability.empiricalMeasureOfFintype {α : Type*} [MeasurableSpace α] {κ : Type*} [Fintype κ] [Nonempty κ] : (κ → α) → MeasureTheory.ProbabilityMeasure α"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.empiricalMeasure_apply","end_line":169,"library":"tauceti","line":164,"location_key":"42b7b252acd74483a9feef1515e3cf8ec774098ae3dcbb5b0ba3a5b80f75a4c4","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"Lean spells the value out as a sum of indicators over the first n+1 recordings, scaled by the reciprocal of that sample size.","pair_key":"12d683e7f7724b9208013da311dab07eded1126308d70cad18f052013dde73e8","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.empiricalMeasure_apply {α : Type*} [MeasurableSpace α] {x : ℕ → α} {n : ℕ} {s : Set α} : MeasurableSet s → ↑(TauCeti.Probability.empiricalMeasure x n) s = (↑(n + 1))⁻¹ * ∑ i ∈ Finset.range (n + 1), s.indicator 1 (x i)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"975f4933f2780308bf819aeb6d5df77b92ce4525a0b755a44773c8362bd7085b","prominence":"central","quote":{"exact":"The relative frequency is the ratio of absolute frequency to the sample"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The relative frequency is the ratio of absolute frequency to the sample size.","segments":[{"text":"The relative frequency is the ratio of absolute frequency to the sample size."}]},"unresolved":null},{"absence":null,"basis":"df749440087362216712d4848f250a9f0909ce1bb0d5d252c8b2d209e58691ad","coverage":null,"id":"enwiki-4839019-1376154580::In-text #cb9632e0","item":"In-text #cb9632e0","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multiset.countP","end_line":40,"library":"mathlib","line":39,"location_key":"df749440087362216712d4848f250a9f0909ce1bb0d5d252c8b2d209e58691ad","module":"Mathlib.Data.Multiset.Count","note":"Lean counts with any decidable property of the entries, and lying at or below a point is one such property.","pair_key":"b850512057b25d6c0152764f8d49a1ce339c2420f14f72e4b2a01623b36349d9","path":"Mathlib/Data/Multiset/Count.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multiset.countP {α : Type*} (p : α → Prop) [DecidablePred p] : Multiset α → ℕ"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"List.countP","end_line":1800,"library":"lean-core","line":1796,"location_key":"909f3698ba1c3df69393d9091ca0606cc2d09f5c4a02dddcbb8b3039c9836964","module":"Init.Data.List.Basic","note":"Lean counts the list entries passing a boolean test, of which the comparison against a cut point is one.","pair_key":"5ed3b398d441fd820762ecd609fee3787592d016110f43f8821f73a7acdb2c61","path":"src/Init/Data/List/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def List.countP {α : Type u} : (α → Bool) → List α → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"28fbf392182bae5f5ac7cc3a5c4fce4ea394649c69890adee52afb287a6dca06","prominence":"central","quote":{"exact":"The cumulative frequency is the total of the absolute frequencies of all"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The cumulative frequency is the total of the absolute frequencies of all events at or below a certain point in an ordered list of events.[1]: 17–19","segments":[{"text":"The cumulative frequency is the total of the absolute frequencies of all events at or below a certain point in an ordered list of events."},{"ref":"[1]: 17–19"}]},"unresolved":null},{"absence":null,"basis":"02c5d366621a86fd9ee86f24e95978891766f51f5bef195313eca5b6ee87a93a","coverage":null,"id":"enwiki-4839019-1376154580::In-text #c0ac177f","item":"In-text #c0ac177f","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.empiricalMeasure_apply","end_line":169,"library":"tauceti","line":164,"location_key":"c136449811ea8f2757b67cba974fc454110d07bd31ddaf1707df42ee1dd98c2d","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"Lean writes the numerator as a sum of indicators over the recordings and the denominator as their number, which the passage also writes as the sum of all the frequencies.","pair_key":"c1d20553f30cff4632d55ebd97af8676f28a6949c25bb39225930a80b5a4ca1a","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Probability.empiricalMeasure_apply {α : Type*} [MeasurableSpace α] {x : ℕ → α} {n : ℕ} {s : Set α} : MeasurableSet s → ↑(TauCeti.Probability.empiricalMeasure x n) s = (↑(n + 1))⁻¹ * ∑ i ∈ Finset.range (n + 1), s.indicator 1 (x i)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Probability.empiricalMeasureOfFintype","end_line":60,"library":"tauceti","line":55,"location_key":"02c5d366621a86fd9ee86f24e95978891766f51f5bef195313eca5b6ee87a93a","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"Lean carries the ratio as a probability measure, so the additivity and the unit total mass travel with the value.","pair_key":"1a1ab8b7e4cc81ba922b19cf48083f0b1feec449de7eeaccc861cdd10d744de4","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Probability.empiricalMeasureOfFintype {α : Type*} [MeasurableSpace α] {κ : Type*} [Fintype κ] [Nonempty κ] : (κ → α) → MeasureTheory.ProbabilityMeasure α"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"Function.sum_occCount_eq_card","end_line":140,"library":"tauceti","line":136,"location_key":"ff0fb08da1889faecb436c841d53c930e07df4dca94a60ff26c16b93583f614b","module":"TauCeti.Data.Fintype.Fiber","note":"It supports the passage's second denominator by equating the sum of the frequencies with the number of recordings.","pair_key":"23878daf43ba88a902f9d1749e5333c52d683b952e20269dbbc33f8a47462487","path":"TauCeti/Data/Fintype/Fiber.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem Function.sum_occCount_eq_card {X : Type*} {S : Type*} [Finite X] (f : X → S) {T : Finset S} : (∀ (x : X), f x ∈ T) → ∑ y ∈ T, Function.occCount f y = Nat.card X"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b407c51214d17a5ccec4b4fdf28ea82644bf124f779f04e181d92c481ac9c2db","prominence":"central","quote":{"exact":"The relative frequency of an event is the absolute frequency normalized by"},"quote_capped":true,"section":["Formulation"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The relative frequency of an event is the absolute frequency normalized by the total number of events: f i = n i N = n i ∑ j n j . {\\displaystyle f_{i}={\\frac {n_{i}}{N}}={\\frac {n_{i}}{\\sum _{j}n_{j}}}.}","segments":[{"text":"The relative frequency of an event is the absolute frequency normalized by the total number of events: "},{"tex":"f_{i}={\\frac {n_{i}}{N}}={\\frac {n_{i}}{\\sum _{j}n_{j}}}."}]},"unresolved":null},{"absence":null,"basis":"215cac13c69dcddf0eafa164326b52fc8d09fd306b4cc687564d8f8dd408fe2a","coverage":null,"id":"enwiki-4839019-1376154580::In-text #987913fb","item":"In-text #987913fb","kind":"definition","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"Function.occCount","end_line":44,"library":"tauceti","line":44,"location_key":"215cac13c69dcddf0eafa164326b52fc8d09fd306b4cc687564d8f8dd408fe2a","module":"TauCeti.Data.Fintype.Fiber","note":"Lean encodes the division into mutually exclusive classes as the fibres of a classifying map and the distribution as the sizes of those fibres.","pair_key":"3119a1f178cf10456e6a08ab85bc43085feb316c5ac2b892891ca5509e8be222","path":"TauCeti/Data/Fintype/Fiber.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def Function.occCount {X : Type*} {S : Type*} : (X → S) → S → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e0147d2fe59c945c6fc8f7f8ad63e1cb5ea19d72dcaae36984fa3b830189bf09","prominence":"central","quote":{"exact":"A frequency distribution shows a summarized grouping of data divided into mutually"},"quote_capped":true,"section":["Visualization"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"A frequency distribution shows a summarized grouping of data divided into mutually exclusive classes and the number of occurrences in a class.","segments":[{"text":"A frequency distribution shows a summarized grouping of data divided into mutually exclusive classes and the number of occurrences in a class."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":6,"sha256":"15be28e551420f3c1b153e545f42a7aacb6f05b972ae0823cc0c4565b295b9fc"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #5990dc5d","item":"In-text #5990dc5d","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2f31f187801d16bd4fe0d44635d61e89e62a3033e0ddce39d8e76e1128d24abf","prominence":"supporting","quote":{"exact":"The ideal number of classes may be determined or estimated by formula:"},"quote_capped":true,"section":["Visualization","Construction"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The ideal number of classes may be determined or estimated by formula: number of classes = C = 1 + 3.3 log ⁡ n {\\displaystyle {\\text{number of classes}}=C=1+3.3\\log n} (log base 10), or by the square-root choice formula C = n {\\displaystyle C={\\sqrt {n}}} where n is the total number of observations in the data.","segments":[{"text":"The ideal number of classes may be determined or estimated by formula: "},{"tex":"{\\text{number of classes}}=C=1+3.3\\log n"},{"text":" (log base 10), or by the square-root choice formula "},{"tex":"C={\\sqrt {n}}"},{"text":" where n is the total number of observations in the data."}]},"unresolved":null},{"absence":null,"basis":"ae04be59c01a2f5af562599b5b6e2a3e4e497fa6ce17a6788f3dc9a7d757cc68","coverage":null,"id":"enwiki-4839019-1376154580::In-text #2514b66c","item":"In-text #2514b66c","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.diam_eq","end_line":705,"library":"mathlib","line":703,"location_key":"ae04be59c01a2f5af562599b5b6e2a3e4e497fa6ce17a6788f3dc9a7d757cc68","module":"Mathlib.Topology.Instances.ENNReal.Lemmas","note":"Lean names the spread the metric diameter and writes the two endpoints as a supremum and an infimum, which a finite nonempty set attains.","pair_key":"0d12a1f0bdfb8873d7aebb18f32696b999330f7ba59a38c718955a29a41345bf","path":"Mathlib/Topology/Instances/ENNReal/Lemmas.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.diam_eq {s : Set ℝ} : Bornology.IsBounded s → Metric.diam s = SupSet.sSup s - InfSet.sInf s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7e8102e267d75c6c7198f136fb43f87fd230298528301805d568062f51fb05e2","prominence":"supporting","quote":{"exact":"Calculate the range of the data (Range = Max – Min) by"},"quote_capped":true,"section":["Visualization","Construction"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"Calculate the range of the data (Range = Max – Min) by finding the minimum and maximum data values.","segments":[{"text":"Calculate the range of the data (Range = Max – Min) by finding the minimum and maximum data values."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"7c7e989d5e5834ff1ded7d9bd2413939416ef2db58a627adce8c9b85a694afbb"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #a1ce79d1","item":"In-text #a1ce79d1","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"1bcacf015d614716e9b9f96e89d1e917da578c5dd446bc369f7be1f9ef7d0bbb","prominence":"supporting","quote":{"exact":"Decide the width of the classes, denoted by h and obtained by"},"quote_capped":true,"section":["Visualization","Construction"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"Decide the width of the classes, denoted by h and obtained by h = range number of classes {\\displaystyle h={\\frac {\\text{range}}{\\text{number of classes}}}} (assuming the class intervals are the same for all classes).","segments":[{"text":"Decide the width of the classes, denoted by h and obtained by "},{"tex":"h={\\frac {\\text{range}}{\\text{number of classes}}}"},{"text":" (assuming the class intervals are the same for all classes)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"8982b7949b879acfdfad8c7efb8521a547176a79774a8ec0dab98ef93b4d8d88"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #8686d210","item":"In-text #8686d210","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c9208af743aafd2a11bfc0f8b3923443c1ed19f855939e4340dbf85517a8c674","prominence":"supporting","quote":{"exact":"The classes all taken together must cover at least the distance from"},"quote_capped":true,"section":["Visualization","Construction"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The classes all taken together must cover at least the distance from the lowest value (minimum) in the data to the highest (maximum) value.","segments":[{"text":"The classes all taken together must cover at least the distance from the lowest value (minimum) in the data to the highest (maximum) value."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"383aa4987e75f3d21fe83d528693d303774ac3ef9a740f812f2e535771bebdf3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #13219b6d","item":"In-text #13219b6d","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"72ccc1de73121b2b888590ef1d0269b48e88594ba26a59a38f61e0a780b5be16","prominence":"central","quote":{"exact":"A histogram is a representation of tabulated frequencies, shown as adjacent rectangles"},"quote_capped":true,"section":["Visualization","Histograms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"A histogram is a representation of tabulated frequencies, shown as adjacent rectangles or squares (in some of situations), erected over discrete intervals (bins), with an area proportional to the frequency of the observations in the interval.","segments":[{"text":"A histogram is a representation of tabulated frequencies, shown as adjacent rectangles or squares (in some of situations), erected over discrete intervals (bins), with an area proportional to the frequency of the observations in the interval."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"7427320a4489ec76e05d9a88ef1876f6b67568ae529c691de01cc3331733d269"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #3f840904","item":"In-text #3f840904","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a6db99269ccd4b8609e4ad80dc96f448020239ef4bb702965ca732d151fce641","prominence":"supporting","quote":{"exact":"The height of a rectangle is also equal to the frequency density"},"quote_capped":true,"section":["Visualization","Histograms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The height of a rectangle is also equal to the frequency density of the interval, i.e., the frequency divided by the width of the interval.","segments":[{"text":"The height of a rectangle is also equal to the frequency density of the interval, i.e., the frequency divided by the width of the interval."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"5131ded7f69a7c7aac0f6dbb01475c16879aa4a5e8f9b3298d65c4e0a9bfd948"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #6a71e7fa","item":"In-text #6a71e7fa","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"849a15615a74060b11f7fcfdd44ba91627520cf09d5e24a03e663738b391d388","prominence":"supporting","quote":{"exact":"The total area of the histogram is equal to the number of"},"quote_capped":true,"section":["Visualization","Histograms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The total area of the histogram is equal to the number of data.","segments":[{"text":"The total area of the histogram is equal to the number of data."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":5,"sha256":"d90325f6ab0f6ba7b3a8f7fdd03b851546e35cc79852fb76cbda60202b7ff4a5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #5123ac1e","item":"In-text #5123ac1e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"dc31121cdd5414649384d9db1449f279883d5084b2e768445b99ec6654f5a545","prominence":"supporting","quote":{"exact":"A histogram may also be normalized displaying relative frequencies. It then shows"},"quote_capped":true,"section":["Visualization","Histograms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"A histogram may also be normalized displaying relative frequencies. It then shows the proportion of cases that fall into each of several categories, with the total area equaling 1.","segments":[{"text":"A histogram may also be normalized displaying relative frequencies. It then shows the proportion of cases that fall into each of several categories, with the total area equaling 1."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"6b23d691cd98ba755de2d5a603e104294c7101fb02387e7298aac050b5cc4d09"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #5f321343","item":"In-text #5f321343","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5a55b3fbdfe681b51e118e3c4588d990458a5e9c6006b77ddbfc768e3c7dac35","prominence":"supporting","quote":{"exact":"The categories are usually specified as consecutive, non-overlapping intervals of a variable."},"quote_capped":false,"section":["Visualization","Histograms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The categories are usually specified as consecutive, non-overlapping intervals of a variable.","segments":[{"text":"The categories are usually specified as consecutive, non-overlapping intervals of a variable."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"7f5a9211f603fca9a73f545ea436ebfab3e8f6cec095a785994f2f9f8088bcbf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #1d29b098","item":"In-text #1d29b098","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"dde5065dbd5552607b070e28e77a055a0216df5396c049107f237c03115cd5a4","prominence":"supporting","quote":{"exact":"The categories (intervals) must be adjacent, and often are chosen to be"},"quote_capped":true,"section":["Visualization","Histograms"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The categories (intervals) must be adjacent, and often are chosen to be of the same size.[4]","segments":[{"text":"The categories (intervals) must be adjacent, and often are chosen to be of the same size."},{"ref":"[4]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"7389f15dc375c0e52c5e8d433d70f78d445df8745ecfcde472d57fc627d70004"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #8d761a66","item":"In-text #8d761a66","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"163c3f94cceeaeaabcea59e9cc4b397373329503d2c068df91299453efb333c8","prominence":"central","quote":{"exact":"A bar chart or bar graph is a chart with rectangular bars"},"quote_capped":true,"section":["Visualization","Bar graphs"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"A bar chart or bar graph is a chart with rectangular bars with lengths proportional to the values that they represent.","segments":[{"text":"A bar chart or bar graph is a chart with rectangular bars with lengths proportional to the values that they represent."}]},"unresolved":null},{"absence":null,"basis":"f313c80884a2e95282d8323517687775ae969cd0f1789fea6069a02f88026684","coverage":null,"id":"enwiki-4839019-1376154580::In-text #f5ca4d92","item":"In-text #f5ca4d92","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multiset.toFinsupp","end_line":146,"library":"mathlib","line":135,"location_key":"f313c80884a2e95282d8323517687775ae969cd0f1789fea6069a02f88026684","module":"Mathlib.Data.Finsupp.Multiset","note":"The library packages the sample-to-counts correspondence as an additive equivalence whose forward direction assigns each observed value its multiplicity; the inverse and the additivity field are packaging.","pair_key":"18796422625ef8ec258bfc9f5ca8e510a37146a97cf0f65648674e416b806022","path":"Mathlib/Data/Finsupp/Multiset.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multiset.toFinsupp {α : Type*} [DecidableEq α] : Multiset α ≃+ (α →₀ ℕ)"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"TauCeti.Probability.empiricalMeasureOfFintype","end_line":60,"library":"tauceti","line":55,"location_key":"e18d9b4d359ce407e5fcae92b6ce8736bcae33eb6e52e2f94fc549641207a9cb","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"The library object records each value's share of the sample rather than its raw occurrence count, and reads the sample as a family indexed by a finite type.","pair_key":"fb58645e351984ba682ffc84387001b7e593005d2834fa9cfdac23b936059856","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Probability.empiricalMeasureOfFintype {α : Type*} [MeasurableSpace α] {κ : Type*} [Fintype κ] [Nonempty κ] : (κ → α) → MeasureTheory.ProbabilityMeasure α"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"low","declaration":"TauCeti.Probability.empiricalMeasure","end_line":146,"library":"tauceti","line":145,"location_key":"c1000f491317ac959d3cef77469730d198dee5e543bb60683d67493f4a760916","module":"TauCeti.Probability.Process.EmpiricalMeasure","note":"Its sample is a prefix of an indexed sequence of observations rather than an arbitrary finite collection.","pair_key":"0f51d137702114a6491e19bb94564ea91d5e32bddb92d5d3b10d1882210004ca","path":"TauCeti/Probability/Process/EmpiricalMeasure.lean","proof_status":"definition","rank":3,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"def TauCeti.Probability.empiricalMeasure {α : Type*} [MeasurableSpace α] : (ℕ → α) → ℕ → MeasureTheory.ProbabilityMeasure α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"139573a91a706b017ebfcc17f933780020e466e98e3684bf75bd201ae7169497","prominence":"central","quote":{"exact":"A frequency distribution table is an arrangement of the values that one"},"quote_capped":true,"section":["Visualization","Frequency distribution table"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"A frequency distribution table is an arrangement of the values that one or more variables take in a sample.","segments":[{"text":"A frequency distribution table is an arrangement of the values that one or more variables take in a sample."}]},"unresolved":null},{"absence":null,"basis":"ae7a4273a1fd789165fa8a11de4c00a454ce5dc0d603326ddc377726cd87e87e","coverage":null,"id":"enwiki-4839019-1376154580::In-text #f917f423","item":"In-text #f917f423","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multiset.countP","end_line":40,"library":"mathlib","line":39,"location_key":"ae7a4273a1fd789165fa8a11de4c00a454ce5dc0d603326ddc377726cd87e87e","module":"Mathlib.Data.Multiset.Count","note":"The library encodes the sample as a multiset of observations and the group as a decidable predicate on values, returning how many observations, counted with repetition, fall in it.","pair_key":"05dbfe851625483af172d9284b5b893b2924327bcfdf0c94caa95cd6fcd771d9","path":"Mathlib/Data/Multiset/Count.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multiset.countP {α : Type*} (p : α → Prop) [DecidablePred p] : Multiset α → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multiset.count","end_line":124,"library":"mathlib","line":123,"location_key":"74d2d05c70ced5e2701a2d74843b92d3489abfec1c2c2650167627e435eb2f19","module":"Mathlib.Data.Multiset.Count","note":"Its group is a single value rather than a group or an interval of values.","pair_key":"5484ad096c8236cf04633717fa2375e506dbec6994f9bcc97254911c015cda0c","path":"Mathlib/Data/Multiset/Count.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multiset.count {α : Type*} [DecidableEq α] : α → Multiset α → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fd01c22fe044c2ddfd157c1aefeaba05690548f58fa418dcd56e162a30b09347","prominence":"supporting","quote":{"exact":"Each entry in the table contains the frequency or count of the"},"quote_capped":true,"section":["Visualization","Frequency distribution table"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"after":{"layer":", and in this way, the table summarizes the distribution of values in the sample.","segments":[{"text":", and in this way, the table summarizes the distribution of values in the sample."}]},"layer":"Each entry in the table contains the frequency or count of the occurrences of values within a particular group or interval","segments":[{"text":"Each entry in the table contains the frequency or count of the occurrences of values within a particular group or interval"}]},"unresolved":null},{"absence":null,"basis":"58f673a4e4329b4d8cd9f2db93332a13101a9a5ef594bd83da76d64e998e9775","coverage":null,"id":"enwiki-4839019-1376154580::In-text #02b57a72","item":"In-text #02b57a72","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multiset.countP","end_line":40,"library":"mathlib","line":39,"location_key":"58f673a4e4329b4d8cd9f2db93332a13101a9a5ef594bd83da76d64e998e9775","module":"Mathlib.Data.Multiset.Count","note":"The library counts the members of a sample satisfying any decidable predicate; a bin's range is one such predicate, and the same count at an equality predicate is the unbinned scheme the passage contrasts with.","pair_key":"7004f6596849fe7bf89f33192dac14d07d5e681a935e2dae2cab458ccc67026b","path":"Mathlib/Data/Multiset/Count.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multiset.countP {α : Type*} (p : α → Prop) [DecidablePred p] : Multiset α → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"low","declaration":"Cslib.Algorithms.Lean.RangeTree.count","library":"atlas","line":299,"location_key":"9311f585cb04e9143964f66cb1c56813f9fdb1a831af6bb79ebd60f7e6829298","module":"CSLibExt.Algorithms.Lean.DataStructures.RangeTree","note":"Its readings are integers kept in one search structure, so it is the passage's binned count at those particular objects.","pair_key":"25c44355fabc0420a57fa8df741cc7e750074e89440ce009742418d47c4cbb67","path":"CSLibExt/Algorithms/Lean/DataStructures/RangeTree.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Cslib.Algorithms.Lean.RangeTree.count : Cslib.Algorithms.Lean.RangeTree → ℤ → ℤ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7051bae10ea0c156c79f65b1390c93e91c2c12d004aca37c403bf3c3a598c542","prominence":"supporting","quote":{"exact":"A different tabulation scheme aggregates values into bins such that each bin"},"quote_capped":true,"section":["Visualization","Frequency distribution table"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"A different tabulation scheme aggregates values into bins such that each bin encompasses a range of values.","segments":[{"text":"A different tabulation scheme aggregates values into bins such that each bin encompasses a range of values."}]},"unresolved":null},{"absence":null,"basis":"7ff05b1f95f43e24d059eea57fbbb389627082548045a4ae8665bc3246c1e45d","coverage":null,"id":"enwiki-4839019-1376154580::In-text #64f613d3","item":"In-text #64f613d3","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.measure_preimage_fst_singleton_eq_sum","end_line":375,"library":"mathlib","line":373,"location_key":"7ff05b1f95f43e24d059eea57fbbb389627082548045a4ae8665bc3246c1e45d","module":"Mathlib.MeasureTheory.Measure.NullMeasurable","note":"The declaration is stated for an arbitrary measure on a product of two category sets, of which the counted cases of the passage are one; the weight of a fibre is the pushforward along the projection at that value, the marginal frequency under another name.","pair_key":"4f51f32f6ec5d1ff775af87180c570b3069916031689db883e6225971f0176b3","path":"Mathlib/MeasureTheory/Measure/NullMeasurable.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem MeasureTheory.measure_preimage_fst_singleton_eq_sum {α : Type*} {β : Type*} {m0 : MeasurableSpace α} [MeasurableSingletonClass α] {mβ : MeasurableSpace β} [MeasurableSingletonClass β] [Fintype β] (μ : MeasureTheory.Measure (α × β)) (x : α) : μ (Prod.fst ⁻¹' {x}) = ∑ y, μ {(x, y)}"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.Measure.fst","end_line":1145,"library":"mathlib","line":1144,"location_key":"ab4b3ca37e6c7b84d1f7c652a99b39aadeb3d4a297d0e6ee51fcfc79c8f51274","module":"Mathlib.MeasureTheory.Measure.Prod","note":"It defines the marginal measure of a joint measure as the pushforward along the first projection, the notion the totals of the passage record, but it asserts nothing about the cells of a cross-classification.","pair_key":"80a218c055fba50e67338ca3a303330f705e0d1d0c0286b4c7a08095e68bf917","path":"Mathlib/MeasureTheory/Measure/Prod.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def MeasureTheory.Measure.fst {α : Type*} {β : Type*} [MeasurableSpace α] [MeasurableSpace β] : MeasureTheory.Measure (α × β) → MeasureTheory.Measure α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e584d6042c293cab5b9d806ed1caac65655b9ca76fff759be5fdbc0b243e9ada","prominence":"central","quote":{"exact":"The total row and total column report the marginal frequencies or marginal"},"quote_capped":true,"section":["Visualization","Joint frequency distributions"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The total row and total column report the marginal frequencies or marginal distribution, while the body of the table reports the joint frequencies.","segments":[{"text":"The total row and total column report the marginal frequencies or marginal distribution, while the body of the table reports the joint frequencies."}]},"unresolved":null},{"absence":null,"basis":"a86aa13930f98666d4e63bcff1e1c0d77d78089e2dde7276adaf6937c384b7f9","coverage":null,"id":"enwiki-4839019-1376154580::In-text #fb13a45d","item":"In-text #fb13a45d","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.Dynamics.Ergodic.BirkhoffWanted.birkhoff_pointwise_ergodic","library":"atlas","line":508,"location_key":"a86aa13930f98666d4e63bcff1e1c0d77d78089e2dde7276adaf6937c384b7f9","module":"MathlibExt.Dynamics.Ergodic.Birkhoff","note":"The declaration covers every integrable real observable, the indicator of an event being one of them, and it pins the limit as that observable's integral where the passage speaks of a fixed value being approached.","pair_key":"aa759f6b6d8d44e4dec94c7a8868410008b9b9d616858e1330ccf06f6e26882f","path":"MathlibExt/Dynamics/Ergodic/Birkhoff.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.Dynamics.Ergodic.BirkhoffWanted.birkhoff_pointwise_ergodic {α : Type*} [MeasurableSpace α] {μ : MeasureTheory.Measure α} [MeasureTheory.IsProbabilityMeasure μ] {T : α → α} : Ergodic T μ → ∀ {g : α → ℝ}, MeasureTheory.Integrable g μ → ∀ᵐ (x : α) ∂μ, Filter.Tendsto (fun n ↦ birkhoffAverage ℝ T g n x) Filter.atTop (𝓝 (∫ (y : α), g y ∂μ))"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ProbabilityTheory.strong_law_ae_real","end_line":631,"library":"mathlib","line":598,"location_key":"10c51fbf1c1746811504c46a9ad19969d28e898bd3b3794e5711174d21b90cda","module":"Mathlib.Probability.StrongLaw","note":"Independence with a common law is assumed of the trials, which is one kind of ergodic source among those the passage allows.","pair_key":"c7082e2f7a64b832c057b97b83fde5fec774c4ad7a28cd0c1a5540f839326361","path":"Mathlib/Probability/StrongLaw.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ProbabilityTheory.strong_law_ae_real {Ω : Type*} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} (X : ℕ → Ω → ℝ) : MeasureTheory.Integrable (X 0) μ → Pairwise (Function.onFun (fun x1 x2 ↦ ProbabilityTheory.IndepFun x1 x2 μ) X) → (∀ (i : ℕ), ProbabilityTheory.IdentDistrib (X i) (X 0) μ μ) → ∀ᵐ (ω : Ω) ∂μ, Filter.Tendsto (fun n ↦ (∑ i ∈ Finset.range n, X i ω) / ↑n) Filter.atTop (𝓝 (∫ (x : Ω), X 0 x ∂μ))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c52510ceead421517bbe16f5b01aa48d64ac59656e0657c586ad8106b8a56a9d","prominence":"central","quote":{"exact":"Under the frequency interpretation of probability, it is assumed that the source"},"quote_capped":true,"section":["Interpretation"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"Under the frequency interpretation of probability, it is assumed that the source is ergodic, i.e., as the length of a series of trials increases without bound, the fraction of experiments in which a given event occurs will approach a fixed value, known as the limiting relative frequency.","segments":[{"text":"Under the frequency interpretation of probability, it is assumed that the source is ergodic, i.e., as the length of a series of trials increases without bound, the fraction of experiments in which a given event occurs will approach a fixed value, known as the limiting relative frequency."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"6636367dcad777e3b0a7d06cb654ceb710f5f407691123c2ca7cfab7b89d4f09"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #e94cb5d6","item":"In-text #e94cb5d6","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"31799c06971a1e32196e037ebdc4401dea8c478d55a5f1195002abf51a64cfa6","prominence":"central","quote":{"exact":"A frequency distribution is said to be skewed when its mean and"},"quote_capped":true,"section":["Applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"A frequency distribution is said to be skewed when its mean and median are significantly different, or more generally when it is asymmetric.","segments":[{"text":"A frequency distribution is said to be skewed when its mean and median are significantly different, or more generally when it is asymmetric."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"542e5297211c3a5936d5a05e656bc333b140dec9fb2628a88c0a4a141bdd285f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #29b91f8f","item":"In-text #29b91f8f","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"38854c33cb6339d472c0f18b5e2e8926034d133d90afaba7f6ee79fe8bc0d498","prominence":"central","quote":{"exact":"The kurtosis of a frequency distribution is a measure of the proportion"},"quote_capped":true,"section":["Applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"layer":"The kurtosis of a frequency distribution is a measure of the proportion of extreme values (outliers), which appear at either end of the histogram.","segments":[{"text":"The kurtosis of a frequency distribution is a measure of the proportion of extreme values (outliers), which appear at either end of the histogram."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"64fdcc61e898df6d80205fb0a48308bff998bceb8baffe912c752256f395926e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #ccb31560","item":"In-text #ccb31560","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"71ae5834dcab47155e321c193090084c68aa0c1033dd2b9eb8bc5c958cddafac","prominence":"supporting","quote":{"exact":"If the distribution is more outlier-prone than the normal distribution it is"},"quote_capped":true,"section":["Applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"after":{"layer":"; if less outlier-prone it is said to be platykurtic.","segments":[{"text":"; if less outlier-prone it is said to be platykurtic."}]},"layer":"If the distribution is more outlier-prone than the normal distribution it is said to be leptokurtic","segments":[{"text":"If the distribution is more outlier-prone than the normal distribution it is said to be leptokurtic"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":6,"sha256":"bf7ebf70e2c958f0953ed23ddb33a22930343906fa0110ad847bbf747dbcfa8f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-4839019-1376154580::In-text #8879bce3","item":"In-text #8879bce3","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e3154aec6cecd94090347ef3236975f126eb9d954184b99d087e444264587801","prominence":"supporting","quote":{"exact":"if less outlier-prone it is said to be platykurtic."},"quote_capped":false,"section":["Applications"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=4839019&oldid=1376154580","text":{"before":{"layer":"If the distribution is more outlier-prone than the normal distribution it is said to be leptokurtic; ","segments":[{"text":"If the distribution is more outlier-prone than the normal distribution it is said to be leptokurtic; "}]},"layer":"if less outlier-prone it is said to be platykurtic.","segments":[{"text":"if less outlier-prone it is said to be platykurtic."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":143654,"images":[{"author":"Snježana Kordić (translation of the legend into English User:Mozel W.)","file":"Existential_clauses2.jpg","licence":"CC BY 3.0","licence_url":"https://creativecommons.org/licenses/by/3.0","project":"commons"},{"author":"Original uploader was XcepticZP at en.wikipedia","file":"Incarceration_Rates_Worldwide_ZP.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"OpenClipart","file":"People_icon.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"},{"author":"PC78, based on work by Julian Herzog, Zscout370, Ed g2s and Erin Silversmith","file":"Symbol_category_class.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"Future Perfect at Sunrise","file":"Symbol_template_class_pink.svg","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Qwfp (talk)","file":"Travel_time_histogram_total_n_Stata.png","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0","project":"commons"},{"author":"Wikideas1","file":"World_population_percentage_pie_chart.png","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"}],"marks":113,"passages":25,"sha256":"5f587f71909a2cb58013715257df861d5d11a51693a5c9a83c0da2ed56b15d4c","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"496451de27dbdaa515ab25b662c8dc9565f6b24cf5edcbe66854d0018ce5aade","revision":1376154580,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"b6df51f3ab78993e0f0301bf4c8bd68f0a997ae050d2110942594cbec8d1d2d9","layer_sha256":"06cc80d11cc5b968da7bc47fa915ab844e28eb64395c6d947c8a427beca0a033","renderer":"web-html/3"},"source_id":"enwiki-4839019-1376154580","summary":{"by_library":{"atlas":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":0},"lean-core":{"complete":2,"incomplete":0,"locations":2,"passages":2,"related":0},"mathlib":{"complete":9,"incomplete":0,"locations":9,"passages":8,"related":1},"tauceti":{"complete":8,"incomplete":0,"locations":8,"passages":5,"related":1}},"by_prominence":{"central":{"by_status":{"formalized":5,"not_formalized":4,"partial":2,"statement_only":0,"unresolved":0},"passages":11},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":2,"not_formalized":10,"partial":1,"statement_only":0,"unresolved":0},"passages":13}},"by_proof_status":{"definition":16,"proved":7},"by_relation":{"broadMatch":5,"closeMatch":11,"hasPart":1,"narrowMatch":4,"relatedMatch":2},"by_status":{"formalized":8,"not_formalized":14,"partial":3,"statement_only":0,"unresolved":0},"locations":21,"passages":25,"related":2},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Frequency (statistics)","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q762856"}
