{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6Z5DC6Y6XTOSXJUP2S33MIDWNW","short_pith_number":"pith:6Z5DC6Y6","schema_version":"1.0","canonical_sha256":"f67a317b1ebcdd2ba68fd4b7b620766d9fa5c23436ee48dfe2eecfc48bcadeae","source":{"kind":"arxiv","id":"2605.31346","version":1},"attestation_state":"computed","paper":{"title":"Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexandra Suvorikova, Anastasia Antsiferova, Artem Vasin, Darina Dvinskikh, Georgii Bychkov, Igor Pavlov","submitted_at":"2026-05-29T14:24:54Z","abstract_excerpt":"Zeroth-order (black-box) optimization is applied when gradients are unavailable and objective evaluations rely on expensive simulations. In many such applications, the oracle fidelity is tunable: higher-accuracy queries reduce noise but incur higher computational costs. To capture this trade-off, we study an accuracy-aware wall-clock model where each query with fidelity $\\delta$ has a cost $c(\\delta)$, and we minimize the total time $T_{\\mathrm{total}} = \\sum_{k=1}^{N} c(\\delta_k)$, subject to a target accuracy constraint. We show how the choice of oracle type, noise model, and optimization sc"},"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":"2605.31346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-29T14:24:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"39e6e9f28f9a46c5f573708118bdc0d36a36f02334c4fe5f61593eaaf87cd6c7","abstract_canon_sha256":"aa9a1f8e1048cf986fcd8983e81c420546966b03e29c4bacd2c05d93e03bbce4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:04:00.010203Z","signature_b64":"t3kr9ecF8e/GS8vN2Xf/5J/XmgIoNT4t0bc3lHwjuNFMfvZlExdWdZ/ACU7clf+I8uxJgqCYXFr5wxh+x1ZgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67a317b1ebcdd2ba68fd4b7b620766d9fa5c23436ee48dfe2eecfc48bcadeae","last_reissued_at":"2026-06-01T02:04:00.009192Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:04:00.009192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexandra Suvorikova, Anastasia Antsiferova, Artem Vasin, Darina Dvinskikh, Georgii Bychkov, Igor Pavlov","submitted_at":"2026-05-29T14:24:54Z","abstract_excerpt":"Zeroth-order (black-box) optimization is applied when gradients are unavailable and objective evaluations rely on expensive simulations. In many such applications, the oracle fidelity is tunable: higher-accuracy queries reduce noise but incur higher computational costs. To capture this trade-off, we study an accuracy-aware wall-clock model where each query with fidelity $\\delta$ has a cost $c(\\delta)$, and we minimize the total time $T_{\\mathrm{total}} = \\sum_{k=1}^{N} c(\\delta_k)$, subject to a target accuracy constraint. We show how the choice of oracle type, noise model, and optimization sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31346","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/2605.31346/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":"2605.31346","created_at":"2026-06-01T02:04:00.009370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.31346v1","created_at":"2026-06-01T02:04:00.009370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31346","created_at":"2026-06-01T02:04:00.009370+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Z5DC6Y6XTOS","created_at":"2026-06-01T02:04:00.009370+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Z5DC6Y6XTOSXJUP","created_at":"2026-06-01T02:04:00.009370+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Z5DC6Y6","created_at":"2026-06-01T02:04:00.009370+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/6Z5DC6Y6XTOSXJUP2S33MIDWNW","json":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW.json","graph_json":"https://pith.science/api/pith-number/6Z5DC6Y6XTOSXJUP2S33MIDWNW/graph.json","events_json":"https://pith.science/api/pith-number/6Z5DC6Y6XTOSXJUP2S33MIDWNW/events.json","paper":"https://pith.science/paper/6Z5DC6Y6"},"agent_actions":{"view_html":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW","download_json":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW.json","view_paper":"https://pith.science/paper/6Z5DC6Y6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.31346&json=true","fetch_graph":"https://pith.science/api/pith-number/6Z5DC6Y6XTOSXJUP2S33MIDWNW/graph.json","fetch_events":"https://pith.science/api/pith-number/6Z5DC6Y6XTOSXJUP2S33MIDWNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW/action/storage_attestation","attest_author":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW/action/author_attestation","sign_citation":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW/action/citation_signature","submit_replication":"https://pith.science/pith/6Z5DC6Y6XTOSXJUP2S33MIDWNW/action/replication_record"}},"created_at":"2026-06-01T02:04:00.009370+00:00","updated_at":"2026-06-01T02:04:00.009370+00:00"}