{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VWS5F5RD6B4WUTPDO4U4E4QPMV","short_pith_number":"pith:VWS5F5RD","schema_version":"1.0","canonical_sha256":"ada5d2f623f0796a4de37729c2720f65419003636f40cef9dfc548c069de28ea","source":{"kind":"arxiv","id":"1803.07844","version":1},"attestation_state":"computed","paper":{"title":"Distributed Zeroth Order Optimization Over Random Networks: A Kiefer-Wolfowitz Stochastic Approximation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anit Kumar Sahu, Dragana Bajovic, Dusan Jakovetic, Soummya Kar","submitted_at":"2018-03-21T10:41:36Z","abstract_excerpt":"We study a standard distributed optimization framework where $N$ networked nodes collaboratively minimize the sum of their local convex costs. The main body of existing work considers the described problem when the underling network is either static or deterministically varying, and the distributed optimization algorithm is of first or second order, i.e., it involves the local costs' gradients and possibly the local Hessians. In this paper, we consider the currently understudied but highly relevant scenarios when: 1) only noisy function values' estimates are available (no gradients nor Hessian"},"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":"1803.07844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T10:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"884b2803a3797475c523540a604bbdead1bc7c92d3a520d7806814f99328fe0c","abstract_canon_sha256":"0f1686268d8e45319b94364c834d9b17256b0215f1a00cbde12d144f49ad9edc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:28.748026Z","signature_b64":"G4F/0OPpAqOrugMMFruLAjXJR0U4iAELUffj08xCMtpp1lTdnWUsJR83OLBP9J46Ql02MqmGCtSVgq2wP7XfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada5d2f623f0796a4de37729c2720f65419003636f40cef9dfc548c069de28ea","last_reissued_at":"2026-05-18T00:20:28.747569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:28.747569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Zeroth Order Optimization Over Random Networks: A Kiefer-Wolfowitz Stochastic Approximation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anit Kumar Sahu, Dragana Bajovic, Dusan Jakovetic, Soummya Kar","submitted_at":"2018-03-21T10:41:36Z","abstract_excerpt":"We study a standard distributed optimization framework where $N$ networked nodes collaboratively minimize the sum of their local convex costs. The main body of existing work considers the described problem when the underling network is either static or deterministically varying, and the distributed optimization algorithm is of first or second order, i.e., it involves the local costs' gradients and possibly the local Hessians. In this paper, we consider the currently understudied but highly relevant scenarios when: 1) only noisy function values' estimates are available (no gradients nor Hessian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07844","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":"1803.07844","created_at":"2026-05-18T00:20:28.747645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07844v1","created_at":"2026-05-18T00:20:28.747645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07844","created_at":"2026-05-18T00:20:28.747645+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWS5F5RD6B4W","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWS5F5RD6B4WUTPD","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWS5F5RD","created_at":"2026-05-18T12:32:59.047623+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/VWS5F5RD6B4WUTPDO4U4E4QPMV","json":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV.json","graph_json":"https://pith.science/api/pith-number/VWS5F5RD6B4WUTPDO4U4E4QPMV/graph.json","events_json":"https://pith.science/api/pith-number/VWS5F5RD6B4WUTPDO4U4E4QPMV/events.json","paper":"https://pith.science/paper/VWS5F5RD"},"agent_actions":{"view_html":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV","download_json":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV.json","view_paper":"https://pith.science/paper/VWS5F5RD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07844&json=true","fetch_graph":"https://pith.science/api/pith-number/VWS5F5RD6B4WUTPDO4U4E4QPMV/graph.json","fetch_events":"https://pith.science/api/pith-number/VWS5F5RD6B4WUTPDO4U4E4QPMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV/action/storage_attestation","attest_author":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV/action/author_attestation","sign_citation":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV/action/citation_signature","submit_replication":"https://pith.science/pith/VWS5F5RD6B4WUTPDO4U4E4QPMV/action/replication_record"}},"created_at":"2026-05-18T00:20:28.747645+00:00","updated_at":"2026-05-18T00:20:28.747645+00:00"}