{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KFJ5UVBHHKWTNQXVS47UIRDC6Q","short_pith_number":"pith:KFJ5UVBH","canonical_record":{"source":{"id":"1703.07169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-21T12:33:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b916d86f503033d661682122da89f163c590327e2cd0fefc77686cb28b69e78c","abstract_canon_sha256":"1ae0dfd762cd9f4408854d7b1a8a98d2bed4ba10b3a8f448cd4f8eb495a8ef8f"},"schema_version":"1.0"},"canonical_sha256":"5153da54273aad36c2f5973f444462f4289c3a9069a5e7838306cfc4977bc800","source":{"kind":"arxiv","id":"1703.07169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07169","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07169v1","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07169","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"KFJ5UVBHHKWT","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KFJ5UVBHHKWTNQXV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KFJ5UVBH","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KFJ5UVBHHKWTNQXVS47UIRDC6Q","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-21T12:33:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b916d86f503033d661682122da89f163c590327e2cd0fefc77686cb28b69e78c","abstract_canon_sha256":"1ae0dfd762cd9f4408854d7b1a8a98d2bed4ba10b3a8f448cd4f8eb495a8ef8f"},"schema_version":"1.0"},"canonical_sha256":"5153da54273aad36c2f5973f444462f4289c3a9069a5e7838306cfc4977bc800","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:11.124951Z","signature_b64":"ou0kWgotZBuscDHqTNJUawlNYY0+B95Rh6z6YO1wDYU70p8eqeC3fWUCS3DlJM8+KL0MhXk5yJuJxF8upr1qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5153da54273aad36c2f5973f444462f4289c3a9069a5e7838306cfc4977bc800","last_reissued_at":"2026-05-18T00:48:11.124368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:11.124368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07169","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-18T00:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Az0sNwViLJiEESLC04q8cIFTLpfaVyAKNXPlY2U7EaMthvEsTmNf12OtgliEV9l/Lt13QBNtVXF3R5vcVR81BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:21:26.357953Z"},"content_sha256":"ef2b0347f7b9f7c8021d4e1726a41e58daae7417f45acb717b8d1ae9568b1de4","schema_version":"1.0","event_id":"sha256:ef2b0347f7b9f7c8021d4e1726a41e58daae7417f45acb717b8d1ae9568b1de4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KFJ5UVBHHKWTNQXVS47UIRDC6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Global Optimization Method for Variational Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Andrew C. Trapp, Hachem Saddiki, Patrick Flaherty","submitted_at":"2017-03-21T12:33:19Z","abstract_excerpt":"Variational inference methods for latent variable statistical models have gained popularity because they are relatively fast, can handle large data sets, and have deterministic convergence guarantees. However, in practice it is unclear whether the fixed point identified by the variational inference algorithm is a local or a global optimum. Here, we propose a method for constructing iterative optimization algorithms for variational inference problems that are guaranteed to converge to the $\\epsilon$-global variational lower bound on the log-likelihood. We derive inference algorithms for two var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07169","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-18T00:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3mkAEVJ3FFQWogM0ymPsF32GjJss1ZWdGQ6w3gnXKIB63swuwgVhVKxKm6V9934Sxaa8OOsF8KZ5FbH+pYCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:21:26.358298Z"},"content_sha256":"0ff86beb3d9cd37b1a679f2d90d6f6816f2a50b31391f5953d70c5c38b0ba0dc","schema_version":"1.0","event_id":"sha256:0ff86beb3d9cd37b1a679f2d90d6f6816f2a50b31391f5953d70c5c38b0ba0dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFJ5UVBHHKWTNQXVS47UIRDC6Q/bundle.json","state_url":"https://pith.science/pith/KFJ5UVBHHKWTNQXVS47UIRDC6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFJ5UVBHHKWTNQXVS47UIRDC6Q/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-20T13:21:26Z","links":{"resolver":"https://pith.science/pith/KFJ5UVBHHKWTNQXVS47UIRDC6Q","bundle":"https://pith.science/pith/KFJ5UVBHHKWTNQXVS47UIRDC6Q/bundle.json","state":"https://pith.science/pith/KFJ5UVBHHKWTNQXVS47UIRDC6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFJ5UVBHHKWTNQXVS47UIRDC6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KFJ5UVBHHKWTNQXVS47UIRDC6Q","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":"1ae0dfd762cd9f4408854d7b1a8a98d2bed4ba10b3a8f448cd4f8eb495a8ef8f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-21T12:33:19Z","title_canon_sha256":"b916d86f503033d661682122da89f163c590327e2cd0fefc77686cb28b69e78c"},"schema_version":"1.0","source":{"id":"1703.07169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07169","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07169v1","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07169","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"KFJ5UVBHHKWT","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KFJ5UVBHHKWTNQXV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KFJ5UVBH","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:0ff86beb3d9cd37b1a679f2d90d6f6816f2a50b31391f5953d70c5c38b0ba0dc","target":"graph","created_at":"2026-05-18T00:48:11Z","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 methods for latent variable statistical models have gained popularity because they are relatively fast, can handle large data sets, and have deterministic convergence guarantees. However, in practice it is unclear whether the fixed point identified by the variational inference algorithm is a local or a global optimum. Here, we propose a method for constructing iterative optimization algorithms for variational inference problems that are guaranteed to converge to the $\\epsilon$-global variational lower bound on the log-likelihood. We derive inference algorithms for two var","authors_text":"Andrew C. Trapp, Hachem Saddiki, Patrick Flaherty","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-21T12:33:19Z","title":"A Deterministic Global Optimization Method for Variational Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07169","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:ef2b0347f7b9f7c8021d4e1726a41e58daae7417f45acb717b8d1ae9568b1de4","target":"record","created_at":"2026-05-18T00:48:11Z","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":"1ae0dfd762cd9f4408854d7b1a8a98d2bed4ba10b3a8f448cd4f8eb495a8ef8f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-21T12:33:19Z","title_canon_sha256":"b916d86f503033d661682122da89f163c590327e2cd0fefc77686cb28b69e78c"},"schema_version":"1.0","source":{"id":"1703.07169","kind":"arxiv","version":1}},"canonical_sha256":"5153da54273aad36c2f5973f444462f4289c3a9069a5e7838306cfc4977bc800","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5153da54273aad36c2f5973f444462f4289c3a9069a5e7838306cfc4977bc800","first_computed_at":"2026-05-18T00:48:11.124368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:11.124368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ou0kWgotZBuscDHqTNJUawlNYY0+B95Rh6z6YO1wDYU70p8eqeC3fWUCS3DlJM8+KL0MhXk5yJuJxF8upr1qDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:11.124951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef2b0347f7b9f7c8021d4e1726a41e58daae7417f45acb717b8d1ae9568b1de4","sha256:0ff86beb3d9cd37b1a679f2d90d6f6816f2a50b31391f5953d70c5c38b0ba0dc"],"state_sha256":"bda76bc8edadbe3be97b2509586534055566ebcb6ada771cf70e0b5ba7bfdaa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mgpy+p5ODwizHgWglSYOmj0W6FEV7ka1TGWmFvHC3nGEyvK68COVC3l/LYUX4vzIbyIXDXdaeLSzakdgRZTCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T13:21:26.360360Z","bundle_sha256":"4e3b7995b1f7303935b977afb5e889624c0677f5abfa16b55e2d727f59406768"}}