{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","short_pith_number":"pith:NJ3OAOPP","canonical_record":{"source":{"id":"1804.09105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-24T15:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"442609a0c81fd09c3a1d9f037d1ba30733c1d18c24726837be0b62636d940c31","abstract_canon_sha256":"affbacc7a516048cbe96f398d5bc386c5de83f3d4a128c1ff6d17870259d582d"},"schema_version":"1.0"},"canonical_sha256":"6a76e039ef6a76b613edd1ac9a8f99ce6fa6d4b49379112fe74fb002fb621cf1","source":{"kind":"arxiv","id":"1804.09105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09105","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09105v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09105","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"NJ3OAOPPNJ3L","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJ3OAOPPNJ3LME7N","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJ3OAOPP","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-24T15:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"442609a0c81fd09c3a1d9f037d1ba30733c1d18c24726837be0b62636d940c31","abstract_canon_sha256":"affbacc7a516048cbe96f398d5bc386c5de83f3d4a128c1ff6d17870259d582d"},"schema_version":"1.0"},"canonical_sha256":"6a76e039ef6a76b613edd1ac9a8f99ce6fa6d4b49379112fe74fb002fb621cf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.313257Z","signature_b64":"H3XP1GNk/luHiRX2liZQ8qwUZ6vyBeUYAeZUXHgG9CG2HNrOihLHJACYyStYCLy8P9p0iz4GGTCw8NCLQu1mBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a76e039ef6a76b613edd1ac9a8f99ce6fa6d4b49379112fe74fb002fb621cf1","last_reissued_at":"2026-05-18T00:17:36.312648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.312648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09105","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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMnK6sUOdUwO87DpRjlTSv+KOV9e2U/LS1GmjiFC/WUN8r3gW8KAYwsNDJ4mEKQPyiHbC0ewM6w73QsTC3kPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:21:10.402092Z"},"content_sha256":"17ea41e9b86e123cd1188cec3853ef2b716cec5ed81b5b769567108a70d13580","schema_version":"1.0","event_id":"sha256:17ea41e9b86e123cd1188cec3853ef2b716cec5ed81b5b769567108a70d13580"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Duality-Based Approach for Distributed Optimization with Coupling Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-04-24T15:50:04Z","abstract_excerpt":"In this paper we consider a distributed optimization scenario in which a set of agents has to solve a convex optimization problem with separable cost function, local constraint sets and a coupling inequality constraint. We propose a novel 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 intuitive structure. That is, each node solves a local version of the original problem relaxation, and updates suitable dual variables. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09105","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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESO21tI4PjeF4rhAfb9RKvAsZrlBdeA9K6J85WqwYpYvXNebfT1hTs+ph5I2oQrX24vu/qkd3t7j6YofHi/bAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:21:10.402805Z"},"content_sha256":"67fd2b960e70f7186d3db580466a7d22436ca3927aad6d62d2f4a54f9d928252","schema_version":"1.0","event_id":"sha256:67fd2b960e70f7186d3db580466a7d22436ca3927aad6d62d2f4a54f9d928252"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/bundle.json","state_url":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/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-08T18:21:10Z","links":{"resolver":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","bundle":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/bundle.json","state":"https://pith.science/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJ3OAOPPNJ3LME7N2GWJVD4ZZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NJ3OAOPPNJ3LME7N2GWJVD4ZZZ","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":"affbacc7a516048cbe96f398d5bc386c5de83f3d4a128c1ff6d17870259d582d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-24T15:50:04Z","title_canon_sha256":"442609a0c81fd09c3a1d9f037d1ba30733c1d18c24726837be0b62636d940c31"},"schema_version":"1.0","source":{"id":"1804.09105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09105","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09105v1","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09105","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"NJ3OAOPPNJ3L","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJ3OAOPPNJ3LME7N","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJ3OAOPP","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:67fd2b960e70f7186d3db580466a7d22436ca3927aad6d62d2f4a54f9d928252","target":"graph","created_at":"2026-05-18T00:17:36Z","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 distributed optimization scenario in which a set of agents has to solve a convex optimization problem with separable cost function, local constraint sets and a coupling inequality constraint. We propose a novel 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 intuitive structure. That is, each node solves a local version of the original problem relaxation, and updates suitable dual variables. We","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-24T15:50:04Z","title":"A Duality-Based Approach for Distributed Optimization with Coupling Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09105","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:17ea41e9b86e123cd1188cec3853ef2b716cec5ed81b5b769567108a70d13580","target":"record","created_at":"2026-05-18T00:17:36Z","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":"affbacc7a516048cbe96f398d5bc386c5de83f3d4a128c1ff6d17870259d582d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-24T15:50:04Z","title_canon_sha256":"442609a0c81fd09c3a1d9f037d1ba30733c1d18c24726837be0b62636d940c31"},"schema_version":"1.0","source":{"id":"1804.09105","kind":"arxiv","version":1}},"canonical_sha256":"6a76e039ef6a76b613edd1ac9a8f99ce6fa6d4b49379112fe74fb002fb621cf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a76e039ef6a76b613edd1ac9a8f99ce6fa6d4b49379112fe74fb002fb621cf1","first_computed_at":"2026-05-18T00:17:36.312648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:36.312648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H3XP1GNk/luHiRX2liZQ8qwUZ6vyBeUYAeZUXHgG9CG2HNrOihLHJACYyStYCLy8P9p0iz4GGTCw8NCLQu1mBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:36.313257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17ea41e9b86e123cd1188cec3853ef2b716cec5ed81b5b769567108a70d13580","sha256:67fd2b960e70f7186d3db580466a7d22436ca3927aad6d62d2f4a54f9d928252"],"state_sha256":"71a337da954f4648a424b2d61dbe9c543ad79692976ab7a73b9f54180f13231e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c55KNDPwD3gKpe+tpa5BVysVsLajw/PJsBAjuZOFZ5QLXmEv+5DmBq9BzWN87L1iCzuIZhvNPGyNMCvS2dSoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:21:10.407374Z","bundle_sha256":"665fb318ee94e59e8713a7875aca214a7e04e6377b5d17697c907893504cab4e"}}