{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K24MLFHKUHHSS642KBB2U6QPCR","short_pith_number":"pith:K24MLFHK","schema_version":"1.0","canonical_sha256":"56b8c594eaa1cf297b9a5043aa7a0f147cf0fb300e6b3aff7c3a67379e5c9817","source":{"kind":"arxiv","id":"2501.18665","version":2},"attestation_state":"computed","paper":{"title":"BARNN: A Bayesian Autoregressive and Recurrent Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dario Coscia, Gianluigi Rozza, Max Welling, Nicola Demo","submitted_at":"2025-01-30T15:44:04Z","abstract_excerpt":"Autoregressive and recurrent networks have achieved remarkable progress across various fields, from weather forecasting to molecular generation and Large Language Models. Despite their strong predictive capabilities, these models lack a rigorous framework for addressing uncertainty, which is key in scientific applications such as PDE solving, molecular generation and Machine Learning Force Fields. To address this shortcoming we present BARNN: a variational Bayesian Autoregressive and Recurrent Neural Network. BARNNs aim to provide a principled way to turn any autoregressive or recurrent model "},"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":"2501.18665","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-30T15:44:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fec87e5d2bf346d5bf4025662135e674abb3312c6dcc52deac5a1e4fc4489c50","abstract_canon_sha256":"d7d51a853c58893bd1fc360fc9e081728476c9b94ef5bd5eb082f55e5d2627e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:47.767381Z","signature_b64":"THLFaYt0XIbp5BmMrI3O5Z4WBeoSUdLeMRCh/O3Pgp0rkYzTX+0PJLAboNZS5Ch6Hn71K0q4WncnlGE3DeQSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56b8c594eaa1cf297b9a5043aa7a0f147cf0fb300e6b3aff7c3a67379e5c9817","last_reissued_at":"2026-07-05T11:39:47.766849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:47.766849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BARNN: A Bayesian Autoregressive and Recurrent Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dario Coscia, Gianluigi Rozza, Max Welling, Nicola Demo","submitted_at":"2025-01-30T15:44:04Z","abstract_excerpt":"Autoregressive and recurrent networks have achieved remarkable progress across various fields, from weather forecasting to molecular generation and Large Language Models. Despite their strong predictive capabilities, these models lack a rigorous framework for addressing uncertainty, which is key in scientific applications such as PDE solving, molecular generation and Machine Learning Force Fields. To address this shortcoming we present BARNN: a variational Bayesian Autoregressive and Recurrent Neural Network. BARNNs aim to provide a principled way to turn any autoregressive or recurrent model "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18665","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/2501.18665/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":"2501.18665","created_at":"2026-07-05T11:39:47.766914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18665v2","created_at":"2026-07-05T11:39:47.766914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18665","created_at":"2026-07-05T11:39:47.766914+00:00"},{"alias_kind":"pith_short_12","alias_value":"K24MLFHKUHHS","created_at":"2026-07-05T11:39:47.766914+00:00"},{"alias_kind":"pith_short_16","alias_value":"K24MLFHKUHHSS642","created_at":"2026-07-05T11:39:47.766914+00:00"},{"alias_kind":"pith_short_8","alias_value":"K24MLFHK","created_at":"2026-07-05T11:39:47.766914+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13416","citing_title":"Single- to multi-fidelity history-dependent learning with uncertainty quantification and disentanglement: application to data-driven constitutive modeling","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR","json":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR.json","graph_json":"https://pith.science/api/pith-number/K24MLFHKUHHSS642KBB2U6QPCR/graph.json","events_json":"https://pith.science/api/pith-number/K24MLFHKUHHSS642KBB2U6QPCR/events.json","paper":"https://pith.science/paper/K24MLFHK"},"agent_actions":{"view_html":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR","download_json":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR.json","view_paper":"https://pith.science/paper/K24MLFHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18665&json=true","fetch_graph":"https://pith.science/api/pith-number/K24MLFHKUHHSS642KBB2U6QPCR/graph.json","fetch_events":"https://pith.science/api/pith-number/K24MLFHKUHHSS642KBB2U6QPCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR/action/storage_attestation","attest_author":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR/action/author_attestation","sign_citation":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR/action/citation_signature","submit_replication":"https://pith.science/pith/K24MLFHKUHHSS642KBB2U6QPCR/action/replication_record"}},"created_at":"2026-07-05T11:39:47.766914+00:00","updated_at":"2026-07-05T11:39:47.766914+00:00"}