{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RC3WI7JMS4DYS35HZKS7XRSC3I","short_pith_number":"pith:RC3WI7JM","schema_version":"1.0","canonical_sha256":"88b7647d2c9707896fa7caa5fbc642da3edf95529a7d3d3c5943d9dcb8692732","source":{"kind":"arxiv","id":"1206.6837","version":1},"attestation_state":"computed","paper":{"title":"Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daphne Koller, Gal Elidan, Ian McGraw","submitted_at":"2012-06-27T16:19:01Z","abstract_excerpt":"Inference for probabilistic graphical models is still very much a practical challenge in large domains. The commonly used and effective belief propagation (BP) algorithm and its generalizations often do not converge when applied to hard, real-life inference tasks. While it is widely recognized that the scheduling of messages in these algorithms may have significant consequences, this issue remains largely unexplored. In this work, we address the question of how to schedule messages for asynchronous propagation so that a fixed point is reached faster and more often. We first show that any reaso"},"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":"1206.6837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T16:19:01Z","cross_cats_sorted":[],"title_canon_sha256":"c4d739b69604f5ce7e6fb9a55c793d2bbf5f23cebecb6531dd728739c5fb1cc0","abstract_canon_sha256":"5b13762e89a9a57e9af90961f0fad01e06d5ee5a4dcacc309ffb974adaa7b3b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.680860Z","signature_b64":"P0wcYY7SIp3Di1a8Sum2WibjnwxP3W8f4nDhXJPeLcdejub/UiI22A9WIb/tK9cRK/m4Fxc+T1xiQKNlPhPgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b7647d2c9707896fa7caa5fbc642da3edf95529a7d3d3c5943d9dcb8692732","last_reissued_at":"2026-05-18T03:52:15.680147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.680147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daphne Koller, Gal Elidan, Ian McGraw","submitted_at":"2012-06-27T16:19:01Z","abstract_excerpt":"Inference for probabilistic graphical models is still very much a practical challenge in large domains. The commonly used and effective belief propagation (BP) algorithm and its generalizations often do not converge when applied to hard, real-life inference tasks. While it is widely recognized that the scheduling of messages in these algorithms may have significant consequences, this issue remains largely unexplored. In this work, we address the question of how to schedule messages for asynchronous propagation so that a fixed point is reached faster and more often. We first show that any reaso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6837","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":"1206.6837","created_at":"2026-05-18T03:52:15.680274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6837v1","created_at":"2026-05-18T03:52:15.680274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6837","created_at":"2026-05-18T03:52:15.680274+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC3WI7JMS4DY","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC3WI7JMS4DYS35H","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC3WI7JM","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I","json":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I.json","graph_json":"https://pith.science/api/pith-number/RC3WI7JMS4DYS35HZKS7XRSC3I/graph.json","events_json":"https://pith.science/api/pith-number/RC3WI7JMS4DYS35HZKS7XRSC3I/events.json","paper":"https://pith.science/paper/RC3WI7JM"},"agent_actions":{"view_html":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I","download_json":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I.json","view_paper":"https://pith.science/paper/RC3WI7JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6837&json=true","fetch_graph":"https://pith.science/api/pith-number/RC3WI7JMS4DYS35HZKS7XRSC3I/graph.json","fetch_events":"https://pith.science/api/pith-number/RC3WI7JMS4DYS35HZKS7XRSC3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I/action/storage_attestation","attest_author":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I/action/author_attestation","sign_citation":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I/action/citation_signature","submit_replication":"https://pith.science/pith/RC3WI7JMS4DYS35HZKS7XRSC3I/action/replication_record"}},"created_at":"2026-05-18T03:52:15.680274+00:00","updated_at":"2026-05-18T03:52:15.680274+00:00"}