{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WT3MVXZ5G7LGG3GVQN44CKHVBM","short_pith_number":"pith:WT3MVXZ5","canonical_record":{"source":{"id":"1505.03175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-12T21:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"57699ba6834908b6228f06599d97d54bbf3623e3e6052a5fda29bd686e1f476b","abstract_canon_sha256":"49ce1c8a74f8449bb90e676061043a6c82a1a31daaacf503bf667882258accad"},"schema_version":"1.0"},"canonical_sha256":"b4f6cadf3d37d6636cd58379c128f50b08ef2cceb9ceabc5e27f38f530242bbf","source":{"kind":"arxiv","id":"1505.03175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03175","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03175v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03175","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"WT3MVXZ5G7LG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WT3MVXZ5G7LGG3GV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WT3MVXZ5","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WT3MVXZ5G7LGG3GVQN44CKHVBM","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-12T21:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"57699ba6834908b6228f06599d97d54bbf3623e3e6052a5fda29bd686e1f476b","abstract_canon_sha256":"49ce1c8a74f8449bb90e676061043a6c82a1a31daaacf503bf667882258accad"},"schema_version":"1.0"},"canonical_sha256":"b4f6cadf3d37d6636cd58379c128f50b08ef2cceb9ceabc5e27f38f530242bbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.276535Z","signature_b64":"GxShlSgT3xtQut6TufhmbfsiAUesuclaaV0ND+RaHRzee7iFrIXu33t1Gkgi3NURJMN17ADcND849277duHLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f6cadf3d37d6636cd58379c128f50b08ef2cceb9ceabc5e27f38f530242bbf","last_reissued_at":"2026-05-18T02:12:10.275698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.275698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03175","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmmUkJCgXMj14PjSiF7U46q91V59DurYxXFOgwGlt0Ak+2qmfu3mol5tWf8IQ8okqBFBsWDVlAtfpux2znmGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:11:33.289856Z"},"content_sha256":"ad1b66fccacde48ecaa9fb880ed96ad6ebe53c1606e7bd6f8f61f7010621965d","schema_version":"1.0","event_id":"sha256:ad1b66fccacde48ecaa9fb880ed96ad6ebe53c1606e7bd6f8f61f7010621965d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WT3MVXZ5G7LGG3GVQN44CKHVBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara, Quoc Tran-Dinh","submitted_at":"2015-05-12T21:49:18Z","abstract_excerpt":"In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in [15] and the newly introduced inexact oracle framework from [4]. We analyze several algorithmic instances with constant and adaptive smoothing parameters and derive total computational complexity results in terms of projections onto a simple primal set. For the basic inexact fast augmented Lagrangian algorithm we obtain the overall computational complexity of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03175","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0HRtdVcb/CfQkQR+YIyRIsB/zJbxd+kx+R7mDHbO1/v5V1ITXr8W58o1tFYnxnj2Sx4ElOpeqeRRM8IeUSTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:11:33.290515Z"},"content_sha256":"5c320576fe98f01702bd099507d0a93db8110bc2a0dffb883724acf8c280498a","schema_version":"1.0","event_id":"sha256:5c320576fe98f01702bd099507d0a93db8110bc2a0dffb883724acf8c280498a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/bundle.json","state_url":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/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-26T17:11:33Z","links":{"resolver":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM","bundle":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/bundle.json","state":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WT3MVXZ5G7LGG3GVQN44CKHVBM","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":"49ce1c8a74f8449bb90e676061043a6c82a1a31daaacf503bf667882258accad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-12T21:49:18Z","title_canon_sha256":"57699ba6834908b6228f06599d97d54bbf3623e3e6052a5fda29bd686e1f476b"},"schema_version":"1.0","source":{"id":"1505.03175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03175","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03175v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03175","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"WT3MVXZ5G7LG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WT3MVXZ5G7LGG3GV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WT3MVXZ5","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:5c320576fe98f01702bd099507d0a93db8110bc2a0dffb883724acf8c280498a","target":"graph","created_at":"2026-05-18T02:12:10Z","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 analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in [15] and the newly introduced inexact oracle framework from [4]. We analyze several algorithmic instances with constant and adaptive smoothing parameters and derive total computational complexity results in terms of projections onto a simple primal set. For the basic inexact fast augmented Lagrangian algorithm we obtain the overall computational complexity of o","authors_text":"Andrei Patrascu, Ion Necoara, Quoc Tran-Dinh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-12T21:49:18Z","title":"Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03175","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:ad1b66fccacde48ecaa9fb880ed96ad6ebe53c1606e7bd6f8f61f7010621965d","target":"record","created_at":"2026-05-18T02:12:10Z","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":"49ce1c8a74f8449bb90e676061043a6c82a1a31daaacf503bf667882258accad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-12T21:49:18Z","title_canon_sha256":"57699ba6834908b6228f06599d97d54bbf3623e3e6052a5fda29bd686e1f476b"},"schema_version":"1.0","source":{"id":"1505.03175","kind":"arxiv","version":1}},"canonical_sha256":"b4f6cadf3d37d6636cd58379c128f50b08ef2cceb9ceabc5e27f38f530242bbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4f6cadf3d37d6636cd58379c128f50b08ef2cceb9ceabc5e27f38f530242bbf","first_computed_at":"2026-05-18T02:12:10.275698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:10.275698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GxShlSgT3xtQut6TufhmbfsiAUesuclaaV0ND+RaHRzee7iFrIXu33t1Gkgi3NURJMN17ADcND849277duHLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:10.276535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad1b66fccacde48ecaa9fb880ed96ad6ebe53c1606e7bd6f8f61f7010621965d","sha256:5c320576fe98f01702bd099507d0a93db8110bc2a0dffb883724acf8c280498a"],"state_sha256":"e744f5ba7ad76d21155b42036d938633d7a25c1636b0e664ce284f52d4fdadc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtegmVt/Z9f5WSKLtPwGzMqsxN0LVmfLqI9/LxuXB4n/WoGHe2hN3lVo+vTVyogzm44VlqB0wJ7LiGa1AmcvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:11:33.294480Z","bundle_sha256":"f1bfd6d62f24ce1bd7e0edcfe479defb62e5debf4dd21eeecdb9b24d297ed4f0"}}