{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FESRXJXNF2FDV4TFRUUATHCTEO","short_pith_number":"pith:FESRXJXN","schema_version":"1.0","canonical_sha256":"29251ba6ed2e8a3af2658d28099c5323bf6e877b736c6dd55d2003a832cc3114","source":{"kind":"arxiv","id":"2406.00104","version":2},"attestation_state":"computed","paper":{"title":"Scalable Bayesian Learning with posteriors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Simpson, Johnathan Chiu, Kaelan Donatella, Phoebe Klett, Samuel Duffield","submitted_at":"2024-05-31T18:00:12Z","abstract_excerpt":"Although theoretically compelling, Bayesian learning with modern machine learning models is computationally challenging since it requires approximating a high dimensional posterior distribution. In this work, we (i) introduce posteriors, an easily extensible PyTorch library hosting general-purpose implementations making Bayesian learning accessible and scalable to large data and parameter regimes; (ii) present a tempered framing of stochastic gradient Markov chain Monte Carlo, as implemented in posteriors, that transitions seamlessly into optimization and unveils a minor modification to deep e"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2406.00104","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T18:00:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7be677418cbadb497d758d47850ecaa093ff710ef0ecda5e8779ff03f2cfcec6","abstract_canon_sha256":"d946e431e591ec87839b26a0c5c936f73dab45e2174af78583b2b8e72520380e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:57.154684Z","signature_b64":"mab50hvBTscvPFe9w3LFkaEBL3VOxpGG/Fs5ehqm84upquI2eBJq9mFevwKUMM8OO1csoPj/hLNNlD9NfVjbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29251ba6ed2e8a3af2658d28099c5323bf6e877b736c6dd55d2003a832cc3114","last_reissued_at":"2026-07-05T10:48:57.154163Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:57.154163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Bayesian Learning with posteriors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Simpson, Johnathan Chiu, Kaelan Donatella, Phoebe Klett, Samuel Duffield","submitted_at":"2024-05-31T18:00:12Z","abstract_excerpt":"Although theoretically compelling, Bayesian learning with modern machine learning models is computationally challenging since it requires approximating a high dimensional posterior distribution. In this work, we (i) introduce posteriors, an easily extensible PyTorch library hosting general-purpose implementations making Bayesian learning accessible and scalable to large data and parameter regimes; (ii) present a tempered framing of stochastic gradient Markov chain Monte Carlo, as implemented in posteriors, that transitions seamlessly into optimization and unveils a minor modification to deep e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00104","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.00104/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.00104","created_at":"2026-07-05T10:48:57.154209+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.00104v2","created_at":"2026-07-05T10:48:57.154209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00104","created_at":"2026-07-05T10:48:57.154209+00:00"},{"alias_kind":"pith_short_12","alias_value":"FESRXJXNF2FD","created_at":"2026-07-05T10:48:57.154209+00:00"},{"alias_kind":"pith_short_16","alias_value":"FESRXJXNF2FDV4TF","created_at":"2026-07-05T10:48:57.154209+00:00"},{"alias_kind":"pith_short_8","alias_value":"FESRXJXN","created_at":"2026-07-05T10:48:57.154209+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.11412","citing_title":"Uncertainty quantification with approximate variational learning for wearable photoplethysmography prediction tasks","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO","json":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO.json","graph_json":"https://pith.science/api/pith-number/FESRXJXNF2FDV4TFRUUATHCTEO/graph.json","events_json":"https://pith.science/api/pith-number/FESRXJXNF2FDV4TFRUUATHCTEO/events.json","paper":"https://pith.science/paper/FESRXJXN"},"agent_actions":{"view_html":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO","download_json":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO.json","view_paper":"https://pith.science/paper/FESRXJXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.00104&json=true","fetch_graph":"https://pith.science/api/pith-number/FESRXJXNF2FDV4TFRUUATHCTEO/graph.json","fetch_events":"https://pith.science/api/pith-number/FESRXJXNF2FDV4TFRUUATHCTEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO/action/storage_attestation","attest_author":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO/action/author_attestation","sign_citation":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO/action/citation_signature","submit_replication":"https://pith.science/pith/FESRXJXNF2FDV4TFRUUATHCTEO/action/replication_record"}},"created_at":"2026-07-05T10:48:57.154209+00:00","updated_at":"2026-07-05T10:48:57.154209+00:00"}