{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MVHDZBZL6EQRKXSTPLWVFSXVB3","short_pith_number":"pith:MVHDZBZL","schema_version":"1.0","canonical_sha256":"654e3c872bf121155e537aed52caf50ec7b385e4825276c9313370b90a6426ba","source":{"kind":"arxiv","id":"1207.4174","version":1},"attestation_state":"computed","paper":{"title":"Robust Probabilistic Inference in Distributed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Carlos E. Guestrin, Mark Paskin","submitted_at":"2012-07-11T15:08:33Z","abstract_excerpt":"Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a natural fit for distributed systems, but they must be robust to the failure situations that arise in real-world settings, such as unreliable communication and node failures. Unfortunately, the popular sum-product algorithm can yield very poor estimates in these settings because the nodes' beliefs before convergence can be arbitrarily different from the correct posteriors. In this paper, we present a new message passing a"},"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":"1207.4174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-11T15:08:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"489d68cd6a463e1011238fd01b7e6d6f5c57ccc69f442cbecd107a3e2956e83d","abstract_canon_sha256":"8e5daf543f71427507736eef5e16e7127c024b89af15c73728e019648486d2d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.430923Z","signature_b64":"8OGpHTBqkD9qSVj2ZvaAXJcEYRyjVlZIIiiORskCKlBBlwpG/625/Zy+5Kua6qnxiwBWBBGPp2K4l33LRdjuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654e3c872bf121155e537aed52caf50ec7b385e4825276c9313370b90a6426ba","last_reissued_at":"2026-05-18T03:50:47.430246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.430246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Probabilistic Inference in Distributed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Carlos E. Guestrin, Mark Paskin","submitted_at":"2012-07-11T15:08:33Z","abstract_excerpt":"Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a natural fit for distributed systems, but they must be robust to the failure situations that arise in real-world settings, such as unreliable communication and node failures. Unfortunately, the popular sum-product algorithm can yield very poor estimates in these settings because the nodes' beliefs before convergence can be arbitrarily different from the correct posteriors. In this paper, we present a new message passing a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4174","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":"1207.4174","created_at":"2026-05-18T03:50:47.430350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4174v1","created_at":"2026-05-18T03:50:47.430350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4174","created_at":"2026-05-18T03:50:47.430350+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVHDZBZL6EQR","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVHDZBZL6EQRKXST","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVHDZBZL","created_at":"2026-05-18T12:27:14.488303+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/MVHDZBZL6EQRKXSTPLWVFSXVB3","json":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3.json","graph_json":"https://pith.science/api/pith-number/MVHDZBZL6EQRKXSTPLWVFSXVB3/graph.json","events_json":"https://pith.science/api/pith-number/MVHDZBZL6EQRKXSTPLWVFSXVB3/events.json","paper":"https://pith.science/paper/MVHDZBZL"},"agent_actions":{"view_html":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3","download_json":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3.json","view_paper":"https://pith.science/paper/MVHDZBZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4174&json=true","fetch_graph":"https://pith.science/api/pith-number/MVHDZBZL6EQRKXSTPLWVFSXVB3/graph.json","fetch_events":"https://pith.science/api/pith-number/MVHDZBZL6EQRKXSTPLWVFSXVB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3/action/storage_attestation","attest_author":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3/action/author_attestation","sign_citation":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3/action/citation_signature","submit_replication":"https://pith.science/pith/MVHDZBZL6EQRKXSTPLWVFSXVB3/action/replication_record"}},"created_at":"2026-05-18T03:50:47.430350+00:00","updated_at":"2026-05-18T03:50:47.430350+00:00"}