{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LBCTHNMWBXB5VJYAICKRKRCW7X","short_pith_number":"pith:LBCTHNMW","canonical_record":{"source":{"id":"2604.23613","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-04-26T09:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"fb12827e561a73ae399edcf4385c842f39c37504b26d324ca326e193033a4e26","abstract_canon_sha256":"5ad99d955f16be0532727a4cadd9afc4650979d555d149230f3e91e7b9c8e0d0"},"schema_version":"1.0"},"canonical_sha256":"584533b5960dc3daa7004095154456fdd6a3beb511caaae809365cd3ba2cc06e","source":{"kind":"arxiv","id":"2604.23613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.23613","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"2604.23613v2","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23613","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"LBCTHNMWBXB5","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"pith_short_16","alias_value":"LBCTHNMWBXB5VJYA","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"pith_short_8","alias_value":"LBCTHNMW","created_at":"2026-06-23T01:12:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LBCTHNMWBXB5VJYAICKRKRCW7X","target":"record","payload":{"canonical_record":{"source":{"id":"2604.23613","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-04-26T09:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"fb12827e561a73ae399edcf4385c842f39c37504b26d324ca326e193033a4e26","abstract_canon_sha256":"5ad99d955f16be0532727a4cadd9afc4650979d555d149230f3e91e7b9c8e0d0"},"schema_version":"1.0"},"canonical_sha256":"584533b5960dc3daa7004095154456fdd6a3beb511caaae809365cd3ba2cc06e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:07.537770Z","signature_b64":"JlOdVvfp5BmJteg+yOE+VOQFj/CvwxO5u4r6Aprg0B/PZl5yPdZd13lRSHdr3/spE49ZK7X6I3iJZ8pinRH4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"584533b5960dc3daa7004095154456fdd6a3beb511caaae809365cd3ba2cc06e","last_reissued_at":"2026-06-23T01:12:07.537231Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:07.537231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.23613","source_version":2,"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-06-23T01:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9/noqPRKp1vAI4VW49G4FZNzeLH6wpFQZzd/Gh3Yyu4a2ysqc5QpM5B2h0fYimezz745dPehW945bGo5I18Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:06:40.825838Z"},"content_sha256":"b92b9ce38f552f1d8ab0173337d057fa927bb3910f8dcc4d0359d8ec50fa1cb6","schema_version":"1.0","event_id":"sha256:b92b9ce38f552f1d8ab0173337d057fa927bb3910f8dcc4d0359d8ec50fa1cb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LBCTHNMWBXB5VJYAICKRKRCW7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Random zeroth-order gradient descent reaches ε-suboptimality with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries for smooth strongly convex functions.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haishan Ye","submitted_at":"2026-04-26T09:02:05Z","abstract_excerpt":"Zeroth-order optimization aims to minimize an objective function using only function evaluations, and is therefore fundamental in black-box optimization, hyperparameter tuning, bandit learning, and adversarial machine learning. While classical zeroth-order methods are well understood in expectation, much less is known about their high-probability behavior, especially for smooth and strongly convex objectives. In this paper, we establish high-probability convergence guarantees for random zeroth-order gradient descent in both deterministic and stochastic settings. For deterministic $L$-smooth an"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For deterministic L-smooth and μ-strongly convex objectives of d-dimension, the classical two-query random zeroth-order method finds an ε-suboptimal solution with probability at least 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) function queries. For stochastic objectives under bounded-noise, random zeroth-order SGD achieves the same with O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The objective is L-smooth and μ-strongly convex (deterministic case) or has bounded noise without uniformly bounded stochastic gradients (stochastic case); these are invoked to derive the stated query complexities but their necessity for the high-probability result is not relaxed in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Random zeroth-order gradient descent reaches ε-suboptimal solutions with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries deterministically and O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries under bounded stochastic noise.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Random zeroth-order gradient descent reaches ε-suboptimality with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries for smooth strongly convex functions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5bb2a04d37b030016610e3ec1b6423c3fa7afedf47d8d7ea0fe9bbba2e123b05"},"source":{"id":"2604.23613","kind":"arxiv","version":2},"verdict":{"id":"7b712e9e-3fec-4f67-8f27-f20344d87c54","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T05:45:08.341843Z","strongest_claim":"For deterministic L-smooth and μ-strongly convex objectives of d-dimension, the classical two-query random zeroth-order method finds an ε-suboptimal solution with probability at least 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) function queries. For stochastic objectives under bounded-noise, random zeroth-order SGD achieves the same with O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries.","one_line_summary":"Random zeroth-order gradient descent reaches ε-suboptimal solutions with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries deterministically and O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries under bounded stochastic noise.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The objective is L-smooth and μ-strongly convex (deterministic case) or has bounded noise without uniformly bounded stochastic gradients (stochastic case); these are invoked to derive the stated query complexities but their necessity for the high-probability result is not relaxed in the abstract.","pith_extraction_headline":"Random zeroth-order gradient descent reaches ε-suboptimality with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries for smooth strongly convex functions."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.23613/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T08:37:52.229328Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:56:21.762503Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"bc245d88e81ed969ac84eb025b90b20c273f3798bcd1040e7d6522cb2e1e25a5"},"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":"7b712e9e-3fec-4f67-8f27-f20344d87c54"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T01:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNDDagG7wbMSZbobCatIErdZTn3+xPJpNbxN4W5SfkFxynLKOaw51FXVTXTFTmNrHCNgGVqPCU1sjgs62gEVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:06:40.826427Z"},"content_sha256":"e7cde3c3cf1b6e9d25d4fd93104b8e7d8bfb79d9910c82a67b011b65af424235","schema_version":"1.0","event_id":"sha256:e7cde3c3cf1b6e9d25d4fd93104b8e7d8bfb79d9910c82a67b011b65af424235"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBCTHNMWBXB5VJYAICKRKRCW7X/bundle.json","state_url":"https://pith.science/pith/LBCTHNMWBXB5VJYAICKRKRCW7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBCTHNMWBXB5VJYAICKRKRCW7X/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-07-04T22:06:40Z","links":{"resolver":"https://pith.science/pith/LBCTHNMWBXB5VJYAICKRKRCW7X","bundle":"https://pith.science/pith/LBCTHNMWBXB5VJYAICKRKRCW7X/bundle.json","state":"https://pith.science/pith/LBCTHNMWBXB5VJYAICKRKRCW7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBCTHNMWBXB5VJYAICKRKRCW7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LBCTHNMWBXB5VJYAICKRKRCW7X","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":"5ad99d955f16be0532727a4cadd9afc4650979d555d149230f3e91e7b9c8e0d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-04-26T09:02:05Z","title_canon_sha256":"fb12827e561a73ae399edcf4385c842f39c37504b26d324ca326e193033a4e26"},"schema_version":"1.0","source":{"id":"2604.23613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.23613","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"2604.23613v2","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23613","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"LBCTHNMWBXB5","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"pith_short_16","alias_value":"LBCTHNMWBXB5VJYA","created_at":"2026-06-23T01:12:07Z"},{"alias_kind":"pith_short_8","alias_value":"LBCTHNMW","created_at":"2026-06-23T01:12:07Z"}],"graph_snapshots":[{"event_id":"sha256:e7cde3c3cf1b6e9d25d4fd93104b8e7d8bfb79d9910c82a67b011b65af424235","target":"graph","created_at":"2026-06-23T01:12:07Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For deterministic L-smooth and μ-strongly convex objectives of d-dimension, the classical two-query random zeroth-order method finds an ε-suboptimal solution with probability at least 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) function queries. For stochastic objectives under bounded-noise, random zeroth-order SGD achieves the same with O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The objective is L-smooth and μ-strongly convex (deterministic case) or has bounded noise without uniformly bounded stochastic gradients (stochastic case); these are invoked to derive the stated query complexities but their necessity for the high-probability result is not relaxed in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Random zeroth-order gradient descent reaches ε-suboptimal solutions with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries deterministically and O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries under bounded stochastic noise."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Random zeroth-order gradient descent reaches ε-suboptimality with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries for smooth strongly convex functions."}],"snapshot_sha256":"5bb2a04d37b030016610e3ec1b6423c3fa7afedf47d8d7ea0fe9bbba2e123b05"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T08:37:52.229328Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:56:21.762503Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.23613/integrity.json","findings":[],"snapshot_sha256":"bc245d88e81ed969ac84eb025b90b20c273f3798bcd1040e7d6522cb2e1e25a5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Zeroth-order optimization aims to minimize an objective function using only function evaluations, and is therefore fundamental in black-box optimization, hyperparameter tuning, bandit learning, and adversarial machine learning. While classical zeroth-order methods are well understood in expectation, much less is known about their high-probability behavior, especially for smooth and strongly convex objectives. In this paper, we establish high-probability convergence guarantees for random zeroth-order gradient descent in both deterministic and stochastic settings. For deterministic $L$-smooth an","authors_text":"Haishan Ye","cross_cats":[],"headline":"Random zeroth-order gradient descent reaches ε-suboptimality with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries for smooth strongly convex functions.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-04-26T09:02:05Z","title":"High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.23613","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T05:45:08.341843Z","id":"7b712e9e-3fec-4f67-8f27-f20344d87c54","model_set":{"reader":"grok-4.3"},"one_line_summary":"Random zeroth-order gradient descent reaches ε-suboptimal solutions with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries deterministically and O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries under bounded stochastic noise.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Random zeroth-order gradient descent reaches ε-suboptimality with probability 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) queries for smooth strongly convex functions.","strongest_claim":"For deterministic L-smooth and μ-strongly convex objectives of d-dimension, the classical two-query random zeroth-order method finds an ε-suboptimal solution with probability at least 1-δ using O((dL/μ)log(1/ε) + log(1/δ)) function queries. For stochastic objectives under bounded-noise, random zeroth-order SGD achieves the same with O(d log(1/ε)(log(1/ε)+log(1/δ))/ε) queries.","weakest_assumption":"The objective is L-smooth and μ-strongly convex (deterministic case) or has bounded noise without uniformly bounded stochastic gradients (stochastic case); these are invoked to derive the stated query complexities but their necessity for the high-probability result is not relaxed in the abstract."}},"verdict_id":"7b712e9e-3fec-4f67-8f27-f20344d87c54"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b92b9ce38f552f1d8ab0173337d057fa927bb3910f8dcc4d0359d8ec50fa1cb6","target":"record","created_at":"2026-06-23T01:12:07Z","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":"5ad99d955f16be0532727a4cadd9afc4650979d555d149230f3e91e7b9c8e0d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-04-26T09:02:05Z","title_canon_sha256":"fb12827e561a73ae399edcf4385c842f39c37504b26d324ca326e193033a4e26"},"schema_version":"1.0","source":{"id":"2604.23613","kind":"arxiv","version":2}},"canonical_sha256":"584533b5960dc3daa7004095154456fdd6a3beb511caaae809365cd3ba2cc06e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"584533b5960dc3daa7004095154456fdd6a3beb511caaae809365cd3ba2cc06e","first_computed_at":"2026-06-23T01:12:07.537231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:12:07.537231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JlOdVvfp5BmJteg+yOE+VOQFj/CvwxO5u4r6Aprg0B/PZl5yPdZd13lRSHdr3/spE49ZK7X6I3iJZ8pinRH4Cw==","signature_status":"signed_v1","signed_at":"2026-06-23T01:12:07.537770Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.23613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b92b9ce38f552f1d8ab0173337d057fa927bb3910f8dcc4d0359d8ec50fa1cb6","sha256:e7cde3c3cf1b6e9d25d4fd93104b8e7d8bfb79d9910c82a67b011b65af424235"],"state_sha256":"a88b72f7916d29a2d2d25f9efe06fe728abcb7e82eafd5432fa41d48c9da194d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kX38EalPwSbQABYlgEcCVa+SEZlowzDJJNKHFolXWQHdL1WVxksQFv2C7fauGjcM9VNJKyj9qnI8eF45Zg2NBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T22:06:40.828852Z","bundle_sha256":"05b861f4543f6ffaa0d84e1e7bc12e9c29cc4a35dc883ee3681aa1fb6a8352bf"}}