{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TZ6WQVCBFTN4NKUPNOL6ZZUNY5","short_pith_number":"pith:TZ6WQVCB","schema_version":"1.0","canonical_sha256":"9e7d6854412cdbc6aa8f6b97ece68dc770bc808044334d19e49ebdedf8c3dbfe","source":{"kind":"arxiv","id":"1903.04157","version":1},"attestation_state":"computed","paper":{"title":"Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel W. C. Ho, Deming Yuan, Zhan Yu","submitted_at":"2019-03-11T07:54:22Z","abstract_excerpt":"This paper is concerned with multi-agent optimization problem. A distributed randomized gradient-free mirror descent (DRGFMD) method is developed by introducing a randomized gradient-free oracle in the mirror descent scheme where the non-Euclidean Bregman divergence is used. The classical gradient descent method is generalized without using subgradient information of objective functions. The proposed algorithm is the first distributed non-Euclidean zeroth-order method which achieves an $O(1/\\sqrt{T})$ convergence rate, recovering the best known optimal rate of distributed compact constrained c"},"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":"1903.04157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T07:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"ef199ec29926e8e34765d53b4ecb513c02a07491d829ceddaf6fa00f85d57cf4","abstract_canon_sha256":"fd5a321e47b0b448f2d69bbf08902a699eff4a9b1fdd25987175edd872610dd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:36.341264Z","signature_b64":"lHopCOMNfR9pDh6JwwH3UDw/qOz4A49wZqXB0TWcS+W/xq1kOnqaxoCKhflPQe5ydRc/yHZE0fN8YeXA2bP4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e7d6854412cdbc6aa8f6b97ece68dc770bc808044334d19e49ebdedf8c3dbfe","last_reissued_at":"2026-05-17T23:51:36.340501Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:36.340501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel W. C. Ho, Deming Yuan, Zhan Yu","submitted_at":"2019-03-11T07:54:22Z","abstract_excerpt":"This paper is concerned with multi-agent optimization problem. A distributed randomized gradient-free mirror descent (DRGFMD) method is developed by introducing a randomized gradient-free oracle in the mirror descent scheme where the non-Euclidean Bregman divergence is used. The classical gradient descent method is generalized without using subgradient information of objective functions. The proposed algorithm is the first distributed non-Euclidean zeroth-order method which achieves an $O(1/\\sqrt{T})$ convergence rate, recovering the best known optimal rate of distributed compact constrained c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04157","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":"1903.04157","created_at":"2026-05-17T23:51:36.340639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04157v1","created_at":"2026-05-17T23:51:36.340639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04157","created_at":"2026-05-17T23:51:36.340639+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZ6WQVCBFTN4","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZ6WQVCBFTN4NKUP","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZ6WQVCB","created_at":"2026-05-18T12:33:30.264802+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/TZ6WQVCBFTN4NKUPNOL6ZZUNY5","json":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5.json","graph_json":"https://pith.science/api/pith-number/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/graph.json","events_json":"https://pith.science/api/pith-number/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/events.json","paper":"https://pith.science/paper/TZ6WQVCB"},"agent_actions":{"view_html":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5","download_json":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5.json","view_paper":"https://pith.science/paper/TZ6WQVCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04157&json=true","fetch_graph":"https://pith.science/api/pith-number/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/graph.json","fetch_events":"https://pith.science/api/pith-number/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/action/storage_attestation","attest_author":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/action/author_attestation","sign_citation":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/action/citation_signature","submit_replication":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/action/replication_record"}},"created_at":"2026-05-17T23:51:36.340639+00:00","updated_at":"2026-05-17T23:51:36.340639+00:00"}