{"as_of":"2026-08-08T09:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4bda1a806a9c3ec65b8f42448fdaafeec66f1cebdb0070719aa0d73dfeb83817","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-08T06:32:00.761636+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-07T23:10:47.804167Z","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:f73b073495ee7eb58f0d961d446d019aed6d2f96157ef06456c98dfe09e5153e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:4bacf7d6e8d0afe4f0d98bc049584b18ae789224c3df05de6f72ec490b8bc6eb","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-07T23:10:47.804167Z","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:9848ba33d26e807d9269a02b8e370e16402c999aa20e490c8d54f8d4bc24b009","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:754c48750e3786436751416614385e79b5a1e6d5976e48bc9ee53d7eb150f31f","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-07T23:10:47.804167Z","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:93fe214e1b50d99c6b0c67be146c9b2b008e22655ac3238f799837bbd30d3d4d","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-07T23:10:47.804167Z","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:ff4f4d81d8f6925afd52dd8034b791b3b8d85e729f977a9e286aeb743331ed0f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:874b0d45465295be4f8608aea2e4be6eee5430095e5c54f9586c3eb8df06be7e","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-07T23:10:47.804167Z","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:f35d1a21f1b486b9139644bc3248770daa93325f853508e4a882402b30afb92f","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T11:32:33.363187Z","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-07T23:10:47.804167Z","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:5ad7fea0bd00b51c4cb3343b5b6a9ff1ae3d43cfc37510321fc29413c34e12c8","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-07T23:10:47.804167Z","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:13a35eb95c74528441e30909b44d9c30e091a66a0e7832f3ff0fcb11da8db94e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:73770b7e86eea90f4c069161bfbca4a051c0325f00b71a723da02ebfde26431d","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:8bef3308d603777c43bdc1bf134292e64d79557be002205c9c9b326a5fceb6ca","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-07T23:10:47.804167Z","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:61daf9839e252be35369f648460ac6d3836d2275ccd35fdcc15aef46676e54c7","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-07T23:10:47.804167Z","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:583711da2e78af363f9c195e0109179598947fbb2587386b37d0bd9719b81f73","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-07T23:10:47.804167Z","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:8f41decdb653f9946feb3b57cdf9c77dc4acfb0aff3041ffac0c7df02345890e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:871688d36b446d0fc6a4ed8b1bff8a05ecb2b256cc733c3aaf75cc787f8af931","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:3fa23d6d71d9d0ac8f407194e133db1c2d0237fd5957a80fd68cb032c18e28a9","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:e6abd91ba5ee98bb763c22c0d68268a12186bc38339c37c30e8dead8f6043799","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:7a53bd64d8d60d92f80f7ec3af299880bfca02cc169107ea66292546d763288e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:02ccb6e06e6ebc693438018c22e530bd1ec2ceb0c4e128d25b437bab160dfe22","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:f6caedc25d67dd750c65ebf66828c644e47e62a852672d6e4cc487333250c6bd","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:09f12e747ece9c8a4896410f5473b75501eb88855d2420187895a50d1884def7","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-07T23:10:47.804167Z","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:ce589af924628efc3c320b9fc0e20f6449282892962126bf84e26e2ecb029cf2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:d1c06c3ddcf7584ebfaaed4f9166d7a5a2bbf73b65fc53e81be2aa13b94e5d26","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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:db41b09eeb726e385b68765f98e8577ae7adf84bdb51fca110beb2d6b487f6ae","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T23:10:47.804167Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2608.03246."}