{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3RQXY677X2C7L7HAGA2Q7LS7IR","short_pith_number":"pith:3RQXY677","schema_version":"1.0","canonical_sha256":"dc617c7bffbe85f5fce030350fae5f446d9137aadad14473cbc14b0efd50abee","source":{"kind":"arxiv","id":"1904.04650","version":1},"attestation_state":"computed","paper":{"title":"Gradient-Free Multi-Agent Nonconvex Nonsmooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Davood Hajinezhad, Michael Zavlanos","submitted_at":"2019-04-09T13:24:44Z","abstract_excerpt":"In this paper, we consider the problem of minimizing the sum of nonconvex and possibly nonsmooth functions over a connected multi-agent network, where the agents have partial knowledge about the global cost function and can only access the zeroth-order information (i.e., the functional values) of their local cost functions. We propose and analyze a distributed primal-dual gradient-free algorithm for this challenging problem. We show that by appropriately choosing the parameters, the proposed algorithm converges to the set of first order stationary solutions with a provable global sublinear con"},"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":"1904.04650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-09T13:24:44Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"617d68aa5492b6c2abdd79fcae5b6ed029a8713889629164342c4a26909e566d","abstract_canon_sha256":"1370839fdda72f86d0701d9fd51a712574a57364823ec3613c366b3c3c794e95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:58.508436Z","signature_b64":"s/p+Sv7JYETLzfPkHEhAK+jTRzhZs7EcQWz3Pq8AC6+cHh+I+IQMGjDNiBpesG/lSXNS2zS3pAfyCAXUg3zgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc617c7bffbe85f5fce030350fae5f446d9137aadad14473cbc14b0efd50abee","last_reissued_at":"2026-05-17T23:48:58.508030Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:58.508030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-Free Multi-Agent Nonconvex Nonsmooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Davood Hajinezhad, Michael Zavlanos","submitted_at":"2019-04-09T13:24:44Z","abstract_excerpt":"In this paper, we consider the problem of minimizing the sum of nonconvex and possibly nonsmooth functions over a connected multi-agent network, where the agents have partial knowledge about the global cost function and can only access the zeroth-order information (i.e., the functional values) of their local cost functions. We propose and analyze a distributed primal-dual gradient-free algorithm for this challenging problem. We show that by appropriately choosing the parameters, the proposed algorithm converges to the set of first order stationary solutions with a provable global sublinear con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04650","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":"1904.04650","created_at":"2026-05-17T23:48:58.508097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04650v1","created_at":"2026-05-17T23:48:58.508097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04650","created_at":"2026-05-17T23:48:58.508097+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RQXY677X2C7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RQXY677X2C7L7HA","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RQXY677","created_at":"2026-05-18T12:33:10.108867+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/3RQXY677X2C7L7HAGA2Q7LS7IR","json":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR.json","graph_json":"https://pith.science/api/pith-number/3RQXY677X2C7L7HAGA2Q7LS7IR/graph.json","events_json":"https://pith.science/api/pith-number/3RQXY677X2C7L7HAGA2Q7LS7IR/events.json","paper":"https://pith.science/paper/3RQXY677"},"agent_actions":{"view_html":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR","download_json":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR.json","view_paper":"https://pith.science/paper/3RQXY677","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04650&json=true","fetch_graph":"https://pith.science/api/pith-number/3RQXY677X2C7L7HAGA2Q7LS7IR/graph.json","fetch_events":"https://pith.science/api/pith-number/3RQXY677X2C7L7HAGA2Q7LS7IR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR/action/storage_attestation","attest_author":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR/action/author_attestation","sign_citation":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR/action/citation_signature","submit_replication":"https://pith.science/pith/3RQXY677X2C7L7HAGA2Q7LS7IR/action/replication_record"}},"created_at":"2026-05-17T23:48:58.508097+00:00","updated_at":"2026-05-17T23:48:58.508097+00:00"}