{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HUWADFQ6GMBAYORCJRZL6DD6R3","short_pith_number":"pith:HUWADFQ6","canonical_record":{"source":{"id":"1401.4398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T16:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"51991b8dc03612e9b125b5f3f896c7c2cc5f196b06d1dbe3e6b5716c0ac29bf0","abstract_canon_sha256":"b7313b0fdc8d8aa2a733c47c00050ce4de77034cb373a486d875b62dda1df144"},"schema_version":"1.0"},"canonical_sha256":"3d2c01961e33020c3a224c72bf0c7e8ef8a316e64b206ca829971dab5e1b5d78","source":{"kind":"arxiv","id":"1401.4398","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4398","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4398v2","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4398","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"HUWADFQ6GMBA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HUWADFQ6GMBAYORC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HUWADFQ6","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HUWADFQ6GMBAYORCJRZL6DD6R3","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T16:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"51991b8dc03612e9b125b5f3f896c7c2cc5f196b06d1dbe3e6b5716c0ac29bf0","abstract_canon_sha256":"b7313b0fdc8d8aa2a733c47c00050ce4de77034cb373a486d875b62dda1df144"},"schema_version":"1.0"},"canonical_sha256":"3d2c01961e33020c3a224c72bf0c7e8ef8a316e64b206ca829971dab5e1b5d78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:25.249408Z","signature_b64":"dn+H1FfmruvHUHkwH26gvfe2MC9ix08YPe02mdEKcRJoY8rlxbL0MgaqNVVBLyF7rwis0kLGmz29W0hllX6vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d2c01961e33020c3a224c72bf0c7e8ef8a316e64b206ca829971dab5e1b5d78","last_reissued_at":"2026-05-18T03:00:25.248551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:25.248551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4398","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:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4F+T4ddzZ3kXP/fhPHecs3+scpXcZkj0G3myDZLDmqGnlvXPB3YbvCnnmCBpqyUJX8nDlO66tjrYfuks20TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:37:13.117911Z"},"content_sha256":"b0484ec7c18a6f7af5c75a232b91dbdfe000b43d52d7e92d876d1771a323d67d","schema_version":"1.0","event_id":"sha256:b0484ec7c18a6f7af5c75a232b91dbdfe000b43d52d7e92d876d1771a323d67d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HUWADFQ6GMBAYORCJRZL6DD6R3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed dual gradient methods and error bound conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Valentin Nedelcu","submitted_at":"2014-01-17T16:13:09Z","abstract_excerpt":"In this paper we propose distributed dual gradient algorithms for linearly constrained separable convex problems and analyze their rate of convergence under different assumptions. Under the strong convexity assumption on the primal objective function we propose two distributed dual fast gradient schemes for which we prove sublinear rate of convergence for dual suboptimality but also primal suboptimality and feasibility violation for an average primal sequence or for the last generated primal iterate. Under the additional assumption of Lipshitz continuity of the gradient of the primal objective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4398","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:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7W6WEHxYwyNTif36ToOIjuAHiO6TUQwxV2OXOBtwq6jAKB2z8xqeDe6WE37pE8CxIIPHXqo+VFs/oL7b5dyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:37:13.118601Z"},"content_sha256":"cd664fea4aed62d5e729e5178b0f5ca53459bcfb5de63da188671becf780fe9d","schema_version":"1.0","event_id":"sha256:cd664fea4aed62d5e729e5178b0f5ca53459bcfb5de63da188671becf780fe9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUWADFQ6GMBAYORCJRZL6DD6R3/bundle.json","state_url":"https://pith.science/pith/HUWADFQ6GMBAYORCJRZL6DD6R3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUWADFQ6GMBAYORCJRZL6DD6R3/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-26T06:37:13Z","links":{"resolver":"https://pith.science/pith/HUWADFQ6GMBAYORCJRZL6DD6R3","bundle":"https://pith.science/pith/HUWADFQ6GMBAYORCJRZL6DD6R3/bundle.json","state":"https://pith.science/pith/HUWADFQ6GMBAYORCJRZL6DD6R3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUWADFQ6GMBAYORCJRZL6DD6R3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HUWADFQ6GMBAYORCJRZL6DD6R3","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":"b7313b0fdc8d8aa2a733c47c00050ce4de77034cb373a486d875b62dda1df144","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T16:13:09Z","title_canon_sha256":"51991b8dc03612e9b125b5f3f896c7c2cc5f196b06d1dbe3e6b5716c0ac29bf0"},"schema_version":"1.0","source":{"id":"1401.4398","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4398","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4398v2","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4398","created_at":"2026-05-18T03:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"HUWADFQ6GMBA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HUWADFQ6GMBAYORC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HUWADFQ6","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:cd664fea4aed62d5e729e5178b0f5ca53459bcfb5de63da188671becf780fe9d","target":"graph","created_at":"2026-05-18T03:00: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":"In this paper we propose distributed dual gradient algorithms for linearly constrained separable convex problems and analyze their rate of convergence under different assumptions. Under the strong convexity assumption on the primal objective function we propose two distributed dual fast gradient schemes for which we prove sublinear rate of convergence for dual suboptimality but also primal suboptimality and feasibility violation for an average primal sequence or for the last generated primal iterate. Under the additional assumption of Lipshitz continuity of the gradient of the primal objective","authors_text":"Ion Necoara, Valentin Nedelcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T16:13:09Z","title":"Distributed dual gradient methods and error bound conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4398","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:b0484ec7c18a6f7af5c75a232b91dbdfe000b43d52d7e92d876d1771a323d67d","target":"record","created_at":"2026-05-18T03:00: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":"b7313b0fdc8d8aa2a733c47c00050ce4de77034cb373a486d875b62dda1df144","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-17T16:13:09Z","title_canon_sha256":"51991b8dc03612e9b125b5f3f896c7c2cc5f196b06d1dbe3e6b5716c0ac29bf0"},"schema_version":"1.0","source":{"id":"1401.4398","kind":"arxiv","version":2}},"canonical_sha256":"3d2c01961e33020c3a224c72bf0c7e8ef8a316e64b206ca829971dab5e1b5d78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d2c01961e33020c3a224c72bf0c7e8ef8a316e64b206ca829971dab5e1b5d78","first_computed_at":"2026-05-18T03:00:25.248551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:25.248551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dn+H1FfmruvHUHkwH26gvfe2MC9ix08YPe02mdEKcRJoY8rlxbL0MgaqNVVBLyF7rwis0kLGmz29W0hllX6vDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:25.249408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4398","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0484ec7c18a6f7af5c75a232b91dbdfe000b43d52d7e92d876d1771a323d67d","sha256:cd664fea4aed62d5e729e5178b0f5ca53459bcfb5de63da188671becf780fe9d"],"state_sha256":"2e1f949d583964667d38bd785967a228aeca9cc1fc7bf628aa6f59bbe9ec1409"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H22I+Q1xlbeibAnVhbPXrwHzwrN9IBbxudFGO5hYIbL1G5S0ATUp896rSUMGnTtIB5/R2WypMJbWZLmMPUsGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:37:13.122247Z","bundle_sha256":"fa3e83539d760f8ffe197c9df5ebfe4b02b570191c3f346da712a74a22e0f406"}}