{"as_of":"2026-08-09T23:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea6de6747bab6fdded2583cc248a2c76bf11a7388b6337e1cb5c500e037ce52e","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"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/2607.08753/citation-record","integrity":"/paper/2607.08753/integrity","json":"/paper/2607.08753/citation-record.json","paper":"/paper/2607.08753"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10957-023-02199-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Optimization Theory and Applications202, 475–496 (2024)","venue":"Journal of Optimization Theory and Applications","work_id":"c7b99086-055e-48ba-a21b-83504e2e3001","year":2024},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:e9f375c13a91ea873f92ac2dce3815597697a09b88b13efb8e7fc618ee0b5524","observation_id":"ab11bda3-f2a6-487f-a7e8-80ae816e1cf0","resolution":{"observed_at":"2026-07-10T02:06:41.812700Z","resolver_source":"doi","status":"metadata_mismatch"},"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-07-17T19:51:14.358802+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:14.358802+00:00","source":"openalex_status_cache"},{"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":"10.1145/3708502","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the ACM","work_id":"6c0d60c3-362e-43fe-a1a6-9a133bf9c591","year":2025},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:a612a8b4bcd588410ff07ed14c20cb420fb4e975b2133b4255980e94084f3b05","observation_id":"b509e0c3-87af-4fe8-929b-5bb9ae1c93d5","resolution":{"observed_at":"2026-07-10T02:06:41.782617Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:14.879098+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:14.879098+00:00","source":"openalex_status_cache"},{"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":"10.1016/s0304-3975(97)00115-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Amaldi and V","venue":"Theoretical Computer Science","work_id":"2265135e-e2f8-40ee-b6d0-8d4502d56a95","year":1998},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:33af488af018b5b58474d8ce83f397cefce2fcfffd90e23be358b5729ee4ca05","observation_id":"31175a15-b8ca-4483-b97f-b1bbbdb87edf","resolution":{"observed_at":"2026-07-10T02:06:41.822865Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:15.397448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:15.397448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.06041","last_updated":"2021-06-29T16:26:06Z","snapshot_observed_at":"2026-08-07T12:02:51.532932Z","submitted_at":"2020-06-10T19:44:36Z","title":"Principled Analyses and Design of First-Order Methods with Inexact Proximal Operators","version":3},"cited_work":{"arxiv_id":"2006.06041","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.06041","snapshot_observed_at":"2026-07-10T02:06:42.038445Z","title":"Principled Analyses and Design of First-Order Methods with Inexact Proximal Operators","venue":"math.OC","work_id":"1d774944-badf-4c10-ad17-af0a187234a8","year":2020},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"cited_paper":"/paper/2006.06041","citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:7e5f9a5675bd1cef854908f69a1b2d2d272382a09bce52abe4e68841ec658ae8","observation_id":"a6146c41-26a0-4dde-97ae-999d5a479977","resolution":{"observed_at":"2026-07-10T02:06:42.039989Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07-10T02:06:42.315556Z","title":"Berg Thomsen, A","venue":null,"work_id":"df5f874e-0e37-4947-a335-adf62b485a2a","year":2025},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:21854b11657211b38cee584e95ba7334f81e60d25b677cb3632b6b4ab6e386d1","observation_id":"053e5452-4828-4e96-af45-7e6eac800ba0","resolution":{"observed_at":"2026-07-10T02:06:42.316698Z","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":"10.1214/15-aos1388","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Annals of Statistics44(2), 813–852 (2016)","venue":"The Annals of Statistics","work_id":"fec63214-5de9-4914-a3e4-1fcf10006e14","year":2016},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:785c78f217ad969d3116e6756a65815554852ea3bbe01be48c41c3086dbd9244","observation_id":"46079d0b-b7b8-4420-9aa4-159cb71482a4","resolution":{"observed_at":"2026-07-10T02:06:41.832732Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:15.877716+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:15.877716+00:00","source":"openalex_status_cache"},{"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":"10.1007/s00041-008-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T02:06:41.831311Z","title":"Weighted Norm Inequalities for Paraproducts and Bilinear Pseudodifferential Operators with Mild Regularity","venue":null,"work_id":"008edfa3-492e-453b-8158-b38c760a38fd","year":2008},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:3c8621ba534684b2217ff4e087d608af6e9b03c647b4abf5786b8c9707bb1629","observation_id":"6ef23ebb-e974-49ea-b88b-18eabe8def80","resolution":{"observed_at":"2026-07-10T02:06:41.832930Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":"10.1007/s11590-016-1087-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"de Klerk, F","venue":"Optimization Letters","work_id":"cbe719c8-8650-4ebf-886b-426706aecac7","year":2017},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:64feac04af7677e95bd295c5cad38b591e1d041b5306306ddfd6a39be5d12ffc","observation_id":"fae2dfa4-42a4-4258-9da7-7a54cb1e4d16","resolution":{"observed_at":"2026-07-10T02:06:41.831021Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:16.382461+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:16.382461+00:00","source":"openalex_status_cache"},{"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":"10.1007/s10107-021-01618-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dragomir, A","venue":"Mathematical Programming","work_id":"16f3a4c9-a627-41e9-b60d-0a901089d219","year":2022},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:7e5dec7b5b149e92e142a621dd03e22e6812ab0f5835e43cae882bda88136369","observation_id":"c94e3914-140a-4ee0-857b-1a0d5bcb61fd","resolution":{"observed_at":"2026-07-10T02:06:41.838377Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:16.921842+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:16.921842+00:00","source":"openalex_status_cache"},{"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":"10.1007/s10107-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T02:06:41.790374Z","title":"W¨ achter and L","venue":null,"work_id":"90b9f003-b166-4994-8e55-eef97f3ead88","year":2014},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:7741a2808879551143a13fcc61ec2d7d4ba41763cfe89cb04467f23416aa34ab","observation_id":"fe38f407-c322-4acf-a8e2-2341fdfa5090","resolution":{"observed_at":"2026-07-10T02:06:41.791680Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":"2003.12433","last_updated":"2020-03-27T14:23:17Z","snapshot_observed_at":"2026-08-07T14:33:43.915290Z","submitted_at":"2020-03-27T14:23:17Z","title":"Fredholm theory of families of discrete dynamical systems and its applications to bifurcation theory","version":1},"cited_work":{"arxiv_id":"2003.12433","doi":"10.1109/acc.2003.1243393","metadata_source":"pith","pith_arxiv_id":"2003.12433","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Fredholm theory of families of discrete dynamical systems and its applications to bifurcation theory","venue":"math.FA","work_id":"320232c1-c925-444b-b267-4f9a2a6330eb","year":2020},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2003.12433","citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:66c7c380556d5c403910b8af697a805ed9a44411a594346652b8667dc54c5d98","observation_id":"dcc2ccb4-1c41-497c-858d-9b8810454444","resolution":{"observed_at":"2026-07-10T02:06:41.837428Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07-17T19:51:17.372482+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:17.372482+00:00","source":"openalex_status_cache"},{"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":"10.52202/068431-1589","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gorbunov, A","venue":null,"work_id":"b27cde9d-2543-482c-be85-02144b7469fc","year":2022},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:bd40a2e3f53c4db4263047c5c87db77e70597677df1f7ea20a370f64bdf9ff95","observation_id":"d2f514cd-609f-4eba-986c-066f5cb5d372","resolution":{"observed_at":"2026-07-10T02:06:41.819268Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:17.769987+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:17.769987+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.15033","last_updated":"2022-05-30T12:10:30Z","snapshot_observed_at":"2026-08-01T19:59:48.378444Z","submitted_at":"2022-05-30T12:10:30Z","title":"Optimal first-order methods for convex functions with a quadratic upper bound","version":1},"cited_work":{"arxiv_id":"2205.15033","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.15033","snapshot_observed_at":"2026-07-10T02:06:42.033111Z","title":"Optimal first-order methods for convex functions with a quadratic upper bound","venue":"math.OC","work_id":"59259be8-1088-4709-bb16-520722baa4fb","year":2022},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"cited_paper":"/paper/2205.15033","citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:74e7f28cbde11a6e671c295bb66dcc120b253b1b7f95ea7585241506afc32668","observation_id":"c0c71ddc-90ae-4893-8921-4fbe8990c97d","resolution":{"observed_at":"2026-07-10T02:06:42.034614Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07-10T02:06:42.313815Z","title":"Goujaud, A","venue":null,"work_id":"c5e125c3-9bc0-425c-8c3f-0bf620d6f974","year":null},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:22150a0c982eeffdcde05fc4bed93ab56e57e5ffbff4dd7047243acc830b266b","observation_id":"756f6b21-038f-4d9c-b5f4-55292e0fddaf","resolution":{"observed_at":"2026-07-10T02:06:42.314974Z","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":"9753.2023","doi":"10.1109/cdc49753.2023.10383426","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Schwan, Y","venue":null,"work_id":"42f2ffaa-cc32-4a87-a7ca-eb28e430edbb","year":2023},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:78bd04bae82e8eec51b799a7d7edcb0db16fc582e3ec2ab899736062beb70009","observation_id":"cc0183c5-5425-4ca5-9208-88be75fe56b4","resolution":{"observed_at":"2026-07-10T02:06:41.827740Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"10.1007/s12532-024-00259-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Goujaud, C","venue":"Mathematical Programming Computation","work_id":"1f47f742-40ab-4ed6-8660-c710ed3452fb","year":2024},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:0836d9cb5f557ed8f29143da77ccf235ccaab407c8a61f93436e110b8bbe0123","observation_id":"e8b9bec5-68c9-4e55-bdcd-489ab0798847","resolution":{"observed_at":"2026-07-10T02:06:41.821074Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:18.659013+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:18.659013+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1934.2025","doi":"10.1080/02331934.2025.2477138","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimization pp","venue":"Optimization","work_id":"03542271-4cbd-41f2-b1d0-f62515b657e9","year":2025},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:e7b4c9ba1cc16d456048596a629321a42b468385e780e1ccd10a53a2f8ea2d60","observation_id":"3feda423-1a3d-40eb-a0ac-77706419ff27","resolution":{"observed_at":"2026-07-10T02:06:41.830750Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"10.1007/s10107-025-02258-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Mathematical Programming","work_id":"04a7ba87-15d5-40a9-a91c-7d17368c3acb","year":2025},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:92480ae3c1816a1b886f62ea7bbaaae23e76269094c96ad77d1d1d3bc4815378","observation_id":"7c05e4bb-9bc8-481e-887b-2f4d6aed6a94","resolution":{"observed_at":"2026-07-10T02:06:41.836639Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:19.44612+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:19.44612+00:00","source":"openalex_status_cache"},{"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":"10.1007/s10107-021-01643-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Acceleratedproximalpointmethodformaximallymonotoneoperators.Mathematical Programming, 190(1–2):57–87","venue":"Mathematical Programming","work_id":"a0d2acfe-17ed-4eb5-abcf-fc8efab9759c","year":2021},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:c27611d36f4fd393d6318e2cced7ffc87ccbf89be5320b739b866f80a02bd741","observation_id":"d91f40e0-5397-4016-b4f9-c435823df6b5","resolution":{"observed_at":"2026-07-10T02:06:41.809830Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:19.97451+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:19.97451+00:00","source":"openalex_status_cache"},{"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":"10.1007/s10107-015-0949-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kim and J","venue":"Mathematical Programming","work_id":"2788c427-9481-4ad1-a25f-9d1bd941f370","year":2016},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:ec530f570b9f7de0617e840147b523ca0c8fb2d83f5c192c9881fd2bd80af236","observation_id":"4e43e154-614f-4efc-b6e4-06cbc0bd2323","resolution":{"observed_at":"2026-07-10T02:06:41.845250Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:20.45268+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:20.45268+00:00","source":"openalex_status_cache"},{"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":"10.1137/16m108940x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kim and J","venue":"SIAM Journal on Optimization","work_id":"b460254d-7abf-485a-9d15-cc3999a3f3f7","year":2018},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:a5fde297dbb417356c30f671231b8b71dc2e785407dcbc401e18d54686806db3","observation_id":"4c784de4-55ce-4453-89e4-62918e2c25c0","resolution":{"observed_at":"2026-07-10T02:06:41.789728Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:21.027214+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:21.027214+00:00","source":"openalex_status_cache"},{"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":"10.1137/17m112124x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kim and J","venue":"SIAM Journal on Optimization","work_id":"050480a7-0113-4f53-be14-afbd4a5d4121","year":1920},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:cf53f84db36933621e2cca34b75c0f0e3fdea552ee8e9e13f57accd46763a458","observation_id":"b6feba9e-7df0-4549-9613-90410f5d976e","resolution":{"observed_at":"2026-07-10T02:06:41.810792Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:21.596863+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:21.596863+00:00","source":"openalex_status_cache"},{"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":"10.1007/s11590-020-01617-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Optimization Letters","work_id":"77945739-57fe-4ee0-a5f2-33759e46817b","year":2021},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:48a1237b50cf3dcc5660d5ff8567d6ac4ae08df6a56a8eeed9ed4b5fb9b5588e","observation_id":"928e7869-f3c4-4741-bea3-c490c9279c55","resolution":{"observed_at":"2026-07-10T02:06:41.839080Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:22.011436+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:22.011436+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7199.374757","doi":"10.1145/3747199.3747570","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Naldi, M","venue":null,"work_id":"c7d41204-0768-4329-b833-c33da33a1f64","year":2025},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:c36110d09dc2faaab5f4c60c0b44402222d900d470426ab172c980e3445fc629","observation_id":"281c64fa-4125-4b19-ac7d-50c4c0239fd8","resolution":{"observed_at":"2026-07-10T02:06:41.841671Z","resolver_source":"arxiv_id","status":"verified_exact"},"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-07-17T19:51:22.439883+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:22.439883+00:00","source":"openalex_status_cache"},{"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":"10.1137/s0097539792240406","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sparse approximate solutions to linear systems","venue":"SIAM Journal on Computing","work_id":"aa3f8a50-935a-4275-9910-224f7062514f","year":1995},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:b42f252c5ad64cb97212df264e21a81584b67f9b8871fc9ff34141eb71562d63","observation_id":"283c2767-9a4f-49ee-a2bc-fda43927e7e8","resolution":{"observed_at":"2026-07-10T02:06:41.827235Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:22.804693+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:22.804693+00:00","source":"openalex_status_cache"},{"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-07-10T02:06:42.304133Z","title":"Park and E","venue":null,"work_id":"a22e4cab-abc5-4034-8680-b39a16a1ac26","year":2022},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:dc9cb0cca9851367fd2f2705d59b9b45751f3c8c324a64d56e82a278a339f1a7","observation_id":"b1f89d6a-b8c2-451f-bf32-1819ef7adcd7","resolution":{"observed_at":"2026-07-10T02:06:42.305431Z","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-07-10T02:06:42.302542Z","title":"Rotaru.Exact Performance Analysis of Fundamental First-Order Optimization Methods","venue":null,"work_id":"20c6e839-a0fd-4ece-abba-eb97a7488124","year":2026},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:9ef2616f21e85b0f1d2654a79b1cec744e31a6b560fbd647244bfc4280ba9b9f","observation_id":"f77a7e42-acbe-460b-ad29-6d6b7c10666a","resolution":{"observed_at":"2026-07-10T02:06:42.303732Z","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":"2406.17506","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T02:06:42.029951Z","title":"Rotaru, F","venue":null,"work_id":"dacb92f5-9f19-4323-b634-275a39e24867","year":2024},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:e4c82bc8ec748a200cdad767c68489219d1ab754d887dfcd43c8fc13aea497e0","observation_id":"38fed5b7-b6bb-480f-827a-ed6a7687fa20","resolution":{"observed_at":"2026-07-10T02:06:42.031556Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"10.1137/19m1304854","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"9e525d3a-fde9-4367-a516-aa1772a59426","year":2020},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:681aba674b54ffcf4110eef471d54b3455473e13fd648b5a055e5a10dba5c807","observation_id":"848807cd-4c1d-4d84-9931-4cf774cb327c","resolution":{"observed_at":"2026-07-10T02:06:41.834599Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:23.277433+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:23.277433+00:00","source":"openalex_status_cache"},{"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-07-10T02:06:42.306061Z","title":"Shugart and J","venue":null,"work_id":"c14ba945-0895-4b3e-89e2-365785526abb","year":null},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:765b57100e00895ad396e0394bbc34732fe47c9019309725bb056506839299f8","observation_id":"68fb58e6-01a0-4d5a-9cd6-2433ad8c2222","resolution":{"observed_at":"2026-07-10T02:06:42.307266Z","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":"2505.01423","last_updated":"2026-06-28T16:36:22Z","snapshot_observed_at":"2026-08-09T12:52:45.230931Z","submitted_at":"2025-05-02T17:59:46Z","title":"Negative Stepsizes Make Gradient-Descent-Ascent Converge","version":2},"cited_work":{"arxiv_id":"2505.01423","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.01423","snapshot_observed_at":"2026-07-10T02:06:42.035818Z","title":"Altschuler","venue":"math.OC","work_id":"0d8f793d-30ed-4aa6-841c-b58e3d9aa253","year":2025},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"cited_paper":"/paper/2505.01423","citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:97395c8a0e85cb29cda4490336985be285b0e1a384460b4ff9473d88741db65b","observation_id":"eca24368-c5d7-448c-991e-f112047e67aa","resolution":{"observed_at":"2026-07-10T02:06:42.037588Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07-10T02:06:42.302321Z","title":"Taylor.Convex interpolation and performance estimation of first-order methods for convex optimization","venue":null,"work_id":"9990d23d-19ad-4418-82db-60385dc31ec5","year":2017},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:ad0947161b7fd3b40d4ed291afdea0b082240945fbf4511442e094a8e6395210","observation_id":"0c90e525-7eb0-48b3-a152-4eae951d7f13","resolution":{"observed_at":"2026-07-10T02:06:42.303574Z","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-07-10T02:06:42.294012Z","title":"Taylor and F","venue":null,"work_id":"f2e149ca-5863-4566-a848-20ff8eb47e04","year":null},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:7e1dc8b9bc1290f2f056cb46580251319a6300282783707947b69a15d2ab80a7","observation_id":"7b85d478-6067-4d07-9662-4b4fdc3bf244","resolution":{"observed_at":"2026-07-10T02:06:42.295363Z","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-07-10T02:06:42.292107Z","title":null,"venue":null,"work_id":"744db747-be04-4567-82e9-5e197c8b7323","year":null},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:73500c75731a7b133538f6c80f33628fe066bb1c0c88911311cfb71b4347c89c","observation_id":"d427e644-ea3a-4539-98e1-e1300ace6ea3","resolution":{"observed_at":"2026-07-10T02:06:42.293414Z","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":"10.1007/s10107-022-01839-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Taylor and Y","venue":"Mathematical Programming","work_id":"556cb563-e7fd-450c-8c96-3b69bd31bdb2","year":2023},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:a7850b337c5adcca107182638617690f6b53e07a59727c21e9ce1363ff99bf22","observation_id":"7bfcd489-4314-40dd-84e8-95e152c79777","resolution":{"observed_at":"2026-07-10T02:06:41.803578Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:23.794685+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:23.794685+00:00","source":"openalex_status_cache"},{"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-07-10T02:06:42.295950Z","title":null,"venue":null,"work_id":"6a04104d-b1a2-4e0c-a394-aea8be1579e8","year":null},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:5a3a232bd61aaf6f4cec1594f125d77c31a59b97a75c69cdafb4f876e6d5b43a","observation_id":"0fa7818a-e235-46df-9e56-820285c79d03","resolution":{"observed_at":"2026-07-10T02:06:42.297457Z","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":"10.1137/16m108104x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"736be1b0-56ac-4ad3-a0ff-ebd32c5d9541","year":2017},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:c233d621dd23db19c268df4c9920e06e3ab0be5310d821b1a3558a7208b309a4","observation_id":"2f746810-0163-4338-a33e-9dcd82f6a0f1","resolution":{"observed_at":"2026-07-10T02:06:41.824722Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:24.225876+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:24.225876+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2017.826383","doi":"10.1109/cdc.2017.8263832","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp","venue":null,"work_id":"c4bde77f-e759-4e04-b1e5-e5f0d27bcfb8","year":2017},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:1a5f440820328faaae295b5e93e26ccf9c0bc5e991f9905aacdf1b299ffa896b","observation_id":"6874ccc7-66eb-4e04-8170-2e347d022625","resolution":{"observed_at":"2026-07-10T02:06:41.843325Z","resolver_source":"arxiv_id","status":"verified_exact"},"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-07-17T19:51:24.672717+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:24.672717+00:00","source":"openalex_status_cache"},{"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-07-10T02:06:42.300263Z","title":null,"venue":null,"work_id":"c94a5a3f-be42-47a2-963e-30209a6339f4","year":null},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:8b1c64f5dac3801aad0255a44bd7212b9bdbc41d29bb1f49d59a7d6bb169f959","observation_id":"4f4f5e55-ad61-49af-b2ea-e16039065cee","resolution":{"observed_at":"2026-07-10T02:06:42.301711Z","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":"10.1007/s10107-016-1009-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Taylor and Julien M","venue":"Mathematical Programming","work_id":"de50d8e2-b1b3-4810-bd15-8a51564da77d","year":2017},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:156e7c560ef147ffd43a88d88ad8cdd5cc806ecfd918c7ad7d71a18123cd5d14","observation_id":"aa6831fe-f6ba-47f0-9e9f-9a30a1f4e5d3","resolution":{"observed_at":"2026-07-10T02:06:41.840368Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:25.132818+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:25.132818+00:00","source":"openalex_status_cache"},{"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":"10.1007/s10957-018-1298-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Optimization Theory and Applications","work_id":"397e5173-9d46-4506-9101-56fd2534242d","year":2018},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:ab35fa381fd794255d98cc1c9c5859355155a8fcb9deb85b3a807b91c3a433b0","observation_id":"7bf35118-915c-48d6-a563-c75e81314043","resolution":{"observed_at":"2026-07-10T02:06:41.797218Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:25.945974+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:25.945974+00:00","source":"openalex_status_cache"},{"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":"10.1111/j.2517-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T02:06:41.810476Z","title":"Cross-Validatory Choice and Assessment of Statistical Pre- dictions","venue":null,"work_id":"0cdb035d-a094-4daf-aa10-6846c4ad6ff7","year":1996},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:00654265a31f933164043bc6cd088ddcfe208ce8e255e9d71f4c4554f8fbb0ae","observation_id":"e32ef1aa-4b19-4204-ab41-c0907ce62700","resolution":{"observed_at":"2026-07-10T02:06:41.811702Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":"10.1007/s10107-024-02061-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Upadhyaya, S","venue":"Mathematical Programming","work_id":"f4dc848a-125c-4676-bd6b-cc3a8b896500","year":2024},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:3f7af6444cc605ae3fe3b37bd14b28a1a7aa012333a4139975a12d0aedc21f42","observation_id":"21bb82af-59ef-41d1-a773-d43f00764d03","resolution":{"observed_at":"2026-07-10T02:06:41.801633Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:26.459652+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:26.459652+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2506.24076","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T02:06:42.041731Z","title":"Upadhyaya, S","venue":null,"work_id":"f883979b-0f23-485e-bcd1-d7ad5fd8520b","year":2025},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:1fbfc04c95d2b7ea46fb6265e392edf940369c26412404f419f1ebbe43f9706d","observation_id":"7a5d01f3-1c9c-46d5-8f81-fba7b143185a","resolution":{"observed_at":"2026-07-10T02:06:42.043964Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-03T09:17:15.892372Z","submitted_at":"2026-05-21T18:06:17Z","title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","version":1},"cited_work":{"arxiv_id":"2605.22929","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.22929","snapshot_observed_at":"2026-07-10T02:06:42.041788Z","title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","venue":"math.OC","work_id":"10df103a-3a75-4ee4-908a-b87a65034e80","year":2026},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"cited_paper":"/paper/2605.22929","citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:3323821ec6e42f6f37e933d96dd665db6b8a1488cab0f5863dd0f67fe16d5085","observation_id":"58b73b54-e19f-4665-8c90-fd110e1ee47b","resolution":{"observed_at":"2026-07-10T02:06:42.043357Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"10.1007/s10957-022-02032-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Uschmajew and B","venue":"Journal of Optimization Theory and Applications","work_id":"14a4086a-909c-4697-ba90-8d11cd29e839","year":2022},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:e6312ed4aed8a84437801c2c4ceca7f475073c0eb2ee9d857258a36f4682b9b8","observation_id":"d0ae7801-2b8a-42c9-8c80-b1af78efcdb0","resolution":{"observed_at":"2026-07-10T02:06:41.808011Z","resolver_source":"doi","status":"verified_exact"},"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-07-17T19:51:26.898064+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:26.898064+00:00","source":"openalex_status_cache"},{"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-07-10T02:06:42.307900Z","title":null,"venue":null,"work_id":"becd0965-e3fd-4654-85ac-3d14b83ade95","year":2024},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:e0fa314d5a09ab7f7b5e640c187a25e8cf55b29f983899d326af96a9bd7ede3c","observation_id":"638922d5-9c9f-4cde-8d5a-722bfd75dcd4","resolution":{"observed_at":"2026-07-10T02:06:42.309109Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T02:06:42.309751Z","title":"1 0 0 # ,bx 1 =","venue":null,"work_id":"0f7ace6c-cca7-4574-96f0-7f56687fd8b1","year":2010},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:219f59de1fb092e277f29b0c831f8eb2e7c1dcf14f4d0e78dd2d940dafd8eeac","observation_id":"340e7553-8e6d-46ad-976e-14db3b53cf4c","resolution":{"observed_at":"2026-07-10T02:06:42.310910Z","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-07-10T02:06:42.311497Z","title":"Finally, convexity gives F(x N)−F ⋆ ⩽⟨g N , xN −x ⋆⟩, and Young’s inequality in theB/B−1 pair yields 2AN(F(x N)−F ⋆)⩽∥x N −x ⋆∥2 B +A 2 N ∥gN ∥2 B−1","venue":null,"work_id":"bf7a1635-c6f4-4077-928c-0b4168b7981c","year":null},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:78393a8b186a21e44a079538a44b1414f8793e9108bf4dcdd0f3cd71f7101cc7","observation_id":"d9c49721-6d56-443a-b8f8-bb8acd5cdcc9","resolution":{"observed_at":"2026-07-10T02:06:42.313191Z","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":"2607.08753","last_updated":"2026-07-09T17:51:07Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-03T19:46:29.896090Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":3,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":4,"verified_exact":30,"verified_fuzzy":9},"total_outbound_references":49},"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 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2607.08753."}