{"as_of":"2026-08-21T21:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aed8a703f6060b478dfb3e5c661b3aa97052ff964c6fa56c0c5e26bca1e0b689","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T05:51:03.303818Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:34:49.437332Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T14:34:51.092380Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.13335","snapshot_observed_at":"2026-07-30T18:53:53.991493Z","title":"Kerger,Closing the oracle-complexity gap in derivative-free convex optimization: A near- quadratic lower bound from exact function values, arXiv preprint arXiv:2607.13335, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26863","last_updated":"2026-07-29T12:46:20Z","snapshot_observed_at":"2026-08-07T11:49:56.595157Z","submitted_at":"2026-07-29T12:46:20Z","title":"Convergence rates for pivoted QR and LU","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T18:53:53.991493Z"},"links":{"cited_paper":"/paper/2607.13335","citing_paper":"/paper/2607.26863"},"observation_digest":"sha256:87aa0938ba10e6d94b598135a51ef1eaa93dfa55771ede925eb8ed24125a9bea","observation_id":"bd27a7d2-b8ab-480e-bd14-49c17872d202","resolution":{"observed_at":"2026-07-30T18:53:53.991493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"cited_work":{"arxiv_id":"2607.13335","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.13335","snapshot_observed_at":"2026-08-15T14:34:51.092380Z","title":"Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values","venue":"math.OC","work_id":"d5095e99-f83a-4da8-8c3c-7d094a4fee71","year":2026},"citing_paper":{"arxiv_id":"2608.07407","last_updated":"2026-08-07T16:54:17Z","snapshot_observed_at":"2026-08-18T05:15:24.844029Z","submitted_at":"2026-08-07T16:54:17Z","title":"A Domain-Specific Harness for End-to-End Automation of Optimization Research","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T14:34:49.437332Z"},"links":{"cited_paper":"/paper/2607.13335","citing_paper":"/paper/2608.07407"},"observation_digest":"sha256:7a74674274a0107602af020079902eca3d230592ee9e603ad16277229519ca7f","observation_id":"e6629fcd-a09e-4e7e-a90b-285f80d02cf5","resolution":{"observed_at":"2026-08-15T14:34:51.098902Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2607.13335/citation-record","integrity":"/paper/2607.13335/integrity","json":"/paper/2607.13335/citation-record.json","paper":"/paper/2607.13335"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:00.530626Z","title":"MPS-SIAM Series on Optimization, vol","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:00.530626Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:48757e9221a0f50715374bedd53e7d4df6ab7ae95534f1ded92d57f583df0cd1","observation_id":"44856844-7b48-46ee-974a-9eea2104c71f","resolution":{"observed_at":"2026-08-02T05:51:00.530626Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:00.597445Z","title":"IEEE Transactions on Information Theory61(5), 2788–2806 (2015) https://doi.org/10","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:00.597445Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:581d40a320c36f1ee52c62a6d94bc89225358ea8dfff5ff78206df989f2b9672","observation_id":"396e76ac-fed3-4841-8cd8-376a6154265d","resolution":{"observed_at":"2026-08-02T05:51:00.597445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:00.749028Z","title":"In: Proceedings of the 26th Annual Conference on Learning Theory","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:00.749028Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:ed36f37fd63b2f319235525d16023ba95a00437ad54817bb986a87e263547e51","observation_id":"29218309-2ec4-4202-963a-b108de1c3b20","resolution":{"observed_at":"2026-08-02T05:51:00.749028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:00.891869Z","title":"Journal of Machine Learning Research18(52), 1–11 (2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:00.891869Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:f2575f002108aa4c1ff6c32760f2ddafd0d853bc847316235d57fa84d62f9f60","observation_id":"46f7bcb8-91b2-4bef-8995-962db60b050d","resolution":{"observed_at":"2026-08-02T05:51:00.891869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:01.008500Z","title":"John Wiley & Sons, New York (1983)","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:01.008500Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:4ce547f7df0d1dab027935ab2c81523406f4ed9f38e01c693d98fca810934baa","observation_id":"3e110a70-c14c-476f-a07b-ccd069db9c7f","resolution":{"observed_at":"2026-08-02T05:51:01.008500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:01.096795Z","title":"Foundations and Trends in Machine Learning8(3–4), 231–357 (2015) https://doi.org/10.1561/ 2200000050","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:01.096795Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:868ca7c4ca71ecb50647fd69ff4346d5e24b27bd87519a083523fcf285763441","observation_id":"69372cb5-00b5-4feb-a100-5610f0d51cfc","resolution":{"observed_at":"2026-08-02T05:51:01.096795Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:01.272489Z","title":"In: Advances in Neural Information Processing Systems, vol","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:01.272489Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:4805d9cb1988340364d44ded8a3b0642a2027ef57ca5e465eb92dadf4b29c685","observation_id":"37536872-2509-4ba0-b117-ac76a93dc1c4","resolution":{"observed_at":"2026-08-02T05:51:01.272489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:01.481244Z","title":"In: Proceedings of the Thirty-Second Confer- ence on Learning Theory","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:01.481244Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:3b42e498b8c062e512cbe92323cd7b9a429c79e96fe52c8e5f9b2f90c8451348","observation_id":"d8ca3d8b-c4c8-493c-8e5f-7ca864ac4cf1","resolution":{"observed_at":"2026-08-02T05:51:01.481244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3689208","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of the ACM71(6), 41–14137 (2024) https: //doi.org/10.1145/3689208","venue":"Journal of the ACM","work_id":"d67d33b8-0da8-4326-b4a6-7d2ae890a868","year":2024},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:01.610924Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:bac63a0cf14fe3c27e4609b68f4b367da8f8c74f9d3b6ba31e218dc3e646b924","observation_id":"d22b3777-bf8a-4c92-9456-8b52243800e3","resolution":{"observed_at":"2026-08-02T05:54:11.487489Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:01.782994Z","title":"Mathematics of Operations Research50(4), 2941–2971 (2024) https://doi.org/ 10.1287/moor.2023.0208","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:01.782994Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:5545304eabefb686c67744aee0dee8c8bca8718e828bdbbe2e33ca65dcd98592","observation_id":"ff11f19a-671d-4672-a40b-e5c7c3da3ce3","resolution":{"observed_at":"2026-08-02T05:51:01.782994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02312467","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathematical Notes59(1), 69–74 (1996) https: //doi.org/10.1007/BF02312467","venue":"Mathematical Notes","work_id":"a5b53da1-59b3-4734-85f3-da2f3ac5a655","year":1996},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:01.956656Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:9dde39af5f42c85b43bbd840be5527fd7013407984ee20c344208e44efd09e02","observation_id":"9b364d1a-51d8-4b20-8a0b-ef1287ced982","resolution":{"observed_at":"2026-08-02T05:54:11.161780Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-017-1137-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathematical Programming 169(2), 337–375 (2018) https://doi.org/10.1007/s10107-017-1137-4","venue":"Mathematical Programming","work_id":"a843478d-b86b-418f-b515-4eefbcbf6890","year":2018},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:02.114810Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:200bdb90336c165e067e4ab4b34eacb592f14eca47a83378405479adbd74959a","observation_id":"41f9d24b-8738-4c98-9f2b-cab4e658192a","resolution":{"observed_at":"2026-08-02T05:54:10.834724Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-023-01999-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathematical Pro- gramming207(1–2), 55–106 (2024) https://doi.org/10.1007/s10107-023-01999-5","venue":"Mathematical Programming","work_id":"1b7bb942-784a-4434-ac65-a45ee500ecdf","year":2024},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:02.257520Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:0977282d4b00dcd852961e621d4d9fb0da248233980b04a6570dcf06417677e1","observation_id":"8f599a43-07d7-4c20-a3b9-464ad87fea65","resolution":{"observed_at":"2026-08-02T05:54:10.400944Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"cited_work":{"arxiv_id":"2511.02082","doi":"10.48550/arxiv.2511.02082","metadata_source":"pith","pith_arxiv_id":"2511.02082","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","venue":"math.OC","work_id":"66bfff0b-ea8a-4de4-a7c8-8fe535ccbde8","year":2025},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:02.422512Z"},"links":{"cited_paper":"/paper/2511.02082","citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:8388e50e407a46ce1d0f6acec9ae972dc238847f0743f4dc8c1fd95e1df68b31","observation_id":"23565f54-ecbc-444e-878a-09fc742b387c","resolution":{"observed_at":"2026-08-02T05:54:09.970584Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-024-02099-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathematical Programming210(1), 3–45 (2025) https://doi.org/10.1007/s10107-024-02099-8","venue":"Mathematical Programming","work_id":"80e43239-9686-4f3f-8d18-0a254f47a8b5","year":2025},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:02.644648Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:282257b950ce0bf6390fc81e365287dc8d50b7e129e103ef470488a9e2f15caf","observation_id":"d8ca6e1c-14f5-49dd-a0ba-84c8abf3246b","resolution":{"observed_at":"2026-08-02T05:54:09.692403Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:02.819122Z","title":"OpenAI-hosted manuscript (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:02.819122Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:e63e0ee9c6ed92af52b4db49ee2b0a03dfe8e8aeaa43fdcf7f80dc0f2963bfd0","observation_id":"ffd6718e-cded-4467-b519-c789d2928f37","resolution":{"observed_at":"2026-08-02T05:51:02.819122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:02.977630Z","title":"A Proof of the Cycle Double Cover Conjecture","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:02.977630Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:066c57461c8e9f8dffe2ff60fbcc222539035f14354671d56fa937729ebfd3c9","observation_id":"148f6a7e-3fb5-47be-a2e1-407cbfd1945e","resolution":{"observed_at":"2026-08-02T05:51:02.977630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:03.136867Z","title":"Revised 19 January 2026 (2025)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:03.136867Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:5ca922ce5fbac0e9b3ebc050e411dc3aac1de14d163e55924affd290fe5de2fc","observation_id":"32f05929-9ca6-4ed1-9a2a-da497841070e","resolution":{"observed_at":"2026-08-02T05:51:03.136867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:51:03.303818Z","title":"nonsmooth convex optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:03.303818Z"},"links":{"citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:15e573844cd29fc8afdc1607b9f7504fcc44f5142967dd6b2c134161384ae6f9","observation_id":"b6c2b5e2-ad2e-4029-bc5c-a467d9a5e749","resolution":{"observed_at":"2026-08-02T05:51:03.303818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","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"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":19},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"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."}