Paper Citation Record · LEDGER

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values

As of 21 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 2 inbound Pith citation observations for arXiv:2607.13335.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.13335 v1

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T05:51:03.303818Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T14:34:49.437332Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-15T14:34:51.092380Z

Reference resolution

19 of 19 outbound references displayed

verified exact6
verified fuzzy0
unresolved11
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 44856844-7b48-46ee-974a-9eea2104c71f · outbound

This paper cites MPS-SIAM Series on Optimization, vol.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values MPS-SIAM Series on Optimization, vol

Reference 1

Resolution: malformed identifier; no resolver link, observed 2026-08-02T05:51:00.530626Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 396e76ac-fed3-4841-8cd8-376a6154265d · outbound

This paper cites IEEE Transactions on Information Theory61(5), 2788–2806 (2015) https://doi.org/10.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values IEEE Transactions on Information Theory61(5), 2788–2806 (2015) https://doi.org/10

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:00.597445Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29218309-2ec4-4202-963a-b108de1c3b20 · outbound

This paper cites In: Proceedings of the 26th Annual Conference on Learning Theory.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values In: Proceedings of the 26th Annual Conference on Learning Theory

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:00.749028Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46f7bcb8-91b2-4bef-8995-962db60b050d · outbound

This paper cites Journal of Machine Learning Research18(52), 1–11 (2017).

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Journal of Machine Learning Research18(52), 1–11 (2017)

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:00.891869Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e110a70-c14c-476f-a07b-ccd069db9c7f · outbound

This paper cites John Wiley & Sons, New York (1983).

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values John Wiley & Sons, New York (1983)

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:01.008500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69372cb5-00b5-4feb-a100-5610f0d51cfc · outbound

This paper cites Foundations and Trends in Machine Learning8(3–4), 231–357 (2015) https://doi.org/10.1561/ 2200000050.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Foundations and Trends in Machine Learning8(3–4), 231–357 (2015) https://doi.org/10.1561/ 2200000050

Reference 6

Resolution: malformed identifier; no resolver link, observed 2026-08-02T05:51:01.096795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37536872-2509-4ba0-b117-ac76a93dc1c4 · outbound

This paper cites In: Advances in Neural Information Processing Systems, vol.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values In: Advances in Neural Information Processing Systems, vol

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:01.272489Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8ca3d8b-c4c8-493c-8e5f-7ca864ac4cf1 · outbound

This paper cites In: Proceedings of the Thirty-Second Confer- ence on Learning Theory.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values In: Proceedings of the Thirty-Second Confer- ence on Learning Theory

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:01.481244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d22b3777-bf8a-4c92-9456-8b52243800e3 · outbound

This paper cites Journal of the ACM71(6), 41–14137 (2024) https: //doi.org/10.1145/3689208.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Journal of the ACM71(6), 41–14137 (2024) https: //doi.org/10.1145/3689208

Reference 9

Resolution: verified exact; doi, observed 2026-08-02T05:54:11.487489Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ff11f19a-671d-4672-a40b-e5c7c3da3ce3 · outbound

This paper cites Mathematics of Operations Research50(4), 2941–2971 (2024) https://doi.org/ 10.1287/moor.2023.0208.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Mathematics of Operations Research50(4), 2941–2971 (2024) https://doi.org/ 10.1287/moor.2023.0208

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:01.782994Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b364d1a-51d8-4b20-8a0b-ef1287ced982 · outbound

This paper cites Mathematical Notes59(1), 69–74 (1996) https: //doi.org/10.1007/BF02312467.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Mathematical Notes59(1), 69–74 (1996) https: //doi.org/10.1007/BF02312467

Reference 11

Resolution: verified exact; doi, observed 2026-08-02T05:54:11.161780Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 41f9d24b-8738-4c98-9f2b-cab4e658192a · outbound

This paper cites Mathematical Programming 169(2), 337–375 (2018) https://doi.org/10.1007/s10107-017-1137-4.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Mathematical Programming 169(2), 337–375 (2018) https://doi.org/10.1007/s10107-017-1137-4

Reference 12

Resolution: verified exact; doi, observed 2026-08-02T05:54:10.834724Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8f599a43-07d7-4c20-a3b9-464ad87fea65 · outbound

This paper cites Mathematical Pro- gramming207(1–2), 55–106 (2024) https://doi.org/10.1007/s10107-023-01999-5.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Mathematical Pro- gramming207(1–2), 55–106 (2024) https://doi.org/10.1007/s10107-023-01999-5

Reference 13

Resolution: verified exact; doi, observed 2026-08-02T05:54:10.400944Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 23565f54-ecbc-444e-878a-09fc742b387c · outbound

This paper cites Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization

Reference 14

Resolution: verified exact; local_arxiv, observed 2026-08-02T05:54:09.970584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d8ca6e1c-14f5-49dd-a0ba-84c8abf3246b · outbound

This paper cites Mathematical Programming210(1), 3–45 (2025) https://doi.org/10.1007/s10107-024-02099-8.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Mathematical Programming210(1), 3–45 (2025) https://doi.org/10.1007/s10107-024-02099-8

Reference 15

Resolution: verified exact; doi, observed 2026-08-02T05:54:09.692403Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ffd6718e-cded-4467-b519-c789d2928f37 · outbound

This paper cites OpenAI-hosted manuscript (2026).

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values OpenAI-hosted manuscript (2026)

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:02.819122Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 148f6a7e-3fb5-47be-a2e1-407cbfd1945e · outbound

This paper cites A Proof of the Cycle Double Cover Conjecture.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values A Proof of the Cycle Double Cover Conjecture

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:02.977630Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32f05929-9ca6-4ed1-9a2a-da497841070e · outbound

This paper cites Revised 19 January 2026 (2025).

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values Revised 19 January 2026 (2025)

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:03.136867Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b6c2b5e2-ad2e-4029-bc5c-a467d9a5e749 · outbound

This paper cites nonsmooth convex optimization.

Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values nonsmooth convex optimization

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-02T05:51:03.303818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation bd27a7d2-b8ab-480e-bd14-49c17872d202 · inbound

Convergence rates for pivoted QR and LU cites this paper.

Convergence rates for pivoted QR and LU Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-30T18:53:53.991493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6629fcd-a09e-4e7e-a90b-285f80d02cf5 · inbound

A Domain-Specific Harness for End-to-End Automation of Optimization Research cites this paper.

A Domain-Specific Harness for End-to-End Automation of Optimization Research Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values

Reference 29

Resolution: verified exact; local_arxiv, observed 2026-08-15T14:34:51.098902Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.