{"as_of":"2026-08-09T15:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc7a5ab7310527725336e6c9c648421e0f35ad94c14cf4d4cac0512f6b9c32dc","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-07T13:07:45.038972Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2505.23056/citation-record","integrity":"/paper/2505.23056/integrity","json":"/paper/2505.23056/citation-record.json","paper":"/paper/2505.23056"},"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-07T13:07:46.940944Z","title":null,"venue":null,"work_id":"e43535f8-60f3-4b89-a4e0-945c942dfe39","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.560918Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:87ebf9ad93110130ae5a568b7b853926da508652858bc13ca335a875cfe80de7","observation_id":"ddb4126b-60c6-46f0-8dad-213d711aa0a6","resolution":{"observed_at":"2026-08-07T13:07:47.034575Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:48.875891Z","title":"cc/paper_files/paper/2020/file/ 2e2c4bf7ceaa4712a72dd5ee136dc9a8- Paper.pdf","venue":null,"work_id":"0edabd8d-bc06-4e7a-b08a-6824cdbe2394","year":2020},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.270910Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:d4f7ec8d7ea9faff4de85f85b5d745b4c3cef9c309cd956e24abde5bc1adb9db","observation_id":"b9d3cf3b-cc2a-47ee-92f5-4a7c1f784e61","resolution":{"observed_at":"2026-08-07T13:07:48.948896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:46.485902Z","title":"v1fi(t)(z) + tX s=1 (vs+1 − vs)fi(t)(xs) − vt+1f (zt+1) # (b) = TX t=1 γtηt","venue":null,"work_id":"87938b35-67d4-4bdd-87d3-186fcd9a25a5","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.701618Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:8fc11b169f1ac53d7559841df1f97e3509b885cd023c2de7fb2381a0a73d522c","observation_id":"15f4dabc-f8ce-44d2-ad16-f081f6842e60","resolution":{"observed_at":"2026-08-07T13:07:46.597097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01838","last_updated":"2022-02-03T20:38:42Z","snapshot_observed_at":"2026-08-05T07:24:31.338141Z","submitted_at":"2022-02-03T20:38:42Z","title":"Characterizing & Finding Good Data Orderings for Fast Convergence of Sequential Gradient Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01838","snapshot_observed_at":"2026-08-07T13:07:43.756190Z","title":"cc/paper_files/paper/2020/file/ c8cc6e90ccbff44c9cee23611711cdc4- Paper.pdf","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.756190Z"},"links":{"cited_paper":"/paper/2202.01838","citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:66ed19870f056931a31f34a2ae9862ff3753fc54a1af674fe0670ae080023da8","observation_id":"e86cf782-27fb-406d-848c-982168889d7f","resolution":{"observed_at":"2026-08-07T13:07:43.756190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.18452","last_updated":"2026-06-27T04:31:47Z","snapshot_observed_at":"2026-07-06T18:06:53.888474Z","submitted_at":"2024-04-29T06:23:28Z","title":"Random Reshuffling with Momentum: Complexity Bounds and Last-iterate Convergence","version":3},"cited_work":{"arxiv_id":"2404.18452","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.18452","snapshot_observed_at":"2026-08-07T13:07:45.351482Z","title":"Random Reshuffling with Momentum: Complexity Bounds and Last-iterate Convergence","venue":"math.OC","work_id":"463d86d3-2801-4621-9a5e-a8e237f2acc3","year":2024},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.932155Z"},"links":{"cited_paper":"/paper/2404.18452","citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:87c7e4e1cae1033b810dbabe2de3590278925a7940e2da04c6750e3f2db68a64","observation_id":"ff8e7e0b-f911-40ab-9e69-de10017a5006","resolution":{"observed_at":"2026-08-07T13:07:45.443825Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:48.032380Z","title":"Rajput, S., Lee, K., and Papailiopoulos, D","venue":null,"work_id":"170c5755-40fa-4942-9266-879ebe5d8d6c","year":2022},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.015474Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:6971f50268e62016aad50cc622e340fc31fb9eb360d35d699fe2d4946b540d2a","observation_id":"c0079134-3990-40d2-8116-d96e1dae308d","resolution":{"observed_at":"2026-08-07T13:07:48.174382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:47.820096Z","title":"Safran, I","venue":null,"work_id":"57442dda-26ec-4582-b6a8-08ca7eb75383","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.116729Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:1bf7c6a4f100ba56061d939d80d6257d2f58d90c1cd3020c646ecb0a205fd894","observation_id":"ac5d38e6-80ad-48a1-b984-13646c27af95","resolution":{"observed_at":"2026-08-07T13:07:47.902553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:47.411379Z","title":"cc/paper_files/paper/2021/file/ 107030ca685076c0ed5e054e2c3ed940- Paper.pdf","venue":null,"work_id":"ef9606a9-c705-4e1f-8072-75f2fddb0355","year":2021},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.311893Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:943ef093a66a1654973fec135eddee9a78b6789d8ef455c5c2da3ee83f8fc2c7","observation_id":"7b1ed153-35f7-4352-9d71-01c641fd69bc","resolution":{"observed_at":"2026-08-07T13:07:47.492327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:47.208500Z","title":null,"venue":null,"work_id":"fcf2393a-8545-4e5b-bbc4-fbdb1b5ffbef","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.375586Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:ae9efe14e94ffe4fb43dde4296f39389878fb9a7ac841899d9e19d69c95b4aa0","observation_id":"301484d6-f0c7-49e8-8b58-da32245aeb0f","resolution":{"observed_at":"2026-08-07T13:07:47.313240Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.11841","last_updated":"2026-04-16T14:19:35Z","snapshot_observed_at":"2026-07-06T16:50:02.155961Z","submitted_at":"2023-11-20T15:17:20Z","title":"High Probability Guarantees for Random Reshuffling","version":4},"cited_work":{"arxiv_id":"2311.11841","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.11841","snapshot_observed_at":"2026-08-07T13:07:45.178188Z","title":"High Probability Guarantees for Random Reshuffling","venue":"math.OC","work_id":"96866225-cd18-402d-85a2-d70450e95e75","year":2023},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.471432Z"},"links":{"cited_paper":"/paper/2311.11841","citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:b3535f1d02943adf026542e7c1b5a08126d567d04ebdcb5a86d830f67a08f7c4","observation_id":"6730de18-824d-4c37-bf31-80de95a7c58c","resolution":{"observed_at":"2026-08-07T13:07:45.233304Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:46.707124Z","title":null,"venue":null,"work_id":"68d41175-86c5-4e73-8d43-c7ed5764e45f","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.632690Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:01a39ab25dcdbb98752769766ff1586cf80ccd098311390361581fc614eeb768","observation_id":"1837f053-8f02-495b-afa0-bd510cf0dd06","resolution":{"observed_at":"2026-08-07T13:07:46.830747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:46.266615Z","title":"In contrast, Condition 3 is more artificial and makes the rate depend on a new parameter Gψ","venue":null,"work_id":"227ef64a-6bf2-4f70-9ad5-ac8689ae574f","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.801790Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:e6d563ab25a0f85bf26386e19b66cb6e3f1158d0b42c0fd9e94267fb55e6d3b1","observation_id":"9a6b7b10-092a-43b1-8951-7bab5562a0c4","resolution":{"observed_at":"2026-08-07T13:07:46.388076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:46.068029Z","title":null,"venue":null,"work_id":"5bea0b7c-7065-45ef-93b6-748a6b152583","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.863370Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:e52fc8db114af2c90a44c4a8dc2a1fc9ee47819f2a742074e8bb17dc6138ce1b","observation_id":"022c5fc8-5018-419b-8cf8-8b700df47644","resolution":{"observed_at":"2026-08-07T13:07:46.150110Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:45.835830Z","title":null,"venue":null,"work_id":"830911c3-3773-475f-a96f-c6eded7fd18e","year":null},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.949033Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:02572922b4e6c19247d1111a1e351f622676b0863eb62aa21a9157a37f601485","observation_id":"9b9ac05a-bfc2-4561-8b80-0e597ee3874e","resolution":{"observed_at":"2026-08-07T13:07:45.958796Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:45.618164Z","title":null,"venue":null,"work_id":"62251154-5e4e-4919-aac3-6f05be919e2b","year":2020},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:45.038972Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:6e3207d296ae8f548136509bc0a7128f1d0082e69dbc14047520f3c159d66f5f","observation_id":"5e18d6bd-57f9-4d47-b9da-bb5a2e63706f","resolution":{"observed_at":"2026-08-07T13:07:45.691606Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:48.269638Z","title":"Nguyen, L","venue":null,"work_id":"43a170e6-f9ca-464d-94d4-afca14ece006","year":2018},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":137,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.832141Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:d1e509c219bea00e37522fe36de6d0ae59359d9b98e92ff943bf118cad654c1b","observation_id":"9fd5d9a4-6ffc-481e-a559-fc1ccc41d4ae","resolution":{"observed_at":"2026-08-07T13:07:48.390088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:48.745561Z","title":"Bubeck, S","venue":null,"work_id":"35a101ca-e260-4691-8026-c95e2bac9099","year":2012},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":436,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.375290Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:10de4b5e87f6c54f0e247f6f7ea79dcdfad97c92eb81caca5ba602025747cbb6","observation_id":"f290bbd3-22dd-4bbc-8a88-f397893dc043","resolution":{"observed_at":"2026-08-07T13:07:48.799942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:49.015308Z","title":"cc/paper_files/paper/2020/file/ cb8acb1dc9821bf74e6ca9068032d623- Paper.pdf","venue":null,"work_id":"bccb4158-d1fb-4f9b-9cdd-f97d5da782f1","year":2020},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.202385Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:8e79cd35606c99665d623c11b575a62308267cb15a4e951f4ac019ff50165b7b","observation_id":"44994c17-28c7-42cb-96e1-1806bd4d6c2c","resolution":{"observed_at":"2026-08-07T13:07:49.075830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:07:47.624357Z","title":"cc/paper_files/paper/2021/file/ 803ef56843860e4a48fc4cdb3065e8ce- Paper.pdf","venue":null,"work_id":"26501b8b-889a-46c2-906a-6fdc3430b216","year":2021},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:44.202557Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:dff223af27fe9ce548985d0dbed1af0cbbc732d104c6ab8c75ed28411906647c","observation_id":"84a7f8d8-0633-40d8-a2b5-1697396008e7","resolution":{"observed_at":"2026-08-07T13:07:47.724056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11687","last_updated":"2022-12-23T14:51:18Z","snapshot_observed_at":"2026-08-04T03:40:40.503129Z","submitted_at":"2019-07-26T17:39:32Z","title":"Incremental Methods for Weakly Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11687","snapshot_observed_at":"2026-08-07T13:07:43.671793Z","title":"cc/paper_files/paper/2022/file/ 7bc4f74e35bcfe8cfe43b0a860786d6a- Paper-Conference.pdf","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.671793Z"},"links":{"cited_paper":"/paper/1907.11687","citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:e4ac7deaf4c6b446c09b39db78761837ee315b6f6e42dbf2000eaa6213f5c171","observation_id":"9afae420-f153-4eda-b9dd-847475b27e49","resolution":{"observed_at":"2026-08-07T13:07:43.671793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07182","last_updated":"2024-08-13T19:50:36Z","snapshot_observed_at":"2026-07-06T19:00:22.436627Z","submitted_at":"2024-08-13T19:50:36Z","title":"Proximal random reshuffling under local Lipschitz continuity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.07182","snapshot_observed_at":"2026-08-07T13:07:43.571006Z","title":"Cortes, C","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.571006Z"},"links":{"cited_paper":"/paper/2408.07182","citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:172082808ab689381b5014609ca2f7163ddbaad55bfd11361b3ef1839fb11375","observation_id":"53c1189d-b64f-4e1b-8fce-3739af370e5e","resolution":{"observed_at":"2026-08-07T13:07:43.571006Z","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-07T13:07:48.564197Z","title":"cc/paper_files/paper/2024/file/ 84d395725a9b40cb4a49d84478ac24c7- Paper-Conference.pdf","venue":null,"work_id":"ef1816b9-8821-4a3a-a73a-c0435cb7a5d6","year":2024},"citing_paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T13:07:43.467065Z"},"links":{"citing_paper":"/paper/2505.23056"},"observation_digest":"sha256:f92c37ac85e78e42496c05bbad970312663a08fd18da2857fe4fa9b528e4e88b","observation_id":"1796f350-4b1d-4f6f-96c7-4cea85355859","resolution":{"observed_at":"2026-08-07T13:07:48.686586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23056","last_updated":"2025-05-29T03:53:45Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T18:54:25.740181Z","submitted_at":"2025-05-29T03:53:45Z","title":"Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":11},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2505.23056."}