{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RVQFNMPNYH5DQQ2KBIV5TCV2AY","short_pith_number":"pith:RVQFNMPN","schema_version":"1.0","canonical_sha256":"8d6056b1edc1fa38434a0a2bd98aba062fc654bec88ebc96798b5eeac1bb0837","source":{"kind":"arxiv","id":"1706.07907","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.07907","created_at":"2026-05-18T00:41:47.177500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07907v1","created_at":"2026-05-18T00:41:47.177500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07907","created_at":"2026-05-18T00:41:47.177500+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVQFNMPNYH5D","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVQFNMPNYH5DQQ2K","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVQFNMPN","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY","json":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY.json","graph_json":"https://pith.science/api/pith-number/RVQFNMPNYH5DQQ2KBIV5TCV2AY/graph.json","events_json":"https://pith.science/api/pith-number/RVQFNMPNYH5DQQ2KBIV5TCV2AY/events.json","paper":"https://pith.science/paper/RVQFNMPN"},"agent_actions":{"view_html":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY","download_json":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY.json","view_paper":"https://pith.science/paper/RVQFNMPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07907&json=true","fetch_graph":"https://pith.science/api/pith-number/RVQFNMPNYH5DQQ2KBIV5TCV2AY/graph.json","fetch_events":"https://pith.science/api/pith-number/RVQFNMPNYH5DQQ2KBIV5TCV2AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/action/storage_attestation","attest_author":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/action/author_attestation","sign_citation":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/action/citation_signature","submit_replication":"https://pith.science/pith/RVQFNMPNYH5DQQ2KBIV5TCV2AY/action/replication_record"}},"created_at":"2026-05-18T00:41:47.177500+00:00","updated_at":"2026-05-18T00:41:47.177500+00:00"}