{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DP4ENAWILS3XHIPCPZHDSNOBKU","short_pith_number":"pith:DP4ENAWI","schema_version":"1.0","canonical_sha256":"1bf84682c85cb773a1e27e4e3935c1552f7f455aa47e471c5a565a6687582106","source":{"kind":"arxiv","id":"2105.12597","version":1},"attestation_state":"computed","paper":{"title":"Distributed Zeroth-Order Stochastic Optimization in Time-varying Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Mohamad Assaad, Wenjie Li","submitted_at":"2021-05-26T14:54:07Z","abstract_excerpt":"We consider a distributed convex optimization problem in a network which is time-varying and not always strongly connected. The local cost function of each node is affected by some stochastic process. All nodes of the network collaborate to minimize the average of their local cost functions. The major challenge of our work is that the gradient of cost functions is supposed to be unavailable and has to be estimated only based on the numerical observation of cost functions. Such problem is known as zeroth-order stochastic convex optimization (ZOSCO). In this paper we take a first step towards th"},"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":"2105.12597","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-26T14:54:07Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"627b49d16e3a68a09d92a039f183e5a88741ca0cd2865c86fa76b834ff046c55","abstract_canon_sha256":"e0976b9652372b16cbbb662a606649ff3d39eac1022e09631513fd19ac5b1949"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:40.532470Z","signature_b64":"f+MHcfMH1srkxfBOpfH9ePYt/LOf/ovAc5RwPOlBvHXe+iWlRej8iUkXKbvQG8cZv8QyYLNpZCModIOb4VaJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf84682c85cb773a1e27e4e3935c1552f7f455aa47e471c5a565a6687582106","last_reissued_at":"2026-07-05T02:43:40.531876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:40.531876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Zeroth-Order Stochastic Optimization in Time-varying Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Mohamad Assaad, Wenjie Li","submitted_at":"2021-05-26T14:54:07Z","abstract_excerpt":"We consider a distributed convex optimization problem in a network which is time-varying and not always strongly connected. The local cost function of each node is affected by some stochastic process. All nodes of the network collaborate to minimize the average of their local cost functions. The major challenge of our work is that the gradient of cost functions is supposed to be unavailable and has to be estimated only based on the numerical observation of cost functions. Such problem is known as zeroth-order stochastic convex optimization (ZOSCO). In this paper we take a first step towards th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12597","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.12597/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.12597","created_at":"2026-07-05T02:43:40.531937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12597v1","created_at":"2026-07-05T02:43:40.531937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12597","created_at":"2026-07-05T02:43:40.531937+00:00"},{"alias_kind":"pith_short_12","alias_value":"DP4ENAWILS3X","created_at":"2026-07-05T02:43:40.531937+00:00"},{"alias_kind":"pith_short_16","alias_value":"DP4ENAWILS3XHIPC","created_at":"2026-07-05T02:43:40.531937+00:00"},{"alias_kind":"pith_short_8","alias_value":"DP4ENAWI","created_at":"2026-07-05T02:43:40.531937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07138","citing_title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","ref_index":94,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU","json":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU.json","graph_json":"https://pith.science/api/pith-number/DP4ENAWILS3XHIPCPZHDSNOBKU/graph.json","events_json":"https://pith.science/api/pith-number/DP4ENAWILS3XHIPCPZHDSNOBKU/events.json","paper":"https://pith.science/paper/DP4ENAWI"},"agent_actions":{"view_html":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU","download_json":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU.json","view_paper":"https://pith.science/paper/DP4ENAWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12597&json=true","fetch_graph":"https://pith.science/api/pith-number/DP4ENAWILS3XHIPCPZHDSNOBKU/graph.json","fetch_events":"https://pith.science/api/pith-number/DP4ENAWILS3XHIPCPZHDSNOBKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU/action/storage_attestation","attest_author":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU/action/author_attestation","sign_citation":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU/action/citation_signature","submit_replication":"https://pith.science/pith/DP4ENAWILS3XHIPCPZHDSNOBKU/action/replication_record"}},"created_at":"2026-07-05T02:43:40.531937+00:00","updated_at":"2026-07-05T02:43:40.531937+00:00"}