{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PUE3MKV3S2L3NPNGGJDHYPLYWI","short_pith_number":"pith:PUE3MKV3","canonical_record":{"source":{"id":"1301.0564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"fc6c0701d3c3ab405171c3f20f7ef407dd8a2add3f3e4a726d3f036be3019a31","abstract_canon_sha256":"4f30ef60e8b2818a1dd0a10f51d70cda91b70cc50ffa70ef3d06a448f043e6f8"},"schema_version":"1.0"},"canonical_sha256":"7d09b62abb9697b6bda632467c3d78b23a6f1f8e3518dbe559250dfe92a5c18a","source":{"kind":"arxiv","id":"1301.0564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0564","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0564v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0564","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"PUE3MKV3S2L3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PUE3MKV3S2L3NPNG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PUE3MKV3","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PUE3MKV3S2L3NPNGGJDHYPLYWI","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"fc6c0701d3c3ab405171c3f20f7ef407dd8a2add3f3e4a726d3f036be3019a31","abstract_canon_sha256":"4f30ef60e8b2818a1dd0a10f51d70cda91b70cc50ffa70ef3d06a448f043e6f8"},"schema_version":"1.0"},"canonical_sha256":"7d09b62abb9697b6bda632467c3d78b23a6f1f8e3518dbe559250dfe92a5c18a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.520718Z","signature_b64":"V4Etev3o/9l7JrdD5N60/3xDfCQ+0csYPju8RqIPrd2SPAc35hqZPGhg3f2TiXUVvqmDPfM0jO/PDCj54p+NBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d09b62abb9697b6bda632467c3d78b23a6f1f8e3518dbe559250dfe92a5c18a","last_reissued_at":"2026-05-18T03:37:18.520169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.520169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0564","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzTvZKN5KYpEU2Br8UK8A0aZED/tg1cWbRnt8zddUTDleoLEalMUj4eH2+9Rg3dm5YOTCAYRS2/lbDhdbyNJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:45.241774Z"},"content_sha256":"3bb41825bd999f054c257fc632ee1d6f95140904cbc8dfddbdbe7dd40aa52936","schema_version":"1.0","event_id":"sha256:3bb41825bd999f054c257fc632ee1d6f95140904cbc8dfddbdbe7dd40aa52936"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PUE3MKV3S2L3NPNGGJDHYPLYWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Join-Graph Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kalev Kask, Rina Dechter, Robert Mateescu","submitted_at":"2012-12-12T15:55:58Z","abstract_excerpt":"The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering algorithm to join-graphs rather than to join-trees, iteratively. It is inspired by the success of Pearl's belief propagation algorithm as an iterative approximation scheme on one hand, and by a recently introduced mini-clustering i. success as an anytime approximation method, on the other. The proposed Iterative Join-graph Propagation IJGP belongs to the class of generalized belief propagation methods, recently proposed using analogy with algorithms in statistical physics. E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0564","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kAJXoD8cJoeqaFQ0xvAKkJ19G2yUG+pimOl8kcnKqcmYYmBlXi+Bnxa0FBbiD5RbV0aJTnAZ+13xGb9a/coHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:38:45.242131Z"},"content_sha256":"a3af8ce957b6c3e67fb0319a8f4f3eccde4cb744278f779865e64176ccae2819","schema_version":"1.0","event_id":"sha256:a3af8ce957b6c3e67fb0319a8f4f3eccde4cb744278f779865e64176ccae2819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUE3MKV3S2L3NPNGGJDHYPLYWI/bundle.json","state_url":"https://pith.science/pith/PUE3MKV3S2L3NPNGGJDHYPLYWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUE3MKV3S2L3NPNGGJDHYPLYWI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T05:38:45Z","links":{"resolver":"https://pith.science/pith/PUE3MKV3S2L3NPNGGJDHYPLYWI","bundle":"https://pith.science/pith/PUE3MKV3S2L3NPNGGJDHYPLYWI/bundle.json","state":"https://pith.science/pith/PUE3MKV3S2L3NPNGGJDHYPLYWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUE3MKV3S2L3NPNGGJDHYPLYWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PUE3MKV3S2L3NPNGGJDHYPLYWI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4f30ef60e8b2818a1dd0a10f51d70cda91b70cc50ffa70ef3d06a448f043e6f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:58Z","title_canon_sha256":"fc6c0701d3c3ab405171c3f20f7ef407dd8a2add3f3e4a726d3f036be3019a31"},"schema_version":"1.0","source":{"id":"1301.0564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0564","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0564v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0564","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"PUE3MKV3S2L3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PUE3MKV3S2L3NPNG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PUE3MKV3","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:a3af8ce957b6c3e67fb0319a8f4f3eccde4cb744278f779865e64176ccae2819","target":"graph","created_at":"2026-05-18T03:37:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering algorithm to join-graphs rather than to join-trees, iteratively. It is inspired by the success of Pearl's belief propagation algorithm as an iterative approximation scheme on one hand, and by a recently introduced mini-clustering i. success as an anytime approximation method, on the other. The proposed Iterative Join-graph Propagation IJGP belongs to the class of generalized belief propagation methods, recently proposed using analogy with algorithms in statistical physics. E","authors_text":"Kalev Kask, Rina Dechter, Robert Mateescu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:58Z","title":"Iterative Join-Graph Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0564","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3bb41825bd999f054c257fc632ee1d6f95140904cbc8dfddbdbe7dd40aa52936","target":"record","created_at":"2026-05-18T03:37:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4f30ef60e8b2818a1dd0a10f51d70cda91b70cc50ffa70ef3d06a448f043e6f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:58Z","title_canon_sha256":"fc6c0701d3c3ab405171c3f20f7ef407dd8a2add3f3e4a726d3f036be3019a31"},"schema_version":"1.0","source":{"id":"1301.0564","kind":"arxiv","version":1}},"canonical_sha256":"7d09b62abb9697b6bda632467c3d78b23a6f1f8e3518dbe559250dfe92a5c18a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d09b62abb9697b6bda632467c3d78b23a6f1f8e3518dbe559250dfe92a5c18a","first_computed_at":"2026-05-18T03:37:18.520169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.520169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V4Etev3o/9l7JrdD5N60/3xDfCQ+0csYPju8RqIPrd2SPAc35hqZPGhg3f2TiXUVvqmDPfM0jO/PDCj54p+NBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.520718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bb41825bd999f054c257fc632ee1d6f95140904cbc8dfddbdbe7dd40aa52936","sha256:a3af8ce957b6c3e67fb0319a8f4f3eccde4cb744278f779865e64176ccae2819"],"state_sha256":"01b22cdc781442ab36a256e15662c7e950b36bb7431049da1f57bd72a5caf55f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTZHfHRBgUPqKlP9TKOCwR4T9MLvPAtdNfIA05ooxurT6OnTA2FaF+4NHIzyX8n99Sf3QTl1wXH/qq3PtrkDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:38:45.244259Z","bundle_sha256":"fa0097ff1b53f00d3c1b8ac3e016ed06b7950af2bae58fbc503a64b7d73d49e7"}}