{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PLD6KGWHD6PX4ECPPLJ5YFOMLK","short_pith_number":"pith:PLD6KGWH","canonical_record":{"source":{"id":"1506.05320","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:18:55Z","cross_cats_sorted":[],"title_canon_sha256":"a7ef40453c68cb7a069f354b25f06c9b5cdf42117a839cc63501811645de28af","abstract_canon_sha256":"e715fba793f35bf5852807a785a892792462cf6f184a3ec9a5067e1891ba0a55"},"schema_version":"1.0"},"canonical_sha256":"7ac7e51ac71f9f7e104f7ad3dc15cc5ab26176e89ae632eb8523b63646368a79","source":{"kind":"arxiv","id":"1506.05320","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05320","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05320v3","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05320","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"PLD6KGWHD6PX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLD6KGWHD6PX4ECP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLD6KGWH","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PLD6KGWHD6PX4ECPPLJ5YFOMLK","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05320","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:18:55Z","cross_cats_sorted":[],"title_canon_sha256":"a7ef40453c68cb7a069f354b25f06c9b5cdf42117a839cc63501811645de28af","abstract_canon_sha256":"e715fba793f35bf5852807a785a892792462cf6f184a3ec9a5067e1891ba0a55"},"schema_version":"1.0"},"canonical_sha256":"7ac7e51ac71f9f7e104f7ad3dc15cc5ab26176e89ae632eb8523b63646368a79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:05.910462Z","signature_b64":"eGG0C/GDqkPbsMokVq0hmHmh4Wetra6CcDzAqjVfigeKKyIJBqkKWr2+RrrqJ75pBB+8GwWg+HRFjHHC1vtsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ac7e51ac71f9f7e104f7ad3dc15cc5ab26176e89ae632eb8523b63646368a79","last_reissued_at":"2026-05-18T00:48:05.909848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:05.909848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05320","source_version":3,"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-18T00:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVLLwcpUvoLXsllo5WPObVuSfnh4pvdDWq5U27PTYJ7b/6lraMCZG52d0CkpCwtxIx6dS74hie3MLX60fPsKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:52:29.013104Z"},"content_sha256":"b8ff354bc8c81d74d60db48a54a6b0093fcf44810092a7883889fa529de5186c","schema_version":"1.0","event_id":"sha256:b8ff354bc8c81d74d60db48a54a6b0093fcf44810092a7883889fa529de5186c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PLD6KGWHD6PX4ECPPLJ5YFOMLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of first order inexact Lagrangian and penalty 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, Francois Glineur, Ion Necoara","submitted_at":"2015-06-17T13:18:55Z","abstract_excerpt":"In this paper we present a complete iteration complexity analysis of inexact first order Lagrangian and penalty methods for solving cone constrained convex problems that have or may not have optimal Lagrange multipliers that close the duality gap. We first assume the existence of optimal Lagrange multipliers and study primal-dual first order methods based on inexact information and augmented Lagrangian smoothing or Nesterov type smoothing. For inexact (fast) gradient augmented Lagrangian methods we derive a total computational complexity of $\\mathcal{O}\\left(\\frac{1}{\\epsilon}\\right)$ projecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05320","kind":"arxiv","version":3},"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-18T00:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYDq8YNOBgamfCpub1jKMGKF9NTKEpKxWqsHIqrvuHp430b4tRO9KJy4VXBkyIGulIF04KJ79Agzm20m8cWYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:52:29.013519Z"},"content_sha256":"fb75b87389d3c2cb75d935c754ed79f9fc5400995161ab57440052fc19f7cb6b","schema_version":"1.0","event_id":"sha256:fb75b87389d3c2cb75d935c754ed79f9fc5400995161ab57440052fc19f7cb6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLD6KGWHD6PX4ECPPLJ5YFOMLK/bundle.json","state_url":"https://pith.science/pith/PLD6KGWHD6PX4ECPPLJ5YFOMLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLD6KGWHD6PX4ECPPLJ5YFOMLK/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-26T03:52:29Z","links":{"resolver":"https://pith.science/pith/PLD6KGWHD6PX4ECPPLJ5YFOMLK","bundle":"https://pith.science/pith/PLD6KGWHD6PX4ECPPLJ5YFOMLK/bundle.json","state":"https://pith.science/pith/PLD6KGWHD6PX4ECPPLJ5YFOMLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLD6KGWHD6PX4ECPPLJ5YFOMLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PLD6KGWHD6PX4ECPPLJ5YFOMLK","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":"e715fba793f35bf5852807a785a892792462cf6f184a3ec9a5067e1891ba0a55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:18:55Z","title_canon_sha256":"a7ef40453c68cb7a069f354b25f06c9b5cdf42117a839cc63501811645de28af"},"schema_version":"1.0","source":{"id":"1506.05320","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05320","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05320v3","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05320","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"PLD6KGWHD6PX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLD6KGWHD6PX4ECP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLD6KGWH","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:fb75b87389d3c2cb75d935c754ed79f9fc5400995161ab57440052fc19f7cb6b","target":"graph","created_at":"2026-05-18T00:48:05Z","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 present a complete iteration complexity analysis of inexact first order Lagrangian and penalty methods for solving cone constrained convex problems that have or may not have optimal Lagrange multipliers that close the duality gap. We first assume the existence of optimal Lagrange multipliers and study primal-dual first order methods based on inexact information and augmented Lagrangian smoothing or Nesterov type smoothing. For inexact (fast) gradient augmented Lagrangian methods we derive a total computational complexity of $\\mathcal{O}\\left(\\frac{1}{\\epsilon}\\right)$ projecti","authors_text":"Andrei Patrascu, Francois Glineur, Ion Necoara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:18:55Z","title":"Complexity of first order inexact Lagrangian and penalty methods for conic convex programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05320","kind":"arxiv","version":3},"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:b8ff354bc8c81d74d60db48a54a6b0093fcf44810092a7883889fa529de5186c","target":"record","created_at":"2026-05-18T00:48:05Z","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":"e715fba793f35bf5852807a785a892792462cf6f184a3ec9a5067e1891ba0a55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:18:55Z","title_canon_sha256":"a7ef40453c68cb7a069f354b25f06c9b5cdf42117a839cc63501811645de28af"},"schema_version":"1.0","source":{"id":"1506.05320","kind":"arxiv","version":3}},"canonical_sha256":"7ac7e51ac71f9f7e104f7ad3dc15cc5ab26176e89ae632eb8523b63646368a79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ac7e51ac71f9f7e104f7ad3dc15cc5ab26176e89ae632eb8523b63646368a79","first_computed_at":"2026-05-18T00:48:05.909848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:05.909848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eGG0C/GDqkPbsMokVq0hmHmh4Wetra6CcDzAqjVfigeKKyIJBqkKWr2+RrrqJ75pBB+8GwWg+HRFjHHC1vtsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:05.910462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05320","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8ff354bc8c81d74d60db48a54a6b0093fcf44810092a7883889fa529de5186c","sha256:fb75b87389d3c2cb75d935c754ed79f9fc5400995161ab57440052fc19f7cb6b"],"state_sha256":"a55af9f1907454caa99df458a1b95d37a77a53c717dc80a8725144992fe911c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0pEbxXTRYWJxVk4jbA5j9sL4dt2JWasRfMhBBLvgraZllw/J+TmapX3zutUtOx3mnX42zIet9N7XG95d/lulCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:52:29.016438Z","bundle_sha256":"e9116c11b2e24a203bfba8e6894415497e70b8944bc003af87bace80beead3cd"}}