{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TOHMP7AHBRFXPWRUIPHH74JP2S","short_pith_number":"pith:TOHMP7AH","canonical_record":{"source":{"id":"1607.02536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-08T21:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"8988c25a488ef87d5cbac1a9126bc78266e6238e3915ed77659a3381529b3bc8","abstract_canon_sha256":"3f7f6b2819917e0277dad831228c243542bb9b849953c69a4a78d324cbb7b6cf"},"schema_version":"1.0"},"canonical_sha256":"9b8ec7fc070c4b77da3443ce7ff12fd4b04a2cfa9ecd6224c930af562cbb3606","source":{"kind":"arxiv","id":"1607.02536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02536","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02536v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02536","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"TOHMP7AHBRFX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOHMP7AHBRFXPWRU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOHMP7AH","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TOHMP7AHBRFXPWRUIPHH74JP2S","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-08T21:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"8988c25a488ef87d5cbac1a9126bc78266e6238e3915ed77659a3381529b3bc8","abstract_canon_sha256":"3f7f6b2819917e0277dad831228c243542bb9b849953c69a4a78d324cbb7b6cf"},"schema_version":"1.0"},"canonical_sha256":"9b8ec7fc070c4b77da3443ce7ff12fd4b04a2cfa9ecd6224c930af562cbb3606","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:16.862797Z","signature_b64":"O6sA0SyejT+p3/w/Nue1ImWxldJl7FcH3tagsTyPwnASxDXmkTUMYZegE371/o4sQa5/MRiKtXXuNPwlDpRkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b8ec7fc070c4b77da3443ce7ff12fd4b04a2cfa9ecd6224c930af562cbb3606","last_reissued_at":"2026-05-18T01:11:16.862170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:16.862170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02536","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-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DSdaSi1eymZEHJsC8N0fLRe9jsW41obS31iijXXs+akyPg9SFojMKF7gkeiwUKzA3PAaSONIFCO6hb8+0DvxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T20:53:51.888803Z"},"content_sha256":"42fccd7a2faf79c821e9fba1125cd556c5453ed06f81e98e11ee52bc1551e015","schema_version":"1.0","event_id":"sha256:42fccd7a2faf79c821e9fba1125cd556c5453ed06f81e98e11ee52bc1551e015"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TOHMP7AHBRFXPWRUIPHH74JP2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A primal-dual method for conic constrained distributed optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Erfan Yazdandoost Hamedani, Necdet Serhat Aybat","submitted_at":"2016-07-08T21:51:33Z","abstract_excerpt":"We consider cooperative multi-agent consensus optimization problems over an undirected network of agents, where only those agents connected by an edge can directly communicate. The objective is to minimize the sum of agent-specific composite convex functions over agent-specific private conic constraint sets; hence, the optimal consensus decision should lie in the intersection of these private sets. We provide convergence rates both in sub-optimality, infeasibility and consensus violation; examine the effect of underlying network topology on the convergence rates of the proposed decentralized a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02536","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-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKKFGHvjbPJtXxjkliavyOQx8ZN2PICdYSYZ6r/Y+RGD7NBousZZEdpqqnpCuOVAFM1rSadDi07FD+WNenXeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T20:53:51.889143Z"},"content_sha256":"5ddf5f1afe3bfcd26bdf1887e2e4bc933cb0d53060dfbabe698edb0bd9916f60","schema_version":"1.0","event_id":"sha256:5ddf5f1afe3bfcd26bdf1887e2e4bc933cb0d53060dfbabe698edb0bd9916f60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOHMP7AHBRFXPWRUIPHH74JP2S/bundle.json","state_url":"https://pith.science/pith/TOHMP7AHBRFXPWRUIPHH74JP2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOHMP7AHBRFXPWRUIPHH74JP2S/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-21T20:53:51Z","links":{"resolver":"https://pith.science/pith/TOHMP7AHBRFXPWRUIPHH74JP2S","bundle":"https://pith.science/pith/TOHMP7AHBRFXPWRUIPHH74JP2S/bundle.json","state":"https://pith.science/pith/TOHMP7AHBRFXPWRUIPHH74JP2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOHMP7AHBRFXPWRUIPHH74JP2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TOHMP7AHBRFXPWRUIPHH74JP2S","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":"3f7f6b2819917e0277dad831228c243542bb9b849953c69a4a78d324cbb7b6cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-08T21:51:33Z","title_canon_sha256":"8988c25a488ef87d5cbac1a9126bc78266e6238e3915ed77659a3381529b3bc8"},"schema_version":"1.0","source":{"id":"1607.02536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02536","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02536v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02536","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"TOHMP7AHBRFX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOHMP7AHBRFXPWRU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOHMP7AH","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:5ddf5f1afe3bfcd26bdf1887e2e4bc933cb0d53060dfbabe698edb0bd9916f60","target":"graph","created_at":"2026-05-18T01:11:16Z","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 cooperative multi-agent consensus optimization problems over an undirected network of agents, where only those agents connected by an edge can directly communicate. The objective is to minimize the sum of agent-specific composite convex functions over agent-specific private conic constraint sets; hence, the optimal consensus decision should lie in the intersection of these private sets. We provide convergence rates both in sub-optimality, infeasibility and consensus violation; examine the effect of underlying network topology on the convergence rates of the proposed decentralized a","authors_text":"Erfan Yazdandoost Hamedani, Necdet Serhat Aybat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-08T21:51:33Z","title":"A primal-dual method for conic constrained distributed optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02536","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:42fccd7a2faf79c821e9fba1125cd556c5453ed06f81e98e11ee52bc1551e015","target":"record","created_at":"2026-05-18T01:11:16Z","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":"3f7f6b2819917e0277dad831228c243542bb9b849953c69a4a78d324cbb7b6cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-08T21:51:33Z","title_canon_sha256":"8988c25a488ef87d5cbac1a9126bc78266e6238e3915ed77659a3381529b3bc8"},"schema_version":"1.0","source":{"id":"1607.02536","kind":"arxiv","version":1}},"canonical_sha256":"9b8ec7fc070c4b77da3443ce7ff12fd4b04a2cfa9ecd6224c930af562cbb3606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b8ec7fc070c4b77da3443ce7ff12fd4b04a2cfa9ecd6224c930af562cbb3606","first_computed_at":"2026-05-18T01:11:16.862170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:16.862170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O6sA0SyejT+p3/w/Nue1ImWxldJl7FcH3tagsTyPwnASxDXmkTUMYZegE371/o4sQa5/MRiKtXXuNPwlDpRkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:16.862797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42fccd7a2faf79c821e9fba1125cd556c5453ed06f81e98e11ee52bc1551e015","sha256:5ddf5f1afe3bfcd26bdf1887e2e4bc933cb0d53060dfbabe698edb0bd9916f60"],"state_sha256":"4fc32029a291637c959a424febd50acdb0342edde16373ad5f43afbcd8d5a722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JFjp62FCS8Oo4QdUekF5wGVTi/DP9JwrChIBRTr9XJUhz/fAIsbEYdGQXAmreIc4sZKsotJaQ5mkDCe+YS1SCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T20:53:51.891793Z","bundle_sha256":"228fade076c04109203fbb5a2a2bc26b42854516066e0aaeb611036266bda03e"}}