{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TFVTTZHXQAMV46LKTR4YWZFSDW","short_pith_number":"pith:TFVTTZHX","schema_version":"1.0","canonical_sha256":"996b39e4f780195e796a9c798b64b21d8eb88e7bc428bc99fe4809215f04a1be","source":{"kind":"arxiv","id":"2605.14008","version":1},"attestation_state":"computed","paper":{"title":"Predictive Inference via Kernel Density Estimates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Kernel density estimator and recursive kernel predictive processes converge weakly almost surely, with the classic version limiting to compact support and the recursive version to non-compact support.","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Torey Hilbert","submitted_at":"2026-05-13T18:13:03Z","abstract_excerpt":"Kernel density estimation is a widely used nonparametric approach to estimate an unknown distribution. Recent work in Bayesian predictive inference has considered stochastic processes formed by specifying the predictive distribution for the next data point given all observed data such that the resulting predictive distributions converge weakly almost surely. We study two kernel based prediction rules: the classic kernel density estimator, and a recursive version previously introduced for online problems. We show that both processes converge weakly almost surely, which opens the door for new Ba"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14008","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-13T18:13:03Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"07630e42fe917d2d6ce11646b39b65e9e7e8f30379033b4945b35e2840b5e8e3","abstract_canon_sha256":"29e7e1728cf2ccac9783df4dc5e28fc800fd51fbb4b86a1dc7d6da3f3ef406d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:13.090248Z","signature_b64":"Z095PO4LY2GrJpXkzmi4g7r9nQg0JHXZXKJTeLf9DtEjp5YcuvYnp88ldIHEd1nHI0wQHTMev//QkRejf6FcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"996b39e4f780195e796a9c798b64b21d8eb88e7bc428bc99fe4809215f04a1be","last_reissued_at":"2026-05-17T23:39:13.089671Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:13.089671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predictive Inference via Kernel Density Estimates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Kernel density estimator and recursive kernel predictive processes converge weakly almost surely, with the classic version limiting to compact support and the recursive version to non-compact support.","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Torey Hilbert","submitted_at":"2026-05-13T18:13:03Z","abstract_excerpt":"Kernel density estimation is a widely used nonparametric approach to estimate an unknown distribution. Recent work in Bayesian predictive inference has considered stochastic processes formed by specifying the predictive distribution for the next data point given all observed data such that the resulting predictive distributions converge weakly almost surely. We study two kernel based prediction rules: the classic kernel density estimator, and a recursive version previously introduced for online problems. We show that both processes converge weakly almost surely, which opens the door for new Ba"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"We show that both processes converge weakly almost surely, which opens the door for new Bayesian interpretations of kernel density estimation. Surprisingly, the process based on the classic kernel density estimates converges to a compactly supported measure, while the recursive version converges to a non-compactly supported measure.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The underlying data are i.i.d. draws from an unknown distribution, and the kernel and bandwidth sequence satisfy standard regularity conditions that enable weak convergence of the predictive processes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Kernel density estimator and recursive kernel predictive processes converge weakly almost surely, with the classic version limiting to compact support and the recursive version to non-compact support.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"46dc0a1a65758a5d6078fc8fbff823f990c5c7b7bd57dd563a0e361560cc157f"},"source":{"id":"2605.14008","kind":"arxiv","version":1},"verdict":{"id":"13fa364c-42b6-41ee-9726-4e22068697c9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:18:00.258070Z","strongest_claim":"We show that both processes converge weakly almost surely, which opens the door for new Bayesian interpretations of kernel density estimation. Surprisingly, the process based on the classic kernel density estimates converges to a compactly supported measure, while the recursive version converges to a non-compactly supported measure.","one_line_summary":"Kernel density estimator and recursive kernel predictive processes converge weakly almost surely, with the classic version limiting to compact support and the recursive version to non-compact support.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The underlying data are i.i.d. draws from an unknown distribution, and the kernel and bandwidth sequence satisfy standard regularity conditions that enable weak convergence of the predictive processes.","pith_extraction_headline":""},"references":{"count":16,"sample":[{"doi":"","year":2023,"title":"Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=","work_id":"6b004198-279b-4922-9bf4-c58d8e983fb4","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Statistical Science , volume=","work_id":"0891828b-9775-4bf4-8067-5469cc503a17","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Bayesian predictive inference beyond martingales","work_id":"4315e8a7-959a-4638-8eb5-2c1b59a0c3d5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The Annals of Probability , number =","work_id":"52f75c2d-3d9c-4b58-827b-5d28b6624922","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Kernel based Dirichlet sequences , author=. Bernoulli , volume=. 2023 , publisher=","work_id":"3fcaf709-bcc0-4ed0-a5ea-e9894deb8bef","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"30ed11fc4c05446b384381c6634d63db7883dc57aa5b496c8f9f683b10aea4e0","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e2d43ae39d657c17371bfc6d584f49cb5ff733dc6509032c847f4580f418bf16"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.14008","created_at":"2026-05-17T23:39:13.089766+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14008v1","created_at":"2026-05-17T23:39:13.089766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14008","created_at":"2026-05-17T23:39:13.089766+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFVTTZHXQAMV","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFVTTZHXQAMV46LK","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFVTTZHX","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW","json":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW.json","graph_json":"https://pith.science/api/pith-number/TFVTTZHXQAMV46LKTR4YWZFSDW/graph.json","events_json":"https://pith.science/api/pith-number/TFVTTZHXQAMV46LKTR4YWZFSDW/events.json","paper":"https://pith.science/paper/TFVTTZHX"},"agent_actions":{"view_html":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW","download_json":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW.json","view_paper":"https://pith.science/paper/TFVTTZHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14008&json=true","fetch_graph":"https://pith.science/api/pith-number/TFVTTZHXQAMV46LKTR4YWZFSDW/graph.json","fetch_events":"https://pith.science/api/pith-number/TFVTTZHXQAMV46LKTR4YWZFSDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW/action/storage_attestation","attest_author":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW/action/author_attestation","sign_citation":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW/action/citation_signature","submit_replication":"https://pith.science/pith/TFVTTZHXQAMV46LKTR4YWZFSDW/action/replication_record"}},"created_at":"2026-05-17T23:39:13.089766+00:00","updated_at":"2026-05-17T23:39:13.089766+00:00"}