{"as_of":"2026-08-23T03:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b6df04b4fb5d7411d446e13317d528d49aa271088139734d539b9db77159505","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T05:45:41.905519Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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-08-15T14:34:49.732621Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T02:06:42.041788Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","submitted_at":"2026-05-21T18:06:17Z","title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","version":1},"cited_work":{"arxiv_id":"2605.22929","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.22929","snapshot_observed_at":"2026-07-10T02:06:42.041788Z","title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","venue":"math.OC","work_id":"10df103a-3a75-4ee4-908a-b87a65034e80","year":2026},"citing_paper":{"arxiv_id":"2607.08753","last_updated":"2026-07-09T17:51:07Z","snapshot_observed_at":"2026-08-16T04:34:21.788283Z","submitted_at":"2026-07-09T17:51:07Z","title":"Finding Simple Proofs for First-Order Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-10T02:00:42.021537Z"},"links":{"cited_paper":"/paper/2605.22929","citing_paper":"/paper/2607.08753"},"observation_digest":"sha256:5b513d3575f24c297decb18ff9c00dc55b17da40e93df0aeabeabd53ce8d9e7c","observation_id":"58b73b54-e19f-4665-8c90-fd110e1ee47b","resolution":{"observed_at":"2026-07-10T02:06:42.043357Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","submitted_at":"2026-05-21T18:06:17Z","title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.22929","snapshot_observed_at":"2026-08-15T14:34:49.732621Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.07407","last_updated":"2026-08-07T16:54:17Z","snapshot_observed_at":"2026-08-18T05:15:24.844029Z","submitted_at":"2026-08-07T16:54:17Z","title":"A Domain-Specific Harness for End-to-End Automation of Optimization Research","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T14:34:49.732621Z"},"links":{"cited_paper":"/paper/2605.22929","citing_paper":"/paper/2608.07407"},"observation_digest":"sha256:3c8583c429b9033501931d790a31d704286cfb7950893ccdd682b4d72e4c6d2f","observation_id":"a59b147c-9559-445e-8b01-94fdb2db0e2b","resolution":{"observed_at":"2026-08-15T14:34:49.732621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.22929/citation-record","integrity":"/paper/2605.22929/integrity","json":"/paper/2605.22929/citation-record.json","paper":"/paper/2605.22929"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-024-02164-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Mathematical Programming","work_id":"cadfbda9-7dce-45ee-8b37-aaec4b747e32","year":2025},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":1,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:0ae003b31e9833fc5a7adc28a3709e7a7523632751de41988066311575412a91","observation_id":"1970b36b-becd-4bac-8fd1-c1867cad51c7","resolution":{"observed_at":"2026-05-25T05:46:39.527961Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:18.371698+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:18.371698+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3708502","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of the ACM","work_id":"6c0d60c3-362e-43fe-a1a6-9a133bf9c591","year":2025},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":2,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:c6da73c342b267a6f8f7e99dcf4b084e4fb52d39396c26773d3ef2dc14191125","observation_id":"97489db2-da8c-4f74-949e-d8f7f3490100","resolution":{"observed_at":"2026-05-25T05:46:39.470954Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:16.623653+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:16.623653+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s10526","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Auslender and M","venue":null,"work_id":"10df3a63-27ae-4f5b-9f2f-128db7a55c4c","year":2006},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":3,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:2b5e9d2e7104918099b715936a1d17504ccf34da15c1e60562ac199892c849af","observation_id":"9e668936-9ad5-45f1-8ea6-049a984e0a22","resolution":{"observed_at":"2026-05-25T05:46:39.483858Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:25.000627+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:25.000627+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-022-01903-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Barré, A","venue":"Mathematical Programming","work_id":"6cda53a1-e4c5-4f65-8963-1ee00d860d31","year":2023},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":4,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:3a9e337d7749888c689670263df0f90b1dc8240f874dee483635c84acf6528a1","observation_id":"09f019f5-5f6f-4dba-9319-d4ee68763919","resolution":{"observed_at":"2026-05-25T05:46:39.464468Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:25.508976+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:25.508976+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-48311-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CMS Books in Mathematics","venue":"CMS books in mathematics","work_id":"36cf15c3-4550-45af-9dff-c0dbc2ba6529","year":2017},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":5,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:db322127cf07109fb3ca1a19b53fd3f4022e128223bed5075b6da1f4b1f7dffb","observation_id":"ae9ed1d6-3c22-48c2-b897-4434fc3771ed","resolution":{"observed_at":"2026-05-25T05:46:39.487035Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-07-11T03:18:54.853556+00:00","source":"paper_reference_links","state":"open"},"event_date":"2020-01-13","event_type":"correction","notice_doi":"10.1007/978-3-319-48311-5_31","provenance":{"observed_at":"2026-07-11T02:59:02.678249+00:00","source":"crossref","source_record_id":"10.1007/978-3-319-48311-5_31->10.1007/978-3-319-48311-5:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611974997","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Beck.First-Order Methods in Optimization","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"04368896-824a-49e9-be92-3551072b73fb","year":2017},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":6,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:41616087286345ccfdf42fe0823a52b883fd7d80a84ba5e8fe4a390ac88a705b","observation_id":"4eedef34-d751-4181-b7c3-83182e71c152","resolution":{"observed_at":"2026-05-25T05:46:39.405484Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-30T11:25:53.245677+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-30T11:25:53.245677+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/080716542","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Beck and M","venue":"SIAM Journal on Imaging Sciences","work_id":"6a55b5f1-3c7e-4234-9bf1-59e14b878072","year":2009},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":7,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:e4378947cc54b268798aad5caeaa9603d54a75bd64198c363eeb62e85bc80db4","observation_id":"2793bff0-2cff-4b74-aa13-45006625b9e9","resolution":{"observed_at":"2026-05-25T05:46:39.512257Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-10T23:49:24.390514+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T23:49:24.390514+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-15T04:41:51.649998Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"cited_work":{"arxiv_id":"2506.23756","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.23756","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bok and J","venue":null,"work_id":"8b6f20cf-970e-43fd-8d83-f96455b0c44a","year":2025},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":8,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"cited_paper":"/paper/2506.23756","citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:b4c7753023ea2969a9222ad7290118a93ffb0b609cd0474076da5d3b68cb7a75","observation_id":"ea425a05-a6b3-477b-b673-21ba95424366","resolution":{"observed_at":"2026-05-25T05:46:39.653191Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Bok and J","venue":null,"work_id":"6d963546-5f1d-4a64-8f20-c415a5c88f4e","year":2025},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":9,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:aae981e99a12242d0975493d592188af7d05f5d7b383162b6a50e17e229d9da1","observation_id":"f346be7f-c116-4971-9159-e82368d172a1","resolution":{"observed_at":"2026-05-25T05:46:40.595708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Bravo, R","venue":null,"work_id":"35b40d3c-f80f-456a-bceb-6baf7dde3cec","year":null},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":10,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:0034235f8962ec54b6701167c2da441c8594181d41969587cc8a4dba3f28ddc2","observation_id":"854270bb-07f8-4557-a400-dbc57ac67d66","resolution":{"observed_at":"2026-05-25T05:46:40.604871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.15996","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"dfeec8fa-8010-4c9a-b556-d18bdfe4136b","year":null},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":11,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:58181ce447c1af240bdd598d9c4364e5e5e96b9050fb88f61e7ed3d7d2482b83","observation_id":"2f7b36b5-f0d1-4323-a893-4543c64db740","resolution":{"observed_at":"2026-05-25T05:46:39.648169Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/050626090","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Multiscale Modeling and Simulation","work_id":"e89b5c47-4ced-4738-a57f-1511003b7b01","year":2005},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":12,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:156d0aa76af83bd9d7215c285564cf7af0f0f009a962dcc76bcf81ea2e2e35b9","observation_id":"c0f012f9-7836-4c4b-9f3e-e3f1e27d6447","resolution":{"observed_at":"2026-05-25T05:46:39.463792Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:26.426159+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:26.426159+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-022-01830-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Mathematical Programming","work_id":"9df7333d-46c4-47cd-845a-4a6c5ba2eaf2","year":2023},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":13,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:49e84f689058e160f43b91c899d65fa3c0c14b390f1e57e77d5a15dc9f195892","observation_id":"71a8e3bf-af47-4880-a879-4e2b1ed4215f","resolution":{"observed_at":"2026-05-25T05:46:39.453060Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:26.845803+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:26.845803+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-023-01973-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Das Gupta, B","venue":"Mathematical Programming","work_id":"444cc052-8ab5-469f-b162-188e3df73a3a","year":2024},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":14,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:47ae203b9f295d89094ba0acc35ace037f975f7a8be41a73674103537530696c","observation_id":"13874e8d-3a69-430a-a93d-bd5d47bb2bcf","resolution":{"observed_at":"2026-05-25T05:46:39.497824Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-07-11T03:19:04.320038+00:00","source":"paper_reference_links","state":"open"},"event_date":"2023-07-12","event_type":"correction","notice_doi":"10.1007/s10107-023-01998-6","provenance":{"observed_at":"2026-07-11T03:05:32.5779+00:00","source":"crossref","source_record_id":"10.1007/s10107-023-01998-6->10.1007/s10107-023-01973-1:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/2400000036","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"d’Aspremont, D","venue":"Foundations and Trends® in Optimization","work_id":"2606ec82-a46c-410b-a6a6-94b8cfcea2a8","year":2021},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":15,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:ee3e97df0a907c646332ca3bdb21112406a65b074caa8ba3b918b9c5554b7644","observation_id":"34021898-e949-4f45-8fd1-3ab33d4ebec3","resolution":{"observed_at":"2026-05-25T05:46:39.478089Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:16.948906+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:16.948906+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jco.2016.11.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The exact information-based complexity of smooth convex minimization , journal =","venue":"Journal of Complexity","work_id":"0a061449-e737-4035-99a1-35ded9c32c70","year":2017},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":16,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:6a60f1cd6a962bb2129c7fbde7b3795efb3cb7dbc1765a7f7ac3130a875c9f3e","observation_id":"bf18ccce-4f45-4c88-a2da-df0d4cd9ea02","resolution":{"observed_at":"2026-05-25T05:46:39.521174Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:17.062627+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:17.062627+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.101590","doi":"10.1016/j.jco.2021.101590","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Drori and A","venue":"Journal of Complexity","work_id":"5388262f-14e2-4599-8a57-3ebe6f89cfe2","year":2021},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":17,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:85e3f51f835e0dac04541a120af4fcad84e03b88359c4d8417d7ff265bcb8128","observation_id":"006e0968-f231-4238-a815-314668fa8371","resolution":{"observed_at":"2026-05-25T05:46:39.431477Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:28.67247+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:28.67247+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-013-0653-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Drori and M","venue":"Mathematical Programming","work_id":"90fb11b6-9908-4779-acc2-17a62d9a7afc","year":2014},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":18,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:31e4ab100d183ba04bf9f26d6ed19e2588538e4ee80c3bae2170044261dd968b","observation_id":"5df72c73-ec9d-4ffa-8c4d-a1f48d29b096","resolution":{"observed_at":"2026-05-25T05:46:39.474273Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:17.125906+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:17.125906+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5824fd4a-53eb-4824-b955-9e573d95cf17","year":2024},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":19,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:ce529ad0b3c13cba4e1689c5eae4720cc570129f2d2d4a5de216ff3cf8970f53","observation_id":"8586f25c-021e-41bc-8a07-df47b77fecaf","resolution":{"observed_at":"2026-05-25T05:46:40.599162Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1134/s0965542518010050","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Computational Mathematics and Mathematical Physics","work_id":"f968e069-3020-4271-a571-a9cc44c3bf6f","year":2018},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":20,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:319638cf515744b875abe78c117c474b8cad5791af982b9053a3cbdb5bd4239d","observation_id":"bdedacb3-8604-4d8a-ab88-5b6a5919f096","resolution":{"observed_at":"2026-05-25T05:46:39.455061Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:29.509577+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:29.509577+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01386013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Numerische Mathematik","work_id":"1b84577b-d47a-4d2f-976d-5c72014ebb0b","year":1961},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":21,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:ba6f92b390d026e3255f14974da042290c2a6d6f57954c577b70dcf7348d23ff","observation_id":"72e5386f-0419-4d38-bec4-d9bbe15135a7","resolution":{"observed_at":"2026-05-25T05:46:39.490800Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:29.876057+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:29.876057+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01386014","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Numerische Mathematik","work_id":"fcbc51b5-d399-4444-a1c4-90e82c227561","year":1961},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":22,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:5e0747a99e78adc6c70bd6942585a5f17b41da167c0fd0e912f6ac6a56dcb1a6","observation_id":"5fc4e973-e616-4fbf-88f5-2a8ad6d51700","resolution":{"observed_at":"2026-05-25T05:46:39.477185Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:30.23343+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:30.23343+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s12532-024-002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Goujaud, C","venue":null,"work_id":"f129a918-2c25-4760-8d47-d7baa492c992","year":2024},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":23,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:1d1e2acafc28b094711922b8ed497966dc7e66bc83961b31472895d9abd279ee","observation_id":"a9033e8b-2250-4d2e-a55e-dd8e64c5c05b","resolution":{"observed_at":"2026-05-25T05:46:39.456736Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:30.559014+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:30.559014+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/23m1588408","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"7f517e13-14da-4a91-a79a-c8c65d0656f8","year":2024},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":24,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:16e744292f10ef2aef0cf3bd1af6c57b9c721d5847abd39fcb769d8ffeabc323","observation_id":"8266fb53-ee5f-4d9f-8530-126dc739914b","resolution":{"observed_at":"2026-05-25T05:46:39.493146Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:17.308542+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:17.308542+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0802032","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"5a5b27da-d36b-45f1-9be3-5a6855ad2435","year":1992},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":25,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:fec783ba18c224012867a0fc7610346e37ac1ade7ee9820544421a2a23ff3e09","observation_id":"04f1302c-59c9-4dcd-ba6b-117483f0ea4c","resolution":{"observed_at":"2026-05-25T05:46:39.421457Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:31.35716+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:31.35716+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/s0002-9904-1967-11864-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bulletin of the American Mathematical Society73(6), 957–961 (1967)","venue":"Bulletin of the American Mathematical Society","work_id":"2cd47fad-d740-476d-8ffb-96688306dc4a","year":1967},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":26,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:cafda9d5cb8438e9ae7a55a4b4b1e957fa3771a49cc94aa392bb1d01dd82570e","observation_id":"348e17b6-23a5-481f-902b-43faf3f8ff2c","resolution":{"observed_at":"2026-05-25T05:46:39.471592Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:31.70188+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:31.70188+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20773","last_updated":"2026-08-19T00:09:58Z","snapshot_observed_at":"2026-08-22T23:09:07.936891Z","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms","version":2},"cited_work":{"arxiv_id":"2507.20773","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.20773","snapshot_observed_at":"2026-08-20T00:26:12.270051Z","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-18T17:31:05.291952Z","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:dfdab36c71e77d7b03dda1f517630f9bb1e1fdf67cb9ddcc08ccffe9607829a7","observation_id":"bf1566f0-729a-420c-98f1-07d8cd67af1e","resolution":{"observed_at":"2026-08-20T00:26:12.270051Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-021-01643-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Acceleratedproximalpointmethodformaximallymonotoneoperators.Mathematical Programming, 190(1–2):57–87","venue":"Mathematical Programming","work_id":"a0d2acfe-17ed-4eb5-abcf-fc8efab9759c","year":2021},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":29,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:38ed10ab231bebd5c4a058e63f718c35d84348ae0d1b65817b072838f7c6db96","observation_id":"ba0d1140-a496-48d1-99e3-d03ab3f137ca","resolution":{"observed_at":"2026-05-25T05:46:39.487605Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-17T19:51:19.97451+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:19.97451+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-015-0949-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kim and J","venue":"Mathematical Programming","work_id":"2788c427-9481-4ad1-a25f-9d1bd941f370","year":2016},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":30,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:5928b8dcfdf5f211c871a89bda0168223a6b762f97455a7f31f5aee4663ec760","observation_id":"0fb54796-b433-434d-b287-d4a5500eeff0","resolution":{"observed_at":"2026-05-25T05:46:39.397899Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-17T19:51:20.45268+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:20.45268+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/17m1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kim and J","venue":null,"work_id":"b5a83eec-2b80-4a29-a80b-61a17341d5c7","year":1920},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":31,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:209f93a8685f33a8fe8222e5242c5d96856c476df4c3bcb49b55e8107be09381","observation_id":"0d5e29ab-f59f-4ae4-95a4-79c0780f9508","resolution":{"observed_at":"2026-05-25T05:46:39.532299Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10957-020-01770-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kim and J","venue":"Journal of Optimization Theory and Applications","work_id":"52a029c5-9798-476f-85ad-82f38f16ec4f","year":2021},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":32,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:ea20d24a810432aefb8a47763eecc3062445f55b5410163d16b863ed81ef913f","observation_id":"6bb721ce-2e2a-4c25-9d20-5bf77cc58b1b","resolution":{"observed_at":"2026-05-25T05:46:39.501555Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:17.598729+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:17.598729+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13965","last_updated":"2026-06-06T14:09:50Z","snapshot_observed_at":"2026-08-20T11:06:23.390976Z","submitted_at":"2025-03-18T06:57:36Z","title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts","version":5},"cited_work":{"arxiv_id":"2503.13965","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13965","snapshot_observed_at":"2026-06-09T02:06:02.463959Z","title":"First-order projected algorithms with the same linear convergence rate bounds as their unconstrained counterparts","venue":null,"work_id":"bdc11ff8-2547-4d7a-be61-1bd1538b79a9","year":2025},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":33,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"cited_paper":"/paper/2503.13965","citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:318a34c7ea7fb3238ac2a2233927e427b0c1da25ae83904f4e30ab81d95def98","observation_id":"9e8220c7-6319-4ea7-97f9-952e706b0d3c","resolution":{"observed_at":"2026-06-09T02:06:02.463959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11590-020-01617-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Optimization Letters","work_id":"77945739-57fe-4ee0-a5f2-33759e46817b","year":2021},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":34,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:4cc94647a9cefe989f6b9274cf515a1f11203261c7b055533d23c4ff49550f29","observation_id":"cbead15c-752c-46b6-a083-fd387a980e38","resolution":{"observed_at":"2026-05-25T05:46:39.505002Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-17T19:51:22.011436+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:22.011436+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0716071","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lions and B","venue":"SIAM Journal on Numerical Analysis","work_id":"f04f8189-92ec-4d62-a636-e46a51866030","year":1979},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":35,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:39ec136a05e6d201db56ff5620c144960264e7196a5456e74cf434bbaa8b4b55","observation_id":"4e3417fc-afe6-4849-b881-a2dcbbf35141","resolution":{"observed_at":"2026-05-25T05:46:39.484235Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:33.817117+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:33.817117+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Nesterov","venue":null,"work_id":"ebb73b65-f4d1-46bd-8aa5-5a4b5afa94fe","year":1983},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":36,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:a3728a77b387f818900fe48f71cd4521cda7e44e0293c8694e051d4b5e3d2ffe","observation_id":"9635d838-6e55-4e07-a537-ed6ae8f68a6d","resolution":{"observed_at":"2026-05-25T05:46:40.586400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-012-0629-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Nesterov","venue":"Mathematical Programming","work_id":"7cbe0b35-d1dc-46e2-bd7f-69a7c35e9dd3","year":2013},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":37,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:2ddbed3f8f0dda401548c66269dc96835ac70c86092ffa60928cd08559a57bc1","observation_id":"85fd357b-f01c-427d-9d7c-ba00850832ce","resolution":{"observed_at":"2026-05-25T05:46:39.474923Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:34.154832+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:34.154832+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"record/2650891","doi":"10.1007/978-3-319-91578-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Nesterov.Lectures on Convex Optimization, volume 137 ofSpringer Optimization and Its Applications","venue":"Springer Optimization and Its Applications","work_id":"a16f7852-81f5-4728-a8c2-f2b611eefba9","year":2018},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":38,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:0b9f5231870800a58aea95c916648fe88cccdff65dfb67a33ba0f95163647cc4","observation_id":"9fae1ff5-405f-42f0-91d4-2c9fd8a75ff8","resolution":{"observed_at":"2026-05-25T05:46:39.517042Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:34.492165+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:34.492165+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":"Park and E","venue":null,"work_id":"c64926cf-404c-4a4d-b1b5-55980e50f411","year":2022},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":39,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:5d9e748f044dc885308462bc74fdd4b9bad06730a8e0e20b2d463a9e8446d7d8","observation_id":"7d0e49bb-a502-4f35-a54e-20dcb5c77068","resolution":{"observed_at":"2026-05-25T05:46:40.592425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0022-247x(79)90234-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Mathematical Analysis and Applications","work_id":"8ffd3c6a-f802-4ba1-a825-9d9fc1310ec3","year":1979},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":40,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:1462dd3b3f971ff34ba8254f0a4b8b4ebf0b631bbf238c5394a319826b7b0a3f","observation_id":"df044f66-5a07-4acc-a1cb-e28a91d3b4c6","resolution":{"observed_at":"2026-05-25T05:46:39.508871Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:34.844264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:34.844264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"55e4ad52-56f1-45ac-956a-f8b330baa17d","year":2023},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":41,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:1e80f297b7afb5ad38928e16843d72959a17a340bd3db570fd8c0b1b1a3f9969","observation_id":"3fae1041-22af-42b5-b79b-81f304b3e256","resolution":{"observed_at":"2026-05-25T05:46:39.443512Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:35.1847+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:35.1847+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-016-1009-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Taylor and Julien M","venue":"Mathematical Programming","work_id":"de50d8e2-b1b3-4810-bd15-8a51564da77d","year":2017},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":42,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:42ac7281319fbcac658b063dd1ab063cef25f02121467ab5de2c62849a37e678","observation_id":"cff34b3b-bb14-4829-b7cc-5bb83e4478d4","resolution":{"observed_at":"2026-05-25T05:46:39.524786Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:18.221948+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:18.221948+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/16m108104x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"736be1b0-56ac-4ad3-a0ff-ebd32c5d9541","year":2017},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":43,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:2443817f632fd00c5a7a5346fdbe28a91a6721e206492f9b9d4c1675fef8a62a","observation_id":"4552c994-4fab-49ae-99d8-5073e0dd24bd","resolution":{"observed_at":"2026-05-25T05:46:39.490298Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-17T17:38:18.161267+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-17T17:38:18.161267+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10957-018-1298-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Optimization Theory and Applications","work_id":"397e5173-9d46-4506-9101-56fd2534242d","year":2018},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":44,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:92b95e64d264724dc0925931bd626c5d77426e2bad4c4a2c159ec5be56ad8c8b","observation_id":"12604922-36e9-424d-bb7b-ca04d4e1402d","resolution":{"observed_at":"2026-05-25T05:46:39.495143Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-17T19:51:25.945974+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T19:51:25.945974+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"90e58b81-f669-45ce-a696-3c05e805183e","year":2008},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":45,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:cff45428c73ebcc089b813f1c02732e1b67026f7d612691c030a3e32b5fccda7","observation_id":"15462603-3389-4f6c-b4b1-5a5aabdc4b44","resolution":{"observed_at":"2026-05-25T05:46:40.589419Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09295","last_updated":"2026-08-06T12:45:28Z","snapshot_observed_at":"2026-08-20T04:34:46.021808Z","submitted_at":"2025-09-11T09:35:40Z","title":"A $\\sqrt{2}$-accelerated FISTA for composite strongly convex problems","version":3},"cited_work":{"arxiv_id":"2509.09295","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09295","snapshot_observed_at":"2026-08-07T01:35:52.425958Z","title":"Ushiyama","venue":null,"work_id":"f880b4d2-83f5-419e-b893-2b424c86af2f","year":2025},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":46,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"cited_paper":"/paper/2509.09295","citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:79106c6b980c8f86f0e92cc73cb100071b8e33a5931a8400dc1e154da47b6b8c","observation_id":"317b8a1f-2429-45d2-9e94-8d087928bedf","resolution":{"observed_at":"2026-08-07T01:35:52.425958Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2017.272240","doi":"10.1109/lcsys.2017.2722406","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Van Scoy, R","venue":"IEEE Control Systems Letters","work_id":"95d268bb-5b46-495f-87f9-2262eb56a123","year":2018},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":47,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:ad80dce384bfce82950e36c2020f469d7b78b6e3ce16a283ecfc9567ebb4992a","observation_id":"2e45f2cc-9b1e-47da-b8b6-5ba6c11c9831","resolution":{"observed_at":"2026-05-25T05:46:39.449044Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:36.899919+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:36.899919+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-05156-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Springer series in computational mathematics","work_id":"370afef9-c011-463e-818c-6702f87f0e9a","year":2000},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","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":48,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:e9e4b465b97d20fd656e605f29b754a2378f94188c276801de743c188962cfc2","observation_id":"c4903507-680b-4357-a084-13f35f9f2950","resolution":{"observed_at":"2026-05-25T05:46:39.467210Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-25T18:24:37.339271+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:24:37.339271+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T17:31:05.291952Z","submitted_at":"2026-05-21T18:06:17Z","title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":40,"verified_fuzzy":4},"total_outbound_references":47},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 2 inbound Pith citation observations for arXiv:2605.22929."}