{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CGABBORD3EY52A3WH25YKTMDWG","short_pith_number":"pith:CGABBORD","canonical_record":{"source":{"id":"1907.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-25T06:56:03Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"b45f660dc373e53218cd883679ba7a786fbd6703f56c89f5986cc4ac453429e9","abstract_canon_sha256":"d9515957fbe7eba60f236311f00c37b804c1059f7a074d5a54cb10ab604d664b"},"schema_version":"1.0"},"canonical_sha256":"118010ba23d931dd03763ebb854d83b1ab8fd79793a46102f60e9696bb8e63a1","source":{"kind":"arxiv","id":"1907.10860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10860","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10860v1","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10860","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"pith_short_12","alias_value":"CGABBORD3EY5","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CGABBORD3EY52A3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CGABBORD","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CGABBORD3EY52A3WH25YKTMDWG","target":"record","payload":{"canonical_record":{"source":{"id":"1907.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-25T06:56:03Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"b45f660dc373e53218cd883679ba7a786fbd6703f56c89f5986cc4ac453429e9","abstract_canon_sha256":"d9515957fbe7eba60f236311f00c37b804c1059f7a074d5a54cb10ab604d664b"},"schema_version":"1.0"},"canonical_sha256":"118010ba23d931dd03763ebb854d83b1ab8fd79793a46102f60e9696bb8e63a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:34.285854Z","signature_b64":"2yQ9VGbVow18xhKvkGma6Zg/TK9FSU0VNkdfFH/EL9fsYjWnCZPU7KOw3IM2z8QvqWtcNOyfLVonOAJZlrsNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118010ba23d931dd03763ebb854d83b1ab8fd79793a46102f60e9696bb8e63a1","last_reissued_at":"2026-05-17T23:39:34.285410Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:34.285410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.10860","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-17T23:39:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhOiwm+FZEOPq0TJdpGX0JNgPPnOKNc6US5pYihKP8ThGkBWVt5PkNqX8DmRcKLPdrukzxEJp5WCy76ThadqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:08.869631Z"},"content_sha256":"3d7e6eef2390c2eef18ff8ec8492395ed8fa0ddd8cb743a1a3469fc4a49f4301","schema_version":"1.0","event_id":"sha256:3d7e6eef2390c2eef18ff8ec8492395ed8fa0ddd8cb743a1a3469fc4a49f4301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CGABBORD3EY52A3WH25YKTMDWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tracking-ADMM for Distributed Constraint-Coupled Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Alessandro Falsone, Giuseppe Notarstefano, Ivano Notarnicola, Maria Prandini","submitted_at":"2019-07-25T06:56:03Z","abstract_excerpt":"We consider constraint-coupled optimization problems in which agents of a network aim to cooperatively minimize the sum of local objective functions subject to individual constraints and a common linear coupling constraint. We propose a novel optimization algorithm that embeds a dynamic average consensus protocol in the parallel Alternating Direction Method of Multipliers (ADMM) to design a fully distributed scheme for the considered set-up. The dynamic average mechanism allows agents to track the time-varying coupling constraint violation (at the current solution estimates). The tracked versi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10860","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-17T23:39:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y++N6UXri9TXCFwsy3C05wcKPnfOO2H8qY+F0cl4JWAW98VEmfdk6WtR3fp47UcLta0XU72TxTPMZMdWrG9yBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:08.870393Z"},"content_sha256":"76055b69d171f29c199c9a9e9dca73aa9694c842b5e11c217939ec914c046ce6","schema_version":"1.0","event_id":"sha256:76055b69d171f29c199c9a9e9dca73aa9694c842b5e11c217939ec914c046ce6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGABBORD3EY52A3WH25YKTMDWG/bundle.json","state_url":"https://pith.science/pith/CGABBORD3EY52A3WH25YKTMDWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGABBORD3EY52A3WH25YKTMDWG/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-06-08T17:02:08Z","links":{"resolver":"https://pith.science/pith/CGABBORD3EY52A3WH25YKTMDWG","bundle":"https://pith.science/pith/CGABBORD3EY52A3WH25YKTMDWG/bundle.json","state":"https://pith.science/pith/CGABBORD3EY52A3WH25YKTMDWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGABBORD3EY52A3WH25YKTMDWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CGABBORD3EY52A3WH25YKTMDWG","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":"d9515957fbe7eba60f236311f00c37b804c1059f7a074d5a54cb10ab604d664b","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-25T06:56:03Z","title_canon_sha256":"b45f660dc373e53218cd883679ba7a786fbd6703f56c89f5986cc4ac453429e9"},"schema_version":"1.0","source":{"id":"1907.10860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10860","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10860v1","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10860","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"pith_short_12","alias_value":"CGABBORD3EY5","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CGABBORD3EY52A3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CGABBORD","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:76055b69d171f29c199c9a9e9dca73aa9694c842b5e11c217939ec914c046ce6","target":"graph","created_at":"2026-05-17T23:39:34Z","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 consider constraint-coupled optimization problems in which agents of a network aim to cooperatively minimize the sum of local objective functions subject to individual constraints and a common linear coupling constraint. We propose a novel optimization algorithm that embeds a dynamic average consensus protocol in the parallel Alternating Direction Method of Multipliers (ADMM) to design a fully distributed scheme for the considered set-up. The dynamic average mechanism allows agents to track the time-varying coupling constraint violation (at the current solution estimates). The tracked versi","authors_text":"Alessandro Falsone, Giuseppe Notarstefano, Ivano Notarnicola, Maria Prandini","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-25T06:56:03Z","title":"Tracking-ADMM for Distributed Constraint-Coupled Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10860","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:3d7e6eef2390c2eef18ff8ec8492395ed8fa0ddd8cb743a1a3469fc4a49f4301","target":"record","created_at":"2026-05-17T23:39:34Z","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":"d9515957fbe7eba60f236311f00c37b804c1059f7a074d5a54cb10ab604d664b","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-25T06:56:03Z","title_canon_sha256":"b45f660dc373e53218cd883679ba7a786fbd6703f56c89f5986cc4ac453429e9"},"schema_version":"1.0","source":{"id":"1907.10860","kind":"arxiv","version":1}},"canonical_sha256":"118010ba23d931dd03763ebb854d83b1ab8fd79793a46102f60e9696bb8e63a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"118010ba23d931dd03763ebb854d83b1ab8fd79793a46102f60e9696bb8e63a1","first_computed_at":"2026-05-17T23:39:34.285410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:34.285410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2yQ9VGbVow18xhKvkGma6Zg/TK9FSU0VNkdfFH/EL9fsYjWnCZPU7KOw3IM2z8QvqWtcNOyfLVonOAJZlrsNCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:34.285854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d7e6eef2390c2eef18ff8ec8492395ed8fa0ddd8cb743a1a3469fc4a49f4301","sha256:76055b69d171f29c199c9a9e9dca73aa9694c842b5e11c217939ec914c046ce6"],"state_sha256":"0f7cad20c496009a251e2e3ec7d27141daa5ab0a6d66d6fd0f71ee1828fbaf4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqYaiy24S8gEoTU1UDunPq3cRJ3sBeBbU63rwhC4yaFeClnigTQYGZpnLzaxeVpPujiqxbCqlYRhc4JgWNBJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:02:08.874476Z","bundle_sha256":"226daf6f95030ddc9c0a9542777ee47331839dbd894430b71262826862307cf9"}}