{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GSARAY4YJTJQQVMXDT6F42CAOA","short_pith_number":"pith:GSARAY4Y","schema_version":"1.0","canonical_sha256":"34811063984cd30855971cfc5e6840702efa9c968b6574227193a04604876503","source":{"kind":"arxiv","id":"2110.11790","version":1},"attestation_state":"computed","paper":{"title":"Automatic Guide Generation for Stan via NumPyro","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Guillaume Baudart, Louis Mandel","submitted_at":"2021-10-22T13:42:48Z","abstract_excerpt":"Stan is a very popular probabilistic language with a state-of-the-art HMC sampler but it only offers a limited choice of algorithms for black-box variational inference. In this paper, we show that using our recently proposed compiler from Stan to Pyro, Stan users can easily try the set of algorithms implemented in Pyro for black-box variational inference. We evaluate our approach on PosteriorDB, a database of Stan models with corresponding data and reference posterior samples. Results show that the eight algorithms available in Pyro offer a range of possible compromises between complexity and "},"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":"2110.11790","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-10-22T13:42:48Z","cross_cats_sorted":[],"title_canon_sha256":"25064e983d7649aeee17d08b457cdb37ab811b264605e8a49b3d614d9cfc7031","abstract_canon_sha256":"e7149f0ca55566ed452f7691864c171fae6b5e49fb2dee6173ce9e1cd78ad1fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:51.212838Z","signature_b64":"ym3wY3tUGruahQkQ53dnRwh+Wo0xSUz+aFMNjo7+9bgrh/wU7GTzMhaCSFapFKpO6AOM4qY6/l8ACTMEt7BoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34811063984cd30855971cfc5e6840702efa9c968b6574227193a04604876503","last_reissued_at":"2026-07-05T03:24:51.212522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:51.212522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Guide Generation for Stan via NumPyro","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Guillaume Baudart, Louis Mandel","submitted_at":"2021-10-22T13:42:48Z","abstract_excerpt":"Stan is a very popular probabilistic language with a state-of-the-art HMC sampler but it only offers a limited choice of algorithms for black-box variational inference. In this paper, we show that using our recently proposed compiler from Stan to Pyro, Stan users can easily try the set of algorithms implemented in Pyro for black-box variational inference. We evaluate our approach on PosteriorDB, a database of Stan models with corresponding data and reference posterior samples. Results show that the eight algorithms available in Pyro offer a range of possible compromises between complexity and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11790","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/2110.11790/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":"2110.11790","created_at":"2026-07-05T03:24:51.212569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.11790v1","created_at":"2026-07-05T03:24:51.212569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11790","created_at":"2026-07-05T03:24:51.212569+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSARAY4YJTJQ","created_at":"2026-07-05T03:24:51.212569+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSARAY4YJTJQQVMX","created_at":"2026-07-05T03:24:51.212569+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSARAY4Y","created_at":"2026-07-05T03:24:51.212569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.08824","citing_title":"Disentangling impact of capacity, objective, batchsize, estimators, and step-size on flow VI","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA","json":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA.json","graph_json":"https://pith.science/api/pith-number/GSARAY4YJTJQQVMXDT6F42CAOA/graph.json","events_json":"https://pith.science/api/pith-number/GSARAY4YJTJQQVMXDT6F42CAOA/events.json","paper":"https://pith.science/paper/GSARAY4Y"},"agent_actions":{"view_html":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA","download_json":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA.json","view_paper":"https://pith.science/paper/GSARAY4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.11790&json=true","fetch_graph":"https://pith.science/api/pith-number/GSARAY4YJTJQQVMXDT6F42CAOA/graph.json","fetch_events":"https://pith.science/api/pith-number/GSARAY4YJTJQQVMXDT6F42CAOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA/action/storage_attestation","attest_author":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA/action/author_attestation","sign_citation":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA/action/citation_signature","submit_replication":"https://pith.science/pith/GSARAY4YJTJQQVMXDT6F42CAOA/action/replication_record"}},"created_at":"2026-07-05T03:24:51.212569+00:00","updated_at":"2026-07-05T03:24:51.212569+00:00"}