{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ARGMFHHCBBBVOPU6MEVFZ5FIE6","short_pith_number":"pith:ARGMFHHC","canonical_record":{"source":{"id":"2607.13335","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-14T23:45:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"94316ebb390d4fc00af34899582909181c45a7ca17a7136be4b63e26803dffc9","abstract_canon_sha256":"3b180fa3b9e83ad58a320a042eb487ba52de66d094307b20575422d129662d97"},"schema_version":"1.0"},"canonical_sha256":"044cc29ce20843573e9e612a5cf4a827b084e340a5e39e4c3d648ce0682cf332","source":{"kind":"arxiv","id":"2607.13335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13335","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13335v1","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13335","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"ARGMFHHCBBBV","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"pith_short_16","alias_value":"ARGMFHHCBBBVOPU6","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"pith_short_8","alias_value":"ARGMFHHC","created_at":"2026-07-16T00:22:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ARGMFHHCBBBVOPU6MEVFZ5FIE6","target":"record","payload":{"canonical_record":{"source":{"id":"2607.13335","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-14T23:45:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"94316ebb390d4fc00af34899582909181c45a7ca17a7136be4b63e26803dffc9","abstract_canon_sha256":"3b180fa3b9e83ad58a320a042eb487ba52de66d094307b20575422d129662d97"},"schema_version":"1.0"},"canonical_sha256":"044cc29ce20843573e9e612a5cf4a827b084e340a5e39e4c3d648ce0682cf332","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:22:12.912353Z","signature_b64":"ZgukNaYY553exHHpLyJPms1NG/i4MZre2I8cZgsF/FdPK//6/tTWb0iN2xJ/WrgAQLKT9tMqGM2Qww33Ek5kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"044cc29ce20843573e9e612a5cf4a827b084e340a5e39e4c3d648ce0682cf332","last_reissued_at":"2026-07-16T00:22:12.911489Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:22:12.911489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.13335","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-07-16T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76iHCcV4ZBnFR6zBR1tb5CQ6oSNWN4aZLLGOjODbGuAcRp0axtMWmMU4qeCftyMNkn8IBIDunBiUk3mhdi5zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T19:15:02.995467Z"},"content_sha256":"04517c933587cd1622cf50a4c6007abecae770969c62f8286434603e5d279af0","schema_version":"1.0","event_id":"sha256:04517c933587cd1622cf50a4c6007abecae770969c62f8286434603e5d279af0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ARGMFHHCBBBVOPU6MEVFZ5FIE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Phillip Kerger","submitted_at":"2026-07-14T23:45:21Z","abstract_excerpt":"We study the deterministic query complexity of minimizing a convex Lipschitz function over a $d$-dimensional Euclidean ball using only exact function values. At accuracy $\\Theta(d^{-1/2})$, the previously applicable lower bound was $\\Omega(d)$, inherited from the stronger full first-order oracle, while an upper bound from Protasov's value-only method requires $O(d^2\\log^2 d)$ evaluations. By providing a lower bound of $\\Omega(\\,\\frac{d^2}{\\log(d+1)})$ on the oracle complexity in this setting, we thereby close this gap dating back to 1996, up to polylogarithmic factors. Furthermore, we are able"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13335","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/2607.13335/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-16T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqOQw9hw04JAU58rlKvkuGPfCmWgk6OPTIcPZFYs3Z+FcNKmsW++1iz5jIFvoNG2z7DhB6f3MjdUw3W/0F0CCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T19:15:02.995809Z"},"content_sha256":"bf64513c93560ac89ef6bf0fb7efd836718a32e020aa0812d232ac5652711fe0","schema_version":"1.0","event_id":"sha256:bf64513c93560ac89ef6bf0fb7efd836718a32e020aa0812d232ac5652711fe0"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ARGMFHHCBBBVOPU6MEVFZ5FIE6","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1137/1.9780898718768 resolves to 'Introduction to Derivative-Free Optimization'. A reader following the printed text alone cannot reach it.","snippet":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization, vol. 8. Society for Indus- trial and Applied Mathematics, Philadelphia (2009). https://doi.org/10.1137/1. 978089871876","arxiv_id":"2607.13335","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":"Introduction to Derivative-Free Optimization","printed_excerpt":"10.1137/1","reconstructed_doi":"10.1137/1.9780898718768"},"severity":"advisory","ref_index":1,"audited_at":"2026-08-02T05:59:14.174870Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9780898718768","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"537c97249853b7bbfef5f45fe8fb03dcf9f56cb532f2ea4cd0d2ce5559983898","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Introduction to Derivative-Free Optimization","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17298,"payload_sha256":"e8663116b15d4c394c2e43684ef6f28ce4e47cbf0513e428ac0c563180963576","signature_b64":"KYnEByyTE5rJFRhOAc+xBWGss3gsdGf2EpORUZuR5sanejSQBcCrKaBAiVFY6fWyDb1OQBBw6/U7FFyxX66iDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-02T06:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2P9QQ2nynK3KocaDxZS+XzvxhYn/mqcn6FssRIyCNKVYlzL4hyVMoCYyUKshhi1sB+9zTKfHDbxbhxkGCIYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T19:15:02.998131Z"},"content_sha256":"90882e92c465f26158e0462994562b3b7159ac79afea0162a78ccf3c75fa1948","schema_version":"1.0","event_id":"sha256:90882e92c465f26158e0462994562b3b7159ac79afea0162a78ccf3c75fa1948"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARGMFHHCBBBVOPU6MEVFZ5FIE6/bundle.json","state_url":"https://pith.science/pith/ARGMFHHCBBBVOPU6MEVFZ5FIE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARGMFHHCBBBVOPU6MEVFZ5FIE6/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-08-21T19:15:02Z","links":{"resolver":"https://pith.science/pith/ARGMFHHCBBBVOPU6MEVFZ5FIE6","bundle":"https://pith.science/pith/ARGMFHHCBBBVOPU6MEVFZ5FIE6/bundle.json","state":"https://pith.science/pith/ARGMFHHCBBBVOPU6MEVFZ5FIE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARGMFHHCBBBVOPU6MEVFZ5FIE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ARGMFHHCBBBVOPU6MEVFZ5FIE6","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b180fa3b9e83ad58a320a042eb487ba52de66d094307b20575422d129662d97","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-14T23:45:21Z","title_canon_sha256":"94316ebb390d4fc00af34899582909181c45a7ca17a7136be4b63e26803dffc9"},"schema_version":"1.0","source":{"id":"2607.13335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13335","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13335v1","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13335","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"ARGMFHHCBBBV","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"pith_short_16","alias_value":"ARGMFHHCBBBVOPU6","created_at":"2026-07-16T00:22:12Z"},{"alias_kind":"pith_short_8","alias_value":"ARGMFHHC","created_at":"2026-07-16T00:22:12Z"}],"graph_snapshots":[{"event_id":"sha256:bf64513c93560ac89ef6bf0fb7efd836718a32e020aa0812d232ac5652711fe0","target":"graph","created_at":"2026-07-16T00:22:12Z","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/2607.13335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the deterministic query complexity of minimizing a convex Lipschitz function over a $d$-dimensional Euclidean ball using only exact function values. At accuracy $\\Theta(d^{-1/2})$, the previously applicable lower bound was $\\Omega(d)$, inherited from the stronger full first-order oracle, while an upper bound from Protasov's value-only method requires $O(d^2\\log^2 d)$ evaluations. By providing a lower bound of $\\Omega(\\,\\frac{d^2}{\\log(d+1)})$ on the oracle complexity in this setting, we thereby close this gap dating back to 1996, up to polylogarithmic factors. Furthermore, we are able","authors_text":"Phillip Kerger","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-14T23:45:21Z","title":"Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13335","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:04517c933587cd1622cf50a4c6007abecae770969c62f8286434603e5d279af0","target":"record","created_at":"2026-07-16T00:22:12Z","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":"3b180fa3b9e83ad58a320a042eb487ba52de66d094307b20575422d129662d97","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-14T23:45:21Z","title_canon_sha256":"94316ebb390d4fc00af34899582909181c45a7ca17a7136be4b63e26803dffc9"},"schema_version":"1.0","source":{"id":"2607.13335","kind":"arxiv","version":1}},"canonical_sha256":"044cc29ce20843573e9e612a5cf4a827b084e340a5e39e4c3d648ce0682cf332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"044cc29ce20843573e9e612a5cf4a827b084e340a5e39e4c3d648ce0682cf332","first_computed_at":"2026-07-16T00:22:12.911489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-16T00:22:12.911489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZgukNaYY553exHHpLyJPms1NG/i4MZre2I8cZgsF/FdPK//6/tTWb0iN2xJ/WrgAQLKT9tMqGM2Qww33Ek5kDw==","signature_status":"signed_v1","signed_at":"2026-07-16T00:22:12.912353Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.13335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04517c933587cd1622cf50a4c6007abecae770969c62f8286434603e5d279af0","sha256:bf64513c93560ac89ef6bf0fb7efd836718a32e020aa0812d232ac5652711fe0","sha256:90882e92c465f26158e0462994562b3b7159ac79afea0162a78ccf3c75fa1948"],"state_sha256":"7c4626b9ef464797e6b4cb647dcc76eba93c989bbc89111ca34df32fb19881c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kN4TiaEnReYqoesCWFMNJ/Nd76FM6yY3vUDdbCOUtthX9f1H6HgXq8w2ECL6zCgOwEXWuM2MX03Vh39sJoM1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T19:15:02.999582Z","bundle_sha256":"1d01c17fa0e9b0996c65963cc7b62597d302f2b4b17d6b012e2ced3abb65559b"}}