{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TXMP2HP4DQMEKLSEV52S7BVUAO","short_pith_number":"pith:TXMP2HP4","schema_version":"1.0","canonical_sha256":"9dd8fd1dfc1c18452e44af752f86b403801df9b72dd08983ecf3bdf6c0ffa8fe","source":{"kind":"arxiv","id":"2306.16371","version":4},"attestation_state":"computed","paper":{"title":"Information-Theoretic Upper Bounds for Deterministic Noise in Zeroth-Order Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Dmitry Pasechnyuk-Vilensky, Igor Pavlov, Martin Tak\\'a\\v{c}","submitted_at":"2023-06-28T17:06:52Z","abstract_excerpt":"We study deterministic adversarial noise in zeroth-order convex optimization on Euclidean balls. The maximum admissible level of noise is the largest uniform error in function-value queries for which polynomial-query optimization remains possible. We convert the Risteski-Li information-theoretic obstruction for approximately convex optimization into deterministic noisy-oracle upper bounds on this quantity.\n  The conversion gives the Lipschitz convex MALN upper bound with the Risteski-Li dimension dependence. A localized conic-collar embedding gives the corresponding Lipschitz strongly convex b"},"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":"2306.16371","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-06-28T17:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"c99c9f4536945d16c68fc25a9442c95769890ef875679170c76513ae045ea381","abstract_canon_sha256":"d4e36f0e3ab683831f58c7cf263e5f3f7f9474f6c50a9c3348ddd0f08d541c98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:02.770143Z","signature_b64":"vn11p/FeSloJN+0vZf2tIBZiYo617F8ueSAIXbZx0aMVbJ075gA6pwcpAP7JoITvQRGgj7siaWhkMSwG/sN7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd8fd1dfc1c18452e44af752f86b403801df9b72dd08983ecf3bdf6c0ffa8fe","last_reissued_at":"2026-06-09T01:05:02.769652Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:02.769652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-Theoretic Upper Bounds for Deterministic Noise in Zeroth-Order Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Dmitry Pasechnyuk-Vilensky, Igor Pavlov, Martin Tak\\'a\\v{c}","submitted_at":"2023-06-28T17:06:52Z","abstract_excerpt":"We study deterministic adversarial noise in zeroth-order convex optimization on Euclidean balls. The maximum admissible level of noise is the largest uniform error in function-value queries for which polynomial-query optimization remains possible. We convert the Risteski-Li information-theoretic obstruction for approximately convex optimization into deterministic noisy-oracle upper bounds on this quantity.\n  The conversion gives the Lipschitz convex MALN upper bound with the Risteski-Li dimension dependence. A localized conic-collar embedding gives the corresponding Lipschitz strongly convex b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16371","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/2306.16371/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":"2306.16371","created_at":"2026-06-09T01:05:02.769706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.16371v4","created_at":"2026-06-09T01:05:02.769706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16371","created_at":"2026-06-09T01:05:02.769706+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXMP2HP4DQME","created_at":"2026-06-09T01:05:02.769706+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXMP2HP4DQMEKLSE","created_at":"2026-06-09T01:05:02.769706+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXMP2HP4","created_at":"2026-06-09T01:05:02.769706+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/TXMP2HP4DQMEKLSEV52S7BVUAO","json":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO.json","graph_json":"https://pith.science/api/pith-number/TXMP2HP4DQMEKLSEV52S7BVUAO/graph.json","events_json":"https://pith.science/api/pith-number/TXMP2HP4DQMEKLSEV52S7BVUAO/events.json","paper":"https://pith.science/paper/TXMP2HP4"},"agent_actions":{"view_html":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO","download_json":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO.json","view_paper":"https://pith.science/paper/TXMP2HP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.16371&json=true","fetch_graph":"https://pith.science/api/pith-number/TXMP2HP4DQMEKLSEV52S7BVUAO/graph.json","fetch_events":"https://pith.science/api/pith-number/TXMP2HP4DQMEKLSEV52S7BVUAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO/action/storage_attestation","attest_author":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO/action/author_attestation","sign_citation":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO/action/citation_signature","submit_replication":"https://pith.science/pith/TXMP2HP4DQMEKLSEV52S7BVUAO/action/replication_record"}},"created_at":"2026-06-09T01:05:02.769706+00:00","updated_at":"2026-06-09T01:05:02.769706+00:00"}