{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QN5LWKTHHR7LUS4JWDZB7ETVTY","short_pith_number":"pith:QN5LWKTH","schema_version":"1.0","canonical_sha256":"837abb2a673c7eba4b89b0f21f92759e18031bba4a61eb1fcda8ea6f4edb1516","source":{"kind":"arxiv","id":"1301.2294","version":1},"attestation_state":"computed","paper":{"title":"Expectation Propagation for approximate Bayesian inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Thomas P. Minka","submitted_at":"2013-01-10T16:25:20Z","abstract_excerpt":"This paper presents a new deterministic approximation technique in Bayesian networks.  This method, \"Expectation Propagation\", unifies two previous techniques: assumed-density filtering, an extension of the Kalman filter, and loopy belief propagation, an extension of belief propagation in Bayesian networks.  All three algorithms try to recover an approximate distribution which is close in KL divergence to the true distribution. Loopy belief propagation, because it propagates exact belief states, is useful for a limited class of belief networks, such as those which are purely discrete.  Expecta"},"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":"1301.2294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"366ac85d236b40303b5f0a11c0a94761cb5bb3e8a066a02ce72b7cc02fdea696","abstract_canon_sha256":"caea719f31977f534b0b34c1298745c7a5742db24d25f6d2c509c76fe7fbf839"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.516086Z","signature_b64":"DKUAiir3SlAhfNdp/RAwYb8FaC2nuskeVskb2LPBK/azJmZRLMPkiS0uoE7pkVswxUDQHQrgXdEhu2calzCGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837abb2a673c7eba4b89b0f21f92759e18031bba4a61eb1fcda8ea6f4edb1516","last_reissued_at":"2026-05-18T03:36:45.515593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.515593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expectation Propagation for approximate Bayesian inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Thomas P. Minka","submitted_at":"2013-01-10T16:25:20Z","abstract_excerpt":"This paper presents a new deterministic approximation technique in Bayesian networks.  This method, \"Expectation Propagation\", unifies two previous techniques: assumed-density filtering, an extension of the Kalman filter, and loopy belief propagation, an extension of belief propagation in Bayesian networks.  All three algorithms try to recover an approximate distribution which is close in KL divergence to the true distribution. Loopy belief propagation, because it propagates exact belief states, is useful for a limited class of belief networks, such as those which are purely discrete.  Expecta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2294","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.2294","created_at":"2026-05-18T03:36:45.515669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2294v1","created_at":"2026-05-18T03:36:45.515669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2294","created_at":"2026-05-18T03:36:45.515669+00:00"},{"alias_kind":"pith_short_12","alias_value":"QN5LWKTHHR7L","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QN5LWKTHHR7LUS4J","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QN5LWKTH","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22692","citing_title":"Mechanisms and Pathways of Extreme Events in Partially-Observed Stochastic Dynamical Systems","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY","json":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY.json","graph_json":"https://pith.science/api/pith-number/QN5LWKTHHR7LUS4JWDZB7ETVTY/graph.json","events_json":"https://pith.science/api/pith-number/QN5LWKTHHR7LUS4JWDZB7ETVTY/events.json","paper":"https://pith.science/paper/QN5LWKTH"},"agent_actions":{"view_html":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY","download_json":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY.json","view_paper":"https://pith.science/paper/QN5LWKTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2294&json=true","fetch_graph":"https://pith.science/api/pith-number/QN5LWKTHHR7LUS4JWDZB7ETVTY/graph.json","fetch_events":"https://pith.science/api/pith-number/QN5LWKTHHR7LUS4JWDZB7ETVTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY/action/storage_attestation","attest_author":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY/action/author_attestation","sign_citation":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY/action/citation_signature","submit_replication":"https://pith.science/pith/QN5LWKTHHR7LUS4JWDZB7ETVTY/action/replication_record"}},"created_at":"2026-05-18T03:36:45.515669+00:00","updated_at":"2026-05-18T03:36:45.515669+00:00"}