{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MVCQQ2ETHX4PP36YXRP4XP6XG6","short_pith_number":"pith:MVCQQ2ET","schema_version":"1.0","canonical_sha256":"65450868933df8f7efd8bc5fcbbfd7379c6173117fbafac414b6cda806923f3a","source":{"kind":"arxiv","id":"1401.3489","version":1},"attestation_state":"computed","paper":{"title":"Join-Graph Propagation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kalev Kask, Rina Dechter, Robert Mateescu, Vibhav Gogate","submitted_at":"2014-01-15T05:38:39Z","abstract_excerpt":"The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start with the bounded inference mini-clustering algorithm and then move to the iterative scheme called Iterative Join-Graph Propagation (IJGP), that combines both iteration and bounded inference. Algorithm IJGP belongs to the class of Generalized Belief Propagation algorithms, a framework that allowed connections with approximate algorithms from statistical physics and is shown empirically to surpass the performance of m"},"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":"1401.3489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:38:39Z","cross_cats_sorted":[],"title_canon_sha256":"2ec04515ec880402cd2a27ad5a66eabb0038c541f7aba1231e8d2102d1826513","abstract_canon_sha256":"3af6866592194ceafd7f38c2934167e6314bd70a3e7401d234b9bfbb381e13cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.680944Z","signature_b64":"5FXxGGBtHW33i2/t+2453XV7V6NS85ShUrYe6QnTYgcLDAapWi7UwemZMGVynJB2p2iMXboUb/yHEYa5fHIfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65450868933df8f7efd8bc5fcbbfd7379c6173117fbafac414b6cda806923f3a","last_reissued_at":"2026-05-18T03:02:08.680167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.680167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Join-Graph Propagation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kalev Kask, Rina Dechter, Robert Mateescu, Vibhav Gogate","submitted_at":"2014-01-15T05:38:39Z","abstract_excerpt":"The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start with the bounded inference mini-clustering algorithm and then move to the iterative scheme called Iterative Join-Graph Propagation (IJGP), that combines both iteration and bounded inference. Algorithm IJGP belongs to the class of Generalized Belief Propagation algorithms, a framework that allowed connections with approximate algorithms from statistical physics and is shown empirically to surpass the performance of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3489","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":"1401.3489","created_at":"2026-05-18T03:02:08.680291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3489v1","created_at":"2026-05-18T03:02:08.680291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3489","created_at":"2026-05-18T03:02:08.680291+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVCQQ2ETHX4P","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVCQQ2ETHX4PP36Y","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVCQQ2ET","created_at":"2026-05-18T12:28:38.356838+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/MVCQQ2ETHX4PP36YXRP4XP6XG6","json":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6.json","graph_json":"https://pith.science/api/pith-number/MVCQQ2ETHX4PP36YXRP4XP6XG6/graph.json","events_json":"https://pith.science/api/pith-number/MVCQQ2ETHX4PP36YXRP4XP6XG6/events.json","paper":"https://pith.science/paper/MVCQQ2ET"},"agent_actions":{"view_html":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6","download_json":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6.json","view_paper":"https://pith.science/paper/MVCQQ2ET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3489&json=true","fetch_graph":"https://pith.science/api/pith-number/MVCQQ2ETHX4PP36YXRP4XP6XG6/graph.json","fetch_events":"https://pith.science/api/pith-number/MVCQQ2ETHX4PP36YXRP4XP6XG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6/action/storage_attestation","attest_author":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6/action/author_attestation","sign_citation":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6/action/citation_signature","submit_replication":"https://pith.science/pith/MVCQQ2ETHX4PP36YXRP4XP6XG6/action/replication_record"}},"created_at":"2026-05-18T03:02:08.680291+00:00","updated_at":"2026-05-18T03:02:08.680291+00:00"}