{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7HTPJHO6KMBMPSHGIEOPMFT23B","short_pith_number":"pith:7HTPJHO6","canonical_record":{"source":{"id":"1511.02619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-09T10:21:39Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"6c4c3ebfe9b356b8c4a4277b50e3669ef0d4cbe51a508a1bea9cff3b4be4938b","abstract_canon_sha256":"4f244ab2237a963a18e3acde0ccdea452ffafb76e4a38d228848e54ffcea7d2f"},"schema_version":"1.0"},"canonical_sha256":"f9e6f49dde5302c7c8e6411cf6167ad877e71e61d1800f0074f238f1b3a24c85","source":{"kind":"arxiv","id":"1511.02619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02619","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02619v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02619","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"7HTPJHO6KMBM","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7HTPJHO6KMBMPSHG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7HTPJHO6","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7HTPJHO6KMBMPSHGIEOPMFT23B","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-09T10:21:39Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"6c4c3ebfe9b356b8c4a4277b50e3669ef0d4cbe51a508a1bea9cff3b4be4938b","abstract_canon_sha256":"4f244ab2237a963a18e3acde0ccdea452ffafb76e4a38d228848e54ffcea7d2f"},"schema_version":"1.0"},"canonical_sha256":"f9e6f49dde5302c7c8e6411cf6167ad877e71e61d1800f0074f238f1b3a24c85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:29.778409Z","signature_b64":"zgh8xkrqBn/IkrHxqQbvOV8bUM4wo8vBYVL0l7E13xkAapz0E8yU2T+Sp5qOI8fG1GZBTD9TZ/0HVGpeSGJqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9e6f49dde5302c7c8e6411cf6167ad877e71e61d1800f0074f238f1b3a24c85","last_reissued_at":"2026-05-18T01:27:29.777841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:29.777841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02619","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-18T01:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uyIdTscFUAE7g22VpYoMq491yEWHzX0kZCHZHw65vG3xImeP7WzoWnw9F9eF7iNBdF1Eo2GjYtMdLmreJAtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:09:51.817565Z"},"content_sha256":"94f431444e86e2e581997b2c48f26bcd7dea19d2eb129bcff10c613fe81941cc","schema_version":"1.0","event_id":"sha256:94f431444e86e2e581997b2c48f26bcd7dea19d2eb129bcff10c613fe81941cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7HTPJHO6KMBMPSHGIEOPMFT23B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition Bounds for Marginal MAP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Ihler, Qiang Liu, Wei Ping","submitted_at":"2015-11-09T10:21:39Z","abstract_excerpt":"Marginal MAP inference involves making MAP predictions in systems defined with latent variables or missing information. It is significantly more difficult than pure marginalization and MAP tasks, for which a large class of efficient and convergent variational algorithms, such as dual decomposition, exist. In this work, we generalize dual decomposition to a generic power sum inference task, which includes marginal MAP, along with pure marginalization and MAP, as special cases. Our method is based on a block coordinate descent algorithm on a new convex decomposition bound, that is guaranteed to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02619","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-18T01:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BM7U2D/W8FAF3dzWiADdDPoDVphfrG6KJbbn/kE8QlCbxkuD3NZLbyt5UvbXY2Eikdus730mUHrjr9cRDEPECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:09:51.818253Z"},"content_sha256":"b8a566dc53cebb30ae3eb88468b6ba0c9bf5735cbef19f0adc0d9bdff67de281","schema_version":"1.0","event_id":"sha256:b8a566dc53cebb30ae3eb88468b6ba0c9bf5735cbef19f0adc0d9bdff67de281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HTPJHO6KMBMPSHGIEOPMFT23B/bundle.json","state_url":"https://pith.science/pith/7HTPJHO6KMBMPSHGIEOPMFT23B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HTPJHO6KMBMPSHGIEOPMFT23B/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-31T12:09:51Z","links":{"resolver":"https://pith.science/pith/7HTPJHO6KMBMPSHGIEOPMFT23B","bundle":"https://pith.science/pith/7HTPJHO6KMBMPSHGIEOPMFT23B/bundle.json","state":"https://pith.science/pith/7HTPJHO6KMBMPSHGIEOPMFT23B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HTPJHO6KMBMPSHGIEOPMFT23B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7HTPJHO6KMBMPSHGIEOPMFT23B","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":"4f244ab2237a963a18e3acde0ccdea452ffafb76e4a38d228848e54ffcea7d2f","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-09T10:21:39Z","title_canon_sha256":"6c4c3ebfe9b356b8c4a4277b50e3669ef0d4cbe51a508a1bea9cff3b4be4938b"},"schema_version":"1.0","source":{"id":"1511.02619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02619","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02619v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02619","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"7HTPJHO6KMBM","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7HTPJHO6KMBMPSHG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7HTPJHO6","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:b8a566dc53cebb30ae3eb88468b6ba0c9bf5735cbef19f0adc0d9bdff67de281","target":"graph","created_at":"2026-05-18T01:27:29Z","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":"Marginal MAP inference involves making MAP predictions in systems defined with latent variables or missing information. It is significantly more difficult than pure marginalization and MAP tasks, for which a large class of efficient and convergent variational algorithms, such as dual decomposition, exist. In this work, we generalize dual decomposition to a generic power sum inference task, which includes marginal MAP, along with pure marginalization and MAP, as special cases. Our method is based on a block coordinate descent algorithm on a new convex decomposition bound, that is guaranteed to ","authors_text":"Alexander Ihler, Qiang Liu, Wei Ping","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-09T10:21:39Z","title":"Decomposition Bounds for Marginal MAP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02619","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:94f431444e86e2e581997b2c48f26bcd7dea19d2eb129bcff10c613fe81941cc","target":"record","created_at":"2026-05-18T01:27:29Z","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":"4f244ab2237a963a18e3acde0ccdea452ffafb76e4a38d228848e54ffcea7d2f","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-09T10:21:39Z","title_canon_sha256":"6c4c3ebfe9b356b8c4a4277b50e3669ef0d4cbe51a508a1bea9cff3b4be4938b"},"schema_version":"1.0","source":{"id":"1511.02619","kind":"arxiv","version":1}},"canonical_sha256":"f9e6f49dde5302c7c8e6411cf6167ad877e71e61d1800f0074f238f1b3a24c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9e6f49dde5302c7c8e6411cf6167ad877e71e61d1800f0074f238f1b3a24c85","first_computed_at":"2026-05-18T01:27:29.777841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:29.777841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zgh8xkrqBn/IkrHxqQbvOV8bUM4wo8vBYVL0l7E13xkAapz0E8yU2T+Sp5qOI8fG1GZBTD9TZ/0HVGpeSGJqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:29.778409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94f431444e86e2e581997b2c48f26bcd7dea19d2eb129bcff10c613fe81941cc","sha256:b8a566dc53cebb30ae3eb88468b6ba0c9bf5735cbef19f0adc0d9bdff67de281"],"state_sha256":"0845f8775951931658e38f69c6a585834a30aeba9ad479a58958f27377e35b82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1VO2XMjFQLpqyBk8yr8br7OsewFdms98l7q5duFk9jjAvqHPSNJBstX0EulZyGapXYKGApS+riza01de07kvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:09:51.822220Z","bundle_sha256":"7d401eb1d536cc7ee13a468c0811bd176159ec20d5f1762000b98f67e56c9419"}}