{"as_of":"2026-08-09T08:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ffcbcdead65356abcf7f47ba4bf12b2a7fd59d0d14c502dc7f9aa22518876569","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T13:22:34.645152Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T05:45:41.905519Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T05:46:39.640426Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"cited_work":{"arxiv_id":"2507.20773","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.20773","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kamri, J","venue":null,"work_id":"b8a7bf2e-e75c-4424-bf31-24aa812ba91c","year":2025},"citing_paper":{"arxiv_id":"2601.03442","last_updated":"2026-04-21T17:52:21Z","snapshot_observed_at":"2026-08-02T09:08:32.164080Z","submitted_at":"2026-01-06T22:10:11Z","title":"Local Updates in Distributed Optimization: Provable Acceleration and Topology Effects","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-16T16:24:59.451870Z"},"links":{"cited_paper":"/paper/2507.20773","citing_paper":"/paper/2601.03442"},"observation_digest":"sha256:dcb642bef52a14a43d814cb364f482bddc8bf31378d3a4acd58ad0c11150f96f","observation_id":"7ece1b8b-3ea0-48ee-82b4-08292369b55d","resolution":{"observed_at":"2026-05-16T16:28:05.584376Z","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":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"cited_work":{"arxiv_id":"2507.20773","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.20773","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kamri, J","venue":null,"work_id":"b8a7bf2e-e75c-4424-bf31-24aa812ba91c","year":2025},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"cited_paper":"/paper/2507.20773","citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:4f350e0e07f92b6cd341358e89f22f113647513cc2e71709dba1da10ec1d7012","observation_id":"bf1566f0-729a-420c-98f1-07d8cd67af1e","resolution":{"observed_at":"2026-05-25T05:46:39.643034Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2507.20773/citation-record","integrity":"/paper/2507.20773/integrity","json":"/paper/2507.20773/citation-record.json","paper":"/paper/2507.20773"},"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-06T13:22:35.765934Z","title":"Abbaszadehpeivasti, E","venue":null,"work_id":"7c405dab-cd55-4d0b-9711-a052c6c96934","year":2023},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:33.837487Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:e5d94774d17c02aa051697954d07192265a453598a2f33c99253390ca0e66428","observation_id":"306f66b6-758c-43b9-baca-3c3bfbd5f50a","resolution":{"observed_at":"2026-08-06T13:22:35.772486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.746685Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods","venue":null,"work_id":"c0cd70fb-3ece-4244-a082-fd4bb1be888e","year":2017},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:33.889394Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:57ad99910957ec34eda184ff35d83643176fe937b9e311c05877d3cfcca51439","observation_id":"807e274b-8b77-4b4f-934d-024a44f99c36","resolution":{"observed_at":"2026-08-06T13:22:35.751982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.726838Z","title":"Altschuler and Pablo A","venue":null,"work_id":"63fbd850-7c3e-4d82-81b9-4d5c6506797f","year":2023},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.022903Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:9acd37e621771d06d3e2e726ce464f3cd7d78d8f6b33679c19eb670022a7633f","observation_id":"514fc84c-3cd3-49b9-8938-843f44a35177","resolution":{"observed_at":"2026-08-06T13:22:35.733114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.706702Z","title":"Altschuler and Pablo A","venue":null,"work_id":"d077d4a9-fc47-47a9-aaba-ad59666cb500","year":2024},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.140489Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:e500236d34b7be7d80b506f1e07a5f37b1d90837cb0817b63fa418c54ce1dcdf","observation_id":"c660e500-1b9a-4a28-b176-47583cc9b335","resolution":{"observed_at":"2026-08-06T13:22:35.715316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.679944Z","title":"Taylor, and Francis Bach","venue":null,"work_id":"58555ae9-b8c8-4a73-9e6b-a19a767c868a","year":2023},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.271238Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:ceb7bd56eda4612bc41a099b9eddfa30a8c84d85f727860c9cc48ba59b85173f","observation_id":"7e01fb5b-6823-448b-912b-b6c10ff77023","resolution":{"observed_at":"2026-08-06T13:22:35.687091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:34.438375Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.438375Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:6cf920451b2af80e5754845884ebf90e5542845f2c54e6249ed9568ed6709e6a","observation_id":"85e5fdeb-978b-4f28-a2dc-61a7ea6ecbdc","resolution":{"observed_at":"2026-08-06T13:22:34.438375Z","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-06T13:22:35.642025Z","title":"Fr´ ed´ eric Bonnans and Alexander Shapiro.Perturbation Analysis of Optimization Prob- lems","venue":null,"work_id":"f7c950ae-1d47-4e15-b512-a8f38d4802e2","year":2000},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.488094Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:34d89e541ef6b0ae099d38983be94be2de8ec089d17190f2232bc88a72645916","observation_id":"9d6d3c98-1f1b-40a6-aa3e-05153af62a25","resolution":{"observed_at":"2026-08-06T13:22:35.648517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.612218Z","title":"Boyd and L","venue":null,"work_id":"14f278ee-eb00-4c95-82ee-80b720b90f25","year":1994},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.492893Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:e0339918cc8539ed528957e78c458128497795cf3f25a06c64bba271794e8625","observation_id":"0ecc5d4f-201c-41fd-a8c6-b1dbb15fbb56","resolution":{"observed_at":"2026-08-06T13:22:35.618199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.581001Z","title":"A global algorithm for nonlinear semidefinite programming","venue":null,"work_id":"7fb75d6d-d377-4b11-be94-f74f55ce7759","year":2004},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.498730Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:686291bc486f2e631c8b4728ab0f7c6be0fb247312e4b60ec1bfd66f19be27fb","observation_id":"7c21b24c-e898-4163-9da7-db158c64479c","resolution":{"observed_at":"2026-08-06T13:22:35.589890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.551104Z","title":"Performance estimation of the gradient method with fixed arbitrary step sizes","venue":null,"work_id":"eef27397-d260-4475-a836-d3eb0318e1a1","year":2019},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.503688Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:7f914a3573986dbda8fac2558f3a40589f76653aad0eb272cb8a1e927a2d9ea3","observation_id":"1aefff7f-4d9b-4404-8978-2e86ce8e474c","resolution":{"observed_at":"2026-08-06T13:22:35.557312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.527062Z","title":"On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions","venue":null,"work_id":"6f4f0eb5-ca11-4f25-877d-cad8f3fa1c2c","year":2017},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.508230Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:88cda2e946dcad210f9622225713e678769f9ca2304f469b747bc6f7fe533c70","observation_id":"6b76af4a-55b9-4b36-ba94-191f8d70e87c","resolution":{"observed_at":"2026-08-06T13:22:35.533967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.505641Z","title":null,"venue":null,"work_id":"7df28cc1-f917-4ec4-a4cd-f4f02d49063c","year":2020},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.514333Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:f94a987c5358584ddb4b824f255a8731d2dd7bd99128eed372c196d710924833","observation_id":"fa02ef2e-2108-4adc-8888-a556451c9f97","resolution":{"observed_at":"2026-08-06T13:22:35.511022Z","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-08-06T13:22:35.477225Z","title":"Performance of first-order methods for smooth convex minimization: A novel approach","venue":null,"work_id":"d7734cc1-d41a-4622-ad86-0b56d673516f","year":2014},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.519271Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:d7b13594e0b83c4a8646974b34fa66468f1da3c4f0d9dd6eaac7101b407b9ffa","observation_id":"cbbdb00b-1bd0-4d6c-83c1-568c014202cb","resolution":{"observed_at":"2026-08-06T13:22:35.484643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.452248Z","title":"Worst-case functions for the gradient method with fixed variable step sizes","venue":null,"work_id":"39aae7fd-bf54-4b20-bf7a-f16e11fc3a14","year":2022},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.524314Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:52360cc7548599c0ccf978ea686ab42c293bdb6b080e2791d5bd4f380ae761bb","observation_id":"2584f306-a9b4-41e1-b423-50a7a907b88a","resolution":{"observed_at":"2026-08-06T13:22:35.459129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.431172Z","title":"Fares, D","venue":null,"work_id":"f63f14e0-54cd-4e2b-aa55-0890d593a009","year":2002},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.528422Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:b5a52370ddd1552d821720b6954a596c3380571d5825556ebba8a4b1078dfd98","observation_id":"1d06f4e8-110f-4a3a-b33a-12155c72839b","resolution":{"observed_at":"2026-08-06T13:22:35.439264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.413533Z","title":"Accelerated, parallel and proximal coordinate descent","venue":null,"work_id":"aea6f935-a9b2-45d7-a38d-2ba73e4eceee","year":1997},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.532908Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:1031ea76ce399e9141519fa23e6aa723fb116d6ad725d8178380bfa684cfd8f2","observation_id":"fa840acc-1500-4e92-a44e-8c15fc8d7a77","resolution":{"observed_at":"2026-08-06T13:22:35.419456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.389974Z","title":"On fundamental proof struc- tures in first-order optimization","venue":null,"work_id":"ede75718-dbb8-4973-8ab6-cedc57aa4279","year":2023},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.538362Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:a4a7e5a62cca882c745ca28d967256cf6c0460e38849b7a3baebf841ff3ed072","observation_id":"191d2b56-395a-4b8e-90c8-d89b93e4f6bf","resolution":{"observed_at":"2026-08-06T13:22:35.396419Z","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":"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.15033","snapshot_observed_at":"2026-08-06T13:22:34.543710Z","title":"Taylor, and Aymeric Dieuleveut","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.543710Z"},"links":{"cited_paper":"/paper/2205.15033","citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:6f6fa45bbb9f339c7d2a7f27fdc728905156111c00546f971b7746b2dc068fc3","observation_id":"ef7d3342-5a72-455f-9f2a-58f4090688da","resolution":{"observed_at":"2026-08-06T13:22:34.543710Z","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-06T13:22:35.368136Z","title":"Provably faster gradient descent via long steps","venue":null,"work_id":"a954562b-9d35-4d18-857f-078faf64330a","year":2024},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.549032Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:b159306b5f5c0f9219b993886b6ec444d9d6a471de2ae769ad2a838414db9aaf","observation_id":"9252e8d6-b7b4-400d-86fc-7e1703c47130","resolution":{"observed_at":"2026-08-06T13:22:35.375918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.346288Z","title":null,"venue":null,"work_id":"10fd7740-48fa-4bdc-b42a-a5344c7c4f90","year":2024},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.554868Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:beaa1f3c6c874bf433b81503d143c4ef2c21a6bd02926745782da1beb029f537","observation_id":"645512ba-8901-434c-b77e-62e18ede6770","resolution":{"observed_at":"2026-08-06T13:22:35.354277Z","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-08-06T13:22:35.319075Z","title":"Van Parys, and Ernest K","venue":null,"work_id":"1d8c770d-1ba2-453f-9d7f-d1b2097f6aec","year":2024},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.559019Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:129d2a9f6c74fdd2f9ec6b9228984962ae1dba8514845e0a63b21da07b1c863b","observation_id":"fdd3f974-6a64-404e-8aab-dd1c1ad00569","resolution":{"observed_at":"2026-08-06T13:22:35.329099Z","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":"2305.15704","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:34.836689Z","title":null,"venue":null,"work_id":"c12ba834-019c-46b9-8deb-de45b1588ea5","year":2023},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.563169Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:1ac7e434ea5349976d3fa058541dae7a79cd4b8675522ae41e74f107c44f8a69","observation_id":"2d1447ea-f8c3-45a2-972c-732987457636","resolution":{"observed_at":"2026-08-06T13:22:34.845860Z","resolver_source":"raw_fallback","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-08-06T13:22:35.292507Z","title":"Hendrickx, and Ion Necoara","venue":null,"work_id":"5a2ba5b4-eb25-47aa-a72d-7e6a6e5f26ca","year":2025},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.567704Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:3e68f144d86e798978fc632e6122e577bff62775817e60933bcccbd3c5b07aaa","observation_id":"1e3ed446-4914-461a-abf2-5e4646b124a7","resolution":{"observed_at":"2026-08-06T13:22:35.298840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.262822Z","title":null,"venue":null,"work_id":"3b834480-dad4-4dc4-afdf-93dd67300563","year":2016},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.573277Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:2ac7a7defd63f8af5908f433b3b4a83ed81dda50a9c34383c94fb001abbb41ac","observation_id":"346a78c5-39c0-44b1-b05f-d240749e043c","resolution":{"observed_at":"2026-08-06T13:22:35.271919Z","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-08-06T13:22:35.246748Z","title":null,"venue":null,"work_id":"12be5ef4-c867-4a47-affb-b96be142ed98","year":2021},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.578976Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:c75670426824d7e71edf4b4a71d2b06fc524dd3d53cc20eaf81c72194fe3dd64","observation_id":"6649fbe8-8f16-4854-a2c0-6706b7e7dba6","resolution":{"observed_at":"2026-08-06T13:22:35.252464Z","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-08-06T13:22:35.231285Z","title":"A universal catalyst for first-order optimization","venue":null,"work_id":"d91b1af3-def1-4082-a59e-2e0539fe0d5d","year":2015},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.584439Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:30adc5dc90a67d937835e02848859d1a0a811397d19adec95c59ba8fe28a590f","observation_id":"ce0a7491-566c-4be4-9e9a-637d09c16905","resolution":{"observed_at":"2026-08-06T13:22:35.235860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.212549Z","title":"Monteiro and Benar F","venue":null,"work_id":"ca04231d-ca94-4adc-982c-e59b2ece5880","year":2013},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.589180Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:de0e8dcdef41c3d6a8ec0a8129cb1f783f3be0021547698385f164bc6a4f3d9f","observation_id":"6110c8f7-8f99-440d-9488-95d268e2644b","resolution":{"observed_at":"2026-08-06T13:22:35.217970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.196255Z","title":"Linear convergence of first order methods for non-strongly convex optimization","venue":null,"work_id":"044da536-1db9-4473-8c5c-b3d2678d942a","year":2019},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.593578Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:fe1cb5aa1d1c99f4794764aecb11b2a1a268d3752ddea4002e3cba338e7e65ca","observation_id":"24a61b46-8c7c-4b6c-8094-b2c85b63a371","resolution":{"observed_at":"2026-08-06T13:22:35.201270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.177803Z","title":null,"venue":null,"work_id":"4a7d58a0-f0f4-4797-a8f5-ceb51c8a6908","year":1984},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.597503Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:67273a92e6b7ca5f416a7d511931fbfc6b0318e05a6230cf646f3a4970e102b9","observation_id":"b7d245da-4b56-43b8-9fbf-4c43aa604caf","resolution":{"observed_at":"2026-08-06T13:22:35.185492Z","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-08-06T13:22:35.161058Z","title":"Problem Complexity and Method Efficiency in Optimization","venue":null,"work_id":"a0f4eca5-c271-4aa8-908c-dfdaeeb3dfe8","year":1983},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.601833Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:eb816abe658e3627d650f9b6988bafc09d14acdb112831325776ec4434b5e9b8","observation_id":"b564a910-9fdd-4072-8152-086d514e227f","resolution":{"observed_at":"2026-08-06T13:22:35.165381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.145092Z","title":"A method of solving a convex programming problem with convergence rate o(1/k2)","venue":null,"work_id":"371645eb-8e64-4b8b-864d-d35b136868b6","year":1983},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.606180Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:046631f9af7216949f82c9f6d9dd7c143487a238b5e517a119d6ad1b58600575","observation_id":"691d73d0-4911-4cef-8fb0-b32b9c82f535","resolution":{"observed_at":"2026-08-06T13:22:35.150656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.129878Z","title":"Efficiency of coordinate descent methods on huge-scale optimization prob- lems","venue":null,"work_id":"06c9b80a-9239-4ea6-b447-a8b0f0071aac","year":2012},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.610204Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:d42cf484d714a99156bb6aafa459923784edfbe966aaf4c0af45091ee9fdf3c6","observation_id":"2037e4f6-5333-47d9-9b45-aaee3994a23f","resolution":{"observed_at":"2026-08-06T13:22:35.134556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.115349Z","title":null,"venue":null,"work_id":"3fddc000-885a-4068-8d00-502674e530dc","year":2022},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.615056Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:fd4cfe9452a3caa22316a7b4e720ca30f79dbaf223ddd2bf142e2f7b953ecc03","observation_id":"49e47a8d-0b88-4f50-be87-5444e0844208","resolution":{"observed_at":"2026-08-06T13:22:35.120113Z","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-08-06T13:22:35.098245Z","title":null,"venue":null,"work_id":"3bb4b932-e1f6-4598-8901-032fccc471aa","year":1964},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.619547Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:7a535a2e00ff6359fcf3296870f5c6f28f9f812177ab6577da5f583a31307fd6","observation_id":"4510ac7e-ccfa-42bd-9bb2-a5b64319a9c2","resolution":{"observed_at":"2026-08-06T13:22:35.103117Z","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-08-06T13:22:35.079440Z","title":"Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization","venue":null,"work_id":"2cd53d86-b9c0-48df-8d88-0c494bcc8bb6","year":2014},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.623839Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:d204f19e53c3693b532f9dd53c618b0df2ce37f094a0570e8afb2bf7e7ae090b","observation_id":"258eae1e-1269-4433-9054-eaa680ddd5a3","resolution":{"observed_at":"2026-08-06T13:22:35.085814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.059795Z","title":"An optimal gradient method for smooth strongly convex minimization","venue":null,"work_id":"e60602c6-173b-4e4c-aa0c-63028124bb16","year":2023},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.628374Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:4a27001d6406a28b2c4df9f9086d6b5ff4e721e8671b3e6e5c374bd4742a75c4","observation_id":"a2c8e9db-cc8c-4db8-8912-dad3d4334990","resolution":{"observed_at":"2026-08-06T13:22:35.064959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:35.042585Z","title":null,"venue":null,"work_id":"6ce81a69-9bc8-4047-bbc6-0d01d20c84f4","year":2017},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.632362Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:1d52846ea6f289df26c069a36dc36813bcdcc4c59b853e5eae386aa8c4e645d3","observation_id":"f1416aa5-d5b4-4285-b84b-7164c0a1740e","resolution":{"observed_at":"2026-08-06T13:22:35.047608Z","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-08-06T13:22:34.908040Z","title":"Taylor, Julien M","venue":null,"work_id":"258b8635-0f6f-4f39-9901-1ddc570d2036","year":2017},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.636413Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:656ded99ff19c8755843cf37d1b317c62f0db7d870b02d89f5717cfe172bbbdb","observation_id":"719320d0-c74b-4ccb-b1a8-e7a3260f09ca","resolution":{"observed_at":"2026-08-06T13:22:35.031683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:34.892057Z","title":"On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback","venue":null,"work_id":"4cd19cae-26c9-4ffa-9041-3e5be04d0c4c","year":1995},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.640740Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:9c6b18fcca9ac13542197d0519be6e5bbf83a394b08cdd098a548270423d3331","observation_id":"793f128a-cefa-4e60-82d4-ac241c5f5125","resolution":{"observed_at":"2026-08-06T13:22:34.896768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:22:34.876667Z","title":"Convergence analysis of an inexact gradient method on smooth convex functions","venue":null,"work_id":"c8232a26-1f0e-45e1-b026-c0bf0815ee8a","year":2024},"citing_paper":{"arxiv_id":"2507.20773","last_updated":"2025-07-28T12:35:46Z","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T13:22:34.645152Z"},"links":{"citing_paper":"/paper/2507.20773"},"observation_digest":"sha256:db3debd7d95778aff2bdc0bdf7fb0355a18e060e5c2fe48b2703a74b12940b71","observation_id":"19b8f347-3196-4fc9-ae67-bc5f616e6829","resolution":{"observed_at":"2026-08-06T13:22:34.881852Z","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":"2507.20773","last_updated":"2025-07-28T12:35:46Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T13:22:30.913855Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":40},"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 40 of 40 outbound references and 2 inbound Pith citation observations for arXiv:2507.20773."}