{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KAM5YTIX2ERWDYWJRUXYXEIN5S","short_pith_number":"pith:KAM5YTIX","schema_version":"1.0","canonical_sha256":"5019dc4d17d12361e2c98d2f8b910decaeda5eb413df797052fffbe7275860c4","source":{"kind":"arxiv","id":"2408.13230","version":3},"attestation_state":"computed","paper":{"title":"Amortized Bayesian Multilevel Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Andreas Bulling, Daniel Habermann, Lars K\\\"uhmichel, Marvin Schmitt, Paul-Christian B\\\"urkner, Stefan T. Radev","submitted_at":"2024-08-23T17:11:04Z","abstract_excerpt":"Multilevel models (MLMs) are a central building block of the Bayesian workflow. They enable joint, interpretable modeling of data across hierarchical levels and provide a fully probabilistic quantification of uncertainty. Despite their well-recognized advantages, MLMs pose significant computational challenges, often rendering their estimation and evaluation intractable within reasonable time constraints. Recent advances in simulation-based inference offer promising solutions for addressing complex probabilistic models using deep generative networks. However, the utility and reliability of deep"},"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":"2408.13230","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2024-08-23T17:11:04Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"27ba63feb046ab40a48f5e35ea830fff5da11b0b3981265c2ba3363f8f2568b0","abstract_canon_sha256":"5e6000474263871d8f9c40c919a3f1b7beeeaeb6f14dad266667eee2bdd69acc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:35.114911Z","signature_b64":"3P8oT8jX+5oV1PvaXI/+hwrlNnHaUL8hIC6RphV5NGI19+T5ei0pnP+hLnlpCRSmbrqHJGWhII/OOhowg1JyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5019dc4d17d12361e2c98d2f8b910decaeda5eb413df797052fffbe7275860c4","last_reissued_at":"2026-07-05T11:21:35.114374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:35.114374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amortized Bayesian Multilevel Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Andreas Bulling, Daniel Habermann, Lars K\\\"uhmichel, Marvin Schmitt, Paul-Christian B\\\"urkner, Stefan T. Radev","submitted_at":"2024-08-23T17:11:04Z","abstract_excerpt":"Multilevel models (MLMs) are a central building block of the Bayesian workflow. They enable joint, interpretable modeling of data across hierarchical levels and provide a fully probabilistic quantification of uncertainty. Despite their well-recognized advantages, MLMs pose significant computational challenges, often rendering their estimation and evaluation intractable within reasonable time constraints. Recent advances in simulation-based inference offer promising solutions for addressing complex probabilistic models using deep generative networks. However, the utility and reliability of deep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13230","kind":"arxiv","version":3},"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/2408.13230/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":"2408.13230","created_at":"2026-07-05T11:21:35.114434+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.13230v3","created_at":"2026-07-05T11:21:35.114434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13230","created_at":"2026-07-05T11:21:35.114434+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAM5YTIX2ERW","created_at":"2026-07-05T11:21:35.114434+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAM5YTIX2ERWDYWJ","created_at":"2026-07-05T11:21:35.114434+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAM5YTIX","created_at":"2026-07-05T11:21:35.114434+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20723","citing_title":"Tokenised Flow Matching for Hierarchical Simulation Based Inference","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S","json":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S.json","graph_json":"https://pith.science/api/pith-number/KAM5YTIX2ERWDYWJRUXYXEIN5S/graph.json","events_json":"https://pith.science/api/pith-number/KAM5YTIX2ERWDYWJRUXYXEIN5S/events.json","paper":"https://pith.science/paper/KAM5YTIX"},"agent_actions":{"view_html":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S","download_json":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S.json","view_paper":"https://pith.science/paper/KAM5YTIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.13230&json=true","fetch_graph":"https://pith.science/api/pith-number/KAM5YTIX2ERWDYWJRUXYXEIN5S/graph.json","fetch_events":"https://pith.science/api/pith-number/KAM5YTIX2ERWDYWJRUXYXEIN5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S/action/storage_attestation","attest_author":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S/action/author_attestation","sign_citation":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S/action/citation_signature","submit_replication":"https://pith.science/pith/KAM5YTIX2ERWDYWJRUXYXEIN5S/action/replication_record"}},"created_at":"2026-07-05T11:21:35.114434+00:00","updated_at":"2026-07-05T11:21:35.114434+00:00"}