{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DWAY2UTELWSD3OA6NOY5NE5S7W","short_pith_number":"pith:DWAY2UTE","schema_version":"1.0","canonical_sha256":"1d818d52645da43db81e6bb1d693b2fdba0dce4197bb3daf668ae95b113dd85a","source":{"kind":"arxiv","id":"2407.04967","version":1},"attestation_state":"computed","paper":{"title":"posteriordb: Testing, Benchmarking and Developing Bayesian Inference Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Aki Vehtari, Bob Carpenter, Jakob Torgander, Lu Zhang, M{\\aa}ns Magnusson, Paul-Christian B\\\"urkner","submitted_at":"2024-07-06T06:01:02Z","abstract_excerpt":"The generality and robustness of inference algorithms is critical to the success of widely used probabilistic programming languages such as Stan, PyMC, Pyro, and Turing.jl. When designing a new general-purpose inference algorithm, whether it involves Monte Carlo sampling or variational approximation, the fundamental problem arises in evaluating its accuracy and efficiency across a range of representative target models. To solve this problem, we propose posteriordb, a database of models and data sets defining target densities along with reference Monte Carlo draws. We further provide a guide to"},"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":"2407.04967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2024-07-06T06:01:02Z","cross_cats_sorted":[],"title_canon_sha256":"ac8ee2a4c7bacf6be5861140be8d66f6e9d03a75ed822ec8de72bb7057c31183","abstract_canon_sha256":"05d4aed1b03f070d30cd773291c591cb32de2df7a8139b0ff8fae20f7278ac7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:44.350879Z","signature_b64":"gMjnNLdr1r+CIk4L1p9g2DfIw6R76FJdQFzUwIMl+KxbmayKldBm2H3v0u2NV6Ji6dO/9ZOimdRGEJGZMSL+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d818d52645da43db81e6bb1d693b2fdba0dce4197bb3daf668ae95b113dd85a","last_reissued_at":"2026-07-05T08:40:44.350463Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:44.350463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"posteriordb: Testing, Benchmarking and Developing Bayesian Inference Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Aki Vehtari, Bob Carpenter, Jakob Torgander, Lu Zhang, M{\\aa}ns Magnusson, Paul-Christian B\\\"urkner","submitted_at":"2024-07-06T06:01:02Z","abstract_excerpt":"The generality and robustness of inference algorithms is critical to the success of widely used probabilistic programming languages such as Stan, PyMC, Pyro, and Turing.jl. When designing a new general-purpose inference algorithm, whether it involves Monte Carlo sampling or variational approximation, the fundamental problem arises in evaluating its accuracy and efficiency across a range of representative target models. To solve this problem, we propose posteriordb, a database of models and data sets defining target densities along with reference Monte Carlo draws. We further provide a guide to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04967","kind":"arxiv","version":1},"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/2407.04967/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":"2407.04967","created_at":"2026-07-05T08:40:44.350517+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04967v1","created_at":"2026-07-05T08:40:44.350517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04967","created_at":"2026-07-05T08:40:44.350517+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWAY2UTELWSD","created_at":"2026-07-05T08:40:44.350517+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWAY2UTELWSD3OA6","created_at":"2026-07-05T08:40:44.350517+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWAY2UTE","created_at":"2026-07-05T08:40:44.350517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18476","citing_title":"AI4BayesCode: From Natural Language Descriptions to Validated Modular Stateful Bayesian Samplers","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2509.01082","citing_title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2509.09162","citing_title":"Divide, Interact, Sample: The Two-System Paradigm","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W","json":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W.json","graph_json":"https://pith.science/api/pith-number/DWAY2UTELWSD3OA6NOY5NE5S7W/graph.json","events_json":"https://pith.science/api/pith-number/DWAY2UTELWSD3OA6NOY5NE5S7W/events.json","paper":"https://pith.science/paper/DWAY2UTE"},"agent_actions":{"view_html":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W","download_json":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W.json","view_paper":"https://pith.science/paper/DWAY2UTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04967&json=true","fetch_graph":"https://pith.science/api/pith-number/DWAY2UTELWSD3OA6NOY5NE5S7W/graph.json","fetch_events":"https://pith.science/api/pith-number/DWAY2UTELWSD3OA6NOY5NE5S7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W/action/storage_attestation","attest_author":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W/action/author_attestation","sign_citation":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W/action/citation_signature","submit_replication":"https://pith.science/pith/DWAY2UTELWSD3OA6NOY5NE5S7W/action/replication_record"}},"created_at":"2026-07-05T08:40:44.350517+00:00","updated_at":"2026-07-05T08:40:44.350517+00:00"}