{"as_of":"2026-08-08T02:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7eb02e386016a902d706effb42149230faed9d68d7b95ae6254131e5057af26e","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:02:09.846505Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-06T06:11:16.417514Z","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-08-06T06:11:16.712711Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"cited_work":{"arxiv_id":"2506.01168","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.01168","snapshot_observed_at":"2026-08-06T06:11:16.712711Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","venue":"math.OC","work_id":"52ad3d89-da93-4df3-a0c6-0b7f877aeb9e","year":2025},"citing_paper":{"arxiv_id":"2508.00775","last_updated":"2026-06-04T16:16:15Z","snapshot_observed_at":"2026-08-06T06:11:14.689302Z","submitted_at":"2025-08-01T16:56:42Z","title":"Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T06:11:16.417514Z"},"links":{"cited_paper":"/paper/2506.01168","citing_paper":"/paper/2508.00775"},"observation_digest":"sha256:17534694e72d749e74cc1734284a0e3ab28f9601417bfb421a8b1933fd591ab4","observation_id":"8d54b0b8-3fb6-4539-b4bd-50f6410e162f","resolution":{"observed_at":"2026-08-06T06:11:16.718435Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01168","snapshot_observed_at":"2026-08-04T09:19:03.492323Z","title":"arXiv preprint arXiv:2506.01168(2025) 2506.01168 [math.OC]","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.16680","last_updated":"2026-07-14T05:00:02Z","snapshot_observed_at":"2026-08-04T09:18:46.869624Z","submitted_at":"2025-10-19T01:21:01Z","title":"HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T09:19:03.492323Z"},"links":{"cited_paper":"/paper/2506.01168","citing_paper":"/paper/2510.16680"},"observation_digest":"sha256:2293417a1e9681919b6d00a7907d6d7d3a9a2ba1c8a068dca2e5dd909df0450a","observation_id":"a2b34fca-48be-46a0-8722-b6ad8ca53ac3","resolution":{"observed_at":"2026-08-04T09:19:03.492323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.01168/citation-record","integrity":"/paper/2506.01168/integrity","json":"/paper/2506.01168/citation-record.json","paper":"/paper/2506.01168"},"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-07T12:02:10.088232Z","title":"On the oracle complexity of smooth strongly convex minimization,","venue":null,"work_id":"c22a4075-9ec6-4929-976c-f75ad8b1ad04","year":2022},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.772027Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:742279beb208e0563b7b715b3a35362b391620c837c2bc3d39fd1a48bc53d6e0","observation_id":"01de164f-1faf-404a-9b85-79d0aa9ab65f","resolution":{"observed_at":"2026-08-07T12:02:10.091782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.077570Z","title":"Smooth strongly convex interpolation and exact worst-case performance of first-order methods,","venue":null,"work_id":"f0b11113-6bab-477c-ac1f-377290e3ae40","year":2017},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.776773Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:a33e60b87d9b561983ad1ca71eb7069db9e122ad5074d5625c0d1b31fd510034","observation_id":"e0d0d32e-bca2-44d0-9d33-1d247342c11d","resolution":{"observed_at":"2026-08-07T12:02:10.081764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.068162Z","title":"Analysis and design of opti- mization algorithms via integral quadratic constraints,","venue":null,"work_id":"3c39d597-e57a-4197-9f58-b71c1aaf77d4","year":2016},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.780167Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:12ce44faaaed5d0625125e7483fc9136b2258a85ce51244c4ee0b377ffd4fa7d","observation_id":"ffe92ee4-cc37-4219-ad14-ec0459335c78","resolution":{"observed_at":"2026-08-07T12:02:10.071470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.058520Z","title":"The analysis of optimization algorithms: A dissipativity approach,","venue":null,"work_id":"eac94e79-92ae-453a-b3c8-835e20863377","year":2022},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.783653Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:2e555c8d5c3f2261d6974c7a0475ff388dfb8d3d53140c039b31e90e1e602851","observation_id":"799a675e-b2d5-4edc-8676-289c6057fdb7","resolution":{"observed_at":"2026-08-07T12:02:10.061947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.048538Z","title":"Robust and structure exploiting optimisation algorithms: An integral quadratic constraint approach,","venue":null,"work_id":"acaa5266-3ef0-48ab-b3a7-8ef96daa2e60","year":2021},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.787084Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:2c69119d45618765f7a8344685c44dd8639a9f528099df25f6a57b880976b9c6","observation_id":"d5140639-976b-44fc-9ddd-1d3a10855b21","resolution":{"observed_at":"2026-08-07T12:02:10.052502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.037633Z","title":"Convex synthesis of accelerated gradient algorithms,","venue":null,"work_id":"37873b29-c22c-4360-b2bd-af8c2b0e8d98","year":2021},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.790766Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:dbde21f665e9002cff17acdaf59f9e114537155ab5980e401c49a66c5d97c7cd","observation_id":"78eb3a5d-0cd9-4c81-95d9-7cad64e7695e","resolution":{"observed_at":"2026-08-07T12:02:10.041607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.026429Z","title":"Direct synthesis of iterative algorithms with bounds on achievable worst-case convergence rate,","venue":null,"work_id":"b0a25ef1-e7ca-46b6-b4f3-54c9d31182ee","year":2020},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.794303Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:2d1a24e4e2da4301ae90393baee272e31e718f360f0f7ab4972b13098ff504f9","observation_id":"165ee448-48aa-4e87-9fce-e3ee77abcc0f","resolution":{"observed_at":"2026-08-07T12:02:10.030579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.016622Z","title":"The fastest known globally convergent first-order method for minimizing strongly convex functions,","venue":null,"work_id":"32b861f6-ee04-4561-8120-a04457b0b71a","year":2017},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.797614Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:891b37a11effe2ead865fe8b2726a0235910ce44c829162930f675ea59c0ca4c","observation_id":"08d9d7fb-4958-4d77-a750-5abd2c5a52fa","resolution":{"observed_at":"2026-08-07T12:02:10.020588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:10.005778Z","title":"An optimal gradient method for smooth strongly convex minimization,","venue":null,"work_id":"2afbd576-b3c5-4126-9574-ce045653a606","year":2023},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.800868Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:2ce990ae15f80d00ac84a4eeea96a3a95d875fb9ca28409f35552a85a2ffff9f","observation_id":"de9cee0c-4b1d-49e1-a2f6-21cd162d3932","resolution":{"observed_at":"2026-08-07T12:02:10.009705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.994973Z","title":"Information-based complexity of linear operator equations,","venue":null,"work_id":"544d9277-ed1b-40d9-bf93-c68625dd8175","year":1992},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.804374Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:cc0f1ac2e90d07643d942d3560a426dd0067efc50cb85957481824768fc3d013","observation_id":"f58232fc-c7d1-49b0-80dc-d863fafdfc51","resolution":{"observed_at":"2026-08-07T12:02:09.998537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.985323Z","title":"Nesterov, Lectures on convex optimization","venue":null,"work_id":"1bacdc25-9867-496c-b256-49c73a490538","year":2018},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.807711Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:092bab403a23c0fbe451a7205afb213378f39663397380981535132a353a2b87","observation_id":"1de7d933-1104-4fd0-8ae4-9b7b95fce612","resolution":{"observed_at":"2026-08-07T12:02:09.988933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.811532Z","title":"Some methods of speeding up the convergence of iteration methods,","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.811532Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:730ee2044505e0c5585003312ce1701208bb0f839f8ce14dd727bd6e74529725","observation_id":"8e91f9d1-cd55-4a95-9ba5-8dd76707d2c9","resolution":{"observed_at":"2026-08-07T12:02:09.811532Z","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-07T12:02:09.969172Z","title":"Global convergence and asymptotic optimality of the heavy ball method for a class of nonconvex optimization problems,","venue":null,"work_id":"27b46c5b-6408-49bb-965e-91e1af76bad5","year":2022},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.815254Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:465804dfec29e348b15695fb2d1018e00e8660ee86766277c5ef8afaa29f2ab3","observation_id":"7c226094-ac33-41e2-be33-7707f2cb0b6d","resolution":{"observed_at":"2026-08-07T12:02:09.972808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.959044Z","title":"A generalized accelerated gradient optimization method,","venue":null,"work_id":"db53ea77-2aed-40b9-8dc1-34b2b56445b4","year":2024},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.819376Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:6b639c98396edac4d22f2b9d57c2f0d4bf769f48c7787c19ab92fa84a24fc53a","observation_id":"740bb502-d27e-433e-aed5-f24b756eb4d5","resolution":{"observed_at":"2026-08-07T12:02:09.962946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.950059Z","title":"Ortega and W","venue":null,"work_id":"97c448a6-c4d5-4cf3-99cf-f4ea2aa872b1","year":1970},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.823231Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:258b43dfb9b0f156a9ff502259e957cab2d3891d7e17e496dfa30cd1362220b4","observation_id":"c6fe49be-9302-4d70-93b8-99f3222a1292","resolution":{"observed_at":"2026-08-07T12:02:09.953248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.940513Z","title":"System analysis via integral quadratic constraints,","venue":null,"work_id":"963d0f93-893a-4d27-bef2-2d651db4362b","year":1997},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.826404Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:dc996b090285c0317b1aa78c47198bea11506bb7a02970928d110f71316dc17e","observation_id":"6f3e2d25-97a7-4001-8c71-7bfeed9b37c0","resolution":{"observed_at":"2026-08-07T12:02:09.944291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.929170Z","title":"Absolute stability analysis of discrete time feedback interconnections,","venue":null,"work_id":"8f7884a6-59e3-43ab-bd97-3a161642263a","year":2017},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.829561Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:8ddc057cfc497e2f04a3d8271b49bc2497aa105f453baf7f818ad7f6b13f6491","observation_id":"c94f88c2-5f80-413c-b7fe-6083b295572f","resolution":{"observed_at":"2026-08-07T12:02:09.933494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.918555Z","title":"Zames–Falb multipliers for quadratic program- ming,","venue":null,"work_id":"edd1b033-a8bc-4e62-ace5-8a957225560b","year":2005},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.832558Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:5af08a19bfd8aece64271dc4f7cdd7974a63169bb89d9b0bdbf82afee20cec34","observation_id":"61c97d1f-842c-416e-b738-0147a597d0cd","resolution":{"observed_at":"2026-08-07T12:02:09.922112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.907715Z","title":null,"venue":null,"work_id":"416c415d-258d-4d36-aaea-27d1bb2726e8","year":2002},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.835893Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:d0255a077b63ad9c293aa224b9b1f51297d581d7e6139b898dde76dbcfd26be4","observation_id":"488eba40-ceb4-4273-9de1-7844ccb946ce","resolution":{"observed_at":"2026-08-07T12:02:09.911466Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.895447Z","title":"Tradeoffs between convergence rate and noise amplification for momentum- based accelerated optimization algorithms,","venue":null,"work_id":"6e7c9348-f8aa-45f4-ab09-72df83d20951","year":2025},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.838995Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:36838a0f7ea585aca5afac2bfa8ccb1cf1ad889ed8b3a6cbfe25274d37c837dc","observation_id":"5efda61f-eec6-448a-a3b2-d7e81fca2453","resolution":{"observed_at":"2026-08-07T12:02:09.901201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.884776Z","title":"Fadali and A","venue":null,"work_id":"c169e5f3-92f0-441d-8a79-b78b89648993","year":2009},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.842553Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:2f07e8ad8435784b91cd14bf3c23c449fc834d67361fc972801d85db928a04a8","observation_id":"08734edd-fe38-44ae-928c-3b69d6c036de","resolution":{"observed_at":"2026-08-07T12:02:09.888195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T12:02:09.872479Z","title":null,"venue":null,"work_id":"10e4c33b-726d-4bb1-a4f5-ed041c284338","year":2007},"citing_paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:09.846505Z"},"links":{"citing_paper":"/paper/2506.01168"},"observation_digest":"sha256:73e0583b5c6afc0c2bca8b4562bfb36753c1b921f6b7de225d55e32e8a675135","observation_id":"044e49c9-4877-45d8-ad64-14e6999eca6e","resolution":{"observed_at":"2026-08-07T12:02:09.876980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01168","last_updated":"2025-06-01T21:01:11Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T11:48:09.303720Z","submitted_at":"2025-06-01T21:01:11Z","title":"The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":22},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 2 inbound Pith citation observations for arXiv:2506.01168."}