{"as_of":"2026-08-08T17:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:231f63dee835fe09e9323c6063503c74682aacc1cd8f9ed504a854ca2971353f","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:07:43.756190Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T18:04:57.789902Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"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-07T10:58:57.125355Z","title":"Characterizing & finding good data orderings for fast convergence of sequential gradient methods","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.04126","last_updated":"2025-06-04T16:17:25Z","snapshot_observed_at":"2026-08-08T15:52:38.460566Z","submitted_at":"2025-06-04T16:17:25Z","title":"Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.125355Z"},"links":{"cited_paper":"/paper/2202.01838","citing_paper":"/paper/2506.04126"},"observation_digest":"sha256:ebe5d6f881c646253157cb7c5f350005184bed6427fb5feadcdc796ffbfabdc9","observation_id":"fd15921a-006a-4ca6-8b24-b9af0ec8cfbf","resolution":{"observed_at":"2026-08-07T10:58:57.125355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2202.01838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.01838","snapshot_observed_at":"2026-06-30T18:04:57.789902Z","title":"Character- izing & finding good data orderings for fast conver- gence of sequential gradient methods.arXiv preprint arXiv:2202.01838","venue":null,"work_id":"e7589dff-e3c4-4cc1-9806-25aab21698cb","year":null},"citing_paper":{"arxiv_id":"2605.20150","last_updated":"2026-05-26T20:15:21Z","snapshot_observed_at":"2026-08-06T09:22:43.986946Z","submitted_at":"2026-05-19T17:40:59Z","title":"TideGS: Scalable Training of Over One Billion 3D Gaussian Splatting Primitives via Out-of-Core Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T05:42:17.021523Z"},"links":{"cited_paper":"/paper/2202.01838","citing_paper":"/paper/2605.20150"},"observation_digest":"sha256:22f26389f6d53db44a7c5ef5c3533d200e7bbce10ca4a8cb17674b1c2c0694be","observation_id":"c8d52b00-9408-4274-86d1-c1b552cbf2f6","resolution":{"observed_at":"2026-05-20T05:43:05.490010Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2202.01838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.01838","snapshot_observed_at":"2026-06-30T18:04:57.789902Z","title":"Character- izing & finding good data orderings for fast conver- gence of sequential gradient methods.arXiv preprint arXiv:2202.01838","venue":null,"work_id":"e7589dff-e3c4-4cc1-9806-25aab21698cb","year":null},"citing_paper":{"arxiv_id":"2605.20150","last_updated":"2026-05-26T20:15:21Z","snapshot_observed_at":"2026-08-06T09:22:43.986946Z","submitted_at":"2026-05-19T17:40:59Z","title":"TideGS: Scalable Training of Over One Billion 3D Gaussian Splatting Primitives via Out-of-Core Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T18:04:00.730797Z"},"links":{"cited_paper":"/paper/2202.01838","citing_paper":"/paper/2605.20150"},"observation_digest":"sha256:91cc37d27c96239cae1d65a225f6b8fd15f76e6ac16bcd33bc433d26c430b1fd","observation_id":"dea0ac3e-f9eb-4f15-bcac-a255a40dbb88","resolution":{"observed_at":"2026-06-30T18:04:57.791645Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.01838/citation-record","integrity":"/paper/2202.01838/integrity","json":"/paper/2202.01838/citation-record.json","paper":"/paper/2202.01838"},"outbound":[],"paper":{"arxiv_id":"2202.01838","last_updated":"2022-02-03T20:38:42Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2202.01838."}