{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JWVYPYLQJBE6X52CY5QCVG2KAF","short_pith_number":"pith:JWVYPYLQ","canonical_record":{"source":{"id":"1212.4275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T08:58:31Z","cross_cats_sorted":[],"title_canon_sha256":"bd9a3ee23fd315d62869499ee32553d1bdb8531943d7d9b5950ad00f636f6d88","abstract_canon_sha256":"5786f11822f914cd4f150dd4db5312bc0f748c048eac88ff86664a5f4afe97d5"},"schema_version":"1.0"},"canonical_sha256":"4dab87e1704849ebf742c7602a9b4a015f42ec17a4086ed19a74e506e5746378","source":{"kind":"arxiv","id":"1212.4275","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4275","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4275v2","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4275","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"JWVYPYLQJBE6","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JWVYPYLQJBE6X52C","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JWVYPYLQ","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JWVYPYLQJBE6X52CY5QCVG2KAF","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T08:58:31Z","cross_cats_sorted":[],"title_canon_sha256":"bd9a3ee23fd315d62869499ee32553d1bdb8531943d7d9b5950ad00f636f6d88","abstract_canon_sha256":"5786f11822f914cd4f150dd4db5312bc0f748c048eac88ff86664a5f4afe97d5"},"schema_version":"1.0"},"canonical_sha256":"4dab87e1704849ebf742c7602a9b4a015f42ec17a4086ed19a74e506e5746378","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:13.650807Z","signature_b64":"6JyVLUcqnJ5kGFbvNcqdlDU/Wc+jWaKk6dx5Zw9Hz/gLdcsIXeKe8bFtp71ee0d/5V/w+EzLDd4KuhBKPMkGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dab87e1704849ebf742c7602a9b4a015f42ec17a4086ed19a74e506e5746378","last_reissued_at":"2026-05-18T03:34:13.649823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:13.649823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4275","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-18T03:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3Zj4HmiRRTOJ20PBywSfh30koDUmzEggq4D3COt/inQc4QCyjMR1zny/Ws3JeyMZ7EvUiaeGX8t/QrbD8oXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:13:00.165103Z"},"content_sha256":"f3ed4866ce16eb5f2333b2536fbeabbbec189eeb18054b451113e6a710fadddd","schema_version":"1.0","event_id":"sha256:f3ed4866ce16eb5f2333b2536fbeabbbec189eeb18054b451113e6a710fadddd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JWVYPYLQJBE6X52CY5QCVG2KAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Inexact Decomposition Algorithms For Large-Scale Separable Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Moritz Diehl, Quoc Tran Dinh","submitted_at":"2012-12-18T08:58:31Z","abstract_excerpt":"In this paper we propose a new inexact dual decomposition algorithm for solving separable convex optimization problems. This algorithm is a combination of three techniques: dual Lagrangian decomposition, smoothing and excessive gap. The algorithm requires only one primal step and two dual steps at each iteration and allows one to solve the subproblem of each component inexactly and in parallel. Moreover, the algorithmic parameters are updated automatically without any tuning strategy as in augmented Lagrangian approaches. We analyze the convergence of the algorithm and estimate its $O(\\frac{1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4275","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-18T03:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLbORvD4Oi5ciJ0KF2sPvQSh+v9IXW50C1LZODRnRn4Mn04TnaFIQCu+Ulxt7oLdZSK8y9F/oo+ASCL4PcQVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:13:00.165481Z"},"content_sha256":"fdf12e47e31af54e57c859cc43af567299500928e991a0940730a516970677b2","schema_version":"1.0","event_id":"sha256:fdf12e47e31af54e57c859cc43af567299500928e991a0940730a516970677b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWVYPYLQJBE6X52CY5QCVG2KAF/bundle.json","state_url":"https://pith.science/pith/JWVYPYLQJBE6X52CY5QCVG2KAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWVYPYLQJBE6X52CY5QCVG2KAF/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-27T01:13:00Z","links":{"resolver":"https://pith.science/pith/JWVYPYLQJBE6X52CY5QCVG2KAF","bundle":"https://pith.science/pith/JWVYPYLQJBE6X52CY5QCVG2KAF/bundle.json","state":"https://pith.science/pith/JWVYPYLQJBE6X52CY5QCVG2KAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWVYPYLQJBE6X52CY5QCVG2KAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JWVYPYLQJBE6X52CY5QCVG2KAF","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":"5786f11822f914cd4f150dd4db5312bc0f748c048eac88ff86664a5f4afe97d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T08:58:31Z","title_canon_sha256":"bd9a3ee23fd315d62869499ee32553d1bdb8531943d7d9b5950ad00f636f6d88"},"schema_version":"1.0","source":{"id":"1212.4275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4275","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4275v2","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4275","created_at":"2026-05-18T03:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"JWVYPYLQJBE6","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JWVYPYLQJBE6X52C","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JWVYPYLQ","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:fdf12e47e31af54e57c859cc43af567299500928e991a0940730a516970677b2","target":"graph","created_at":"2026-05-18T03:34:13Z","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":"In this paper we propose a new inexact dual decomposition algorithm for solving separable convex optimization problems. This algorithm is a combination of three techniques: dual Lagrangian decomposition, smoothing and excessive gap. The algorithm requires only one primal step and two dual steps at each iteration and allows one to solve the subproblem of each component inexactly and in parallel. Moreover, the algorithmic parameters are updated automatically without any tuning strategy as in augmented Lagrangian approaches. We analyze the convergence of the algorithm and estimate its $O(\\frac{1}","authors_text":"Ion Necoara, Moritz Diehl, Quoc Tran Dinh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T08:58:31Z","title":"Fast Inexact Decomposition Algorithms For Large-Scale Separable Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4275","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:f3ed4866ce16eb5f2333b2536fbeabbbec189eeb18054b451113e6a710fadddd","target":"record","created_at":"2026-05-18T03:34:13Z","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":"5786f11822f914cd4f150dd4db5312bc0f748c048eac88ff86664a5f4afe97d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-18T08:58:31Z","title_canon_sha256":"bd9a3ee23fd315d62869499ee32553d1bdb8531943d7d9b5950ad00f636f6d88"},"schema_version":"1.0","source":{"id":"1212.4275","kind":"arxiv","version":2}},"canonical_sha256":"4dab87e1704849ebf742c7602a9b4a015f42ec17a4086ed19a74e506e5746378","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dab87e1704849ebf742c7602a9b4a015f42ec17a4086ed19a74e506e5746378","first_computed_at":"2026-05-18T03:34:13.649823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:13.649823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6JyVLUcqnJ5kGFbvNcqdlDU/Wc+jWaKk6dx5Zw9Hz/gLdcsIXeKe8bFtp71ee0d/5V/w+EzLDd4KuhBKPMkGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:13.650807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3ed4866ce16eb5f2333b2536fbeabbbec189eeb18054b451113e6a710fadddd","sha256:fdf12e47e31af54e57c859cc43af567299500928e991a0940730a516970677b2"],"state_sha256":"3aa649b108e575c68085da6c02d7d6bbf5b15d2aeff24b85b5d10e00550df6e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4VOVLVgBcdUegacbMMkKizBns1Cns5BGCNcO4iZZPX2wz6EbNN07q/dZ5bY4CMuv8sV2vlCbesqABoORApkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:13:00.168083Z","bundle_sha256":"1b8085028e7af1e6391701eae91cc7578964a7945647ab8b44418cee2d6cdc28"}}