{"as_of":"2026-08-10T06:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:08928183e5e681ac88ece1cdb53bad647d813be892e36aa3d20cd3a3d53d095d","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-10T06:31:04.303077+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-09T21:02:57.697293Z","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:f3520c69f1a4a43c2ad17c6c381215de1b72fecbc6326735d4a8e6885c9bcd2f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:6795f554dc2bce84feea9ee0c0875deb55f1f7d186aeb383523eb10c3282479b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:803bd68f630736570277995e6f920ae712760cec9023ee7fc58fae2168990fb2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:10d915f78b21f0eb2ff788109490a5a2477980a7338d5db50390a43165fcaf48","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:a5669f54e898ca298a3679c054f590d997c468c38694a5836ea82cf0e092e436","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:6311a25d6b1364aa885b667f62c292c4658a449f4bb1b9586f8a725259777de4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:0106859ea5feb65d46f2a220dfac4de835b908dd49cc7ec6c7fd4d5dfc048190","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:da079bcfb1494b4bd8df8eaa400461305884aaf4a2665587125c374e20c1cd27","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-09T21:02:57.697293Z","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:27edffd9e3130b5f20b5978409369c4d61787f3f13a69aeac64600bf41b67ba7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:61f5ddf09b9638e79e49ce271bfc9b2b6c125b9dc4cf7323d65c428b4d98a3b5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:e3b5e69d47d3c54acec36b1ac0ddd1a0b71076fe7e9183a6998c6ae62d6b24aa","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:c35e5954db5f43d72d86f058ec6fbe36558fe64ce44eaae4ecbd172802079d58","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:9f72c607d3df12a77bf61db7ebefd78ac98dd93b8e0b07256ad5947e41f955a0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:804e285bf7fae0fda39211ff69713fdeaec113292e9ad91cc47fd9efaed479f0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:47e08f5e3e1d8144d583ea7b8efe35c9d77a1b9da616e0228ffb6c42face1c0e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:3664d08ee0d2584af6adc2e83b712bea842f9fe373e5ff1237f8104084f0d2ea","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:e8683109c0368ddef66668c9a10c56a8044cb94c940252d6387e7bd0780a0857","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:2d93e3ee8bd038ab91988659ac0775f39e5c4ff6f98a95f9f8bfc81ecf078491","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:7479862ab30d2f405bfd235a0abc18a2411197796830a8e61db00cd2cdac96cf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:1c2d367692f06a6e8371e69eae5e20faae9318a38a2d91cfc0122b888e2d0a75","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-09T21:02:57.697293Z","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:dd8e28a4a15d0c96cad1305d4188fd5c45b1270b1c2b232d5c98e30e3171354f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:7158b6d9e31d9600e0b2add0f8b17dcf0fa583d3f6cba51b85d29ee37bb66a40","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:f21f05b6f42a48755a1f01550654fa40567a86d101b0169356f3cade20affe4c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:0336b9ae5e84a42b2cee401f874da3dc450eff5470fb2606cfa9aadad439b083","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:2b68f721fd160137c2064a9993ab53acab4cc67aebd45ed67f8015c13ee62c79","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:f3a3285846e588dfa50d0f145652704c3f38a0abb40d96edba7342cfc8d2dd87","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:ab0b74efc4f198bcc5b4c3f6fb2d3e30a7a80c3fd073af561cbe2ddeea6b8109","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:2fd9fd755c633252c5adaeee137211b4bf187c44f5cd4213f0a11e6b3167d4f8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:f3e2556d0cb23544c31379a65faf67d22415917683a55742dac76f0be39443aa","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:d7b7bd6fc43bee71886af488bda9bc220d65919fa25839554133ab6e1bdb2b20","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:4ce495e82c9c68071b418bf75bc99e23bab50a74a1a4ca6e84ec16d44b464c42","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:c5fe375af8d761edc4a392041dafef26855b44987d5710dde48953ab71ce1094","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:23a36471b3b03b240a220ad73e370c445df138b9bde3ec28224bcb157596ea6e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:d2eb162e16fb69e51eb4b51ddf9c2a8d412e561c3f853c2f3f2dcf0458878dba","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:58acf173c5ecf5d84efc0dae4aa50ef9516334fd400983d4d77329b95d79139b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:73267f81744bd81770789eaa9dcd8e499100f25b11a381d1dc4a9e5ca4e754d5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:e597902f722ca49ae451717a934ad4bbc0ffb38fa3ec1bef51896bc8cd64f8aa","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:fafbf443b04c15b37d23f5d87ecbb3601aefe3fada0391c4a159240519ee2629","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:8a120510022856768c54a91770a48c1a95bb73997c327b02c72073f50f91dc65","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:c21865979b901c824ca438ec2022aebd5b2855daa8573709f694d62aa3f85aa9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:f659b7df685c9bbf365842b70b21e191546ff5449779b014f0c167ff349b9f0f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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:f61eb39a71dee8144962624282a16a164b49ff1f213010398bc76fe0872ccbd2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:02:57.697293Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 2 inbound Pith citation observations for arXiv:2507.20773."}