{"as_of":"2026-08-09T02:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0edc1efc5fedf8edac32c78560e41f334612cf0a7d63a9f8382d537b6acc69d4","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:42:48.422266Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-04T23:25:19.685884Z","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.650291Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23756","snapshot_observed_at":"2026-08-04T23:25:19.685884Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06676","last_updated":"2025-09-13T01:38:34Z","snapshot_observed_at":"2026-08-09T01:26:42.702686Z","submitted_at":"2025-09-08T13:35:41Z","title":"On the convergence rate of the Douglas-Rachford splitting algorithm","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T23:25:19.685884Z"},"links":{"cited_paper":"/paper/2506.23756","citing_paper":"/paper/2509.06676"},"observation_digest":"sha256:15260a7daab3033ea744c0a5b2ef6a65153d95e6d6430ecc903aaa4d26e11aab","observation_id":"90d69565-72d2-494d-8904-e5038aefbda2","resolution":{"observed_at":"2026-08-04T23:25:19.685884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","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-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":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:66825b13e6bb2ca5ff081fd68a24a83891316eaa4b865e6074e06938588f797b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.23756/citation-record","integrity":"/paper/2506.23756/integrity","json":"/paper/2506.23756/citation-record.json","paper":"/paper/2506.23756"},"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-06T21:42:57.340555Z","title":"Altschuler","venue":null,"work_id":"e26dea99-1c51-4451-a003-bae7cccf57d3","year":2018},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.331012Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:1433487c7af3a935414d1a7fe1c24b6c8b35ba006200bd7d58b431739d786db8","observation_id":"b77c7635-fa32-4018-94a5-68d38dc21bcd","resolution":{"observed_at":"2026-08-06T21:42:57.394526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:57.153136Z","title":"Altschuler and Pablo A","venue":null,"work_id":"9cc67b49-385e-45fa-a604-e1c7e8e4b553","year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.388334Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:c13e70c4c49747ca5819e2f91b890fd15fe7a5f73d08f1e07f16b1d2a612b7c1","observation_id":"c119deae-ea8c-4302-addf-2d2b28d251e6","resolution":{"observed_at":"2026-08-06T21:42:57.235937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:57.014687Z","title":"Altschuler and Pablo A","venue":null,"work_id":"8ae787b0-897f-47de-8073-446529ecf097","year":2025},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.492806Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:c3209384f8ecd67db51a6869d2c1bc1ae57be0058a668eba9f4d9fcad079898d","observation_id":"87b2b12c-7eb9-43ac-98a2-bee839bcd2a6","resolution":{"observed_at":"2026-08-06T21:42:57.055071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:56.925078Z","title":"Gradient descent with non-convex constraints: local concavity determines convergence","venue":null,"work_id":"650f2009-10f7-4125-9396-3d338da95522","year":2018},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.549227Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:73957d36282123956a4e48cbeb4890aff3cfeff1f6ed9f291945ac112b8e4f1f","observation_id":"885a3b2c-23d5-4899-a07c-8ac7471fa778","resolution":{"observed_at":"2026-08-06T21:42:56.965981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:56.792684Z","title":"Complexity guarantees for Polyak steps with momentum","venue":null,"work_id":"21f175bd-552f-4ae4-a30f-74f06adbb7fe","year":2020},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.628698Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:2fa877526190b8a6c64929bd900d934c77d37e2d5e5a77b643f752c34eac5175","observation_id":"864a8da7-6951-4986-84f8-2a4c5d73fb8a","resolution":{"observed_at":"2026-08-06T21:42:56.878686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:56.602869Z","title":"First-order methods in optimization , volume 25 of MOS-SIAM Series on Optimization","venue":null,"work_id":"73224a7d-5a3f-4c1a-9c59-877f252482e5","year":2017},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.750131Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:e203f85273fb6d533e95b96ba2faa1d9c64f4638c159891e3a849ad69c6a5233","observation_id":"ea80ff7b-0ea6-4990-918a-11e42f4e0251","resolution":{"observed_at":"2026-08-06T21:42:56.723415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:56.452868Z","title":"Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems","venue":null,"work_id":"f37d5c49-b84d-4b02-ad5f-1db5c731058c","year":2009},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.838984Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:09786dfd88260071cdd1375d48ea70c3e397c89391b9b200a6ce3aab763e54a2","observation_id":"56096418-803f-4028-bfad-9cebaa82b10b","resolution":{"observed_at":"2026-08-06T21:42:56.518910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:56.304532Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":"a0635664-f3a0-4e08-98fb-40e133ed4bec","year":2009},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:43.910768Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:37ac45213b7af2cf5084452f17c60bc05958db8233ab41f55069c279ceb00280","observation_id":"6c268027-ab84-435e-aa52-3051634f8f8c","resolution":{"observed_at":"2026-08-06T21:42:56.375570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05497","last_updated":"2025-06-23T15:12:13Z","snapshot_observed_at":"2026-08-09T01:26:33.904926Z","submitted_at":"2024-12-07T01:58:13Z","title":"Accelerating Proximal Gradient Descent via Silver Stepsizes","version":2},"cited_work":{"arxiv_id":"2412.05497","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.05497","snapshot_observed_at":"2026-08-06T21:42:49.076703Z","title":"Accelerating Proximal Gradient Descent via Silver Stepsizes","venue":"math.OC","work_id":"30a08dae-e260-4554-bb0a-be490fd0fb85","year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.030081Z"},"links":{"cited_paper":"/paper/2412.05497","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:e2ea3654ecc3c8d5f41b6b31253d2fb0a30e24777bd5a9fea96fcf2514a93525","observation_id":"625a377f-86a5-41ea-b0dd-e7e1eefcc10a","resolution":{"observed_at":"2026-08-06T21:42:49.130869Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:56.099590Z","title":"Hendrickx, and Fran¸ cois Glineur","venue":null,"work_id":"8fdd76df-e8f6-439f-a56b-10190230f12a","year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.136753Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:9f2d1e23749afe4f57c91b143b2c121c3e8d6c5f865c9fc1c974176a86e4bdcc","observation_id":"c7072d16-3c7b-4e5f-bed4-5bda377af4fb","resolution":{"observed_at":"2026-08-06T21:42:56.224906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:55.903238Z","title":"Convex optimization","venue":null,"work_id":"b60d5f55-2adb-424e-937f-887bea798be4","year":2004},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.288102Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:ecf443096cd2f226a6e15e5f0e7ace60ca8a4e6df49eb028058ede20c66339c6","observation_id":"2c0db447-504f-4db3-a124-5d5826e4080a","resolution":{"observed_at":"2026-08-06T21:42:55.995457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:55.740422Z","title":"Convex until proven guilty","venue":null,"work_id":"e0a18fe5-0af0-47ef-8ea1-12079973c0d2","year":2017},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.351116Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:bb9f1eb400f5ee1d1d017b6ee1306e6ed0e6597dc075782188e216cd7c636834","observation_id":"6a0fe383-962d-41c1-a25d-02bbd577d1d6","resolution":{"observed_at":"2026-08-06T21:42:55.800591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:55.547673Z","title":"Performance estimation of the gradient method with fixed arbitrary step sizes","venue":null,"work_id":"4cf4c683-f05e-4d67-add3-31ea136bfff8","year":2019},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.434978Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:52e3ced98fa084ef2c8c61d1485765aeb063cab2b0bce684f10b0751fb31e4d5","observation_id":"72b6d89b-d7d9-4725-8153-33fe420838ce","resolution":{"observed_at":"2026-08-06T21:42:55.638824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:55.358778Z","title":"An iterative thresholding algorithm for linear inverse problems with a sparsity constraint","venue":null,"work_id":"fe07b555-529c-433a-a1ed-119f503d7501","year":2004},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.539786Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:704a348f45a3cc6b3c88c6024d899cb56548eebf140a6fd0efb9fa7f9d869e50","observation_id":"71c3aa7a-ba6c-4b4f-a2ee-00a5d23543e2","resolution":{"observed_at":"2026-08-06T21:42:55.444895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:55.229273Z","title":"The exact information-based complexity of smooth convex minimization","venue":null,"work_id":"0672fb7b-0843-422f-b128-43c5bf28ef59","year":2017},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.609569Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:9620077a3f9daf3eeae5f62ffb2d043f47f994c38c6e35c500cd61672971a92b","observation_id":"3629a130-30ca-4298-9199-210d83d39459","resolution":{"observed_at":"2026-08-06T21:42:55.284335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:55.099200Z","title":"Performance of first-order methods for smooth convex minimization: a novel approach","venue":null,"work_id":"39dbcb3b-b46f-4a41-8777-6b0efc09252f","year":2014},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.669285Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:93c059ad781dccdcc4112d56d21aebf8270cb5e43689b26283a605c7f3150653","observation_id":"e87699b9-506d-4d8d-a53d-01fc56a73e20","resolution":{"observed_at":"2026-08-06T21:42:55.159245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:55.002982Z","title":"An optimal variant of Kelley’s cutting-plane method","venue":null,"work_id":"c8c38807-2f2a-4368-8475-ffb6f6b21036","year":2016},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.769246Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:cb33d6eb11fcabb8f7b97c3563baab7e4cae8decbf79cb0b3df69170ceed526d","observation_id":"ebaa6ba0-c3f2-4a34-a89f-04e8f40b6d12","resolution":{"observed_at":"2026-08-06T21:42:55.042741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:54.884338Z","title":"Acceleration methods","venue":null,"work_id":"e11294e8-d186-4035-b77b-790e3ee220d2","year":2021},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.833746Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:cd663cd5c78759caaf1a6178f8a5e0ae0e665d1130a015c8ddc81df3e149e7da","observation_id":"b823abd2-cfa3-4fac-8932-71ea4f6d52e3","resolution":{"observed_at":"2026-08-06T21:42:54.937025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:54.760454Z","title":"Worst-case functions for the gradient method with fixed variable step sizes","venue":null,"work_id":"88d81c31-0999-4921-9542-4797254340ce","year":2022},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:44.905771Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:a82b6551e6690646db4d36ab557b6e82cbf65361537e28045753e47781105fc8","observation_id":"9efae749-38aa-4d93-996b-b1faac095525","resolution":{"observed_at":"2026-08-06T21:42:54.819840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11235","last_updated":"2024-03-09T13:28:29Z","snapshot_observed_at":"2026-08-09T01:25:35.554813Z","submitted_at":"2023-01-26T17:18:36Z","title":"Handbook of Convergence Theorems for (Stochastic) Gradient Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11235","snapshot_observed_at":"2026-08-06T21:42:45.007133Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.007133Z"},"links":{"cited_paper":"/paper/2301.11235","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:18ccbe6a55834240e606abca6f68fdb0c5b36883efb328a11c2000b8615d7e6c","observation_id":"900b19bc-3ea6-4693-8941-ab9d58e7d8f5","resolution":{"observed_at":"2026-08-06T21:42:45.007133Z","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-06T21:42:54.660112Z","title":"Accelerated gradient methods for nonconvex nonlinear and stochastic programming","venue":null,"work_id":"897c8c5a-d4be-4939-8334-2c5f935881f9","year":2016},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.106993Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:9e6aa2893596301d3344184c5de5c6132b0ce5312bc63dd85f351fa70d92f13d","observation_id":"c93a77f3-9e81-4dab-a4e5-855b75fe536e","resolution":{"observed_at":"2026-08-06T21:42:54.695357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-06T21:42:45.203249Z","title":"Optimal first-order methods for convex functions with a quadratic upper bound","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.203249Z"},"links":{"cited_paper":"/paper/2205.15033","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:eeab0a2d1d9b3a0c1dd047b9ef54dde3cd55b893447c3f23510c910bbfcc8cba","observation_id":"71d37c4d-db4b-447c-b513-3cbe9af16775","resolution":{"observed_at":"2026-08-06T21:42:45.203249Z","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-06T21:42:54.539952Z","title":"Provably faster gradient descent via long steps","venue":null,"work_id":"f4631ec7-8275-497f-895a-256174a822f3","year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.298266Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:f7ca1e7646c151f15b4aeb7a31fd604ccea510a8f6e127b7d1c5ffd6765c3bbd","observation_id":"3ecf411c-fd1e-4a3a-8a28-b035b22f6aaa","resolution":{"observed_at":"2026-08-06T21:42:54.597556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:45.370514Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.370514Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:771f3c9acedee8ef8ade5d76e33d458e8bef1d947b6a114c737ed17ae665de92","observation_id":"cd3327f5-0060-427b-b293-80eef223ef91","resolution":{"observed_at":"2026-08-06T21:42:45.370514Z","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-06T21:42:54.420872Z","title":null,"venue":null,"work_id":"5103d648-7661-4347-b7c2-1a273a34d96c","year":2025},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.444027Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:f64e55817a1333f568f6fce4d83455a753d64117a8ed146032b630da6149bf98","observation_id":"bc74984d-f404-4167-bf14-0adf6ee51f2a","resolution":{"observed_at":"2026-08-06T21:42:54.490288Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03175","last_updated":"2023-01-09T05:24:45Z","snapshot_observed_at":"2026-07-06T14:39:27.590535Z","submitted_at":"2023-01-09T05:24:45Z","title":"Tight Convergence Rate in Subgradient Norm of the Proximal Point Algorithm","version":1},"cited_work":{"arxiv_id":"2301.03175","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.03175","snapshot_observed_at":"2026-08-06T21:42:48.828926Z","title":"Tight Convergence Rate in Subgradient Norm of the Proximal Point Algorithm","venue":"math.OC","work_id":"edbab4b7-8769-41f5-8b7a-4f71baf86707","year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.513657Z"},"links":{"cited_paper":"/paper/2301.03175","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:6a6103627f223d15a7174cea8d3bbcdb32ea080f2642b62e8eb4e16df37aec50","observation_id":"8d7c192f-3c24-4d1b-baf0-56fe404b87e4","resolution":{"observed_at":"2026-08-06T21:42:48.887582Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:45.592609Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.592609Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:3cc0d9e1843b461f47a6cd60401e851c9c5f9006c9c68f27bddd47a9f7025f39","observation_id":"99a6cabf-5d02-44fb-9c3e-0a904f841233","resolution":{"observed_at":"2026-08-06T21:42:45.592609Z","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-06T21:42:54.303058Z","title":"Linear convergence of gradient and proximal-gradient methods under the Polyak- Lojasiewicz condition","venue":null,"work_id":"08c46db2-e016-4fd1-a5e7-5ef3b737a149","year":2016},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.687710Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:181cd2b5aed46da3d381e6d8680b63fa1ab424dad563385e4f57864ecbb957b2","observation_id":"8ba5a14f-9aae-404d-ae03-3e1797e4eed4","resolution":{"observed_at":"2026-08-06T21:42:54.356123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:54.201020Z","title":"Wainwright","venue":null,"work_id":"2ccfee2a-a85a-43d6-a3ee-8b8a8a114108","year":2019},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.789203Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:d5a7d69f69157b971b7d837f02796f71ef5f6feaf087e865a22603c94be39050","observation_id":"e055ad94-43ba-45b8-b931-baf51f2536fe","resolution":{"observed_at":"2026-08-06T21:42:54.239244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:54.062027Z","title":"Accelerated proximal point method for maximally monotone operators","venue":null,"work_id":"2e92dfaf-4337-4cec-8049-36cee0eddc8d","year":2021},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.864574Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:654dd6a3bbb75b297377b65d9050557fb03818cb7abd872ba5ca418005c15c5d","observation_id":"2420b481-9786-4b21-bbe5-9eaa3a5e38b9","resolution":{"observed_at":"2026-08-06T21:42:54.133679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:53.823194Z","title":null,"venue":null,"work_id":"2f05a290-9c22-45a0-ba4c-3a453ea5df12","year":2016},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:45.967805Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:f3ea9fa2d987dc8eb3d3bb750c4edb2b87eaf4b667237a239e017d4076478482","observation_id":"c5334e48-133a-438c-bdf4-673775451bdf","resolution":{"observed_at":"2026-08-06T21:42:53.951831Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:53.624412Z","title":null,"venue":null,"work_id":"579a1a5c-d999-4235-a13c-908013186ae7","year":2018},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.054690Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:fb8acad79625039b5ab2b20b2fad22f2f08023a74a1e6ca41d2806fdb6a14171","observation_id":"b0a2c20f-958e-4f08-a230-6b635268bdc5","resolution":{"observed_at":"2026-08-06T21:42:53.743892Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:53.414343Z","title":null,"venue":null,"work_id":"1354baa1-a026-48a5-94fa-02f0df94b0ab","year":2021},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.133572Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:ee2a47594f393a1a25343dff42afe71462ffec9fa4210c6f8732924db8564d62","observation_id":"b35cc1e7-653e-4591-bd1c-bf06207a8c10","resolution":{"observed_at":"2026-08-06T21:42:53.535991Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:53.230948Z","title":null,"venue":null,"work_id":"93b6f048-67f0-4339-99e7-1a680b0d790a","year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.201735Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:ed214828f7a23d21fe173cacfc0886f58a835344ff96adba868661d345a2706c","observation_id":"a0f2493e-f40f-41c7-84d8-a8563db4ed95","resolution":{"observed_at":"2026-08-06T21:42:53.328666Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-08-06T21:42:46.312523Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.312523Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:f23bf349e839b6a0f3d1a083d5badf112f6b28b738cfc1bab4b2bfb02260516d","observation_id":"7a058809-194a-4218-9fe8-7bbcae291bd9","resolution":{"observed_at":"2026-08-06T21:42:46.312523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04427","last_updated":"2025-03-26T17:42:07Z","snapshot_observed_at":"2026-07-06T20:02:21.509050Z","submitted_at":"2024-12-05T18:51:26Z","title":"A Proof of the Exact Convergence Rate of Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04427","snapshot_observed_at":"2026-08-06T21:42:46.408799Z","title":"A proof of the exact convergence rate of gradient descent","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.408799Z"},"links":{"cited_paper":"/paper/2412.04427","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:ab597ddfdc639c177c6e6d8e4c70896b4ede27db1a641f8dc02f5c2c04577c70","observation_id":"7794470f-aa50-498d-bbfe-48e144a7f3e4","resolution":{"observed_at":"2026-08-06T21:42:46.408799Z","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-06T21:42:53.002451Z","title":"A geometric structure of acceleration and its role in making gradients small fast","venue":null,"work_id":"00b7f67e-7156-4ece-b35a-04c3cd68ffcb","year":2021},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.508249Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:f0ed2d8dc20de6c2fee3512b84e57cd679f96c58ac9ba539a52993bb876d50f1","observation_id":"3123da13-f13f-4f7b-a045-d19180e8bc78","resolution":{"observed_at":"2026-08-06T21:42:53.121510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:52.816528Z","title":null,"venue":null,"work_id":"8d53b1e7-c5e2-46e1-8dec-9b6a2b64460d","year":1983},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.582046Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:b9cac715779e9a4d7970f1d19f07400b48bd6ccd04743995405f0f8cd6e092fe","observation_id":"6636c21f-36de-46fd-bef9-b66b52b5662c","resolution":{"observed_at":"2026-08-06T21:42:52.889895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:52.609405Z","title":"Lectures on convex optimization, volume 137 of Springer Optimization and Its Applica- tions","venue":null,"work_id":"a61f9b55-c3cd-4bbb-9e81-c6785a01bb62","year":2018},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.665991Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:07f6b97dbfa0ea2345a813dff85b9caf3ecab3cfeb97c08934535ff4e733d0ce","observation_id":"548d4050-1d50-4b15-b223-969c8db92c9f","resolution":{"observed_at":"2026-08-06T21:42:52.682454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:52.368500Z","title":null,"venue":null,"work_id":"89cb4163-b86e-483e-adf2-e6fbdf3c0292","year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.759493Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:04ebe64c9355d123bd83d4db3519c8c496325684dc9281e8ad8e1cf9e7b80915","observation_id":"7266b5f1-8f14-49f0-a329-8f1d3c5fdd2d","resolution":{"observed_at":"2026-08-06T21:42:52.467556Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:52.096718Z","title":null,"venue":null,"work_id":"6b4dbf87-1564-4e20-926f-8f860f5d140a","year":2022},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.849086Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:0efa64d324ac91057c3f42c83a8bfdee46c6afd944e6b244a31f9311616c3ece","observation_id":"1292ea56-e2b8-41d0-ba98-78cc71b0e4f8","resolution":{"observed_at":"2026-08-06T21:42:52.223922Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:46.943274Z","title":"Exact worst-case convergence rates of gradi- ent descent: a complete analysis for all constant stepsizes over nonconvex and convex functions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.943274Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:d382882cda20e92268ff0c576865d805444f5f95c01effaf70fae2747231fecb","observation_id":"5f5dc421-1693-4e89-a45b-d80890d17043","resolution":{"observed_at":"2026-08-06T21:42:46.943274Z","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-06T21:42:51.887866Z","title":"Ryu, Adrien B","venue":null,"work_id":"d0be1b4f-e028-4f7d-9a31-fde8326d0923","year":2020},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.031542Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:1f49fa551db565f1b960851fcba2c08a200d747231472e7beed7b7db9e8e00c5","observation_id":"bf83d78f-27a6-4dca-b398-f53b98ee7abf","resolution":{"observed_at":"2026-08-06T21:42:51.982246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:51.645682Z","title":"Cand` es","venue":null,"work_id":"cfcdb2c0-030b-4f2e-9b42-3a0a03a5ab76","year":2016},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.115062Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:7f7a7aaf87d2620f3bd188d539e48ed3196fe9fc787b31b084f74b6adbc2c2ed","observation_id":"57cea053-b7b1-4999-bece-1399717cc806","resolution":{"observed_at":"2026-08-06T21:42:51.775945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:51.472015Z","title":"Towards principled and systematic approaches to the analysis and design of optimization algorithms","venue":null,"work_id":"7279bd8c-7bfb-4a21-adee-83215539a5b5","year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.209318Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:2d6e0a78342d410f56fe38129c289189f8ccf19681237ad39004cd07e2195571","observation_id":"b29c0d8b-41e5-49bb-9a16-9845338b77c6","resolution":{"observed_at":"2026-08-06T21:42:51.536223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:51.265454Z","title":"An optimal gradient method for smooth strongly convex minimization","venue":null,"work_id":"bedf9033-3db8-47a4-8f25-94ea72bb0cce","year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.288337Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:3e4e669dd74173bb50689412d1ee03672650f1cb3ea1c3b2ad9eff5f556088ea","observation_id":"ef535c4a-63e1-4aeb-b8cc-22252d48ebc4","resolution":{"observed_at":"2026-08-06T21:42:51.332042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:51.060079Z","title":"Taylor, Julien M","venue":null,"work_id":"a7a84bfb-aaa0-4995-84f6-a51e197d0462","year":2017},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.404633Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:29840382197f01bf0b39d2bb67b4b306c4aec70ce346ada23262c8576e090b97","observation_id":"c7aa4965-3696-43be-838a-d15bac7ada34","resolution":{"observed_at":"2026-08-06T21:42:51.155842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:50.913072Z","title":"Taylor, Julien M","venue":null,"work_id":"a4480a70-03ef-4a9d-a6c1-33b0de396841","year":2017},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.489680Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:3eda1f627ac33ae77de4ea7bc62f3eeed9d4f81c599c0da0b47eb8d14bf9cf89","observation_id":"41672592-86d1-4b0e-aa60-210f07a5e0ad","resolution":{"observed_at":"2026-08-06T21:42:50.983497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:50.703314Z","title":"Taylor, Julien M","venue":null,"work_id":"233dede1-4ecc-4735-a5ea-a130aa2ed3d5","year":2018},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.589284Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:235fd678c206992b47eb239a96f3673b81d8ae0db2e3bb076d5df8986ee799a1","observation_id":"5164bf74-0a5b-498a-a7b5-296923c4e391","resolution":{"observed_at":"2026-08-06T21:42:50.803036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:50.337464Z","title":"An elementary approach to tight worst case complexity analysis of gradient based methods","venue":null,"work_id":"5dbfe229-4b75-44ab-831a-e50e7ed5e745","year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.648944Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:8b519bfb0d7e78379e8d21ee3b86c11fa0becfd8feebc8bf7ca11914fd2cfa7b","observation_id":"7e9ca9af-9826-44b4-8c9a-6ecc0c041f33","resolution":{"observed_at":"2026-08-06T21:42:50.497294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08890","last_updated":"2024-10-11T15:07:32Z","snapshot_observed_at":"2026-07-06T19:31:53.397265Z","submitted_at":"2024-10-11T15:07:32Z","title":"Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08890","snapshot_observed_at":"2026-08-06T21:42:47.709422Z","title":"Relaxed proximal point algorithm: Tight complexity bounds and acceleration without momentum","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.709422Z"},"links":{"cited_paper":"/paper/2410.08890","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:88b5f990e3ef2d9375441dffaa1558628bb195ca1d5104c71f1709878d6b5cb1","observation_id":"10e15512-0dac-4f1a-9a71-603e3cb55c5f","resolution":{"observed_at":"2026-08-06T21:42:47.709422Z","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-06T21:42:49.953570Z","title":"Wilson, Ben Recht, and Michael I","venue":null,"work_id":"ebc077f0-75d4-4a27-ab0d-4d7f1af42f4c","year":2021},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.792497Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:d06a5acd7cd88c8d82594704e1debee6c694a7452cb42191c573ce58fefa68f3","observation_id":"3d0e54d1-9632-4d3f-999e-7a70dae51fe5","resolution":{"observed_at":"2026-08-06T21:42:50.111642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:49.631208Z","title":null,"venue":null,"work_id":"f332224f-3f36-42ff-af52-c621468156da","year":2021},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.872901Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:e2419b02d15e18384f2ee314a53afd005504a4b16575b42d6200fdb0995e018d","observation_id":"d39132f2-de77-4db2-99a0-20201f4ce2c0","resolution":{"observed_at":"2026-08-06T21:42:49.751195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:49.581469Z","title":null,"venue":null,"work_id":"27a6c14f-ef80-4aeb-8de0-dd7d5e36af81","year":2025},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:47.932706Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:b08d62e8fa14ad4882d43635f017dd8206532bc63dd7dc7b433a7bcfc40676d1","observation_id":"430673ab-e990-4c3b-b273-cbc491aaa80b","resolution":{"observed_at":"2026-08-06T21:42:49.586920Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:49.458482Z","title":"On Richardson’s method for solving linear systems with positive definite matrices","venue":null,"work_id":"99eba710-c257-4833-a139-eb6d6aad3b5f","year":1953},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:48.026469Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:6d0ce26ba6055d29af7a66cb981bdf1c8ea42431dffac33f009930cd13dac1ab","observation_id":"0005a0ac-8683-4880-b62b-4cda51f44166","resolution":{"observed_at":"2026-08-06T21:42:49.569384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:49.367801Z","title":"The exact worst-case convergence rate of the alternating direction method of multipliers","venue":null,"work_id":"6682a149-b59e-4479-8ce2-fd4f12332c3d","year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:48.123599Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:fde6fa6a21a01a5a9d19a084c685b9f70a33f0d97a5cf4b42e26aee23cd95b6a","observation_id":"6fd719b8-6c83-403e-b72a-92a813227ede","resolution":{"observed_at":"2026-08-06T21:42:49.414602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.11134","last_updated":"2023-07-20T16:27:12Z","snapshot_observed_at":"2026-07-06T15:56:38.019661Z","submitted_at":"2023-07-20T16:27:12Z","title":"Exact convergence rate of the last iterate in subgradient methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.11134","snapshot_observed_at":"2026-08-06T21:42:48.196514Z","title":"Exact convergence rate of the last iterate in subgradient methods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:48.196514Z"},"links":{"cited_paper":"/paper/2307.11134","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:6f51548d16aca8ef5afca4ebf9623d6ec591dfda75c30ec18e321633ad641cad","observation_id":"24a51a21-9221-4c02-addb-0ecc48c4b659","resolution":{"observed_at":"2026-08-06T21:42:48.196514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:42:48.272002Z","title":"Accelerated gradient descent by concatenation of stepsize schedules","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:48.272002Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:c5f7563e852bbe933ca82d21ec11e2b4651c143d80b46a9baf120bcf499c022b","observation_id":"94000ddd-c7e1-4b30-9498-e88f6227365d","resolution":{"observed_at":"2026-08-06T21:42:48.272002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17668","last_updated":"2024-12-08T11:22:26Z","snapshot_observed_at":"2026-08-06T09:48:47.368191Z","submitted_at":"2024-11-26T18:29:44Z","title":"Anytime Acceleration of Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17668","snapshot_observed_at":"2026-08-06T21:42:48.332185Z","title":"Lee, Simon S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:48.332185Z"},"links":{"cited_paper":"/paper/2411.17668","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:bc26a65e11a97d75d5a22b45d1dfbd1e638ef4b7f1630a054d69d3c582910c86","observation_id":"6f8b47d5-1abb-4fc0-aed4-61944243ff42","resolution":{"observed_at":"2026-08-06T21:42:48.332185Z","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-06T21:42:49.207409Z","title":null,"venue":null,"work_id":"d937de32-2b77-49ec-89fb-133f677e3989","year":null},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:48.422266Z"},"links":{"citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:de2f8b4d53f9e511305fac982de7b9eb505f3c7fa108f0d8988725f5a9883d95","observation_id":"37b6c6bd-9034-4999-862d-ceade1fdeb34","resolution":{"observed_at":"2026-08-06T21:42:49.286486Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":2,"verified_fuzzy":36},"total_outbound_references":60},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 2 inbound Pith citation observations for arXiv:2506.23756."}