{"as_of":"2026-08-08T02:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2bf1bb5e2cd9611055fa7e123a1a2accd933d457fa95a0e31ddcfc13c7a6482b","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T05:41:02.043326Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T02:28:43.704810Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.30502","snapshot_observed_at":"2026-07-14T02:28:43.704810Z","title":"A parameter-free restart scheme with only a parallelizable log log(1/ϵ) overhead.arXiv preprint arXiv:2605.30502, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11878","last_updated":"2026-07-13T17:57:45Z","snapshot_observed_at":"2026-07-29T20:59:50.579430Z","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T02:28:43.704810Z"},"links":{"cited_paper":"/paper/2605.30502","citing_paper":"/paper/2607.11878"},"observation_digest":"sha256:dcb9fba0f7b11550babd057321a1dbef0e015e278391f0fc601b2e85962cf801","observation_id":"51caff89-c5d4-4b0b-b425-a40da59a0b8d","resolution":{"observed_at":"2026-07-14T02:28:43.704810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.30502/citation-record","integrity":"/paper/2605.30502/integrity","json":"/paper/2605.30502/citation-record.json","paper":"/paper/2605.30502"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T05:41:02.043326Z","title":"A simple nearly optimal restart scheme for speeding up first-order methods.Found","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:1744e82d4210c7fc31e38b4a5999dccda48f5a3f878ee6de2be51489315c56b3","observation_id":"83e1b2a6-6894-4373-9562-8bf6b67c0e20","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Gradient methods for minimizing composite functions.Math","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:f4277090af6dbd30163753aba0e02e5b2c7bfc429dbea1999cfba75afdc715d5","observation_id":"1c004eb6-89f5-4306-b21c-70ba44154cbb","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Adaptive restart for accelerated gradient schemes.Found","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:e48dc50bf63206fb597a3d03487185a719465edc03efc12edb46582b16d3717e","observation_id":"21657a18-fd11-4f01-8f5f-ca93fdaaed35","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:56ebc83a6b131b602ec93d81328954d172f37b9411a7a05a73546d79ef487a3d","observation_id":"2233e884-ecbf-4c99-b60e-0f1c0ceb1fce","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Sharpness, restart, and acceleration.SIAM J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:e0b4c92e87248b31319b84e31097e303b639ef89d8556913efe1089b4a4d20cf","observation_id":"4593217a-f3e0-4c45-aff5-072f21bda7b7","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Optimal methods of smooth convex minimization.USSR Computational Mathematics and Mathematical Physics, 25(2):21–30, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:9394105aa02c1169b8b20416699dae1697640b4c616c03254fe1237828a4cc74","observation_id":"168b9b45-b8fa-42c3-b64c-833fefd12635","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"From error bounds to the complexity of first-order descent methods for convex functions.Math","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:25b155e3cf9bc910a8c5ebb5c2f5eeef7e3112a24cc07e4b518208083173bb4f","observation_id":"49cddeb1-6988-4d24-9077-3c4e43fb5941","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Monotonicity and restart in fast gradient methods","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:3b096c81f582509908bef5f0f1e3d4ae892d9b152533f5661c7999a25023de56","observation_id":"20138c76-b21d-4f01-997b-9690f45ff5b2","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07358","last_updated":"2016-09-23T13:33:46Z","snapshot_observed_at":"2026-07-06T05:11:57.058153Z","submitted_at":"2016-09-23T13:33:46Z","title":"Restarting accelerated gradient methods with a rough strong convexity estimate","version":1},"cited_work":{"arxiv_id":"1609.07358","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.07358","snapshot_observed_at":"2026-07-04T06:59:37.561121Z","title":"Restarting accelerated gradient methods with a rough strong convexity estimate","venue":"math.OC","work_id":"1a27c4d1-22b5-4e96-a0e0-544c53f37eb2","year":2016},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"cited_paper":"/paper/1609.07358","citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:81770633b725dd78a1f078c8ceb5bff837fb74746625a58d06dff82f5ebdc4de","observation_id":"4ff0f49c-64bd-44be-9c32-a1098480575c","resolution":{"observed_at":"2026-06-29T05:43:07.919490Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T05:41:02.043326Z","title":"Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems.SIAM J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:8e098664d3cffb21c2e003622f821f1c902ed9f00c1f5237dd87bf48f191565e","observation_id":"d60abdb5-0949-4e07-bfdc-1d468e04be53","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Adaptive accelerated gradient converging method under Hölderian error bound condition","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:929693bf59bf7c1eddf0c0423cbcf8256429ae7091f5d8fa5d7c47fe2c71f68e","observation_id":"e4dc2277-797f-4335-980f-ab9969dfe233","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Adaptive restart of accelerated gradient methods under local quadratic growth condition.IMA Journal of Numerical Analysis, 39(4):2069–2095, 10 2019","venue":null,"work_id":null,"year":2069},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:e2e871d37e81bdae0516254c379feabca6f3212470ba11fd0d879f231d6df1b3","observation_id":"ba129274-a7e2-4032-947d-2c7173acd42d","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization.J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:72f26da0b2428c2841d2748744e67a33104254cb049e89d6b739c49bf60f2809","observation_id":"8faee97d-8a3a-4397-965f-87da0f378320","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Rsg: Beating subgradient method without smoothness and strong convexity.J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:9de72d3030b0e97754e54d597e364f5a4140e6e7c6ddffcea46155f27bdcfcd3","observation_id":"050900a2-91c7-419c-ba18-cc8662097493","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions.Math","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:3759b8963ef608dd8b7e5e6efcc5d4f50c96deabb45474e6a45b35c8cf5ff424","observation_id":"fddaff19-32aa-466b-a0ac-c17a5278e81c","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Practical large-scale linear programming using primal-dual hybrid gradient","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:c3a0ffed490b1686bfe9df03eb66e29d6f876fcf5bb52a0f1a42d60dfbe0e416","observation_id":"455b59c1-4606-4311-a75b-86b6ca49f323","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01942","last_updated":"2024-07-15T17:51:31Z","snapshot_observed_at":"2026-07-06T18:24:52.604412Z","submitted_at":"2024-06-04T03:50:12Z","title":"The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization","version":3},"cited_work":{"arxiv_id":"2406.01942","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01942","snapshot_observed_at":"2026-06-29T05:43:07.915047Z","title":"The role of level-set geometry on the performance of PDHG for conic linear optimization","venue":null,"work_id":"b4b93629-febd-41bb-98d4-494a53792f0e","year":2024},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"cited_paper":"/paper/2406.01942","citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:f24acfd35c0046d20cf148ef834f9a911511dee4034dcf22d6d9fcf62c3df91e","observation_id":"1ea2ebb0-13a5-4cc6-abc9-61d4bac0ba74","resolution":{"observed_at":"2026-06-29T05:43:07.916945Z","resolver_source":"arxiv_id","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T05:41:02.043326Z","title":"Pdlp: A practical first-order method for large-scale linear programming.Math","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:df61b918aaeaa5b2b6c2b42140e7194cfcb244d62e039ec11567b483b43c3d4c","observation_id":"ed2296dc-5654-4eba-ad21-065dc213df76","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Parnes: a rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals.Numer","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:fafb3068bd36ae689d71e8bc625daf1153e322d2e0b4242bed280d83b27554b3","observation_id":"f67e3da2-c963-4a0c-b909-1189eff87f30","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization.Optimization Letters, 9(5):961–979, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:d05967ddcfaab950fb70881f4d1006c21d0a593beba4da5888cb5bdc3bae804c","observation_id":"77fe4519-c5d3-4db6-8edf-ada6e0a3a1f4","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"New computationalguaranteesfor solving convex optimizationproblems with first order methods, via a function growth condition measure.Math","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:5f5da6ba02507234a31054bb7444bfe7d6250b934f53f25c05391e294adc72c9","observation_id":"ee9c6054-1867-4f49-8ca6-7ccbb4d0210a","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Linear convergence of first order methods for non-strongly convex optimization.Math","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:5b176d71c492801588ec57032394b9cfe32eb527d1b0132bb813956cd6ae5624","observation_id":"be9e9e7c-0610-4441-a2ae-939878153489","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization.Comput","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:721266667a8e3a1ed07003f465adb965f49cffe011025f91ef14c17c99404783","observation_id":"9934e3af-fbbc-4454-9a34-f6386b4d809a","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Colbrook, and Maksym Neyra-Nesterenko","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:a3d4d0ed89778ae22b75b91e0bfc36945ff133f87ff684411a2a50f213fa0162","observation_id":"e20af064-3bb2-4afd-9527-4173af64136f","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Nearly optimal first-order methods for convex optimization under gradient norm measure: An adaptive regularization approach.J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:0caa25f078617dc5319be3c164ac100d4782e5088e37e8ece532e286943d0df9","observation_id":"5d5067da-167a-4b42-8e71-6bed188e271d","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"A method for solving the convex programming problem with convergence rateO(1/k2)","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:f42107954c9c7a0caa5d2beb85d8b87f8812e82bad76a31a80a11c433efa588d","observation_id":"27157f75-a7b8-40ef-951d-199b425ec223","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM Journal on Imaging Sciences, 2(1):183–202, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:3b970a2488a1a9390dd2e7ddb401c3343dd793bf8db73c89450323311d30fd8b","observation_id":"f96d21d1-3b87-44ef-b460-fac3c788e735","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Smooth minimization of non-smooth functions.Math","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:dfb1028816e7cc42c32d788e126851a2e12e1f84b1cc9d475e51487d0033b3cc","observation_id":"c27de9ba-6e86-45f5-abdb-46e048a45237","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Smoothing and first order methods: A unified framework.SIAM J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:07c543c29b6d3cacdc95a7f903dcade6c315f21d606585d876223da233a74078","observation_id":"10c20d84-0372-4d48-b4a0-3a43012131b1","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Making sgd parameter-free","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:1f9cd6a4fc0814f4b0ebbf3eff147eb0dd5d33b43b11087362b4946e1a41cd98","observation_id":"02ceecda-86f7-41ef-93d2-f9ebd2f5c791","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"The price of adaptivity in stochastic convex optimization.Math","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:e31435d5a5ccd69a1ae02b66c217c0f263c0251f3e52a75877b675019ba4d455","observation_id":"fed636bb-c354-46db-ae71-5cc910635f7b","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Nemirovski and D.B","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:047a36b4ebdfa900864a95c7a1d25a9ce4379cd3763f76dedf7e4d7cd51090ec","observation_id":"9cb5d438-a8dd-4fe9-91b7-e0568799f660","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"The proof of Proposition B.4 requires some technical lemmas, given in Appendix B.3","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:016b1a17a66b8bda21720838ff41131d6723ca59283b4dcf6be657acc16b4edb","observation_id":"08b2ae44-52aa-4331-9814-1c9d5334f318","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","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-06-29T05:41:02.043326Z","title":"Note thatc0 > 1and b−a·c0 > 0, so ∑∞ k=0 exp ( −(b−a·c0)ck 0 ) is finite, which further implies ∑m−1 k=0 ϵa k+1 ϵb k =O ( 1 ϵb−a )","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T05:41:02.043326Z"},"links":{"citing_paper":"/paper/2605.30502"},"observation_digest":"sha256:e4023d2fcb2fc01bb20bc1fcedac5e38f641ecb18856ae43049e1300c5a5786f","observation_id":"d6bb9b64-883e-47a7-afa1-ec04969cbed4","resolution":{"observed_at":"2026-06-29T05:41:02.043326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.30502","last_updated":"2026-05-28T19:36:26Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-03T17:53:27.655831Z","submitted_at":"2026-05-28T19:36:26Z","title":"A Parameter-Free Restart Scheme with Only a Parallelizable $\\log\\log(1/\\epsilon)$ Overhead"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":34},"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 34 of 34 outbound references and 1 inbound Pith citation observation for arXiv:2605.30502."}