{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UB5TJNCRXDBPFEYB6NKGWDC4RX","short_pith_number":"pith:UB5TJNCR","canonical_record":{"source":{"id":"1405.4807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-19T16:58:24Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"d6f0230bb9f3f9ff6712a84299d94e3886a2779f08839311d21afd74767134a5","abstract_canon_sha256":"fd18334474a7241360347795dd865e33ad49f7f4db122019abbc0c86dab8a447"},"schema_version":"1.0"},"canonical_sha256":"a07b34b451b8c2f29301f3546b0c5c8df28e655a84cc69a5882789a38017595b","source":{"kind":"arxiv","id":"1405.4807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4807","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4807v1","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4807","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"UB5TJNCRXDBP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UB5TJNCRXDBPFEYB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UB5TJNCR","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UB5TJNCRXDBPFEYB6NKGWDC4RX","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-19T16:58:24Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"d6f0230bb9f3f9ff6712a84299d94e3886a2779f08839311d21afd74767134a5","abstract_canon_sha256":"fd18334474a7241360347795dd865e33ad49f7f4db122019abbc0c86dab8a447"},"schema_version":"1.0"},"canonical_sha256":"a07b34b451b8c2f29301f3546b0c5c8df28e655a84cc69a5882789a38017595b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.269580Z","signature_b64":"pn3jtOx9LBK9h4KjPlzKS1GsYWgTzFuQHotnqoZkr6Xan52A7ILt48Cw1sCyW9wI6qnfR29klOQrFx04Tf6GCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07b34b451b8c2f29301f3546b0c5c8df28e655a84cc69a5882789a38017595b","last_reissued_at":"2026-05-18T02:30:08.268982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.268982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4807","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-18T02:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ctUfbUycYi1x5qpB4K2PKPh5G8FHh+hB5LnHgei+T7Vl8q2fAnq2rC2KK6L9RNISYsY6vlFSJq21p3Ea58l3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:41:35.234514Z"},"content_sha256":"f26780271f9594512dab64c522437f012c70fbabe67551d9b79a6e86c8a990c3","schema_version":"1.0","event_id":"sha256:f26780271f9594512dab64c522437f012c70fbabe67551d9b79a6e86c8a990c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UB5TJNCRXDBPFEYB6NKGWDC4RX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Semidefinite Relaxation for Maximum A Posterior Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Leonidas Guibas, Qixing Huang, Yuxin Chen","submitted_at":"2014-05-19T16:58:24Z","abstract_excerpt":"Maximum a posteriori (MAP) inference over discrete Markov random fields is a fundamental task spanning a wide spectrum of real-world applications, which is known to be NP-hard for general graphs. In this paper, we propose a novel semidefinite relaxation formulation (referred to as SDR) to estimate the MAP assignment. Algorithmically, we develop an accelerated variant of the alternating direction method of multipliers (referred to as SDPAD-LR) that can effectively exploit the special structure of the new relaxation. Encouragingly, the proposed procedure allows solving SDR for large-scale proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4807","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-18T02:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJtYe4HbjoxsyodVlxAJyh8uIRbcc1tGVa6ILyFQ9/jUeRK6cNXzt6aZJKQN3RMH2uKswZVPZGoy3VbftoDxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:41:35.235145Z"},"content_sha256":"59af3260f8150da0ca705fe5dfecf4f7552a456d8cca720bde7f8d5629339df8","schema_version":"1.0","event_id":"sha256:59af3260f8150da0ca705fe5dfecf4f7552a456d8cca720bde7f8d5629339df8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UB5TJNCRXDBPFEYB6NKGWDC4RX/bundle.json","state_url":"https://pith.science/pith/UB5TJNCRXDBPFEYB6NKGWDC4RX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UB5TJNCRXDBPFEYB6NKGWDC4RX/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-11T17:41:35Z","links":{"resolver":"https://pith.science/pith/UB5TJNCRXDBPFEYB6NKGWDC4RX","bundle":"https://pith.science/pith/UB5TJNCRXDBPFEYB6NKGWDC4RX/bundle.json","state":"https://pith.science/pith/UB5TJNCRXDBPFEYB6NKGWDC4RX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UB5TJNCRXDBPFEYB6NKGWDC4RX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UB5TJNCRXDBPFEYB6NKGWDC4RX","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":"fd18334474a7241360347795dd865e33ad49f7f4db122019abbc0c86dab8a447","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-19T16:58:24Z","title_canon_sha256":"d6f0230bb9f3f9ff6712a84299d94e3886a2779f08839311d21afd74767134a5"},"schema_version":"1.0","source":{"id":"1405.4807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4807","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4807v1","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4807","created_at":"2026-05-18T02:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"UB5TJNCRXDBP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UB5TJNCRXDBPFEYB","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UB5TJNCR","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:59af3260f8150da0ca705fe5dfecf4f7552a456d8cca720bde7f8d5629339df8","target":"graph","created_at":"2026-05-18T02:30:08Z","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":"Maximum a posteriori (MAP) inference over discrete Markov random fields is a fundamental task spanning a wide spectrum of real-world applications, which is known to be NP-hard for general graphs. In this paper, we propose a novel semidefinite relaxation formulation (referred to as SDR) to estimate the MAP assignment. Algorithmically, we develop an accelerated variant of the alternating direction method of multipliers (referred to as SDPAD-LR) that can effectively exploit the special structure of the new relaxation. Encouragingly, the proposed procedure allows solving SDR for large-scale proble","authors_text":"Leonidas Guibas, Qixing Huang, Yuxin Chen","cross_cats":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-19T16:58:24Z","title":"Scalable Semidefinite Relaxation for Maximum A Posterior Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4807","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:f26780271f9594512dab64c522437f012c70fbabe67551d9b79a6e86c8a990c3","target":"record","created_at":"2026-05-18T02:30:08Z","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":"fd18334474a7241360347795dd865e33ad49f7f4db122019abbc0c86dab8a447","cross_cats_sorted":["cs.CV","cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-19T16:58:24Z","title_canon_sha256":"d6f0230bb9f3f9ff6712a84299d94e3886a2779f08839311d21afd74767134a5"},"schema_version":"1.0","source":{"id":"1405.4807","kind":"arxiv","version":1}},"canonical_sha256":"a07b34b451b8c2f29301f3546b0c5c8df28e655a84cc69a5882789a38017595b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a07b34b451b8c2f29301f3546b0c5c8df28e655a84cc69a5882789a38017595b","first_computed_at":"2026-05-18T02:30:08.268982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:08.268982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pn3jtOx9LBK9h4KjPlzKS1GsYWgTzFuQHotnqoZkr6Xan52A7ILt48Cw1sCyW9wI6qnfR29klOQrFx04Tf6GCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:08.269580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f26780271f9594512dab64c522437f012c70fbabe67551d9b79a6e86c8a990c3","sha256:59af3260f8150da0ca705fe5dfecf4f7552a456d8cca720bde7f8d5629339df8"],"state_sha256":"a8f31d0a5b065b8f2090ecf49e05c073532a24e855c72afdb447d834fa9d52f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jI9fkO7joK6yXsRAXYaTN7Y26Zg/WH0GG9lRKbykz7JhoMJzCFXPp7NOHrfm9J3STa8dFaPbrtP7pdTrGF0EBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:41:35.238714Z","bundle_sha256":"d9b111442772f2f62e94d3847106190216a7236852ba469fd978cf85c51b8452"}}