{"as_of":"2026-08-09T20:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac00745975340f13ff752616ec3dd04aa589586663e825e6ff46e378f4d28936","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:53:52.158040Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.03246/citation-record","integrity":"/paper/2608.03246/integrity","json":"/paper/2608.03246/citation-record.json","paper":"/paper/2608.03246"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:54.912115Z","title":"Mathematics of Operations Research , volume=","venue":null,"work_id":"b88cd938-92bf-43c5-a8a9-906c3946f7bf","year":2024},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:49.658222Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:dbe9007b2563f6a898289c6f967650df1d68ed957b0c97c5873e1a9b8a1b87ab","observation_id":"2b3eac8b-be23-4a09-bcf0-ed2c7128afb3","resolution":{"observed_at":"2026-08-05T22:53:54.917042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T22:53:49.828539Z","title":"Mathematics of Operations Research , volume=","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:49.828539Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:c89ae9249cef00d859bf2fef48794e382619194a5549dbe888f8597d780d31ba","observation_id":"d8eabed1-dc92-483b-8aed-eba45f9555df","resolution":{"observed_at":"2026-08-05T22:53:49.828539Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:54.804815Z","title":"2004 , publisher=","venue":null,"work_id":"e66aa505-5ca6-4536-b382-a3555e9c4c2c","year":2004},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:49.963764Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:876cd2267b2dbd5d0033de11393228215640375b4754aae6d94060f463c330dc","observation_id":"4077c796-d3cb-43f5-a171-44f235966598","resolution":{"observed_at":"2026-08-05T22:53:54.865953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T22:53:50.072159Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.072159Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:c9aa69ace99601a023d2cb709dbe37e29565633cbdaf6bc7bcca1d7aefa09ae9","observation_id":"5a800937-bf63-4c77-b03f-e78a0f7a3bef","resolution":{"observed_at":"2026-08-05T22:53:50.072159Z","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-05T22:53:50.210533Z","title":"Proximit","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.210533Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:285610c27825aca19908aa184127182c9416f1f62736baa892709d72b755317a","observation_id":"9b52f160-9a14-47d1-a10d-336b8f2e13d6","resolution":{"observed_at":"2026-08-05T22:53:50.210533Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:54.585993Z","title":"Stochastic subgradient method converges at the rate","venue":null,"work_id":"ddccd8fc-ff15-45bf-8ac6-b21ee9973fc6","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.353330Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:0ae19a9c72a335a3d1294f4908c9ba8f2c462283341b8af926977a07c8f846bb","observation_id":"272a70e0-0cba-4896-ba7c-dc6546ee750a","resolution":{"observed_at":"2026-08-05T22:53:54.665115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T22:53:50.463825Z","title":"SIAM journal on optimization , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.463825Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:e973415ac2a338707194361fa7f84bc46ea002161ef2cffc371896c74a5d0ddf","observation_id":"734777c4-30a7-4bd1-89a5-9847209662de","resolution":{"observed_at":"2026-08-05T22:53:50.463825Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:54.416683Z","title":"ICML Workshop on Beyond First-Order Methods in ML Systems , pages=","venue":null,"work_id":"0e87518c-bde1-4ec9-ab77-4e748a098d86","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.611249Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:74db1ad48c99d6a0696a0b2667e22e42b539af016cc5cae72c4d6d376bab3f03","observation_id":"91261dc7-5f9b-462a-81e3-c565d9eb23ff","resolution":{"observed_at":"2026-08-05T22:53:54.499114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02804","last_updated":"2025-09-02T20:15:47Z","snapshot_observed_at":"2026-08-09T15:28:02.625762Z","submitted_at":"2025-09-02T20:15:47Z","title":"A Proximal Descent Method for Minimizing Weakly Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02804","snapshot_observed_at":"2026-08-05T22:53:50.751787Z","title":"arXiv preprint arXiv:2509.02804 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.751787Z"},"links":{"cited_paper":"/paper/2509.02804","citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:62f64aaab95eebc8537ed51970d98895d65c6d5bcea6e0d2f1bf1a1e029e2046","observation_id":"d3c44e7d-b0b7-4a88-ae97-5fe711cff741","resolution":{"observed_at":"2026-08-05T22:53:50.751787Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:54.275903Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":"a7f8def6-9b5f-4a60-8925-37da77269f41","year":2019},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.846147Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:f03c9ab44ee0a3a33e5c7abe54d8c1012270fd0e4cda3678f4aab201db740fec","observation_id":"44359031-1763-400d-88ba-a3667f1f4c8f","resolution":{"observed_at":"2026-08-05T22:53:54.343140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:54.161325Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":"200c12b7-2d3e-4017-b27b-cdbcee00ee39","year":2018},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:50.957864Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:7eab05ac1a6305a493e76853f13fb11e1fc96524f8d293b887bf6c4e058ea242","observation_id":"04273853-a57e-4d59-9cc2-5485c31ea0ec","resolution":{"observed_at":"2026-08-05T22:53:54.195231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T22:53:51.013805Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.013805Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:5e7c14ca9a70aaa165c7df388d0de2f2eef76bcb39b95038b64b0ee232414da8","observation_id":"59f7e8b0-f973-483e-8b94-25cb4ae14c51","resolution":{"observed_at":"2026-08-05T22:53:51.013805Z","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-05T22:53:51.034047Z","title":"2009 , publisher=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.034047Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:466c18105a958860607fe79e3000801b782098d520495d3d61c4f5e4cf16537a","observation_id":"2c9c9d5d-a2ea-4b88-b474-247cb0e01582","resolution":{"observed_at":"2026-08-05T22:53:51.034047Z","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-05T22:53:51.134905Z","title":"Journal of Complexity , volume=","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.134905Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:798c6fc21ca61934fec8a3864204edd51e9394772e787d9e7124a101eeb1e1a1","observation_id":"bdc16f76-28d1-4836-bc54-106af86c7da8","resolution":{"observed_at":"2026-08-05T22:53:51.134905Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:53.957799Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":"dc80bf5f-b298-4da8-9fec-187b29763597","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.189179Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:c7bc92b3b4db446a82afb723987894bf1e0ff113e1c375873ac95b838d517ea1","observation_id":"7f28ebdd-4076-458a-942c-1a0ad9438169","resolution":{"observed_at":"2026-08-05T22:53:54.038246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:53.769831Z","title":"and Hinder, Oliver and Sidford, Aaron , journal=","venue":null,"work_id":"1036b58f-7ef3-418f-8ab0-332b7b6d26ce","year":2020},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.288586Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:2784884fca1dc28ca06a34cf116c52a66d2cf30800b1189df63e9155cd478fee","observation_id":"47c09587-95e5-42b5-a91f-907488471073","resolution":{"observed_at":"2026-08-05T22:53:53.877613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:53.636619Z","title":"and Hinder, Oliver and Sidford, Aaron , title =","venue":null,"work_id":"4108975d-86dd-4e22-a022-5ab11e6eb7bd","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.377386Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:8f4041de5cc9622de8a925619683a6cdd625f84855955050ee56ba3bc1c37fac","observation_id":"219db54f-fd05-4f6f-9d86-a204af9e6de3","resolution":{"observed_at":"2026-08-05T22:53:53.681353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:53.437509Z","title":"SIAM Journal on Optimization , year =","venue":null,"work_id":"cade2d06-da50-493c-991f-0130bb8717c5","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.477829Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:73cc9f91951a3f19d686c9bcba3f85f68226b9c254a27d0ce722e2fb1cc13920","observation_id":"e40506f3-12db-4436-977c-b3bfa783c8e5","resolution":{"observed_at":"2026-08-05T22:53:53.532743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:53.309315Z","title":"Lower bounds for parallel and randomized convex optimization , journal =","venue":null,"work_id":"ec20f059-a1d6-4899-8c2b-51552e1bc1c4","year":2020},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.597426Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:c5779de46ee2c6a4c35b34c689a369cd20d02b9b1b43dc909069416e245718a1","observation_id":"a6568750-a6af-44ae-b2ae-c1d546ae764e","resolution":{"observed_at":"2026-08-05T22:53:53.372753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:53.061860Z","title":"Journal of Machine Learning Research , year =","venue":null,"work_id":"23af3e5c-3581-465a-ab9e-aa3518fb4fe5","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.692972Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:0a474107baa4afac0b1f0e2d0493246be1727dd5a069530794e2036c56012f4b","observation_id":"7f4aac16-0614-4971-bde8-8e72c3b8083f","resolution":{"observed_at":"2026-08-05T22:53:53.194181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:52.887455Z","title":null,"venue":null,"work_id":"75d58058-16c3-4e1f-9b06-c88f87b1c0ca","year":1983},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.786010Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:bd79ea524e84a03ae9f1851e6428ef325e1ce12a63401618d58ba9a4ee3ef5ed","observation_id":"07b1ab1f-3bd3-46f9-b110-1ac7c07c0cd8","resolution":{"observed_at":"2026-08-05T22:53:52.924827Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T22:53:51.878150Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.878150Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:5a30cbebf08ebe876b9cb6ce9506098bfc8abfc6a0aae86daa4df5c6b7645a70","observation_id":"211c4fe5-a075-4257-a264-6a23f9ba9d7f","resolution":{"observed_at":"2026-08-05T22:53:51.878150Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:52.669819Z","title":"Mathematical Programming , year =","venue":null,"work_id":"2aa1930e-b313-44eb-95bb-fa75461fc637","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:51.944149Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:873f39d2daacbe7c50ce99787a652d1bc16db0d58587854b5019f464a27c7d30","observation_id":"827fab2b-b72f-4a5b-8423-3229c6d8726d","resolution":{"observed_at":"2026-08-05T22:53:52.768790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:52.465924Z","title":"2017 , eprint =","venue":null,"work_id":"70d1c98d-4b0f-4d5d-bd7e-48366b07ba03","year":2017},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:52.065991Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:819cd076c7f324c3bcd33747666b5e81e7e9a66d9569c4d071a563919f451625","observation_id":"2fa8a960-bd1e-4f05-85b0-eb3b9e1807fd","resolution":{"observed_at":"2026-08-05T22:53:52.533301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:53:52.267794Z","title":"Proceedings of the 37th International Conference on Machine Learning , editor =","venue":null,"work_id":"983e94a9-ead4-4d2c-b5a4-9fd756b9a825","year":null},"citing_paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T22:53:52.158040Z"},"links":{"citing_paper":"/paper/2608.03246"},"observation_digest":"sha256:37f4f3e7be547dd0840913725948df30eb199e68f1aff98face952e866a05bf0","observation_id":"24f08fe4-e1ab-40e1-a85c-8f531786b8aa","resolution":{"observed_at":"2026-08-05T22:53:52.367118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.03246","last_updated":"2026-08-04T07:15:54Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T15:28:17.827672Z","submitted_at":"2026-08-04T07:15:54Z","title":"Optimal Deterministic Oracle Complexity for Weakly Convex Optimization"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":25},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2608.03246."}