{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7ILJFWNHEDCGUWSF3YFT3GALVJ","short_pith_number":"pith:7ILJFWNH","canonical_record":{"source":{"id":"1205.2625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:21:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bda42c12a9950283ef0b27ffc87a6326bd26a6b6f61a4ac6960ed2c2fd8cf274","abstract_canon_sha256":"d41d28d3a03e4298db85c26293324e4624bcc15de34645ebd1c3020342bfdd02"},"schema_version":"1.0"},"canonical_sha256":"fa1692d9a720c46a5a45de0b3d980baa4a68cfcc1edf0613bc6d9af3e4b628d0","source":{"kind":"arxiv","id":"1205.2625","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2625","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2625v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2625","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"7ILJFWNHEDCG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7ILJFWNHEDCGUWSF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7ILJFWNH","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7ILJFWNHEDCGUWSF3YFT3GALVJ","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:21:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bda42c12a9950283ef0b27ffc87a6326bd26a6b6f61a4ac6960ed2c2fd8cf274","abstract_canon_sha256":"d41d28d3a03e4298db85c26293324e4624bcc15de34645ebd1c3020342bfdd02"},"schema_version":"1.0"},"canonical_sha256":"fa1692d9a720c46a5a45de0b3d980baa4a68cfcc1edf0613bc6d9af3e4b628d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.833078Z","signature_b64":"Dglwyk6toNNr1pzaYKQvNtHRikBsD0dQnYXX0Fp4zirNbpb5hGgEk8Pr6mPFw2HSm6zUjFShQosfwWgL/ZkFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa1692d9a720c46a5a45de0b3d980baa4a68cfcc1edf0613bc6d9af3e4b628d0","last_reissued_at":"2026-05-18T03:55:47.832388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.832388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2625","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUu8SQByutA5efm1bweu3moZZTn4vXkj+/NR1e9fxwgOnduUgMuhkulRk5T+jbw9UBnpzyt0kYFl2mB/ewVJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:01:52.802024Z"},"content_sha256":"7ebb45a799bc16ec0328b138d6d2758fa843018fd696c72e25c3d50a8e462bfc","schema_version":"1.0","event_id":"sha256:7ebb45a799bc16ec0328b138d6d2758fa843018fd696c72e25c3d50a8e462bfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7ILJFWNHEDCGUWSF3YFT3GALVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergent message passing algorithms - a unifying view","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Amir Globerson, Talya Meltzer, Yair Weiss","submitted_at":"2012-05-09T17:21:25Z","abstract_excerpt":"Message-passing algorithms have emerged as powerful techniques for approximate inference in graphical models. When these algorithms converge, they can be shown to find local (or sometimes even global) optima of variational formulations to the inference problem. But many of the most popular algorithms are not guaranteed to converge. This has lead to recent interest in convergent message-passing algorithms. In this paper, we present a unified view of convergent message-passing algorithms. We present a simple derivation of an abstract algorithm, tree-consistency bound optimization (TCBO) that is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2625","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:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmY9vIUprqU3fMR/PUV65XzMgFrZD6tkJRG5MI8TPtVJMtE5W9v6/noz5v8TP/L0bFWxNHFA7O+xdBkGTdr+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:01:52.802780Z"},"content_sha256":"a21fbe403fa340ba4c41a0954c477c1b640f8dfae0302427aa2a5275a99ffba5","schema_version":"1.0","event_id":"sha256:a21fbe403fa340ba4c41a0954c477c1b640f8dfae0302427aa2a5275a99ffba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ILJFWNHEDCGUWSF3YFT3GALVJ/bundle.json","state_url":"https://pith.science/pith/7ILJFWNHEDCGUWSF3YFT3GALVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ILJFWNHEDCGUWSF3YFT3GALVJ/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-25T10:01:52Z","links":{"resolver":"https://pith.science/pith/7ILJFWNHEDCGUWSF3YFT3GALVJ","bundle":"https://pith.science/pith/7ILJFWNHEDCGUWSF3YFT3GALVJ/bundle.json","state":"https://pith.science/pith/7ILJFWNHEDCGUWSF3YFT3GALVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ILJFWNHEDCGUWSF3YFT3GALVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7ILJFWNHEDCGUWSF3YFT3GALVJ","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":"d41d28d3a03e4298db85c26293324e4624bcc15de34645ebd1c3020342bfdd02","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:21:25Z","title_canon_sha256":"bda42c12a9950283ef0b27ffc87a6326bd26a6b6f61a4ac6960ed2c2fd8cf274"},"schema_version":"1.0","source":{"id":"1205.2625","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2625","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2625v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2625","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"7ILJFWNHEDCG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7ILJFWNHEDCGUWSF","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7ILJFWNH","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:a21fbe403fa340ba4c41a0954c477c1b640f8dfae0302427aa2a5275a99ffba5","target":"graph","created_at":"2026-05-18T03:55:47Z","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":"Message-passing algorithms have emerged as powerful techniques for approximate inference in graphical models. When these algorithms converge, they can be shown to find local (or sometimes even global) optima of variational formulations to the inference problem. But many of the most popular algorithms are not guaranteed to converge. This has lead to recent interest in convergent message-passing algorithms. In this paper, we present a unified view of convergent message-passing algorithms. We present a simple derivation of an abstract algorithm, tree-consistency bound optimization (TCBO) that is ","authors_text":"Amir Globerson, Talya Meltzer, Yair Weiss","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:21:25Z","title":"Convergent message passing algorithms - a unifying view"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2625","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:7ebb45a799bc16ec0328b138d6d2758fa843018fd696c72e25c3d50a8e462bfc","target":"record","created_at":"2026-05-18T03:55:47Z","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":"d41d28d3a03e4298db85c26293324e4624bcc15de34645ebd1c3020342bfdd02","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-05-09T17:21:25Z","title_canon_sha256":"bda42c12a9950283ef0b27ffc87a6326bd26a6b6f61a4ac6960ed2c2fd8cf274"},"schema_version":"1.0","source":{"id":"1205.2625","kind":"arxiv","version":1}},"canonical_sha256":"fa1692d9a720c46a5a45de0b3d980baa4a68cfcc1edf0613bc6d9af3e4b628d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa1692d9a720c46a5a45de0b3d980baa4a68cfcc1edf0613bc6d9af3e4b628d0","first_computed_at":"2026-05-18T03:55:47.832388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.832388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dglwyk6toNNr1pzaYKQvNtHRikBsD0dQnYXX0Fp4zirNbpb5hGgEk8Pr6mPFw2HSm6zUjFShQosfwWgL/ZkFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.833078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2625","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ebb45a799bc16ec0328b138d6d2758fa843018fd696c72e25c3d50a8e462bfc","sha256:a21fbe403fa340ba4c41a0954c477c1b640f8dfae0302427aa2a5275a99ffba5"],"state_sha256":"554cca9c0888b3b74a0c856f6f9fc9afcdc9ef4dbc8e2f16d6b0de4573286195"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A75IXz+1+jIrs80MF/VhP+rWYTCB9O3A6oK/FquJTVLbS1bqe/Sl7SluXvUCW9l5PK9lf06J4uX6YgX4y2soBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:01:52.806752Z","bundle_sha256":"7d316d9279a01516bec1c5673ba9056d9b1ce379a81eab6d98d1947094249bbf"}}