{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WKCZ4YHG2REZ56OJ6GBC666YCT","short_pith_number":"pith:WKCZ4YHG","canonical_record":{"source":{"id":"1206.3288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-13T15:46:00Z","cross_cats_sorted":["cs.AI","cs.CE"],"title_canon_sha256":"95c0ef0c7db7d3ec833159b984341d9e5b9444623a6a3392a9a4e7d467d03a8c","abstract_canon_sha256":"27970879b992439ae55c5895b497f5f13b5d04762fa5bc92ff651ba8f4d36bf8"},"schema_version":"1.0"},"canonical_sha256":"b2859e60e6d4499ef9c9f1822f7bd814c72492800941ed1eb0275bb47e0043ab","source":{"kind":"arxiv","id":"1206.3288","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3288","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3288v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3288","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"WKCZ4YHG2REZ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WKCZ4YHG2REZ56OJ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WKCZ4YHG","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WKCZ4YHG2REZ56OJ6GBC666YCT","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-13T15:46:00Z","cross_cats_sorted":["cs.AI","cs.CE"],"title_canon_sha256":"95c0ef0c7db7d3ec833159b984341d9e5b9444623a6a3392a9a4e7d467d03a8c","abstract_canon_sha256":"27970879b992439ae55c5895b497f5f13b5d04762fa5bc92ff651ba8f4d36bf8"},"schema_version":"1.0"},"canonical_sha256":"b2859e60e6d4499ef9c9f1822f7bd814c72492800941ed1eb0275bb47e0043ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.724734Z","signature_b64":"SKlPGRcUVV5k78VnMd/H3vPTf+TYKeg0/Joz7sw5kTWmR4ci7EjYfw3pzPdG5uT0/OxA3qIi7LH/VSsDkdUACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2859e60e6d4499ef9c9f1822f7bd814c72492800941ed1eb0275bb47e0043ab","last_reissued_at":"2026-05-18T03:53:30.724207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.724207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3288","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9euo2TfifwPYuRnElpLUsL2zbVl/jnkxzLg1kIIbQCgyP2sIyLoOIQJlKxDEeB78Cr4bEm1fj67u89PmOrp7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:16:10.338557Z"},"content_sha256":"79d4e8371a413e69f7b77c8899b2e153eb714ba185d46932d496572e3669885d","schema_version":"1.0","event_id":"sha256:79d4e8371a413e69f7b77c8899b2e153eb714ba185d46932d496572e3669885d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WKCZ4YHG2REZ56OJ6GBC666YCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tightening LP Relaxations for MAP using Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CE"],"primary_cat":"cs.DS","authors_text":"Amir Globerson, David Sontag, Talya Meltzer, Tommi S. Jaakkola, Yair Weiss","submitted_at":"2012-06-13T15:46:00Z","abstract_excerpt":"Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently using message-passing algorithms such as belief propagation and, when the relaxation is tight, provably find the MAP configuration. The standard LP relaxation is not tight enough in many real-world problems, however, and this has lead to the use of higher order cluster-based LP relaxations. The computational cost increases exponentially with the size of the clusters and limits the number and type of clusters we can use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3288","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/CQy4wexPIegSlKOyVoLqmdI2QxaZMeo5Uf3UXUSRbt0YaIr3ow2rWY27H8+/pBdBWhxDhhx5VRTttjbS1xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:16:10.339181Z"},"content_sha256":"2ac2ab3dcd770b0db402527f27ad55bb37d795b4d45cd983681ef752a051fede","schema_version":"1.0","event_id":"sha256:2ac2ab3dcd770b0db402527f27ad55bb37d795b4d45cd983681ef752a051fede"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKCZ4YHG2REZ56OJ6GBC666YCT/bundle.json","state_url":"https://pith.science/pith/WKCZ4YHG2REZ56OJ6GBC666YCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKCZ4YHG2REZ56OJ6GBC666YCT/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-26T04:16:10Z","links":{"resolver":"https://pith.science/pith/WKCZ4YHG2REZ56OJ6GBC666YCT","bundle":"https://pith.science/pith/WKCZ4YHG2REZ56OJ6GBC666YCT/bundle.json","state":"https://pith.science/pith/WKCZ4YHG2REZ56OJ6GBC666YCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKCZ4YHG2REZ56OJ6GBC666YCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WKCZ4YHG2REZ56OJ6GBC666YCT","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":"27970879b992439ae55c5895b497f5f13b5d04762fa5bc92ff651ba8f4d36bf8","cross_cats_sorted":["cs.AI","cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-13T15:46:00Z","title_canon_sha256":"95c0ef0c7db7d3ec833159b984341d9e5b9444623a6a3392a9a4e7d467d03a8c"},"schema_version":"1.0","source":{"id":"1206.3288","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3288","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3288v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3288","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"WKCZ4YHG2REZ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WKCZ4YHG2REZ56OJ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WKCZ4YHG","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:2ac2ab3dcd770b0db402527f27ad55bb37d795b4d45cd983681ef752a051fede","target":"graph","created_at":"2026-05-18T03:53:30Z","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":"Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently using message-passing algorithms such as belief propagation and, when the relaxation is tight, provably find the MAP configuration. The standard LP relaxation is not tight enough in many real-world problems, however, and this has lead to the use of higher order cluster-based LP relaxations. The computational cost increases exponentially with the size of the clusters and limits the number and type of clusters we can use","authors_text":"Amir Globerson, David Sontag, Talya Meltzer, Tommi S. Jaakkola, Yair Weiss","cross_cats":["cs.AI","cs.CE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-13T15:46:00Z","title":"Tightening LP Relaxations for MAP using Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3288","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:79d4e8371a413e69f7b77c8899b2e153eb714ba185d46932d496572e3669885d","target":"record","created_at":"2026-05-18T03:53:30Z","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":"27970879b992439ae55c5895b497f5f13b5d04762fa5bc92ff651ba8f4d36bf8","cross_cats_sorted":["cs.AI","cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-13T15:46:00Z","title_canon_sha256":"95c0ef0c7db7d3ec833159b984341d9e5b9444623a6a3392a9a4e7d467d03a8c"},"schema_version":"1.0","source":{"id":"1206.3288","kind":"arxiv","version":1}},"canonical_sha256":"b2859e60e6d4499ef9c9f1822f7bd814c72492800941ed1eb0275bb47e0043ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2859e60e6d4499ef9c9f1822f7bd814c72492800941ed1eb0275bb47e0043ab","first_computed_at":"2026-05-18T03:53:30.724207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:30.724207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKlPGRcUVV5k78VnMd/H3vPTf+TYKeg0/Joz7sw5kTWmR4ci7EjYfw3pzPdG5uT0/OxA3qIi7LH/VSsDkdUACw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:30.724734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3288","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79d4e8371a413e69f7b77c8899b2e153eb714ba185d46932d496572e3669885d","sha256:2ac2ab3dcd770b0db402527f27ad55bb37d795b4d45cd983681ef752a051fede"],"state_sha256":"d79a29210e25ac3690ab5a146d62b9fc72d8fd5f9f2dbcd8af9c1802698147c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yctYC9dqObpNCRogMSggWnMoLf2U0fdfY1tgzT3jt4T8/l+GWOY3pr3NppdGaBKWl9S0I5ss6lDqL2zqfcLoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:16:10.342452Z","bundle_sha256":"a393bab4639ac29c281a3e1fe3c934edb6665703a4731e4d7e652513ee13c80f"}}