{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L4GI2R4VFZVULFZBXAJTTLOAXW","short_pith_number":"pith:L4GI2R4V","canonical_record":{"source":{"id":"1206.5286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:16:08Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2d570e45fc1ec1a7ea509fbaf4e4df48e59ed048369adb345a20a6220e39d3e0","abstract_canon_sha256":"9e27748b2c002919ce8835b224a1c38b8bc3d2b152860462554ad5f54777bb9b"},"schema_version":"1.0"},"canonical_sha256":"5f0c8d47952e6b459721b81339adc0bd835245dd734185a2e15890335e47a833","source":{"kind":"arxiv","id":"1206.5286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5286","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5286v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5286","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"L4GI2R4VFZVU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L4GI2R4VFZVULFZB","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L4GI2R4V","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L4GI2R4VFZVULFZBXAJTTLOAXW","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:16:08Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2d570e45fc1ec1a7ea509fbaf4e4df48e59ed048369adb345a20a6220e39d3e0","abstract_canon_sha256":"9e27748b2c002919ce8835b224a1c38b8bc3d2b152860462554ad5f54777bb9b"},"schema_version":"1.0"},"canonical_sha256":"5f0c8d47952e6b459721b81339adc0bd835245dd734185a2e15890335e47a833","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.547198Z","signature_b64":"zI/ju7iPc47zdeCb4tH2DDhUrqP8MhYXy8cz/vasKFU4n1P8dZcIpjEr+cts1qMkT5zJFQ4BIHrXqAs4CupWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0c8d47952e6b459721b81339adc0bd835245dd734185a2e15890335e47a833","last_reissued_at":"2026-05-18T03:52:40.546544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.546544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5286","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkth2RsBMrayvbr228T0z+4WFF/texELC2Q9nNss7Xd6xbQyu48tnTYNI7cETHfteM3UKDVeA+6NyoCZnrDdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:12:44.931653Z"},"content_sha256":"185dbf857a4ba100a592be8360e96bc8ca4a243b4866f974badb09ec3baa149d","schema_version":"1.0","event_id":"sha256:185dbf857a4ba100a592be8360e96bc8ca4a243b4866f974badb09ec3baa149d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L4GI2R4VFZVULFZBXAJTTLOAXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Chen Yanover, Talya Meltzer, Yair Weiss","submitted_at":"2012-06-20T15:16:08Z","abstract_excerpt":"Finding the most probable assignment (MAP) in a general graphical model is known to be NP hard but good approximations have been attained with max-product belief propagation (BP) and its variants. In particular, it is known that using BP on a single-cycle graph or tree reweighted BP on an arbitrary graph will give the MAP solution if the beliefs have no ties. In this paper we extend the setting under which BP can be used to provably extract the MAP. We define Convex BP as BP algorithms based on a convex free energy approximation and show that this class includes ordinary BP with single-cycle, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5286","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pxvdYqVf96tYNvaipj6wIK5kaENrjr8kaEfJBwn5d+xxlQyM6BQ+Zkg6jgTkY2JRheIDGggPRTZt+Zahog6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:12:44.932000Z"},"content_sha256":"8cea51e61cab23c24c9857b04823ec85cc70a5dda3f953b5a744f414b13faa8c","schema_version":"1.0","event_id":"sha256:8cea51e61cab23c24c9857b04823ec85cc70a5dda3f953b5a744f414b13faa8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4GI2R4VFZVULFZBXAJTTLOAXW/bundle.json","state_url":"https://pith.science/pith/L4GI2R4VFZVULFZBXAJTTLOAXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4GI2R4VFZVULFZBXAJTTLOAXW/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-06-04T21:12:44Z","links":{"resolver":"https://pith.science/pith/L4GI2R4VFZVULFZBXAJTTLOAXW","bundle":"https://pith.science/pith/L4GI2R4VFZVULFZBXAJTTLOAXW/bundle.json","state":"https://pith.science/pith/L4GI2R4VFZVULFZBXAJTTLOAXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4GI2R4VFZVULFZBXAJTTLOAXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L4GI2R4VFZVULFZBXAJTTLOAXW","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":"9e27748b2c002919ce8835b224a1c38b8bc3d2b152860462554ad5f54777bb9b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:16:08Z","title_canon_sha256":"2d570e45fc1ec1a7ea509fbaf4e4df48e59ed048369adb345a20a6220e39d3e0"},"schema_version":"1.0","source":{"id":"1206.5286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5286","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5286v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5286","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"L4GI2R4VFZVU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L4GI2R4VFZVULFZB","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L4GI2R4V","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:8cea51e61cab23c24c9857b04823ec85cc70a5dda3f953b5a744f414b13faa8c","target":"graph","created_at":"2026-05-18T03:52:40Z","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":"Finding the most probable assignment (MAP) in a general graphical model is known to be NP hard but good approximations have been attained with max-product belief propagation (BP) and its variants. In particular, it is known that using BP on a single-cycle graph or tree reweighted BP on an arbitrary graph will give the MAP solution if the beliefs have no ties. In this paper we extend the setting under which BP can be used to provably extract the MAP. We define Convex BP as BP algorithms based on a convex free energy approximation and show that this class includes ordinary BP with single-cycle, ","authors_text":"Chen Yanover, Talya Meltzer, Yair Weiss","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:16:08Z","title":"MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5286","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:185dbf857a4ba100a592be8360e96bc8ca4a243b4866f974badb09ec3baa149d","target":"record","created_at":"2026-05-18T03:52:40Z","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":"9e27748b2c002919ce8835b224a1c38b8bc3d2b152860462554ad5f54777bb9b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:16:08Z","title_canon_sha256":"2d570e45fc1ec1a7ea509fbaf4e4df48e59ed048369adb345a20a6220e39d3e0"},"schema_version":"1.0","source":{"id":"1206.5286","kind":"arxiv","version":1}},"canonical_sha256":"5f0c8d47952e6b459721b81339adc0bd835245dd734185a2e15890335e47a833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0c8d47952e6b459721b81339adc0bd835245dd734185a2e15890335e47a833","first_computed_at":"2026-05-18T03:52:40.546544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:40.546544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zI/ju7iPc47zdeCb4tH2DDhUrqP8MhYXy8cz/vasKFU4n1P8dZcIpjEr+cts1qMkT5zJFQ4BIHrXqAs4CupWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:40.547198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:185dbf857a4ba100a592be8360e96bc8ca4a243b4866f974badb09ec3baa149d","sha256:8cea51e61cab23c24c9857b04823ec85cc70a5dda3f953b5a744f414b13faa8c"],"state_sha256":"75e679e71f758f2273e1a8a382c01c76b0892d95f0a9079f43ce8151c1cae07b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zyUb8uJ9jPbwCkpdbWBZKrXwHf6/k0Ra6Q0D7hrZ8B+UrQ7SwD4p5l7RCjF03oJhYzaol3WcbLQBhHkxbCDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:12:44.933918Z","bundle_sha256":"30a42ed8c9b98a7a6198b33391352194f232ff923b63fcae2d73fdc3c44701e2"}}