{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BJZLYC5K6L7L7ADNGQUUSY2HTQ","short_pith_number":"pith:BJZLYC5K","canonical_record":{"source":{"id":"1705.11119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-31T14:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"0285bbdb4b59d83dc3432e0516e63d0d19df184bb02fe5dafdaf500e5439dc68","abstract_canon_sha256":"61aabf72ab586c38f620ef5b99c4fa2e590dfbd9a274ea75d00f1765f873bb3e"},"schema_version":"1.0"},"canonical_sha256":"0a72bc0baaf2febf806d34294963479c356ddca38b829b6e475534a08ac17b14","source":{"kind":"arxiv","id":"1705.11119","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11119","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11119v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11119","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"BJZLYC5K6L7L","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BJZLYC5K6L7L7ADN","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BJZLYC5K","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BJZLYC5K6L7L7ADNGQUUSY2HTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.11119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-31T14:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"0285bbdb4b59d83dc3432e0516e63d0d19df184bb02fe5dafdaf500e5439dc68","abstract_canon_sha256":"61aabf72ab586c38f620ef5b99c4fa2e590dfbd9a274ea75d00f1765f873bb3e"},"schema_version":"1.0"},"canonical_sha256":"0a72bc0baaf2febf806d34294963479c356ddca38b829b6e475534a08ac17b14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.058166Z","signature_b64":"C4YuiGVEq0jqkyKtvXCcsYtkdZhIbDXtsKtqquBshtaO5pMXqSdx03wZH1loI24vFTuawR/QQ1lzsP/jnDDyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a72bc0baaf2febf806d34294963479c356ddca38b829b6e475534a08ac17b14","last_reissued_at":"2026-05-18T00:26:08.057546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.057546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.11119","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-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZHdMgyGwHtY1lt2xNdinQJ6hKsi/X0NZY/Qsimnd+4xojMzc5+YC8LqwisKdC/GLBqTjtxKatkEp62dmCXLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:18:35.485100Z"},"content_sha256":"f48d93f9d8e2e60425c7e5ccd64f47d16a00bbd3db5d41c0f757c0914c406434","schema_version":"1.0","event_id":"sha256:f48d93f9d8e2e60425c7e5ccd64f47d16a00bbd3db5d41c0f757c0914c406434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BJZLYC5K6L7L7ADNGQUUSY2HTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Certification of a Distributed Augmented Lagrangian Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael M. Zavlanos, Nikolaos Chatzipanagiotis, Soomin Lee","submitted_at":"2017-05-31T14:45:02Z","abstract_excerpt":"In this paper we present complexity certification results for a distributed Augmented Lagrangian (AL) algorithm used to solve convex optimization problems involving globally coupled linear constraints. Our method relies on the Accelerated Distributed Augmented Lagrangian (ADAL) algorithm, which can handle the coupled linear constraints in a distributed manner based on local estimates of the AL. We show that the theoretical complexity of ADAL to reach an $\\epsilon$-optimal solution both in terms of suboptimality and infeasibility is $O(\\frac{1}{\\epsilon})$ iterations. Moreover, we provide a val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11119","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-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSBem6CCMYVXCvB8IcwhC4ABSBPurJKCjMMoKgcQ88SuVMX5uw7EJuu1+zZTze5W6Eh87QnPGZwq2E4RPkd1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:18:35.485780Z"},"content_sha256":"fa6c603950f4ab07fd6e366438eaf70e335b29363fdf85ef87670b67ecf908c5","schema_version":"1.0","event_id":"sha256:fa6c603950f4ab07fd6e366438eaf70e335b29363fdf85ef87670b67ecf908c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/bundle.json","state_url":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/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-27T22:18:35Z","links":{"resolver":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ","bundle":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/bundle.json","state":"https://pith.science/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJZLYC5K6L7L7ADNGQUUSY2HTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BJZLYC5K6L7L7ADNGQUUSY2HTQ","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":"61aabf72ab586c38f620ef5b99c4fa2e590dfbd9a274ea75d00f1765f873bb3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-31T14:45:02Z","title_canon_sha256":"0285bbdb4b59d83dc3432e0516e63d0d19df184bb02fe5dafdaf500e5439dc68"},"schema_version":"1.0","source":{"id":"1705.11119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.11119","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.11119v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11119","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"BJZLYC5K6L7L","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BJZLYC5K6L7L7ADN","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BJZLYC5K","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:fa6c603950f4ab07fd6e366438eaf70e335b29363fdf85ef87670b67ecf908c5","target":"graph","created_at":"2026-05-18T00:26:08Z","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 complexity certification results for a distributed Augmented Lagrangian (AL) algorithm used to solve convex optimization problems involving globally coupled linear constraints. Our method relies on the Accelerated Distributed Augmented Lagrangian (ADAL) algorithm, which can handle the coupled linear constraints in a distributed manner based on local estimates of the AL. We show that the theoretical complexity of ADAL to reach an $\\epsilon$-optimal solution both in terms of suboptimality and infeasibility is $O(\\frac{1}{\\epsilon})$ iterations. Moreover, we provide a val","authors_text":"Michael M. Zavlanos, Nikolaos Chatzipanagiotis, Soomin Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-31T14:45:02Z","title":"Complexity Certification of a Distributed Augmented Lagrangian Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11119","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:f48d93f9d8e2e60425c7e5ccd64f47d16a00bbd3db5d41c0f757c0914c406434","target":"record","created_at":"2026-05-18T00:26:08Z","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":"61aabf72ab586c38f620ef5b99c4fa2e590dfbd9a274ea75d00f1765f873bb3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-31T14:45:02Z","title_canon_sha256":"0285bbdb4b59d83dc3432e0516e63d0d19df184bb02fe5dafdaf500e5439dc68"},"schema_version":"1.0","source":{"id":"1705.11119","kind":"arxiv","version":2}},"canonical_sha256":"0a72bc0baaf2febf806d34294963479c356ddca38b829b6e475534a08ac17b14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a72bc0baaf2febf806d34294963479c356ddca38b829b6e475534a08ac17b14","first_computed_at":"2026-05-18T00:26:08.057546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:08.057546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C4YuiGVEq0jqkyKtvXCcsYtkdZhIbDXtsKtqquBshtaO5pMXqSdx03wZH1loI24vFTuawR/QQ1lzsP/jnDDyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:08.058166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.11119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f48d93f9d8e2e60425c7e5ccd64f47d16a00bbd3db5d41c0f757c0914c406434","sha256:fa6c603950f4ab07fd6e366438eaf70e335b29363fdf85ef87670b67ecf908c5"],"state_sha256":"775e699607a16f864d5e0b722afda30da0b70581cea3a2227e0efb8e40606040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxvWdIgymozqjprbEqRAMGDl3WxNqIoAPNGIilLjfDx/TRjj8gLUejgQhdG+d1KKjCU8eMVJIP2EEQiAb40pBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:18:35.488525Z","bundle_sha256":"8046d337de9c9ee28b32019ccfc1bad2ce3fdab23dbf859be98419ac2007d943"}}