{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TZ6WQVCBFTN4NKUPNOL6ZZUNY5","short_pith_number":"pith:TZ6WQVCB","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"},"canonical_sha256":"9e7d6854412cdbc6aa8f6b97ece68dc770bc808044334d19e49ebdedf8c3dbfe","source":{"kind":"arxiv","id":"1903.04157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04157","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04157v1","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04157","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"TZ6WQVCBFTN4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TZ6WQVCBFTN4NKUP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TZ6WQVCB","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TZ6WQVCBFTN4NKUPNOL6ZZUNY5","target":"record","payload":{"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"},"canonical_sha256":"9e7d6854412cdbc6aa8f6b97ece68dc770bc808044334d19e49ebdedf8c3dbfe","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"},"source_kind":"arxiv","source_id":"1903.04157","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZiOKc4I1oH3DDdp6Py//69MjZRWQSf9hphzg+onueMTG0JN5ec7ljw1Vjgc7Im/o5ZooViRU8C+2J8iHZO9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:24:48.507429Z"},"content_sha256":"927c93e4781e65e8a1fa5ac123c878e7d8d669f9dea77615d712df7cd6e6d102","schema_version":"1.0","event_id":"sha256:927c93e4781e65e8a1fa5ac123c878e7d8d669f9dea77615d712df7cd6e6d102"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TZ6WQVCBFTN4NKUPNOL6ZZUNY5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwz+aB1J9+jQinmMx8zfmWQTowS54YfOj25bAGj9cDunx+hAC1SAK8lkYwmcEVzzkrBgi1tFU4UZ+ZxD720dAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:24:48.507772Z"},"content_sha256":"860532a48b59632969fbaa3c7f6bce39f72be6a5a2c484f081d579365d42c0af","schema_version":"1.0","event_id":"sha256:860532a48b59632969fbaa3c7f6bce39f72be6a5a2c484f081d579365d42c0af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/bundle.json","state_url":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T00:24:48Z","links":{"resolver":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5","bundle":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/bundle.json","state":"https://pith.science/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZ6WQVCBFTN4NKUPNOL6ZZUNY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TZ6WQVCBFTN4NKUPNOL6ZZUNY5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fd5a321e47b0b448f2d69bbf08902a699eff4a9b1fdd25987175edd872610dd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T07:54:22Z","title_canon_sha256":"ef199ec29926e8e34765d53b4ecb513c02a07491d829ceddaf6fa00f85d57cf4"},"schema_version":"1.0","source":{"id":"1903.04157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04157","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04157v1","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04157","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"TZ6WQVCBFTN4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TZ6WQVCBFTN4NKUP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TZ6WQVCB","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:860532a48b59632969fbaa3c7f6bce39f72be6a5a2c484f081d579365d42c0af","target":"graph","created_at":"2026-05-17T23:51:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel W. C. Ho, Deming Yuan, Zhan Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T07:54:22Z","title":"Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04157","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:927c93e4781e65e8a1fa5ac123c878e7d8d669f9dea77615d712df7cd6e6d102","target":"record","created_at":"2026-05-17T23:51:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fd5a321e47b0b448f2d69bbf08902a699eff4a9b1fdd25987175edd872610dd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T07:54:22Z","title_canon_sha256":"ef199ec29926e8e34765d53b4ecb513c02a07491d829ceddaf6fa00f85d57cf4"},"schema_version":"1.0","source":{"id":"1903.04157","kind":"arxiv","version":1}},"canonical_sha256":"9e7d6854412cdbc6aa8f6b97ece68dc770bc808044334d19e49ebdedf8c3dbfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e7d6854412cdbc6aa8f6b97ece68dc770bc808044334d19e49ebdedf8c3dbfe","first_computed_at":"2026-05-17T23:51:36.340501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:36.340501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lHopCOMNfR9pDh6JwwH3UDw/qOz4A49wZqXB0TWcS+W/xq1kOnqaxoCKhflPQe5ydRc/yHZE0fN8YeXA2bP4Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:36.341264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:927c93e4781e65e8a1fa5ac123c878e7d8d669f9dea77615d712df7cd6e6d102","sha256:860532a48b59632969fbaa3c7f6bce39f72be6a5a2c484f081d579365d42c0af"],"state_sha256":"e18419f23275ce7adddf90ecc517355524a585d07556eb458b84b8cc01f9daff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHpmUQxzHvR9c2jMjWNCEbqhbrshr+DysIpDCSVTJi+uFhm/nQVSiGk/Uz+tE08HGnuC0d+rAX0y2FNZ0DXxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:24:48.509660Z","bundle_sha256":"698e9c78702a4a3ee21ba306034888badc2a5a25aa4c452b5b4db4f0358f6152"}}