{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4T3YCBGYO5RY4BRLZG2IALRMGZ","short_pith_number":"pith:4T3YCBGY","schema_version":"1.0","canonical_sha256":"e4f78104d877638e062bc9b4802e2c365a9cbf963549895db80b377b3636a248","source":{"kind":"arxiv","id":"1607.00249","version":3},"attestation_state":"computed","paper":{"title":"Distributed Nonconvex Multiagent Optimization Over Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Daniel Palomar, Gesualdo Scutari, Ying Sun","submitted_at":"2016-07-01T13:51:55Z","abstract_excerpt":"We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs. We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility, plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on Successive Convex Approximation (SCA"},"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":"1607.00249","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T13:51:55Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"7e13eccc70e3f94ab2636dfad2adb11afb591a975321a5ef33769c44a72697e5","abstract_canon_sha256":"b601cd43d145b7e052311bcac2347aca18c1e09d72819a4cd91739d954f43934"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:57.938557Z","signature_b64":"JQuICav+EWH+6OnLHlCR4HU89XAvfosvXnS3fi9oC6sYvH/WNkK5Tf9qX27s3P9C8kGnmIzG0pZCuPa7voPaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4f78104d877638e062bc9b4802e2c365a9cbf963549895db80b377b3636a248","last_reissued_at":"2026-05-18T00:54:57.938099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:57.938099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Nonconvex Multiagent Optimization Over Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Daniel Palomar, Gesualdo Scutari, Ying Sun","submitted_at":"2016-07-01T13:51:55Z","abstract_excerpt":"We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs. We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility, plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on Successive Convex Approximation (SCA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00249","kind":"arxiv","version":3},"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":"1607.00249","created_at":"2026-05-18T00:54:57.938169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00249v3","created_at":"2026-05-18T00:54:57.938169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00249","created_at":"2026-05-18T00:54:57.938169+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T3YCBGYO5RY","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T3YCBGYO5RY4BRL","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T3YCBGY","created_at":"2026-05-18T12:29:58.707656+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/4T3YCBGYO5RY4BRLZG2IALRMGZ","json":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ.json","graph_json":"https://pith.science/api/pith-number/4T3YCBGYO5RY4BRLZG2IALRMGZ/graph.json","events_json":"https://pith.science/api/pith-number/4T3YCBGYO5RY4BRLZG2IALRMGZ/events.json","paper":"https://pith.science/paper/4T3YCBGY"},"agent_actions":{"view_html":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ","download_json":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ.json","view_paper":"https://pith.science/paper/4T3YCBGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00249&json=true","fetch_graph":"https://pith.science/api/pith-number/4T3YCBGYO5RY4BRLZG2IALRMGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4T3YCBGYO5RY4BRLZG2IALRMGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/action/storage_attestation","attest_author":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/action/author_attestation","sign_citation":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/action/citation_signature","submit_replication":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/action/replication_record"}},"created_at":"2026-05-18T00:54:57.938169+00:00","updated_at":"2026-05-18T00:54:57.938169+00:00"}