{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B4TTELSJSWXSP7BUYTKMFKX53T","short_pith_number":"pith:B4TTELSJ","canonical_record":{"source":{"id":"1711.09221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-25T09:15:43Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"7b15545e4f67753e68a761d6e6b357aa7ab1447675979b0c810fab85545133df","abstract_canon_sha256":"251362422b4915963f880ee7c3c8dfc156b52b7507d102d51344c83f5ac3b536"},"schema_version":"1.0"},"canonical_sha256":"0f27322e4995af27fc34c4d4c2aafddcdaef1deaaeacec416fe4a58920444cb6","source":{"kind":"arxiv","id":"1711.09221","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09221","created_at":"2026-05-18T00:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09221v2","created_at":"2026-05-18T00:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09221","created_at":"2026-05-18T00:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"B4TTELSJSWXS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B4TTELSJSWXSP7BU","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B4TTELSJ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B4TTELSJSWXSP7BUYTKMFKX53T","target":"record","payload":{"canonical_record":{"source":{"id":"1711.09221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-25T09:15:43Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"7b15545e4f67753e68a761d6e6b357aa7ab1447675979b0c810fab85545133df","abstract_canon_sha256":"251362422b4915963f880ee7c3c8dfc156b52b7507d102d51344c83f5ac3b536"},"schema_version":"1.0"},"canonical_sha256":"0f27322e4995af27fc34c4d4c2aafddcdaef1deaaeacec416fe4a58920444cb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:15.523527Z","signature_b64":"8XKBZruqlwkQJzIfkahTXW9e9gDJb7x9CY9ZDJ7xp5oyZCYiWgBS5Iyj88UQMPhqcx1zGIjluG1bjRPGuJngAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f27322e4995af27fc34c4d4c2aafddcdaef1deaaeacec416fe4a58920444cb6","last_reissued_at":"2026-05-18T00:13:15.522861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:15.522861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.09221","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:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hg5LINtZAcPQ6HT3/TYlPvxKEr7N1RB/AA48tgX7EpACgB7QtkIJ2nkh+AMBwxhAreZwRwQW8YPjMGRY93v+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:28:53.308806Z"},"content_sha256":"b914460d7d4919b0ffff1d2be3e6d1518619214780a4f7b358ac4d5da79a0344","schema_version":"1.0","event_id":"sha256:b914460d7d4919b0ffff1d2be3e6d1518619214780a4f7b358ac4d5da79a0344"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B4TTELSJSWXSP7BUYTKMFKX53T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint Coupled Distributed Optimization: a Relaxation and Duality Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2017-11-25T09:15:43Z","abstract_excerpt":"In this paper we consider a general, challenging distributed optimization set-up arising in several important network control applications. Agents of a network want to minimize the sum of local cost functions, each one depending on a local variable, subject to local and coupling constraints, with the latter involving all the decision variables. We propose a novel fully distributed algorithm based on a relaxation of the primal problem and an elegant exploration of duality theory. Despite its complex derivation, based on several duality steps, the distributed algorithm has a very simple and intu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09221","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:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbeBGl0SMJJWovQaHeM44RHx0YGwidEExyPWLUp/SB7FRmwY03qh95N5Qgf+mf20w5g9Jf5KsSg/UiBwiBkNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:28:53.309356Z"},"content_sha256":"a8db2a2a8c7521124bcb98cecceaa15213c83e6455b7e9d8b370c32c4140534f","schema_version":"1.0","event_id":"sha256:a8db2a2a8c7521124bcb98cecceaa15213c83e6455b7e9d8b370c32c4140534f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/bundle.json","state_url":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4TTELSJSWXSP7BUYTKMFKX53T/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-08T23:28:53Z","links":{"resolver":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T","bundle":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/bundle.json","state":"https://pith.science/pith/B4TTELSJSWXSP7BUYTKMFKX53T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4TTELSJSWXSP7BUYTKMFKX53T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B4TTELSJSWXSP7BUYTKMFKX53T","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":"251362422b4915963f880ee7c3c8dfc156b52b7507d102d51344c83f5ac3b536","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-25T09:15:43Z","title_canon_sha256":"7b15545e4f67753e68a761d6e6b357aa7ab1447675979b0c810fab85545133df"},"schema_version":"1.0","source":{"id":"1711.09221","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09221","created_at":"2026-05-18T00:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09221v2","created_at":"2026-05-18T00:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09221","created_at":"2026-05-18T00:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"B4TTELSJSWXS","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B4TTELSJSWXSP7BU","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B4TTELSJ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:a8db2a2a8c7521124bcb98cecceaa15213c83e6455b7e9d8b370c32c4140534f","target":"graph","created_at":"2026-05-18T00:13:15Z","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 consider a general, challenging distributed optimization set-up arising in several important network control applications. Agents of a network want to minimize the sum of local cost functions, each one depending on a local variable, subject to local and coupling constraints, with the latter involving all the decision variables. We propose a novel fully distributed algorithm based on a relaxation of the primal problem and an elegant exploration of duality theory. Despite its complex derivation, based on several duality steps, the distributed algorithm has a very simple and intu","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","cross_cats":["cs.DC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-25T09:15:43Z","title":"Constraint Coupled Distributed Optimization: a Relaxation and Duality Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09221","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:b914460d7d4919b0ffff1d2be3e6d1518619214780a4f7b358ac4d5da79a0344","target":"record","created_at":"2026-05-18T00:13:15Z","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":"251362422b4915963f880ee7c3c8dfc156b52b7507d102d51344c83f5ac3b536","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-11-25T09:15:43Z","title_canon_sha256":"7b15545e4f67753e68a761d6e6b357aa7ab1447675979b0c810fab85545133df"},"schema_version":"1.0","source":{"id":"1711.09221","kind":"arxiv","version":2}},"canonical_sha256":"0f27322e4995af27fc34c4d4c2aafddcdaef1deaaeacec416fe4a58920444cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f27322e4995af27fc34c4d4c2aafddcdaef1deaaeacec416fe4a58920444cb6","first_computed_at":"2026-05-18T00:13:15.522861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:15.522861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8XKBZruqlwkQJzIfkahTXW9e9gDJb7x9CY9ZDJ7xp5oyZCYiWgBS5Iyj88UQMPhqcx1zGIjluG1bjRPGuJngAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:15.523527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09221","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b914460d7d4919b0ffff1d2be3e6d1518619214780a4f7b358ac4d5da79a0344","sha256:a8db2a2a8c7521124bcb98cecceaa15213c83e6455b7e9d8b370c32c4140534f"],"state_sha256":"130d9d0aeddd6f3c12192ce2543dce30dcbf54592f01257dcfd006c24c82b4c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+o5AWtTxUv1iayXMbDcwB/7oTLQMjnOLTIvp5Vl27AgeMG+eKmj7sx8/C21e/yT9snXe7K4/oOdxe9U8TIVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:28:53.311935Z","bundle_sha256":"11913b901e418f0de16bb14e8b95797ac39f341a1e475f7b0754f9d0cc9e8d8f"}}