{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BHSJA4V4LSAXOLJTXQRA2QX3EG","short_pith_number":"pith:BHSJA4V4","canonical_record":{"source":{"id":"1409.1462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-04T15:15:14Z","cross_cats_sorted":[],"title_canon_sha256":"b43192bc0cf24ee19c9a269e5b7d536622784ef297ec747a0c6fe4ceffdf57c5","abstract_canon_sha256":"29dce97f43e8f2ff97253915e90f8d14187fcf32b2d12b6d97ed0ce426291b7e"},"schema_version":"1.0"},"canonical_sha256":"09e49072bc5c81772d33bc220d42fb21a675f610b4c7ea7ddf041d8e331e607e","source":{"kind":"arxiv","id":"1409.1462","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1462","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1462v2","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1462","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"BHSJA4V4LSAX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHSJA4V4LSAXOLJT","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHSJA4V4","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BHSJA4V4LSAXOLJTXQRA2QX3EG","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-04T15:15:14Z","cross_cats_sorted":[],"title_canon_sha256":"b43192bc0cf24ee19c9a269e5b7d536622784ef297ec747a0c6fe4ceffdf57c5","abstract_canon_sha256":"29dce97f43e8f2ff97253915e90f8d14187fcf32b2d12b6d97ed0ce426291b7e"},"schema_version":"1.0"},"canonical_sha256":"09e49072bc5c81772d33bc220d42fb21a675f610b4c7ea7ddf041d8e331e607e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:58.483513Z","signature_b64":"CiAahSLjsENut7K8j9AMiSP8v5mSWA2QBDKGGNaIyyS6Fg4q3DQe67q1yD035ePqKrlm4YR+hQPg7cnZr/AfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09e49072bc5c81772d33bc220d42fb21a675f610b4c7ea7ddf041d8e331e607e","last_reissued_at":"2026-05-18T02:23:58.482786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:58.482786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1462","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-18T02:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dW684ozFXS4Z5OM2v00jmnmyjynE8RU4XgPfiGogVgOqBxH7gLuUofrZVb4HWqqNdeCzVzLY7v1oMXjRBbb5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:25.096208Z"},"content_sha256":"983c3497c9244e05d1f34861720c29190e615a8a24b0900765028d41e31c71a1","schema_version":"1.0","event_id":"sha256:983c3497c9244e05d1f34861720c29190e615a8a24b0900765028d41e31c71a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BHSJA4V4LSAXOLJTXQRA2QX3EG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iteration complexity analysis of dual first order methods for conic convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara","submitted_at":"2014-09-04T15:15:14Z","abstract_excerpt":"In this paper we provide a detailed analysis of the iteration complexity of dual first order methods for solving conic convex problems. When it is difficult to project on the primal feasible set described by convex constraints, we use the Lagrangian relaxation to handle the complicated constraints and then, we apply dual first order algorithms for solving the corresponding dual problem. We give convergence analysis for dual first order algorithms (dual gradient and fast gradient algorithms): we provide sublinear or linear estimates on the primal suboptimality and feasibility violation of the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1462","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-18T02:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9ahkojNIRYF0z67YfqRH+xp2Y3DIx1DQHU0FvdUGM2W0rHA/40do6D448MidpsZPy4tvWPuPjocTvIWxHFUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:25.096911Z"},"content_sha256":"1990c01c9ab114d7139e4572c9595b3c5f2e2cbe585cc55afa79398f60b7d582","schema_version":"1.0","event_id":"sha256:1990c01c9ab114d7139e4572c9595b3c5f2e2cbe585cc55afa79398f60b7d582"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHSJA4V4LSAXOLJTXQRA2QX3EG/bundle.json","state_url":"https://pith.science/pith/BHSJA4V4LSAXOLJTXQRA2QX3EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHSJA4V4LSAXOLJTXQRA2QX3EG/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-26T09:48:25Z","links":{"resolver":"https://pith.science/pith/BHSJA4V4LSAXOLJTXQRA2QX3EG","bundle":"https://pith.science/pith/BHSJA4V4LSAXOLJTXQRA2QX3EG/bundle.json","state":"https://pith.science/pith/BHSJA4V4LSAXOLJTXQRA2QX3EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHSJA4V4LSAXOLJTXQRA2QX3EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BHSJA4V4LSAXOLJTXQRA2QX3EG","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":"29dce97f43e8f2ff97253915e90f8d14187fcf32b2d12b6d97ed0ce426291b7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-04T15:15:14Z","title_canon_sha256":"b43192bc0cf24ee19c9a269e5b7d536622784ef297ec747a0c6fe4ceffdf57c5"},"schema_version":"1.0","source":{"id":"1409.1462","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1462","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1462v2","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1462","created_at":"2026-05-18T02:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"BHSJA4V4LSAX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHSJA4V4LSAXOLJT","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHSJA4V4","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:1990c01c9ab114d7139e4572c9595b3c5f2e2cbe585cc55afa79398f60b7d582","target":"graph","created_at":"2026-05-18T02:23:58Z","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 provide a detailed analysis of the iteration complexity of dual first order methods for solving conic convex problems. When it is difficult to project on the primal feasible set described by convex constraints, we use the Lagrangian relaxation to handle the complicated constraints and then, we apply dual first order algorithms for solving the corresponding dual problem. We give convergence analysis for dual first order algorithms (dual gradient and fast gradient algorithms): we provide sublinear or linear estimates on the primal suboptimality and feasibility violation of the g","authors_text":"Andrei Patrascu, Ion Necoara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-04T15:15:14Z","title":"Iteration complexity analysis of dual first order methods for conic convex programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1462","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:983c3497c9244e05d1f34861720c29190e615a8a24b0900765028d41e31c71a1","target":"record","created_at":"2026-05-18T02:23:58Z","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":"29dce97f43e8f2ff97253915e90f8d14187fcf32b2d12b6d97ed0ce426291b7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-04T15:15:14Z","title_canon_sha256":"b43192bc0cf24ee19c9a269e5b7d536622784ef297ec747a0c6fe4ceffdf57c5"},"schema_version":"1.0","source":{"id":"1409.1462","kind":"arxiv","version":2}},"canonical_sha256":"09e49072bc5c81772d33bc220d42fb21a675f610b4c7ea7ddf041d8e331e607e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09e49072bc5c81772d33bc220d42fb21a675f610b4c7ea7ddf041d8e331e607e","first_computed_at":"2026-05-18T02:23:58.482786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:58.482786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CiAahSLjsENut7K8j9AMiSP8v5mSWA2QBDKGGNaIyyS6Fg4q3DQe67q1yD035ePqKrlm4YR+hQPg7cnZr/AfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:58.483513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1462","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:983c3497c9244e05d1f34861720c29190e615a8a24b0900765028d41e31c71a1","sha256:1990c01c9ab114d7139e4572c9595b3c5f2e2cbe585cc55afa79398f60b7d582"],"state_sha256":"964cd7a8797c45d3129f76ed3fbc791c72ead06b80616a25f83e931cc102d330"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7NiNyxPr4Tqo1t0PtQWvXAsUMTLDBnt6jumKv3oZFAHHXwGvD+6zZfgkJI98jCiKJWeh9xDcqWpYRsGes4yAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:48:25.100195Z","bundle_sha256":"22f84e34f1903415d6cf5b8578e8af291f14d91c0b801501d83b3e5d254f45d0"}}