{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WIMXGEKYR5IL2UEVSV4GOBYPF6","short_pith_number":"pith:WIMXGEKY","canonical_record":{"source":{"id":"1401.0118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T09:32:43Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"f1b7c2904f072534a202e21007033bb574ad02e3110057e33dc7aebe5daeed15","abstract_canon_sha256":"14ddcf576a2bf84ae66239260818bfd1b4801e7f538af92fb4ec0980fa093c19"},"schema_version":"1.0"},"canonical_sha256":"b2197311588f50bd5095957867070f2fb45e48e65c857850b41b769ba8e7017f","source":{"kind":"arxiv","id":"1401.0118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0118","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0118v1","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0118","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"WIMXGEKYR5IL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WIMXGEKYR5IL2UEV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WIMXGEKY","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WIMXGEKYR5IL2UEVSV4GOBYPF6","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T09:32:43Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"f1b7c2904f072534a202e21007033bb574ad02e3110057e33dc7aebe5daeed15","abstract_canon_sha256":"14ddcf576a2bf84ae66239260818bfd1b4801e7f538af92fb4ec0980fa093c19"},"schema_version":"1.0"},"canonical_sha256":"b2197311588f50bd5095957867070f2fb45e48e65c857850b41b769ba8e7017f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:30.990599Z","signature_b64":"2JFU+q59TJuLId3PMz2WewRgJX4pJWzaGeGtkGeJs9mn83ku9cYV0jiUiMlSEbjjn3ISMZt3EW6SwEhMBaEGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2197311588f50bd5095957867070f2fb45e48e65c857850b41b769ba8e7017f","last_reissued_at":"2026-05-18T03:03:30.990016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:30.990016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0118","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93ytBimZS4/PlZ43QSc6Ff9qA7M0YXVadYJdNzJj6jP+loZZhLrfy8SEsurocA61Emg0sNIwubogdQ2EMGBpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:53:51.523812Z"},"content_sha256":"81a30f6d77db4bbbeeb05b59205c9234475d0246684ca73427c7704f8ae1e15a","schema_version":"1.0","event_id":"sha256:81a30f6d77db4bbbeeb05b59205c9234475d0246684ca73427c7704f8ae1e15a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WIMXGEKYR5IL2UEVSV4GOBYPF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Black Box Variational Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"David M. Blei, Rajesh Ranganath, Sean Gerrish","submitted_at":"2013-12-31T09:32:43Z","abstract_excerpt":"Variational inference has become a widely used method to approximate posteriors in complex latent variables models. However, deriving a variational inference algorithm generally requires significant model-specific analysis, and these efforts can hinder and deter us from quickly developing and exploring a variety of models for a problem at hand. In this paper, we present a \"black box\" variational inference algorithm, one that can be quickly applied to many models with little additional derivation. Our method is based on a stochastic optimization of the variational objective where the noisy grad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0118","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHZRmsyVGL7YR3C7aOxaM5auH96dJws9a4eVtocPGWRwun1h9eCuC3UgAWsVy1XeJ33vBr393kh7aTPalQ4zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:53:51.524164Z"},"content_sha256":"73be95e278a2845b9f59e1d827a32e5dbb9ee11a7a54c917737378beec72572f","schema_version":"1.0","event_id":"sha256:73be95e278a2845b9f59e1d827a32e5dbb9ee11a7a54c917737378beec72572f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIMXGEKYR5IL2UEVSV4GOBYPF6/bundle.json","state_url":"https://pith.science/pith/WIMXGEKYR5IL2UEVSV4GOBYPF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIMXGEKYR5IL2UEVSV4GOBYPF6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T04:53:51Z","links":{"resolver":"https://pith.science/pith/WIMXGEKYR5IL2UEVSV4GOBYPF6","bundle":"https://pith.science/pith/WIMXGEKYR5IL2UEVSV4GOBYPF6/bundle.json","state":"https://pith.science/pith/WIMXGEKYR5IL2UEVSV4GOBYPF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIMXGEKYR5IL2UEVSV4GOBYPF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WIMXGEKYR5IL2UEVSV4GOBYPF6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"14ddcf576a2bf84ae66239260818bfd1b4801e7f538af92fb4ec0980fa093c19","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T09:32:43Z","title_canon_sha256":"f1b7c2904f072534a202e21007033bb574ad02e3110057e33dc7aebe5daeed15"},"schema_version":"1.0","source":{"id":"1401.0118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0118","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0118v1","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0118","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"WIMXGEKYR5IL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WIMXGEKYR5IL2UEV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WIMXGEKY","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:73be95e278a2845b9f59e1d827a32e5dbb9ee11a7a54c917737378beec72572f","target":"graph","created_at":"2026-05-18T03:03:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Variational inference has become a widely used method to approximate posteriors in complex latent variables models. However, deriving a variational inference algorithm generally requires significant model-specific analysis, and these efforts can hinder and deter us from quickly developing and exploring a variety of models for a problem at hand. In this paper, we present a \"black box\" variational inference algorithm, one that can be quickly applied to many models with little additional derivation. Our method is based on a stochastic optimization of the variational objective where the noisy grad","authors_text":"David M. Blei, Rajesh Ranganath, Sean Gerrish","cross_cats":["cs.LG","stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T09:32:43Z","title":"Black Box Variational Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0118","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:81a30f6d77db4bbbeeb05b59205c9234475d0246684ca73427c7704f8ae1e15a","target":"record","created_at":"2026-05-18T03:03:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"14ddcf576a2bf84ae66239260818bfd1b4801e7f538af92fb4ec0980fa093c19","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T09:32:43Z","title_canon_sha256":"f1b7c2904f072534a202e21007033bb574ad02e3110057e33dc7aebe5daeed15"},"schema_version":"1.0","source":{"id":"1401.0118","kind":"arxiv","version":1}},"canonical_sha256":"b2197311588f50bd5095957867070f2fb45e48e65c857850b41b769ba8e7017f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2197311588f50bd5095957867070f2fb45e48e65c857850b41b769ba8e7017f","first_computed_at":"2026-05-18T03:03:30.990016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:30.990016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2JFU+q59TJuLId3PMz2WewRgJX4pJWzaGeGtkGeJs9mn83ku9cYV0jiUiMlSEbjjn3ISMZt3EW6SwEhMBaEGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:30.990599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81a30f6d77db4bbbeeb05b59205c9234475d0246684ca73427c7704f8ae1e15a","sha256:73be95e278a2845b9f59e1d827a32e5dbb9ee11a7a54c917737378beec72572f"],"state_sha256":"58c52ee76f3ef282aa927011f5b06fc831c2ab852ffffa8cd6676aa3f6eac8f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzfcrG/WtPQLSNU/FIP8002UWF95UjWRtx1RsesMIChonsUuvZqsdHsFD9KE8X+fcUMHAiJlJ1jml8G8zCebCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:53:51.526178Z","bundle_sha256":"8c01596c9b494939758a6f4fd46a5c5ad0d4615bb412170430c706555215e580"}}