{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IAFAXYRA3K3ZHES2B5KLDJ57KP","short_pith_number":"pith:IAFAXYRA","canonical_record":{"source":{"id":"1309.6848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:45:22Z","cross_cats_sorted":[],"title_canon_sha256":"f656c8a21ba42bbc0b700883ccbdcc4afc31c6e92aab75d235f4b88d310c0438","abstract_canon_sha256":"e6f956a15bf71cca6eb7834d94b2b0c6b3583b472710b68d722f9a8f793b566f"},"schema_version":"1.0"},"canonical_sha256":"400a0be220dab793925a0f54b1a7bf53e88934580556a8a20ae98065de36dc43","source":{"kind":"arxiv","id":"1309.6848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6848","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6848v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6848","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"IAFAXYRA3K3Z","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IAFAXYRA3K3ZHES2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IAFAXYRA","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IAFAXYRA3K3ZHES2B5KLDJ57KP","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:45:22Z","cross_cats_sorted":[],"title_canon_sha256":"f656c8a21ba42bbc0b700883ccbdcc4afc31c6e92aab75d235f4b88d310c0438","abstract_canon_sha256":"e6f956a15bf71cca6eb7834d94b2b0c6b3583b472710b68d722f9a8f793b566f"},"schema_version":"1.0"},"canonical_sha256":"400a0be220dab793925a0f54b1a7bf53e88934580556a8a20ae98065de36dc43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.101522Z","signature_b64":"z0CE3YedjhVJfZtqynCXsl3hmD+ECE1j4itAH3KFoVkWh4QiT1cDmOApOTWt99QI4++6r997LB5g6bf/iw+QBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"400a0be220dab793925a0f54b1a7bf53e88934580556a8a20ae98065de36dc43","last_reissued_at":"2026-05-18T03:12:10.100851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.100851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6848","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5w+TUtbMlZSiVzQcg8Kpd82cA/8d34b5uIvBtGEsCIga2zIB8yIvFDDLdXhmnJD35UJjhxzS7h6ZanOdDuwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:40.331411Z"},"content_sha256":"72b784de65df47085cb11cac07f4dce6b8d94c1ba5ecd2eb574c7e75ae4c4dd6","schema_version":"1.0","event_id":"sha256:72b784de65df47085cb11cac07f4dce6b8d94c1ba5ecd2eb574c7e75ae4c4dd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IAFAXYRA3K3ZHES2B5KLDJ57KP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tighter Linear Program Relaxations for High Order Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Amir Globerson, Daniel Tarlow, Elad Mezuman, Yair Weiss","submitted_at":"2013-09-26T12:45:22Z","abstract_excerpt":"Graphical models with High Order Potentials (HOPs) have received considerable interest in recent years. While there are a variety of approaches to inference in these models, nearly all of them amount to solving a linear program (LP) relaxation with unary consistency constraints between the HOP and the individual variables. In many cases, the resulting relaxations are loose, and in these cases the results of inference can be poor. It is thus desirable to look for more accurate ways of performing inference in these models. In this work, we study the LP relaxations that result from enforcing addi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6848","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSt7dYY76IRE2JCPDkIZuhyDgdI2Vz/u2s7sG9+MvCGGp3v6V2IKLZH5q7wqxkGSZicYKiLmQo7yS+koX8OUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:10:40.332123Z"},"content_sha256":"716d379caff30c939c9a22cb17c7e3087263da039d11bcfcb849aa6b5f1d653c","schema_version":"1.0","event_id":"sha256:716d379caff30c939c9a22cb17c7e3087263da039d11bcfcb849aa6b5f1d653c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAFAXYRA3K3ZHES2B5KLDJ57KP/bundle.json","state_url":"https://pith.science/pith/IAFAXYRA3K3ZHES2B5KLDJ57KP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAFAXYRA3K3ZHES2B5KLDJ57KP/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-26T01:10:40Z","links":{"resolver":"https://pith.science/pith/IAFAXYRA3K3ZHES2B5KLDJ57KP","bundle":"https://pith.science/pith/IAFAXYRA3K3ZHES2B5KLDJ57KP/bundle.json","state":"https://pith.science/pith/IAFAXYRA3K3ZHES2B5KLDJ57KP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAFAXYRA3K3ZHES2B5KLDJ57KP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IAFAXYRA3K3ZHES2B5KLDJ57KP","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":"e6f956a15bf71cca6eb7834d94b2b0c6b3583b472710b68d722f9a8f793b566f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:45:22Z","title_canon_sha256":"f656c8a21ba42bbc0b700883ccbdcc4afc31c6e92aab75d235f4b88d310c0438"},"schema_version":"1.0","source":{"id":"1309.6848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6848","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6848v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6848","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"IAFAXYRA3K3Z","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IAFAXYRA3K3ZHES2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IAFAXYRA","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:716d379caff30c939c9a22cb17c7e3087263da039d11bcfcb849aa6b5f1d653c","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"Graphical models with High Order Potentials (HOPs) have received considerable interest in recent years. While there are a variety of approaches to inference in these models, nearly all of them amount to solving a linear program (LP) relaxation with unary consistency constraints between the HOP and the individual variables. In many cases, the resulting relaxations are loose, and in these cases the results of inference can be poor. It is thus desirable to look for more accurate ways of performing inference in these models. In this work, we study the LP relaxations that result from enforcing addi","authors_text":"Amir Globerson, Daniel Tarlow, Elad Mezuman, Yair Weiss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:45:22Z","title":"Tighter Linear Program Relaxations for High Order Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6848","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:72b784de65df47085cb11cac07f4dce6b8d94c1ba5ecd2eb574c7e75ae4c4dd6","target":"record","created_at":"2026-05-18T03:12:10Z","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":"e6f956a15bf71cca6eb7834d94b2b0c6b3583b472710b68d722f9a8f793b566f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:45:22Z","title_canon_sha256":"f656c8a21ba42bbc0b700883ccbdcc4afc31c6e92aab75d235f4b88d310c0438"},"schema_version":"1.0","source":{"id":"1309.6848","kind":"arxiv","version":1}},"canonical_sha256":"400a0be220dab793925a0f54b1a7bf53e88934580556a8a20ae98065de36dc43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"400a0be220dab793925a0f54b1a7bf53e88934580556a8a20ae98065de36dc43","first_computed_at":"2026-05-18T03:12:10.100851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.100851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z0CE3YedjhVJfZtqynCXsl3hmD+ECE1j4itAH3KFoVkWh4QiT1cDmOApOTWt99QI4++6r997LB5g6bf/iw+QBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.101522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72b784de65df47085cb11cac07f4dce6b8d94c1ba5ecd2eb574c7e75ae4c4dd6","sha256:716d379caff30c939c9a22cb17c7e3087263da039d11bcfcb849aa6b5f1d653c"],"state_sha256":"b85ea094acb36d64e79bba0c65de10d127a9b502834e2e0038d83e7544121c22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pkJ3CCGcX16MNKisqB7CxYNn9uXEb8FhwHyeJie97lk9AxxknMLFyaCH5sDkbuwe+0hQW4Xj5AyW1Nte25kCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:10:40.335720Z","bundle_sha256":"49eb454a704421d3263989559b7ae97c43c74ec2a39158de888efebac6bd2aff"}}