{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CGXWROBAQZ267ETY7V3HA22KRK","short_pith_number":"pith:CGXWROBA","canonical_record":{"source":{"id":"1506.05328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:35:32Z","cross_cats_sorted":[],"title_canon_sha256":"cd87bde4f379b4cd2cb8e7fa3d31116d37108e491c375607cd7767e8a63a72f3","abstract_canon_sha256":"45eec75d5c4e0ffa9b928264ff16c2746c5864558623c9739cfcf5b2a75387ff"},"schema_version":"1.0"},"canonical_sha256":"11af68b8208675ef9278fd76706b4a8aa80dba5a7b3b35aaf2639e53f3ed57cb","source":{"kind":"arxiv","id":"1506.05328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05328","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05328v1","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05328","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"pith_short_12","alias_value":"CGXWROBAQZ26","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CGXWROBAQZ267ETY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CGXWROBA","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CGXWROBAQZ267ETY7V3HA22KRK","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:35:32Z","cross_cats_sorted":[],"title_canon_sha256":"cd87bde4f379b4cd2cb8e7fa3d31116d37108e491c375607cd7767e8a63a72f3","abstract_canon_sha256":"45eec75d5c4e0ffa9b928264ff16c2746c5864558623c9739cfcf5b2a75387ff"},"schema_version":"1.0"},"canonical_sha256":"11af68b8208675ef9278fd76706b4a8aa80dba5a7b3b35aaf2639e53f3ed57cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:12.486161Z","signature_b64":"XuoXpnWQMtyGIYtsEplRZmNj9cXLh23bfuUwXmmVFa2KM0O2m3kjFhPHjoaADBuKqbtekwPYb60CwyuFumlSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11af68b8208675ef9278fd76706b4a8aa80dba5a7b3b35aaf2639e53f3ed57cb","last_reissued_at":"2026-05-18T01:46:12.485482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:12.485482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05328","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-18T01:46:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewuaZPvof02SPowF0dP9AMSw6XxMtOO0OpL368KbyA6fWZLITa7jPIZv+HkiU+T5uC2KN4ce8qLvkNvhodGtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:57.714821Z"},"content_sha256":"1d932d316b852ae3ec3e052d4dad23c2f8e40c483769cdd5d70a438ba7c58da1","schema_version":"1.0","event_id":"sha256:1d932d316b852ae3ec3e052d4dad23c2f8e40c483769cdd5d70a438ba7c58da1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CGXWROBAQZ267ETY7V3HA22KRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity certifications of first order inexact Lagrangian methods for general convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Angelia Nedi\\'c, Ion Necoara","submitted_at":"2015-06-17T13:35:32Z","abstract_excerpt":"In this chapter we derive computational complexity certifications of first order inexact dual methods for solving general smooth constrained convex problems which can arise in real-time applications, such as model predictive control. When it is difficult to project on the primal constraint set described by a collection of general convex functions, we use the Lagrangian relaxation to handle the complicated constraints and then, we apply dual (fast) gradient algorithms based on inexact dual gradient information for solving the corresponding dual problem. The iteration complexity analysis is base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05328","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-18T01:46:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gE5rLi5XZnKY6u6j3lvKWji96U+Lmdm81L7NZQLtep3bNiJu0F883hz7rdREFNwIouARPP3frXdwCEokMVSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:57.715515Z"},"content_sha256":"14d21931e379c1d363b78765db3834a599cd87be15e771b0b0b7015f3dfcfcbd","schema_version":"1.0","event_id":"sha256:14d21931e379c1d363b78765db3834a599cd87be15e771b0b0b7015f3dfcfcbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGXWROBAQZ267ETY7V3HA22KRK/bundle.json","state_url":"https://pith.science/pith/CGXWROBAQZ267ETY7V3HA22KRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGXWROBAQZ267ETY7V3HA22KRK/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:41:57Z","links":{"resolver":"https://pith.science/pith/CGXWROBAQZ267ETY7V3HA22KRK","bundle":"https://pith.science/pith/CGXWROBAQZ267ETY7V3HA22KRK/bundle.json","state":"https://pith.science/pith/CGXWROBAQZ267ETY7V3HA22KRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGXWROBAQZ267ETY7V3HA22KRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CGXWROBAQZ267ETY7V3HA22KRK","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":"45eec75d5c4e0ffa9b928264ff16c2746c5864558623c9739cfcf5b2a75387ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:35:32Z","title_canon_sha256":"cd87bde4f379b4cd2cb8e7fa3d31116d37108e491c375607cd7767e8a63a72f3"},"schema_version":"1.0","source":{"id":"1506.05328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05328","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05328v1","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05328","created_at":"2026-05-18T01:46:12Z"},{"alias_kind":"pith_short_12","alias_value":"CGXWROBAQZ26","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CGXWROBAQZ267ETY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CGXWROBA","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:14d21931e379c1d363b78765db3834a599cd87be15e771b0b0b7015f3dfcfcbd","target":"graph","created_at":"2026-05-18T01:46:12Z","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 chapter we derive computational complexity certifications of first order inexact dual methods for solving general smooth constrained convex problems which can arise in real-time applications, such as model predictive control. When it is difficult to project on the primal constraint set described by a collection of general convex functions, we use the Lagrangian relaxation to handle the complicated constraints and then, we apply dual (fast) gradient algorithms based on inexact dual gradient information for solving the corresponding dual problem. The iteration complexity analysis is base","authors_text":"Andrei Patrascu, Angelia Nedi\\'c, Ion Necoara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:35:32Z","title":"Complexity certifications of first order inexact Lagrangian methods for general convex programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05328","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:1d932d316b852ae3ec3e052d4dad23c2f8e40c483769cdd5d70a438ba7c58da1","target":"record","created_at":"2026-05-18T01:46:12Z","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":"45eec75d5c4e0ffa9b928264ff16c2746c5864558623c9739cfcf5b2a75387ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-17T13:35:32Z","title_canon_sha256":"cd87bde4f379b4cd2cb8e7fa3d31116d37108e491c375607cd7767e8a63a72f3"},"schema_version":"1.0","source":{"id":"1506.05328","kind":"arxiv","version":1}},"canonical_sha256":"11af68b8208675ef9278fd76706b4a8aa80dba5a7b3b35aaf2639e53f3ed57cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11af68b8208675ef9278fd76706b4a8aa80dba5a7b3b35aaf2639e53f3ed57cb","first_computed_at":"2026-05-18T01:46:12.485482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:46:12.485482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XuoXpnWQMtyGIYtsEplRZmNj9cXLh23bfuUwXmmVFa2KM0O2m3kjFhPHjoaADBuKqbtekwPYb60CwyuFumlSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:46:12.486161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d932d316b852ae3ec3e052d4dad23c2f8e40c483769cdd5d70a438ba7c58da1","sha256:14d21931e379c1d363b78765db3834a599cd87be15e771b0b0b7015f3dfcfcbd"],"state_sha256":"f9c00e99c89e41d31bce84805660a56590ea59659269860d0f058c43006018ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSXEGqynRl7COh2Kr7zhGPXJ/l8bmb3MJKzgzmpz2aENPtSDE1XZl3/DO7WaMvn+qp+6scR/fHPHWqm/wJphBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:41:57.718996Z","bundle_sha256":"14f6621b151078d99c1707d9f34daff7376d0563df646b54394fd866c4a0c949"}}