{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3RVGH667GS4ZL3GLD7T6UILZCP","short_pith_number":"pith:3RVGH667","canonical_record":{"source":{"id":"1911.06317","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-14T18:58:13Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"203816e470e0baf02770b32be249604e9e75d707a75820208abc9e81a3172d6b","abstract_canon_sha256":"04c74affd3f49043a15eba6b13f3fe4e07d071495848a06d70682d2ea2a218a6"},"schema_version":"1.0"},"canonical_sha256":"dc6a63fbdf34b995eccb1fe7ea217913ef37e05e6b5f2f53842e8c1635ac33ac","source":{"kind":"arxiv","id":"1911.06317","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06317","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06317v4","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06317","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"3RVGH667GS4Z","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"3RVGH667GS4ZL3GL","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"3RVGH667","created_at":"2026-07-05T01:03:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3RVGH667GS4ZL3GLD7T6UILZCP","target":"record","payload":{"canonical_record":{"source":{"id":"1911.06317","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-14T18:58:13Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"203816e470e0baf02770b32be249604e9e75d707a75820208abc9e81a3172d6b","abstract_canon_sha256":"04c74affd3f49043a15eba6b13f3fe4e07d071495848a06d70682d2ea2a218a6"},"schema_version":"1.0"},"canonical_sha256":"dc6a63fbdf34b995eccb1fe7ea217913ef37e05e6b5f2f53842e8c1635ac33ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:41.592180Z","signature_b64":"VdT+k/3mFIFiQ/kwZ54cmYv3g0x+YDyP4NNa46XYfTJCVvfbbi1y8w/oV3NoAR9ysG5j7rMeyGV4McfFF9ZVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc6a63fbdf34b995eccb1fe7ea217913ef37e05e6b5f2f53842e8c1635ac33ac","last_reissued_at":"2026-07-05T01:03:41.591683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:41.591683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.06317","source_version":4,"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-07-05T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cg2Oeqs1hw2p3B3T9fMtCB8OIlE67Ve5GLxEtP5F+VfaO46PtZrEzNBtuPxLRwFxnCOuY/YBHdutWyTQyGhNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:37:20.784650Z"},"content_sha256":"b8c4e328e5d9e5b70c21d16b9d70fac7e65aa430a76d3e7d9f63c7b44546f5ca","schema_version":"1.0","event_id":"sha256:b8c4e328e5d9e5b70c21d16b9d70fac7e65aa430a76d3e7d9f63c7b44546f5ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3RVGH667GS4ZL3GLD7T6UILZCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradientless Descent: High-Dimensional Zeroth-Order Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chansoo Lee, Daniel Golovin, Greg Kochanski, John Karro, Qiuyi Zhang, Xingyou Song","submitted_at":"2019-11-14T18:58:13Z","abstract_excerpt":"Zeroth-order optimization is the process of minimizing an objective $f(x)$, given oracle access to evaluations at adaptively chosen inputs $x$. In this paper, we present two simple yet powerful GradientLess Descent (GLD) algorithms that do not rely on an underlying gradient estimate and are numerically stable. We analyze our algorithm from a novel geometric perspective and present a novel analysis that shows convergence within an $\\epsilon$-ball of the optimum in $O(kQ\\log(n)\\log(R/\\epsilon))$ evaluations, for any monotone transform of a smooth and strongly convex objective with latent dimensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06317","kind":"arxiv","version":4},"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/1911.06317/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"},"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-07-05T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLHCyLNIP1QC/qsb3Ezc0TZstnZgRfgVTcZMFC+iTrqBdAIJ9zgVWA0OBLboN78OjgGVc+idTRkg4dik0eThDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:37:20.785050Z"},"content_sha256":"ff8361044aff858bac5176b2744aa5bc638849704ab7295b405bec9c0ea14bec","schema_version":"1.0","event_id":"sha256:ff8361044aff858bac5176b2744aa5bc638849704ab7295b405bec9c0ea14bec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RVGH667GS4ZL3GLD7T6UILZCP/bundle.json","state_url":"https://pith.science/pith/3RVGH667GS4ZL3GLD7T6UILZCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RVGH667GS4ZL3GLD7T6UILZCP/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-07T09:37:20Z","links":{"resolver":"https://pith.science/pith/3RVGH667GS4ZL3GLD7T6UILZCP","bundle":"https://pith.science/pith/3RVGH667GS4ZL3GLD7T6UILZCP/bundle.json","state":"https://pith.science/pith/3RVGH667GS4ZL3GLD7T6UILZCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RVGH667GS4ZL3GLD7T6UILZCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3RVGH667GS4ZL3GLD7T6UILZCP","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":"04c74affd3f49043a15eba6b13f3fe4e07d071495848a06d70682d2ea2a218a6","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-14T18:58:13Z","title_canon_sha256":"203816e470e0baf02770b32be249604e9e75d707a75820208abc9e81a3172d6b"},"schema_version":"1.0","source":{"id":"1911.06317","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06317","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06317v4","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06317","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"3RVGH667GS4Z","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"3RVGH667GS4ZL3GL","created_at":"2026-07-05T01:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"3RVGH667","created_at":"2026-07-05T01:03:41Z"}],"graph_snapshots":[{"event_id":"sha256:ff8361044aff858bac5176b2744aa5bc638849704ab7295b405bec9c0ea14bec","target":"graph","created_at":"2026-07-05T01:03:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.06317/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Zeroth-order optimization is the process of minimizing an objective $f(x)$, given oracle access to evaluations at adaptively chosen inputs $x$. In this paper, we present two simple yet powerful GradientLess Descent (GLD) algorithms that do not rely on an underlying gradient estimate and are numerically stable. We analyze our algorithm from a novel geometric perspective and present a novel analysis that shows convergence within an $\\epsilon$-ball of the optimum in $O(kQ\\log(n)\\log(R/\\epsilon))$ evaluations, for any monotone transform of a smooth and strongly convex objective with latent dimensi","authors_text":"Chansoo Lee, Daniel Golovin, Greg Kochanski, John Karro, Qiuyi Zhang, Xingyou Song","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-14T18:58:13Z","title":"Gradientless Descent: High-Dimensional Zeroth-Order Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06317","kind":"arxiv","version":4},"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:b8c4e328e5d9e5b70c21d16b9d70fac7e65aa430a76d3e7d9f63c7b44546f5ca","target":"record","created_at":"2026-07-05T01:03:41Z","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":"04c74affd3f49043a15eba6b13f3fe4e07d071495848a06d70682d2ea2a218a6","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-14T18:58:13Z","title_canon_sha256":"203816e470e0baf02770b32be249604e9e75d707a75820208abc9e81a3172d6b"},"schema_version":"1.0","source":{"id":"1911.06317","kind":"arxiv","version":4}},"canonical_sha256":"dc6a63fbdf34b995eccb1fe7ea217913ef37e05e6b5f2f53842e8c1635ac33ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc6a63fbdf34b995eccb1fe7ea217913ef37e05e6b5f2f53842e8c1635ac33ac","first_computed_at":"2026-07-05T01:03:41.591683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:03:41.591683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VdT+k/3mFIFiQ/kwZ54cmYv3g0x+YDyP4NNa46XYfTJCVvfbbi1y8w/oV3NoAR9ysG5j7rMeyGV4McfFF9ZVBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:03:41.592180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.06317","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8c4e328e5d9e5b70c21d16b9d70fac7e65aa430a76d3e7d9f63c7b44546f5ca","sha256:ff8361044aff858bac5176b2744aa5bc638849704ab7295b405bec9c0ea14bec"],"state_sha256":"49c9501d98491cefaa80647cb136ed15e99a47c478d22211c7c04516d4ebc862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7qujQ15d3I2T4uV+EcWPWLnhkyPLSn5QoKreC5yFA2QImUsVRpiN6zX5w+zkR1hi6A5R5S2paF8nfXNt8WvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:37:20.787033Z","bundle_sha256":"7a5b9274757903b3a1ff65cc42977c1c7a3f3ca15059fab69b4a25abe08848ba"}}