{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PCY2CNYGE57MLUOMBKU2UEUY35","short_pith_number":"pith:PCY2CNYG","canonical_record":{"source":{"id":"1607.00600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-03T06:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"e8bb7d1856dffc27a74960db6abff8a0b4b560a406ca5133227e308d85092f4b","abstract_canon_sha256":"013eb618c44a3f2dfcda8419452bebc0c2795560a9195dc6c17706d02049dc3b"},"schema_version":"1.0"},"canonical_sha256":"78b1a13706277ec5d1cc0aa9aa1298df437211575774d98be0df5d44ad030754","source":{"kind":"arxiv","id":"1607.00600","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00600","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00600v2","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00600","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"PCY2CNYGE57M","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCY2CNYGE57MLUOM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCY2CNYG","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PCY2CNYGE57MLUOMBKU2UEUY35","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-03T06:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"e8bb7d1856dffc27a74960db6abff8a0b4b560a406ca5133227e308d85092f4b","abstract_canon_sha256":"013eb618c44a3f2dfcda8419452bebc0c2795560a9195dc6c17706d02049dc3b"},"schema_version":"1.0"},"canonical_sha256":"78b1a13706277ec5d1cc0aa9aa1298df437211575774d98be0df5d44ad030754","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:08.140957Z","signature_b64":"oUerlisYZcf99dgUwGCqe3CGjSxZ3YbnX68HQiV8pZ/3bLvlFYA0IBCnkXPl7+vIB6yVco3OUwxo1EYHtYmZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b1a13706277ec5d1cc0aa9aa1298df437211575774d98be0df5d44ad030754","last_reissued_at":"2026-05-18T00:46:08.140406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:08.140406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00600","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:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqLJws3jCtIHFjksndC1CM9s8eWnFvHhmPcx60unLDzshaRgfI5xJCvCIz1cHFI/6XyHBJAruZyLisE39IQZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T20:43:10.672178Z"},"content_sha256":"d42ec86f2db46bbd667e5748a81cf572e3f8701ed2058940bfc8224e813edbbc","schema_version":"1.0","event_id":"sha256:d42ec86f2db46bbd667e5748a81cf572e3f8701ed2058940bfc8224e813edbbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PCY2CNYGE57MLUOMBKU2UEUY35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual decomposition for multi-agent distributed optimization with coupling constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessandro Falsone, Kostas Margellos, Maria Prandini, Simone Garatti","submitted_at":"2016-07-03T06:34:53Z","abstract_excerpt":"We study distributed optimization in a cooperative multi-agent setting, where agents have to agree on the usage of shared resources and can communicate via a time-varying network to this purpose. Each agent has its own decision variables that should be set so as to minimize its individual objective function subject to local constraints. Resource sharing is modeled via coupling constraints that involve the non-positivity of the sum of agents' individual functions, each one depending on the decision variables of one single agent. We propose a novel distributed algorithm to minimize the sum of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00600","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:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlrxjtph1JDR1nC1s6k1b1DCQcRo9WcschHsu+8lqz6WFb+bgrxRAPPM0ArAGM4PJDPzi6Sw9YSmjtv2gWH+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T20:43:10.672643Z"},"content_sha256":"10a1953dfc6269ffa4ed9c1433ccd55340aff6b6ddd5866d7454d78082a968ee","schema_version":"1.0","event_id":"sha256:10a1953dfc6269ffa4ed9c1433ccd55340aff6b6ddd5866d7454d78082a968ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCY2CNYGE57MLUOMBKU2UEUY35/bundle.json","state_url":"https://pith.science/pith/PCY2CNYGE57MLUOMBKU2UEUY35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCY2CNYGE57MLUOMBKU2UEUY35/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-22T20:43:10Z","links":{"resolver":"https://pith.science/pith/PCY2CNYGE57MLUOMBKU2UEUY35","bundle":"https://pith.science/pith/PCY2CNYGE57MLUOMBKU2UEUY35/bundle.json","state":"https://pith.science/pith/PCY2CNYGE57MLUOMBKU2UEUY35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCY2CNYGE57MLUOMBKU2UEUY35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PCY2CNYGE57MLUOMBKU2UEUY35","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":"013eb618c44a3f2dfcda8419452bebc0c2795560a9195dc6c17706d02049dc3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-03T06:34:53Z","title_canon_sha256":"e8bb7d1856dffc27a74960db6abff8a0b4b560a406ca5133227e308d85092f4b"},"schema_version":"1.0","source":{"id":"1607.00600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00600","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00600v2","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00600","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"PCY2CNYGE57M","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCY2CNYGE57MLUOM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCY2CNYG","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:10a1953dfc6269ffa4ed9c1433ccd55340aff6b6ddd5866d7454d78082a968ee","target":"graph","created_at":"2026-05-18T00:46: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":"We study distributed optimization in a cooperative multi-agent setting, where agents have to agree on the usage of shared resources and can communicate via a time-varying network to this purpose. Each agent has its own decision variables that should be set so as to minimize its individual objective function subject to local constraints. Resource sharing is modeled via coupling constraints that involve the non-positivity of the sum of agents' individual functions, each one depending on the decision variables of one single agent. We propose a novel distributed algorithm to minimize the sum of th","authors_text":"Alessandro Falsone, Kostas Margellos, Maria Prandini, Simone Garatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-03T06:34:53Z","title":"Dual decomposition for multi-agent distributed optimization with coupling constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00600","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:d42ec86f2db46bbd667e5748a81cf572e3f8701ed2058940bfc8224e813edbbc","target":"record","created_at":"2026-05-18T00:46: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":"013eb618c44a3f2dfcda8419452bebc0c2795560a9195dc6c17706d02049dc3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-03T06:34:53Z","title_canon_sha256":"e8bb7d1856dffc27a74960db6abff8a0b4b560a406ca5133227e308d85092f4b"},"schema_version":"1.0","source":{"id":"1607.00600","kind":"arxiv","version":2}},"canonical_sha256":"78b1a13706277ec5d1cc0aa9aa1298df437211575774d98be0df5d44ad030754","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78b1a13706277ec5d1cc0aa9aa1298df437211575774d98be0df5d44ad030754","first_computed_at":"2026-05-18T00:46:08.140406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:08.140406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oUerlisYZcf99dgUwGCqe3CGjSxZ3YbnX68HQiV8pZ/3bLvlFYA0IBCnkXPl7+vIB6yVco3OUwxo1EYHtYmZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:08.140957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d42ec86f2db46bbd667e5748a81cf572e3f8701ed2058940bfc8224e813edbbc","sha256:10a1953dfc6269ffa4ed9c1433ccd55340aff6b6ddd5866d7454d78082a968ee"],"state_sha256":"4526fe9f28589f145a570f994cddc71d3e09d8c5f6000babcac7f634ee9df5f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BeVzWu/L+qi+7ZRVF08o2krDrMn2Nec4Uk5nfq46wk12dzOLFLbiCki1/Q8thrRfzvUuiGHbEYu4Ffo9st5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T20:43:10.675020Z","bundle_sha256":"2566e6f6452467101208ec15f31a45c0e7e834ad3a67c2aa3e3ade16ef935a74"}}