{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EWUQVCWAVYN6UTVA7KHPHA7WWW","short_pith_number":"pith:EWUQVCWA","canonical_record":{"source":{"id":"1312.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-17T04:44:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"63c341264f1b195516ebe681e4fde5cb8aa37a0dda1f46409142c7d964458928","abstract_canon_sha256":"c3a61ab3a13ff621f4ed636c12840a5cbffacc269bcdf558b045f8c748b256e0"},"schema_version":"1.0"},"canonical_sha256":"25a90a8ac0ae1bea4ea0fa8ef383f6b5b159953688d1e9b7e86906e4022fc1bd","source":{"kind":"arxiv","id":"1312.4637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4637","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4637v2","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4637","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"EWUQVCWAVYN6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EWUQVCWAVYN6UTVA","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EWUQVCWA","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EWUQVCWAVYN6UTVA7KHPHA7WWW","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-17T04:44:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"63c341264f1b195516ebe681e4fde5cb8aa37a0dda1f46409142c7d964458928","abstract_canon_sha256":"c3a61ab3a13ff621f4ed636c12840a5cbffacc269bcdf558b045f8c748b256e0"},"schema_version":"1.0"},"canonical_sha256":"25a90a8ac0ae1bea4ea0fa8ef383f6b5b159953688d1e9b7e86906e4022fc1bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:53.370197Z","signature_b64":"mj+VLZi5rxRKBNeVKaQL0q9nlxbpUsaxFd+4of1JHqWecNYA/KElBQmWd6455/52sWlJwaN4DBfC8zuW5tkNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25a90a8ac0ae1bea4ea0fa8ef383f6b5b159953688d1e9b7e86906e4022fc1bd","last_reissued_at":"2026-05-18T02:53:53.369418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:53.369418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4637","source_version":2,"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:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oTUKOjSMXtaHM+rJI5LYYf6iSLSyTKdWxwF8OQONC7jQB0sx96enV0scxuz3OrgOznXZEDtFkuEZZRx5+bcrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:08:38.252054Z"},"content_sha256":"c1081ba27437019ada5f1efd7d7fc0e7c56284d4518af41640aff90d736d032e","schema_version":"1.0","event_id":"sha256:c1081ba27437019ada5f1efd7d7fc0e7c56284d4518af41640aff90d736d032e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EWUQVCWAVYN6UTVA7KHPHA7WWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint Reduction using Marginal Polytope Diagrams for MAP LP Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Qinfeng Shi, Yanning Zhang, Zhen Zhang","submitted_at":"2013-12-17T04:44:04Z","abstract_excerpt":"LP relaxation-based message passing algorithms provide an effective tool for MAP inference over Probabilistic Graphical Models. However, different LP relaxations often have different objective functions and variables of differing dimensions, which presents a barrier to effective comparison and analysis. In addition, the computational complexity of LP relaxation-based methods grows quickly with the number of constraints. Reducing the number of constraints without sacrificing the quality of the solutions is thus desirable.\n  We propose a unified formulation under which existing MAP LP relaxation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4637","kind":"arxiv","version":2},"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:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTGGgKNMGJJli59LB1LaLEKhv0mnK5XUQ5G2jUWp3vAffx7LuTDKvmz0wqFUnU/tZr3CLNowEV7CllhCbRAiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:08:38.252790Z"},"content_sha256":"413046d4fd511d0e03febf07677927f1cb1e3a726c651681ae0304d4acb62895","schema_version":"1.0","event_id":"sha256:413046d4fd511d0e03febf07677927f1cb1e3a726c651681ae0304d4acb62895"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWUQVCWAVYN6UTVA7KHPHA7WWW/bundle.json","state_url":"https://pith.science/pith/EWUQVCWAVYN6UTVA7KHPHA7WWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWUQVCWAVYN6UTVA7KHPHA7WWW/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-26T09:08:38Z","links":{"resolver":"https://pith.science/pith/EWUQVCWAVYN6UTVA7KHPHA7WWW","bundle":"https://pith.science/pith/EWUQVCWAVYN6UTVA7KHPHA7WWW/bundle.json","state":"https://pith.science/pith/EWUQVCWAVYN6UTVA7KHPHA7WWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWUQVCWAVYN6UTVA7KHPHA7WWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EWUQVCWAVYN6UTVA7KHPHA7WWW","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":"c3a61ab3a13ff621f4ed636c12840a5cbffacc269bcdf558b045f8c748b256e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-17T04:44:04Z","title_canon_sha256":"63c341264f1b195516ebe681e4fde5cb8aa37a0dda1f46409142c7d964458928"},"schema_version":"1.0","source":{"id":"1312.4637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4637","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4637v2","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4637","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"EWUQVCWAVYN6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EWUQVCWAVYN6UTVA","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EWUQVCWA","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:413046d4fd511d0e03febf07677927f1cb1e3a726c651681ae0304d4acb62895","target":"graph","created_at":"2026-05-18T02:53:53Z","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":"LP relaxation-based message passing algorithms provide an effective tool for MAP inference over Probabilistic Graphical Models. However, different LP relaxations often have different objective functions and variables of differing dimensions, which presents a barrier to effective comparison and analysis. In addition, the computational complexity of LP relaxation-based methods grows quickly with the number of constraints. Reducing the number of constraints without sacrificing the quality of the solutions is thus desirable.\n  We propose a unified formulation under which existing MAP LP relaxation","authors_text":"Anton van den Hengel, Chunhua Shen, Qinfeng Shi, Yanning Zhang, Zhen Zhang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-17T04:44:04Z","title":"Constraint Reduction using Marginal Polytope Diagrams for MAP LP Relaxations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4637","kind":"arxiv","version":2},"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:c1081ba27437019ada5f1efd7d7fc0e7c56284d4518af41640aff90d736d032e","target":"record","created_at":"2026-05-18T02:53:53Z","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":"c3a61ab3a13ff621f4ed636c12840a5cbffacc269bcdf558b045f8c748b256e0","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-12-17T04:44:04Z","title_canon_sha256":"63c341264f1b195516ebe681e4fde5cb8aa37a0dda1f46409142c7d964458928"},"schema_version":"1.0","source":{"id":"1312.4637","kind":"arxiv","version":2}},"canonical_sha256":"25a90a8ac0ae1bea4ea0fa8ef383f6b5b159953688d1e9b7e86906e4022fc1bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25a90a8ac0ae1bea4ea0fa8ef383f6b5b159953688d1e9b7e86906e4022fc1bd","first_computed_at":"2026-05-18T02:53:53.369418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:53.369418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mj+VLZi5rxRKBNeVKaQL0q9nlxbpUsaxFd+4of1JHqWecNYA/KElBQmWd6455/52sWlJwaN4DBfC8zuW5tkNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:53.370197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1081ba27437019ada5f1efd7d7fc0e7c56284d4518af41640aff90d736d032e","sha256:413046d4fd511d0e03febf07677927f1cb1e3a726c651681ae0304d4acb62895"],"state_sha256":"2baf4910b8f5bcabd808da034c4d0494c33e6573cdae8c82f0d7c67ac518131b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILIWKijvtERRtxrWRlUJJq9JX/mi8+qYhOfNtcUPQlseNf2Iu4/3qANR+O+XJRIQea2Bzmouaz3NZ/PehofLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:08:38.256596Z","bundle_sha256":"7daf66644bffef06721a292406967c675dbc226d78521524032bd5d665843748"}}