{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7GFKG6S6EXJECIT3VV2K5XVNNL","short_pith_number":"pith:7GFKG6S6","schema_version":"1.0","canonical_sha256":"f98aa37a5e25d241227bad74aedead6ae5cfa66aeaa4e2c6befb91559ac59e7a","source":{"kind":"arxiv","id":"1301.6725","version":1},"attestation_state":"computed","paper":{"title":"Loopy Belief Propagation for Approximate Inference: An Empirical Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Kevin Murphy, Michael I. Jordan, Yair Weiss","submitted_at":"2013-01-23T16:00:02Z","abstract_excerpt":"Recently, researchers have demonstrated that loopy belief propagation - the use of Pearls polytree algorithm IN a Bayesian network WITH loops OF error- correcting codes.The most dramatic instance OF this IS the near Shannon - limit performance OF Turbo Codes codes whose decoding algorithm IS equivalent TO loopy belief propagation IN a chain - structured Bayesian network. IN this paper we ask : IS there something special about the error - correcting code context, OR does loopy propagation WORK AS an approximate inference schemeIN a more general setting? We compare the marginals computed using l"},"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.6725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T16:00:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ac5f4c7f36ef7abec01c51df41bd5657149c60e3203b015e6cdee2c02fa766ab","abstract_canon_sha256":"69ed9ffad6c0910706d3280d2e25561163e70f0bff8d9d57934dc4547570fe00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.700695Z","signature_b64":"e33xQ+2Pg+qQ+4Y8jP5Wl5mdL2l+HMGF9xOT3W4gSjLDSSmveLR/DRkN7foUmsBGmk5r3vGWDDAZGD0DbmceCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f98aa37a5e25d241227bad74aedead6ae5cfa66aeaa4e2c6befb91559ac59e7a","last_reissued_at":"2026-05-18T03:35:12.700142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.700142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loopy Belief Propagation for Approximate Inference: An Empirical Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Kevin Murphy, Michael I. Jordan, Yair Weiss","submitted_at":"2013-01-23T16:00:02Z","abstract_excerpt":"Recently, researchers have demonstrated that loopy belief propagation - the use of Pearls polytree algorithm IN a Bayesian network WITH loops OF error- correcting codes.The most dramatic instance OF this IS the near Shannon - limit performance OF Turbo Codes codes whose decoding algorithm IS equivalent TO loopy belief propagation IN a chain - structured Bayesian network. IN this paper we ask : IS there something special about the error - correcting code context, OR does loopy propagation WORK AS an approximate inference schemeIN a more general setting? We compare the marginals computed using l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6725","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.6725","created_at":"2026-05-18T03:35:12.700233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6725v1","created_at":"2026-05-18T03:35:12.700233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6725","created_at":"2026-05-18T03:35:12.700233+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GFKG6S6EXJE","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GFKG6S6EXJECIT3","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GFKG6S6","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.17158","citing_title":"Stochastic tensor contraction for quantum chemistry","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL","json":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL.json","graph_json":"https://pith.science/api/pith-number/7GFKG6S6EXJECIT3VV2K5XVNNL/graph.json","events_json":"https://pith.science/api/pith-number/7GFKG6S6EXJECIT3VV2K5XVNNL/events.json","paper":"https://pith.science/paper/7GFKG6S6"},"agent_actions":{"view_html":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL","download_json":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL.json","view_paper":"https://pith.science/paper/7GFKG6S6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6725&json=true","fetch_graph":"https://pith.science/api/pith-number/7GFKG6S6EXJECIT3VV2K5XVNNL/graph.json","fetch_events":"https://pith.science/api/pith-number/7GFKG6S6EXJECIT3VV2K5XVNNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL/action/storage_attestation","attest_author":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL/action/author_attestation","sign_citation":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL/action/citation_signature","submit_replication":"https://pith.science/pith/7GFKG6S6EXJECIT3VV2K5XVNNL/action/replication_record"}},"created_at":"2026-05-18T03:35:12.700233+00:00","updated_at":"2026-05-18T03:35:12.700233+00:00"}