{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B6JLLR5BWSISBD3BPHO6IOXMAN","short_pith_number":"pith:B6JLLR5B","canonical_record":{"source":{"id":"1405.5208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-23T02:50:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c5248ec5b03f295a599bfdabf5fc51e78077443f907083703dff87232f25c188","abstract_canon_sha256":"7b4581fe3ac19b3c4ff4c7335fc932e580faa4edcc36b75be32a4e216e900653"},"schema_version":"1.0"},"canonical_sha256":"0f92b5c7a1b491208f6179dde43aec034dc2d2de869d814a8ad375d6abda2bec","source":{"kind":"arxiv","id":"1405.5208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5208","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5208v1","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5208","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"B6JLLR5BWSIS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B6JLLR5BWSISBD3B","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B6JLLR5B","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B6JLLR5BWSISBD3BPHO6IOXMAN","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-23T02:50:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c5248ec5b03f295a599bfdabf5fc51e78077443f907083703dff87232f25c188","abstract_canon_sha256":"7b4581fe3ac19b3c4ff4c7335fc932e580faa4edcc36b75be32a4e216e900653"},"schema_version":"1.0"},"canonical_sha256":"0f92b5c7a1b491208f6179dde43aec034dc2d2de869d814a8ad375d6abda2bec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:25.831959Z","signature_b64":"Aw5GBiZimnmFxlUwXTNbUui44rnj4ic0CLVve+KI4ZYptp7xd5lczmlGkJ1Gf/14HkTgg5czD3I4q67TgUzuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f92b5c7a1b491208f6179dde43aec034dc2d2de869d814a8ad375d6abda2bec","last_reissued_at":"2026-05-18T02:51:25.831332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:25.831332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5208","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-18T02:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmEJ6d0TL84B8RcT72C+qIVbMWqBc7Ew+QHUN3r5tTYdh6nvo/NB58yVxvGPt/kyhzCBGa6PnG3Sk/Wh68RcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:02:20.139841Z"},"content_sha256":"41738333f0c833b319dd851e53953d094a53cb155d79a1c7bf8965919cc01be2","schema_version":"1.0","event_id":"sha256:41738333f0c833b319dd851e53953d094a53cb155d79a1c7bf8965919cc01be2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B6JLLR5BWSISBD3BPHO6IOXMAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Alexander M. Rush, Michael Collins","submitted_at":"2014-01-23T02:50:15Z","abstract_excerpt":"Dual decomposition, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language processing (NLP). This tutorial gives an overview of the technique. We describe example algorithms, describe formal guarantees for the method, and describe practical issues in implementing the algorithms. While our examples are predominantly drawn from the NLP literature, the material should be of general relevance to inference problems in machine learning. A central theme of this tutorial is that Lagr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5208","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-18T02:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sd9ur02pCOzhBQWbJKSAT5l1TYQQlp8heGpMGYNSrg6LkgsN71u+Qnvi5Fd0QyyFWUALRHkRPlzbGjlfGCyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:02:20.140225Z"},"content_sha256":"01e3704fbf41df7aaf972b86c981b8b1f5d32eaeaac10f2e9b4c530a19c28ad9","schema_version":"1.0","event_id":"sha256:01e3704fbf41df7aaf972b86c981b8b1f5d32eaeaac10f2e9b4c530a19c28ad9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6JLLR5BWSISBD3BPHO6IOXMAN/bundle.json","state_url":"https://pith.science/pith/B6JLLR5BWSISBD3BPHO6IOXMAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6JLLR5BWSISBD3BPHO6IOXMAN/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-07-05T15:02:20Z","links":{"resolver":"https://pith.science/pith/B6JLLR5BWSISBD3BPHO6IOXMAN","bundle":"https://pith.science/pith/B6JLLR5BWSISBD3BPHO6IOXMAN/bundle.json","state":"https://pith.science/pith/B6JLLR5BWSISBD3BPHO6IOXMAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6JLLR5BWSISBD3BPHO6IOXMAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B6JLLR5BWSISBD3BPHO6IOXMAN","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":"7b4581fe3ac19b3c4ff4c7335fc932e580faa4edcc36b75be32a4e216e900653","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-23T02:50:15Z","title_canon_sha256":"c5248ec5b03f295a599bfdabf5fc51e78077443f907083703dff87232f25c188"},"schema_version":"1.0","source":{"id":"1405.5208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5208","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5208v1","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5208","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"B6JLLR5BWSIS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B6JLLR5BWSISBD3B","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B6JLLR5B","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:01e3704fbf41df7aaf972b86c981b8b1f5d32eaeaac10f2e9b4c530a19c28ad9","target":"graph","created_at":"2026-05-18T02:51:25Z","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, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language processing (NLP). This tutorial gives an overview of the technique. We describe example algorithms, describe formal guarantees for the method, and describe practical issues in implementing the algorithms. While our examples are predominantly drawn from the NLP literature, the material should be of general relevance to inference problems in machine learning. A central theme of this tutorial is that Lagr","authors_text":"Alexander M. Rush, Michael Collins","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-23T02:50:15Z","title":"A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5208","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:41738333f0c833b319dd851e53953d094a53cb155d79a1c7bf8965919cc01be2","target":"record","created_at":"2026-05-18T02:51:25Z","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":"7b4581fe3ac19b3c4ff4c7335fc932e580faa4edcc36b75be32a4e216e900653","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-23T02:50:15Z","title_canon_sha256":"c5248ec5b03f295a599bfdabf5fc51e78077443f907083703dff87232f25c188"},"schema_version":"1.0","source":{"id":"1405.5208","kind":"arxiv","version":1}},"canonical_sha256":"0f92b5c7a1b491208f6179dde43aec034dc2d2de869d814a8ad375d6abda2bec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f92b5c7a1b491208f6179dde43aec034dc2d2de869d814a8ad375d6abda2bec","first_computed_at":"2026-05-18T02:51:25.831332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:25.831332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aw5GBiZimnmFxlUwXTNbUui44rnj4ic0CLVve+KI4ZYptp7xd5lczmlGkJ1Gf/14HkTgg5czD3I4q67TgUzuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:25.831959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41738333f0c833b319dd851e53953d094a53cb155d79a1c7bf8965919cc01be2","sha256:01e3704fbf41df7aaf972b86c981b8b1f5d32eaeaac10f2e9b4c530a19c28ad9"],"state_sha256":"b0e10b6e6cb2128f66bcc8068ac2715f76bb78b2f81a1622f41a8480e0ec1734"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xAAm82u8DmhdTg9alviaIRXvcKtVYZeXD4shUnfbwyKMdeQrzxw+RUpJnRxaIgBHV1GfiErZbLI6S2x/wrfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:02:20.142956Z","bundle_sha256":"f0c80f88ac5ded8e6c572d3d86f7ca9bfa0010aad0410dd2ca560db57dd035e3"}}