{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EBJWBUDYDX7IWHJPOW6FHEV7XQ","short_pith_number":"pith:EBJWBUDY","canonical_record":{"source":{"id":"1210.4902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-16T17:51:21Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"81d6f2fc830770747e1bbb994ecc046a37a477026a70581787d141b04de622f8","abstract_canon_sha256":"f6c1dcfba686dedbb9ac77ef6bf97d8328257d3b8e80e5f7d055b96313bd91c8"},"schema_version":"1.0"},"canonical_sha256":"205360d0781dfe8b1d2f75bc5392bfbc1287db8b3fb40e6492ae9587d38d0c9c","source":{"kind":"arxiv","id":"1210.4902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4902","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4902v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4902","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"EBJWBUDYDX7I","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EBJWBUDYDX7IWHJP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EBJWBUDY","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EBJWBUDYDX7IWHJPOW6FHEV7XQ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-16T17:51:21Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"81d6f2fc830770747e1bbb994ecc046a37a477026a70581787d141b04de622f8","abstract_canon_sha256":"f6c1dcfba686dedbb9ac77ef6bf97d8328257d3b8e80e5f7d055b96313bd91c8"},"schema_version":"1.0"},"canonical_sha256":"205360d0781dfe8b1d2f75bc5392bfbc1287db8b3fb40e6492ae9587d38d0c9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.034623Z","signature_b64":"iaXslbutBcWn1WQtYUlfmz6UL4oyf4lX9oFebzM3oBRxovCsTT/OZk+he3MwTqpbAxq12GuR73o07oHl0a75AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"205360d0781dfe8b1d2f75bc5392bfbc1287db8b3fb40e6492ae9587d38d0c9c","last_reissued_at":"2026-05-18T03:42:55.033972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.033972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4902","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:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J23WzejFmZluF403fXF7y+cgsip6aOIXGat47r4vZnIY8yW6LutyEgLpZp8xEY9A0lvUlR0BPYfOGGigvQbBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:12.063063Z"},"content_sha256":"2b1c857bf214122aa6fd7fd777d1210bc82d79ea9396feed0cf4bc720469f536","schema_version":"1.0","event_id":"sha256:2b1c857bf214122aa6fd7fd777d1210bc82d79ea9396feed0cf4bc720469f536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EBJWBUDYDX7IWHJPOW6FHEV7XQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently Searching for Frustrated Cycles in MAP Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"David Sontag, Do Kook Choe, Yitao Li","submitted_at":"2012-10-16T17:51:21Z","abstract_excerpt":"Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to introduce additional constraints that explicitly enforce cycle consistency. Earlier work showed that cluster-pursuit algorithms, which iteratively introduce cycle and other higherorder consistency constraints, allows one to exactly solve many hard inference problems. However, these a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4902","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:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zf8e0CIQFJh5Z1LlUr69JlKF5ay2H7CxlPynqXLsWRMI9K16VWx5PX0spDxkJfySP/SLX3OKn5XgdIl15P9RCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:12.063585Z"},"content_sha256":"3807efc6f7c32a2da265c5daf5f273a68b6f647650ece7eb08e2fa61275ebbc6","schema_version":"1.0","event_id":"sha256:3807efc6f7c32a2da265c5daf5f273a68b6f647650ece7eb08e2fa61275ebbc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBJWBUDYDX7IWHJPOW6FHEV7XQ/bundle.json","state_url":"https://pith.science/pith/EBJWBUDYDX7IWHJPOW6FHEV7XQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBJWBUDYDX7IWHJPOW6FHEV7XQ/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-27T14:16:12Z","links":{"resolver":"https://pith.science/pith/EBJWBUDYDX7IWHJPOW6FHEV7XQ","bundle":"https://pith.science/pith/EBJWBUDYDX7IWHJPOW6FHEV7XQ/bundle.json","state":"https://pith.science/pith/EBJWBUDYDX7IWHJPOW6FHEV7XQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBJWBUDYDX7IWHJPOW6FHEV7XQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EBJWBUDYDX7IWHJPOW6FHEV7XQ","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":"f6c1dcfba686dedbb9ac77ef6bf97d8328257d3b8e80e5f7d055b96313bd91c8","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-16T17:51:21Z","title_canon_sha256":"81d6f2fc830770747e1bbb994ecc046a37a477026a70581787d141b04de622f8"},"schema_version":"1.0","source":{"id":"1210.4902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4902","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4902v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4902","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"EBJWBUDYDX7I","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EBJWBUDYDX7IWHJP","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EBJWBUDY","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:3807efc6f7c32a2da265c5daf5f273a68b6f647650ece7eb08e2fa61275ebbc6","target":"graph","created_at":"2026-05-18T03:42:55Z","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":"Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to introduce additional constraints that explicitly enforce cycle consistency. Earlier work showed that cluster-pursuit algorithms, which iteratively introduce cycle and other higherorder consistency constraints, allows one to exactly solve many hard inference problems. However, these a","authors_text":"David Sontag, Do Kook Choe, Yitao Li","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-16T17:51:21Z","title":"Efficiently Searching for Frustrated Cycles in MAP Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4902","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:2b1c857bf214122aa6fd7fd777d1210bc82d79ea9396feed0cf4bc720469f536","target":"record","created_at":"2026-05-18T03:42:55Z","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":"f6c1dcfba686dedbb9ac77ef6bf97d8328257d3b8e80e5f7d055b96313bd91c8","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-16T17:51:21Z","title_canon_sha256":"81d6f2fc830770747e1bbb994ecc046a37a477026a70581787d141b04de622f8"},"schema_version":"1.0","source":{"id":"1210.4902","kind":"arxiv","version":1}},"canonical_sha256":"205360d0781dfe8b1d2f75bc5392bfbc1287db8b3fb40e6492ae9587d38d0c9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"205360d0781dfe8b1d2f75bc5392bfbc1287db8b3fb40e6492ae9587d38d0c9c","first_computed_at":"2026-05-18T03:42:55.033972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:55.033972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iaXslbutBcWn1WQtYUlfmz6UL4oyf4lX9oFebzM3oBRxovCsTT/OZk+he3MwTqpbAxq12GuR73o07oHl0a75AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:55.034623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b1c857bf214122aa6fd7fd777d1210bc82d79ea9396feed0cf4bc720469f536","sha256:3807efc6f7c32a2da265c5daf5f273a68b6f647650ece7eb08e2fa61275ebbc6"],"state_sha256":"fd9eb6fb1e0ebdad6bceb317967d559654d911fdb8cd417ac082143e83353bf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IrNrVMNQWpxqV8YQ4atFxUJ/e5rPuoAiYjLOGGih2iTM4rvJiiGmN9tujAEE9xPXVkWUqnIOG5MEJGMc2XzPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:16:12.066537Z","bundle_sha256":"0490f3c3e2600dbcacb597add3feede9ed590d96a727d53ad39424a3060a38b7"}}