{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HQ7BJD2HQTWEEIK37OKML34J4L","short_pith_number":"pith:HQ7BJD2H","canonical_record":{"source":{"id":"1302.4355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-18T17:12:00Z","cross_cats_sorted":[],"title_canon_sha256":"8e57278d4e576a820d89710c8c58bc8540a05dc268cccfc42ff886ca8fb42bfa","abstract_canon_sha256":"29532bbff66c791715f00d5f0061a92ebffd9f111911ce77b8ffab04a9853ebc"},"schema_version":"1.0"},"canonical_sha256":"3c3e148f4784ec42215bfb94c5ef89e2ed20c78c0c75b79553367ae5f242f16d","source":{"kind":"arxiv","id":"1302.4355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4355","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4355v1","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4355","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"HQ7BJD2HQTWE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQ7BJD2HQTWEEIK3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQ7BJD2H","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HQ7BJD2HQTWEEIK37OKML34J4L","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-18T17:12:00Z","cross_cats_sorted":[],"title_canon_sha256":"8e57278d4e576a820d89710c8c58bc8540a05dc268cccfc42ff886ca8fb42bfa","abstract_canon_sha256":"29532bbff66c791715f00d5f0061a92ebffd9f111911ce77b8ffab04a9853ebc"},"schema_version":"1.0"},"canonical_sha256":"3c3e148f4784ec42215bfb94c5ef89e2ed20c78c0c75b79553367ae5f242f16d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.324041Z","signature_b64":"QKd4wKKvMV0808P3Nzz7jlN25wfDC5+9cIIZFapl/ieZGLHh7N5Xib1pG3zdcTIgYUsd0zD+oy5FNIymLCOhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3e148f4784ec42215bfb94c5ef89e2ed20c78c0c75b79553367ae5f242f16d","last_reissued_at":"2026-05-18T03:33:23.323260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.323260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4355","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rrFdB9OCPvN1b4dsAMLx/+eQZuKxh67+4cC8EF5uyhzjFV+1nEJWJ18G7vHuAjlqT1roASm8ivn1gwpE2qwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:33:47.079540Z"},"content_sha256":"f072859914f86512407830efdaf2c3bd18c163836126e9eeb98f012efd596d6a","schema_version":"1.0","event_id":"sha256:f072859914f86512407830efdaf2c3bd18c163836126e9eeb98f012efd596d6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HQ7BJD2HQTWEEIK37OKML34J4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Quoc Tran Dinh, Valentin Nedelcu","submitted_at":"2013-02-18T17:12:00Z","abstract_excerpt":"We study the computational complexity certification of inexact gradient augmented Lagrangian methods for solving convex optimization problems with complicated constraints. We solve the augmented Lagrangian dual problem that arises from the relaxation of complicating constraints with gradient and fast gradient methods based on inexact first order information. Moreover, since the exact solution of the augmented Lagrangian primal problem is hard to compute in practice, we solve this problem up to some given inner accuracy. We derive relations between the inner and the outer accuracy of the primal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4355","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrEgIu2TLN6djQESPXtX8Z/zITzGOup4deBY2dtsnGdYJu6sbvYlJVFQkdP7HMWoo5ZLYsp8ba2XrykAqSL0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:33:47.080181Z"},"content_sha256":"ba59b90609c215f7dc648599c75d35509629987a45b5c38c7498d9f52b4f72cd","schema_version":"1.0","event_id":"sha256:ba59b90609c215f7dc648599c75d35509629987a45b5c38c7498d9f52b4f72cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQ7BJD2HQTWEEIK37OKML34J4L/bundle.json","state_url":"https://pith.science/pith/HQ7BJD2HQTWEEIK37OKML34J4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQ7BJD2HQTWEEIK37OKML34J4L/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-26T08:33:47Z","links":{"resolver":"https://pith.science/pith/HQ7BJD2HQTWEEIK37OKML34J4L","bundle":"https://pith.science/pith/HQ7BJD2HQTWEEIK37OKML34J4L/bundle.json","state":"https://pith.science/pith/HQ7BJD2HQTWEEIK37OKML34J4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQ7BJD2HQTWEEIK37OKML34J4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HQ7BJD2HQTWEEIK37OKML34J4L","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":"29532bbff66c791715f00d5f0061a92ebffd9f111911ce77b8ffab04a9853ebc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-18T17:12:00Z","title_canon_sha256":"8e57278d4e576a820d89710c8c58bc8540a05dc268cccfc42ff886ca8fb42bfa"},"schema_version":"1.0","source":{"id":"1302.4355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4355","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4355v1","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4355","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"HQ7BJD2HQTWE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQ7BJD2HQTWEEIK3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQ7BJD2H","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ba59b90609c215f7dc648599c75d35509629987a45b5c38c7498d9f52b4f72cd","target":"graph","created_at":"2026-05-18T03:33:23Z","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":"We study the computational complexity certification of inexact gradient augmented Lagrangian methods for solving convex optimization problems with complicated constraints. We solve the augmented Lagrangian dual problem that arises from the relaxation of complicating constraints with gradient and fast gradient methods based on inexact first order information. Moreover, since the exact solution of the augmented Lagrangian primal problem is hard to compute in practice, we solve this problem up to some given inner accuracy. We derive relations between the inner and the outer accuracy of the primal","authors_text":"Ion Necoara, Quoc Tran Dinh, Valentin Nedelcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-18T17:12:00Z","title":"Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4355","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:f072859914f86512407830efdaf2c3bd18c163836126e9eeb98f012efd596d6a","target":"record","created_at":"2026-05-18T03:33:23Z","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":"29532bbff66c791715f00d5f0061a92ebffd9f111911ce77b8ffab04a9853ebc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-18T17:12:00Z","title_canon_sha256":"8e57278d4e576a820d89710c8c58bc8540a05dc268cccfc42ff886ca8fb42bfa"},"schema_version":"1.0","source":{"id":"1302.4355","kind":"arxiv","version":1}},"canonical_sha256":"3c3e148f4784ec42215bfb94c5ef89e2ed20c78c0c75b79553367ae5f242f16d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c3e148f4784ec42215bfb94c5ef89e2ed20c78c0c75b79553367ae5f242f16d","first_computed_at":"2026-05-18T03:33:23.323260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:23.323260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QKd4wKKvMV0808P3Nzz7jlN25wfDC5+9cIIZFapl/ieZGLHh7N5Xib1pG3zdcTIgYUsd0zD+oy5FNIymLCOhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:23.324041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f072859914f86512407830efdaf2c3bd18c163836126e9eeb98f012efd596d6a","sha256:ba59b90609c215f7dc648599c75d35509629987a45b5c38c7498d9f52b4f72cd"],"state_sha256":"541965a97262246f3d27f7dbed9db66a5f79fb83edcf70f4c8b80224340a8690"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghu/UnxddX6N9P3wE9G80M61jerI4p7RJq27HSrBJHOhfe/NoSFYMqypRefGXXEUOtVKPXOCndQIDTgNoFoSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:33:47.083826Z","bundle_sha256":"b34270eca1ddd80b1669ed628fd0a255f3acb8e7ae05ceb2f21c261367cbee4d"}}