{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RVQFNMPNYH5DQQ2KBIV5TCV2AY","short_pith_number":"pith:RVQFNMPN","canonical_record":{"source":{"id":"1706.07907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-24T04:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"2ad042942ec4d2ee7e0fad065d917be961d243f84e6775e5a4ce2bb5542e2cb7","abstract_canon_sha256":"6ab4397014802e5b357b4355c6fa3d19bafd9a900f51d90175fa2698d210c466"},"schema_version":"1.0"},"canonical_sha256":"8d6056b1edc1fa38434a0a2bd98aba062fc654bec88ebc96798b5eeac1bb0837","source":{"kind":"arxiv","id":"1706.07907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07907","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07907v1","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07907","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"RVQFNMPNYH5D","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RVQFNMPNYH5DQQ2K","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RVQFNMPN","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RVQFNMPNYH5DQQ2KBIV5TCV2AY","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-24T04:36:28Z","cross_cats_sorted":[],"title_canon_sha256":"2ad042942ec4d2ee7e0fad065d917be961d243f84e6775e5a4ce2bb5542e2cb7","abstract_canon_sha256":"6ab4397014802e5b357b4355c6fa3d19bafd9a900f51d90175fa2698d210c466"},"schema_version":"1.0"},"canonical_sha256":"8d6056b1edc1fa38434a0a2bd98aba062fc654bec88ebc96798b5eeac1bb0837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:47.177993Z","signature_b64":"4xyZ5AuUOiNL7fqysP+mCb9+Dq5Few2AqxYNWz89O2951M4PSFWJmciv9CdyjTxb0HmrQgMVcbVp3M/GFZDFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d6056b1edc1fa38434a0a2bd98aba062fc654bec88ebc96798b5eeac1bb0837","last_reissued_at":"2026-05-18T00:41:47.177404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:47.177404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07907","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:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+ECEylO5jNC7rY20HP9cZebmdQ4l09aCsRz5FI7oq7aI9JcUjc16nJ2JTG7ppogBVTMEv/K5D/JY9vSIOygDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:58:41.692831Z"},"content_sha256":"ad7e5fa35986eb6e8d461bc1b99d1b3ca7ac1c45c4591af6408280ac126526ef","schema_version":"1.0","event_id":"sha256:ad7e5fa35986eb6e8d461bc1b99d1b3ca7ac1c45c4591af6408280ac126526ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RVQFNMPNYH5DQQ2KBIV5TCV2AY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-agent constrained optimization of a strongly convex function over time-varying directed networks","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":"2017-06-24T04:36:28Z","abstract_excerpt":"We consider cooperative multi-agent consensus optimization problems over both static and time-varying communication networks, where only local communications are allowed. The objective is to minimize the sum of agent-specific possibly non-smooth composite convex functions over agent-specific private conic constraint sets; hence, the optimal consensus decision should lie in the intersection of these private sets. Assuming the sum function is strongly convex, we provide convergence rates in suboptimality, infeasibility and consensus violation; examine the effect of underlying network topology on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07907","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:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6xBRPnCQkay7Q/8Zkla62065zqkc8W4X8MfN5S2CA50owQmSpdcySDtbNUaDUEx4//n/JE7ZZD8PNWWnoo+iDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:58:41.693412Z"},"content_sha256":"5caacb931cd97a78871b9574750b0b19b706de3a65f62c018d03a459a2d3d3e3","schema_version":"1.0","event_id":"sha256:5caacb931cd97a78871b9574750b0b19b706de3a65f62c018d03a459a2d3d3e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/bundle.json","state_url":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/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-21T18:58:41Z","links":{"resolver":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY","bundle":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/bundle.json","state":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RVQFNMPNYH5DQQ2KBIV5TCV2AY","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":"6ab4397014802e5b357b4355c6fa3d19bafd9a900f51d90175fa2698d210c466","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-24T04:36:28Z","title_canon_sha256":"2ad042942ec4d2ee7e0fad065d917be961d243f84e6775e5a4ce2bb5542e2cb7"},"schema_version":"1.0","source":{"id":"1706.07907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07907","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07907v1","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07907","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"RVQFNMPNYH5D","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RVQFNMPNYH5DQQ2K","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RVQFNMPN","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:5caacb931cd97a78871b9574750b0b19b706de3a65f62c018d03a459a2d3d3e3","target":"graph","created_at":"2026-05-18T00:41:47Z","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 both static and time-varying communication networks, where only local communications are allowed. The objective is to minimize the sum of agent-specific possibly non-smooth composite convex functions over agent-specific private conic constraint sets; hence, the optimal consensus decision should lie in the intersection of these private sets. Assuming the sum function is strongly convex, we provide convergence rates in suboptimality, infeasibility and consensus violation; examine the effect of underlying network topology on","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":"2017-06-24T04:36:28Z","title":"Multi-agent constrained optimization of a strongly convex function over time-varying directed networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07907","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:ad7e5fa35986eb6e8d461bc1b99d1b3ca7ac1c45c4591af6408280ac126526ef","target":"record","created_at":"2026-05-18T00:41:47Z","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":"6ab4397014802e5b357b4355c6fa3d19bafd9a900f51d90175fa2698d210c466","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-24T04:36:28Z","title_canon_sha256":"2ad042942ec4d2ee7e0fad065d917be961d243f84e6775e5a4ce2bb5542e2cb7"},"schema_version":"1.0","source":{"id":"1706.07907","kind":"arxiv","version":1}},"canonical_sha256":"8d6056b1edc1fa38434a0a2bd98aba062fc654bec88ebc96798b5eeac1bb0837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d6056b1edc1fa38434a0a2bd98aba062fc654bec88ebc96798b5eeac1bb0837","first_computed_at":"2026-05-18T00:41:47.177404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:47.177404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4xyZ5AuUOiNL7fqysP+mCb9+Dq5Few2AqxYNWz89O2951M4PSFWJmciv9CdyjTxb0HmrQgMVcbVp3M/GFZDFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:47.177993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad7e5fa35986eb6e8d461bc1b99d1b3ca7ac1c45c4591af6408280ac126526ef","sha256:5caacb931cd97a78871b9574750b0b19b706de3a65f62c018d03a459a2d3d3e3"],"state_sha256":"48e7e3f35b019d8e2b6ba1428270be1d795c2bac44edd1a17a9a0de5ade12491"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hw1dm6VCKsQIKDxkf87QRKJyxtJyAksl2bDofA0qus3ZABZv7SORY9kmNP3lf30Nm4V/+huYYqqxPbulJrTIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:58:41.696427Z","bundle_sha256":"f6b4e0ef71e99c8156c7d2f42ca4a63772e37df2e4b29ad80d3bc12fdd3cd470"}}