{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q4AMPNU5KYXMJCSZ6TPV4I2BXS","short_pith_number":"pith:Q4AMPNU5","canonical_record":{"source":{"id":"2604.27442","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-04-30T05:29:06Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"f45db0a01905c0764b6d6c64779a2956ea26c73ef25365783754f7ba3bb7c606","abstract_canon_sha256":"c52da6ac5ca8b93c632b6dcbb546e27924dccc2ffeae31588d763db780edd4f0"},"schema_version":"1.0"},"canonical_sha256":"8700c7b69d562ec48a59f4df5e2341bcb08d22352d974d6ba751f97729f773b0","source":{"kind":"arxiv","id":"2604.27442","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27442","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27442v2","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27442","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"Q4AMPNU5KYXM","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"Q4AMPNU5KYXMJCSZ","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"Q4AMPNU5","created_at":"2026-06-11T01:09:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q4AMPNU5KYXMJCSZ6TPV4I2BXS","target":"record","payload":{"canonical_record":{"source":{"id":"2604.27442","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-04-30T05:29:06Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"f45db0a01905c0764b6d6c64779a2956ea26c73ef25365783754f7ba3bb7c606","abstract_canon_sha256":"c52da6ac5ca8b93c632b6dcbb546e27924dccc2ffeae31588d763db780edd4f0"},"schema_version":"1.0"},"canonical_sha256":"8700c7b69d562ec48a59f4df5e2341bcb08d22352d974d6ba751f97729f773b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:36.572424Z","signature_b64":"AKI8Ef1u8CZ/O22oUE1qrvxqHfPJz7fMR1NMmElWHXkpbOrINjQyfcUFuSuZE4tkLrpKAfrwZ9NThzsaAzQECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8700c7b69d562ec48a59f4df5e2341bcb08d22352d974d6ba751f97729f773b0","last_reissued_at":"2026-06-11T01:09:36.571493Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:36.571493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.27442","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hc1g/cJKENzyRlc3Js3fYJj+cc40nKu3wspoN9KTzAYg6/EYmCEOjr2UEAI3hSyn+xRqH9XTNEkuOA9gC5aeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:46:46.140160Z"},"content_sha256":"291c4562fd7c849edd8eabac7d326445f4df937a051b5d74090d9b8559935f62","schema_version":"1.0","event_id":"sha256:291c4562fd7c849edd8eabac7d326445f4df937a051b5d74090d9b8559935f62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q4AMPNU5KYXMJCSZ6TPV4I2BXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian online learning in the one-pass regime: Frequentist validity and uncertainty quantification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A Bayesian algorithm for one-pass online learning achieves optimal posterior convergence and an online Bernstein-von Mises theorem.","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Dongguen Kim, Jeyong Lee, Junhyeok Choi, Minwoo Chae","submitted_at":"2026-04-30T05:29:06Z","abstract_excerpt":"Bayesian online learning provides a coherent framework for sequential inference. However, its theoretical understanding remains limited, particularly in the one-pass setting. Existing theoretical guarantees typically require the mini-batch sample size to diverge, a condition that fails in the one-pass regime. In this paper, we propose a new Bayesian online learning algorithm tailored to the one-pass setting, which incorporates a warm-start phase to ensure stable sequential updates. For this algorithm, we show that the sequentially updated posterior attains the optimal convergence rate. Buildin"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For this algorithm, we show that the sequentially updated posterior attains the optimal convergence rate. Building on this, we establish an online analogue of the Bernstein-von Mises theorem, which guarantees valid uncertainty quantification without diverging mini-batch sample sizes.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis assumes that a warm-start phase can be incorporated to ensure stable sequential updates in the one-pass regime without violating the single-pass constraint or requiring additional conditions that may not hold for general data streams.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A one-pass Bayesian online learner with warm-start achieves optimal posterior convergence and satisfies an online Bernstein-von Mises theorem for uncertainty quantification.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A Bayesian algorithm for one-pass online learning achieves optimal posterior convergence and an online Bernstein-von Mises theorem.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3868beb3161d7d79e5dc55114aeb31a75550dedb80d17bf35117cb471f4d951c"},"source":{"id":"2604.27442","kind":"arxiv","version":2},"verdict":{"id":"749f3fdd-a492-46ea-acbd-c9997c88b67d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T09:30:33.058261Z","strongest_claim":"For this algorithm, we show that the sequentially updated posterior attains the optimal convergence rate. Building on this, we establish an online analogue of the Bernstein-von Mises theorem, which guarantees valid uncertainty quantification without diverging mini-batch sample sizes.","one_line_summary":"A one-pass Bayesian online learner with warm-start achieves optimal posterior convergence and satisfies an online Bernstein-von Mises theorem for uncertainty quantification.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis assumes that a warm-start phase can be incorporated to ensure stable sequential updates in the one-pass regime without violating the single-pass constraint or requiring additional conditions that may not hold for general data streams.","pith_extraction_headline":"A Bayesian algorithm for one-pass online learning achieves optimal posterior convergence and an online Bernstein-von Mises theorem."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.27442/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T22:36:20.026917Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:15:21.381726Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"76b857ecaa62c06bb110e88e5a8403c7d73d6678699a61c9d3936bda54a4f061"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"749f3fdd-a492-46ea-acbd-c9997c88b67d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trFjmKJPnmBZTrMdg0O7agB45iWWtXsRRyIX6O9Y/Oylnblbdw4Nqvl+e3XB4hdkWsbxMfLkRjbNPv8EDcbEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:46:46.140689Z"},"content_sha256":"0937473365e5fac71ca19ac63845f393be7ccd623f2704ef960e1cba6a8db903","schema_version":"1.0","event_id":"sha256:0937473365e5fac71ca19ac63845f393be7ccd623f2704ef960e1cba6a8db903"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4AMPNU5KYXMJCSZ6TPV4I2BXS/bundle.json","state_url":"https://pith.science/pith/Q4AMPNU5KYXMJCSZ6TPV4I2BXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4AMPNU5KYXMJCSZ6TPV4I2BXS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T11:46:46Z","links":{"resolver":"https://pith.science/pith/Q4AMPNU5KYXMJCSZ6TPV4I2BXS","bundle":"https://pith.science/pith/Q4AMPNU5KYXMJCSZ6TPV4I2BXS/bundle.json","state":"https://pith.science/pith/Q4AMPNU5KYXMJCSZ6TPV4I2BXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4AMPNU5KYXMJCSZ6TPV4I2BXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q4AMPNU5KYXMJCSZ6TPV4I2BXS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c52da6ac5ca8b93c632b6dcbb546e27924dccc2ffeae31588d763db780edd4f0","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-04-30T05:29:06Z","title_canon_sha256":"f45db0a01905c0764b6d6c64779a2956ea26c73ef25365783754f7ba3bb7c606"},"schema_version":"1.0","source":{"id":"2604.27442","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27442","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27442v2","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27442","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"Q4AMPNU5KYXM","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"Q4AMPNU5KYXMJCSZ","created_at":"2026-06-11T01:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"Q4AMPNU5","created_at":"2026-06-11T01:09:36Z"}],"graph_snapshots":[{"event_id":"sha256:0937473365e5fac71ca19ac63845f393be7ccd623f2704ef960e1cba6a8db903","target":"graph","created_at":"2026-06-11T01:09:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For this algorithm, we show that the sequentially updated posterior attains the optimal convergence rate. Building on this, we establish an online analogue of the Bernstein-von Mises theorem, which guarantees valid uncertainty quantification without diverging mini-batch sample sizes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis assumes that a warm-start phase can be incorporated to ensure stable sequential updates in the one-pass regime without violating the single-pass constraint or requiring additional conditions that may not hold for general data streams."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A one-pass Bayesian online learner with warm-start achieves optimal posterior convergence and satisfies an online Bernstein-von Mises theorem for uncertainty quantification."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A Bayesian algorithm for one-pass online learning achieves optimal posterior convergence and an online Bernstein-von Mises theorem."}],"snapshot_sha256":"3868beb3161d7d79e5dc55114aeb31a75550dedb80d17bf35117cb471f4d951c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T22:36:20.026917Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:15:21.381726Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.27442/integrity.json","findings":[],"snapshot_sha256":"76b857ecaa62c06bb110e88e5a8403c7d73d6678699a61c9d3936bda54a4f061","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bayesian online learning provides a coherent framework for sequential inference. However, its theoretical understanding remains limited, particularly in the one-pass setting. Existing theoretical guarantees typically require the mini-batch sample size to diverge, a condition that fails in the one-pass regime. In this paper, we propose a new Bayesian online learning algorithm tailored to the one-pass setting, which incorporates a warm-start phase to ensure stable sequential updates. For this algorithm, we show that the sequentially updated posterior attains the optimal convergence rate. Buildin","authors_text":"Dongguen Kim, Jeyong Lee, Junhyeok Choi, Minwoo Chae","cross_cats":["stat.ML","stat.TH"],"headline":"A Bayesian algorithm for one-pass online learning achieves optimal posterior convergence and an online Bernstein-von Mises theorem.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-04-30T05:29:06Z","title":"Bayesian online learning in the one-pass regime: Frequentist validity and uncertainty quantification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.27442","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T09:30:33.058261Z","id":"749f3fdd-a492-46ea-acbd-c9997c88b67d","model_set":{"reader":"grok-4.3"},"one_line_summary":"A one-pass Bayesian online learner with warm-start achieves optimal posterior convergence and satisfies an online Bernstein-von Mises theorem for uncertainty quantification.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A Bayesian algorithm for one-pass online learning achieves optimal posterior convergence and an online Bernstein-von Mises theorem.","strongest_claim":"For this algorithm, we show that the sequentially updated posterior attains the optimal convergence rate. Building on this, we establish an online analogue of the Bernstein-von Mises theorem, which guarantees valid uncertainty quantification without diverging mini-batch sample sizes.","weakest_assumption":"The analysis assumes that a warm-start phase can be incorporated to ensure stable sequential updates in the one-pass regime without violating the single-pass constraint or requiring additional conditions that may not hold for general data streams."}},"verdict_id":"749f3fdd-a492-46ea-acbd-c9997c88b67d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:291c4562fd7c849edd8eabac7d326445f4df937a051b5d74090d9b8559935f62","target":"record","created_at":"2026-06-11T01:09:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c52da6ac5ca8b93c632b6dcbb546e27924dccc2ffeae31588d763db780edd4f0","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-04-30T05:29:06Z","title_canon_sha256":"f45db0a01905c0764b6d6c64779a2956ea26c73ef25365783754f7ba3bb7c606"},"schema_version":"1.0","source":{"id":"2604.27442","kind":"arxiv","version":2}},"canonical_sha256":"8700c7b69d562ec48a59f4df5e2341bcb08d22352d974d6ba751f97729f773b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8700c7b69d562ec48a59f4df5e2341bcb08d22352d974d6ba751f97729f773b0","first_computed_at":"2026-06-11T01:09:36.571493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:36.571493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKI8Ef1u8CZ/O22oUE1qrvxqHfPJz7fMR1NMmElWHXkpbOrINjQyfcUFuSuZE4tkLrpKAfrwZ9NThzsaAzQECg==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:36.572424Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.27442","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:291c4562fd7c849edd8eabac7d326445f4df937a051b5d74090d9b8559935f62","sha256:0937473365e5fac71ca19ac63845f393be7ccd623f2704ef960e1cba6a8db903"],"state_sha256":"2205208fcfbb5e6276d6f487fa76b5d43dafa097fa566a2f08032bca85d1f50a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRukmx3ZgR5wA1sOVYxt2303D10qw9gtEekan3FZClZB8nh2lJBYeEzzbjMWz2dcMLQYVb3i7kvCzmZ8SrvCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T11:46:46.143043Z","bundle_sha256":"5255fe916e56ac698f01fb1847ef35949804faa999f3cab8130978056cc6a744"}}