{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KTWAQZG7DX3AE5NKULHF7KC3ES","short_pith_number":"pith:KTWAQZG7","canonical_record":{"source":{"id":"1302.3129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T14:58:18Z","cross_cats_sorted":[],"title_canon_sha256":"0b203907cc9207b339a6f2482378e1ff70c8e37da254ac335a5f306e94f169d0","abstract_canon_sha256":"51f35cae77b0fe1ca31f1fd0aecafbb50b55bacc5c5912128b35b5cb2530da88"},"schema_version":"1.0"},"canonical_sha256":"54ec0864df1df60275aaa2ce5fa85b2489662cd69dbc5f4466c6162facf6e684","source":{"kind":"arxiv","id":"1302.3129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3129","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3129v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3129","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"KTWAQZG7DX3A","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KTWAQZG7DX3AE5NK","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KTWAQZG7","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KTWAQZG7DX3AE5NKULHF7KC3ES","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T14:58:18Z","cross_cats_sorted":[],"title_canon_sha256":"0b203907cc9207b339a6f2482378e1ff70c8e37da254ac335a5f306e94f169d0","abstract_canon_sha256":"51f35cae77b0fe1ca31f1fd0aecafbb50b55bacc5c5912128b35b5cb2530da88"},"schema_version":"1.0"},"canonical_sha256":"54ec0864df1df60275aaa2ce5fa85b2489662cd69dbc5f4466c6162facf6e684","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:48.635992Z","signature_b64":"ZQCNIcoYakIM2NcYUAXAkYn+fvO2lH7xaaIn4UVn4542tFOgmMoNLRU6sI8X/HbLfBHyT4Pjslkke7guJdCYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ec0864df1df60275aaa2ce5fa85b2489662cd69dbc5f4466c6162facf6e684","last_reissued_at":"2026-05-18T03:33:48.634918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:48.634918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3129","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:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37tcp1xEMUASubeZ0HIhkdNNIpBDXkSOjcuwG66ogu1RWcMwD6e+hlQUEGooOsR/2tEZC9Dzp3CWZ/c+BY5eCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:40:33.161128Z"},"content_sha256":"ff40af4e7abb6cd1baa8cbb84326a2e7290f1d5542de77fae4b7f1b13064b372","schema_version":"1.0","event_id":"sha256:ff40af4e7abb6cd1baa8cbb84326a2e7290f1d5542de77fae4b7f1b13064b372"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KTWAQZG7DX3AE5NKULHF7KC3ES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate analysis of inexact dual first order methods: Application to distributed MPC for network systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Valentin Nedelcu","submitted_at":"2013-02-13T14:58:18Z","abstract_excerpt":"In this paper we propose and analyze two dual methods based on inexact gradient information and averaging that generate approximate primal solutions for smooth convex optimization problems. The complicating constraints are moved into the cost using the Lagrange multipliers. The dual problem is solved by inexact first order methods based on approximate gradients and we prove sublinear rate of convergence for these methods. In particular, we provide, for the first time, estimates on the primal feasibility violation and primal and dual suboptimality of the generated approximate primal and dual so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3129","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:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHGg4j+8/qVSRTYnp/d1Cva4+ksHudCxnE8YpEWsFaHhYwiv4wqEA/Ae/dH7P/FECIcTjSHEJCcYLqePIabaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:40:33.161671Z"},"content_sha256":"5dd9219aae8f439a09e0bc0beac605d93883f22dc492498901f50f09a48dce1e","schema_version":"1.0","event_id":"sha256:5dd9219aae8f439a09e0bc0beac605d93883f22dc492498901f50f09a48dce1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTWAQZG7DX3AE5NKULHF7KC3ES/bundle.json","state_url":"https://pith.science/pith/KTWAQZG7DX3AE5NKULHF7KC3ES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTWAQZG7DX3AE5NKULHF7KC3ES/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-26T16:40:33Z","links":{"resolver":"https://pith.science/pith/KTWAQZG7DX3AE5NKULHF7KC3ES","bundle":"https://pith.science/pith/KTWAQZG7DX3AE5NKULHF7KC3ES/bundle.json","state":"https://pith.science/pith/KTWAQZG7DX3AE5NKULHF7KC3ES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTWAQZG7DX3AE5NKULHF7KC3ES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KTWAQZG7DX3AE5NKULHF7KC3ES","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":"51f35cae77b0fe1ca31f1fd0aecafbb50b55bacc5c5912128b35b5cb2530da88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T14:58:18Z","title_canon_sha256":"0b203907cc9207b339a6f2482378e1ff70c8e37da254ac335a5f306e94f169d0"},"schema_version":"1.0","source":{"id":"1302.3129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3129","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3129v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3129","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"KTWAQZG7DX3A","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KTWAQZG7DX3AE5NK","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KTWAQZG7","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:5dd9219aae8f439a09e0bc0beac605d93883f22dc492498901f50f09a48dce1e","target":"graph","created_at":"2026-05-18T03:33:48Z","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 and analyze two dual methods based on inexact gradient information and averaging that generate approximate primal solutions for smooth convex optimization problems. The complicating constraints are moved into the cost using the Lagrange multipliers. The dual problem is solved by inexact first order methods based on approximate gradients and we prove sublinear rate of convergence for these methods. In particular, we provide, for the first time, estimates on the primal feasibility violation and primal and dual suboptimality of the generated approximate primal and dual so","authors_text":"Ion Necoara, Valentin Nedelcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T14:58:18Z","title":"Rate analysis of inexact dual first order methods: Application to distributed MPC for network systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3129","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:ff40af4e7abb6cd1baa8cbb84326a2e7290f1d5542de77fae4b7f1b13064b372","target":"record","created_at":"2026-05-18T03:33:48Z","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":"51f35cae77b0fe1ca31f1fd0aecafbb50b55bacc5c5912128b35b5cb2530da88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T14:58:18Z","title_canon_sha256":"0b203907cc9207b339a6f2482378e1ff70c8e37da254ac335a5f306e94f169d0"},"schema_version":"1.0","source":{"id":"1302.3129","kind":"arxiv","version":1}},"canonical_sha256":"54ec0864df1df60275aaa2ce5fa85b2489662cd69dbc5f4466c6162facf6e684","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ec0864df1df60275aaa2ce5fa85b2489662cd69dbc5f4466c6162facf6e684","first_computed_at":"2026-05-18T03:33:48.634918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:48.634918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZQCNIcoYakIM2NcYUAXAkYn+fvO2lH7xaaIn4UVn4542tFOgmMoNLRU6sI8X/HbLfBHyT4Pjslkke7guJdCYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:48.635992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff40af4e7abb6cd1baa8cbb84326a2e7290f1d5542de77fae4b7f1b13064b372","sha256:5dd9219aae8f439a09e0bc0beac605d93883f22dc492498901f50f09a48dce1e"],"state_sha256":"6307952f03c56997e77999f0e4806db302887a4c764c23fe1c5d0fa9f1079fc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVBLL88Ado5GW7tabZgKnr242ke4ECGVxq/hFE1PiRlxtLO1ocQZzRRD9g4+CdFlmwDxHlx+ZRjPyjF/xvQ+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:40:33.164340Z","bundle_sha256":"1ff07f882cdeffa5440a268836b338b0dc46c341fd30f5def0d7130fba1920c6"}}