{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OZAWIFWR7UQBVA4AWRSCV5JEGO","short_pith_number":"pith:OZAWIFWR","canonical_record":{"source":{"id":"1202.3739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"5b9b113a4569ee48e6a3fc5b2a9e77c1679fa24f87916c7be7849e47acaf8c65","abstract_canon_sha256":"95374c428787a8a0643e6b63f6ee18c70dc5c429cfab51ebb5fd167473d42faf"},"schema_version":"1.0"},"canonical_sha256":"76416416d1fd201a8380b4642af52433961c39765fa7e8c7616e51a3916dafd2","source":{"kind":"arxiv","id":"1202.3739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3739","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3739v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3739","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"OZAWIFWR7UQB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZAWIFWR7UQBVA4A","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZAWIFWR","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OZAWIFWR7UQBVA4AWRSCV5JEGO","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"5b9b113a4569ee48e6a3fc5b2a9e77c1679fa24f87916c7be7849e47acaf8c65","abstract_canon_sha256":"95374c428787a8a0643e6b63f6ee18c70dc5c429cfab51ebb5fd167473d42faf"},"schema_version":"1.0"},"canonical_sha256":"76416416d1fd201a8380b4642af52433961c39765fa7e8c7616e51a3916dafd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.181986Z","signature_b64":"Sti5jDuTiC7VZq9BxJss7n++HBp94MBgMhf0nKkqBRuV5mTXikxbtfX0mGUqnRpVckjj58M0cvlEnyf+2OK1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76416416d1fd201a8380b4642af52433961c39765fa7e8c7616e51a3916dafd2","last_reissued_at":"2026-05-18T04:02:03.181285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.181285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3739","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/r1TU9+H6eOZdT2QYkz+mO1g0aZAnRM2CmiKr7YXe86q7LsBozyPl+q6Fd3PmYmqg23i7z/a85+o+BpPryRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:26:34.153596Z"},"content_sha256":"e6302ca5ec4001de8a85df5fcac98a405040d33b0bff2341a0975ffc9af18576","schema_version":"1.0","event_id":"sha256:e6302ca5ec4001de8a85df5fcac98a405040d33b0bff2341a0975ffc9af18576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OZAWIFWR7UQBVA4AWRSCV5JEGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"cs.AI","authors_text":"Akshat Kumar, Shlomo Zilberstein","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3739","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m87RIN/xrVMW5aYubQly5aYPw7/LFfrMLBPAa4VLCoLXf54FCl+lUe1Wtpx59VYl4eUzeiboql4CLPX2U/cjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:26:34.153949Z"},"content_sha256":"687559aebc8275c9bc216369f06547ee8b33eaae50e4e0c225a7279a3ca430ce","schema_version":"1.0","event_id":"sha256:687559aebc8275c9bc216369f06547ee8b33eaae50e4e0c225a7279a3ca430ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/bundle.json","state_url":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/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-04T00:26:34Z","links":{"resolver":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO","bundle":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/bundle.json","state":"https://pith.science/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZAWIFWR7UQBVA4AWRSCV5JEGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OZAWIFWR7UQBVA4AWRSCV5JEGO","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":"95374c428787a8a0643e6b63f6ee18c70dc5c429cfab51ebb5fd167473d42faf","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"5b9b113a4569ee48e6a3fc5b2a9e77c1679fa24f87916c7be7849e47acaf8c65"},"schema_version":"1.0","source":{"id":"1202.3739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3739","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3739v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3739","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"OZAWIFWR7UQB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZAWIFWR7UQBVA4A","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZAWIFWR","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:687559aebc8275c9bc216369f06547ee8b33eaae50e4e0c225a7279a3ca430ce","target":"graph","created_at":"2026-05-18T04:02:03Z","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":"Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation","authors_text":"Akshat Kumar, Shlomo Zilberstein","cross_cats":["cs.DS","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title":"Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3739","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:e6302ca5ec4001de8a85df5fcac98a405040d33b0bff2341a0975ffc9af18576","target":"record","created_at":"2026-05-18T04:02:03Z","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":"95374c428787a8a0643e6b63f6ee18c70dc5c429cfab51ebb5fd167473d42faf","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"5b9b113a4569ee48e6a3fc5b2a9e77c1679fa24f87916c7be7849e47acaf8c65"},"schema_version":"1.0","source":{"id":"1202.3739","kind":"arxiv","version":1}},"canonical_sha256":"76416416d1fd201a8380b4642af52433961c39765fa7e8c7616e51a3916dafd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76416416d1fd201a8380b4642af52433961c39765fa7e8c7616e51a3916dafd2","first_computed_at":"2026-05-18T04:02:03.181285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.181285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sti5jDuTiC7VZq9BxJss7n++HBp94MBgMhf0nKkqBRuV5mTXikxbtfX0mGUqnRpVckjj58M0cvlEnyf+2OK1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.181986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6302ca5ec4001de8a85df5fcac98a405040d33b0bff2341a0975ffc9af18576","sha256:687559aebc8275c9bc216369f06547ee8b33eaae50e4e0c225a7279a3ca430ce"],"state_sha256":"09075c094e4a3908c2daa6017ea0638549fd392797c3ea9d47e3c5caf207d5a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KK8ksfs7MhS8umEdsBIDXx4Kik4DoOFJTj7sLSkl/AjRrPfytHV/mw4f1bQd6SXZpTV/QfVZ20va4tCgyknxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:26:34.156456Z","bundle_sha256":"4cde51c8197d51495f22057fff10e80e98a0610a35b8b2a89bff2f83543bbaf7"}}