{"as_of":"2026-08-11T02:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4c8711a28098d27817fd4b0ebd626bce28b65e93c25f898c4e3d40e4ac5b046c","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-05T18:41:17.589351Z","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-05T18:41:22.504093Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1710.09430","last_updated":"2018-07-21T21:13:33Z","snapshot_observed_at":"2026-07-06T06:06:06.859267Z","submitted_at":"2017-10-25T19:28:13Z","title":"A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)","version":2},"cited_work":{"arxiv_id":"1710.09430","doi":null,"metadata_source":"pith","pith_arxiv_id":"1710.09430","snapshot_observed_at":"2026-08-05T18:41:22.504093Z","title":"A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)","venue":"stat.ML","work_id":"4e06af59-8e74-48b4-b5f4-65b44361dadc","year":2017},"citing_paper":{"arxiv_id":"2508.14338","last_updated":"2025-08-20T01:26:56Z","snapshot_observed_at":"2026-08-09T18:29:11.382186Z","submitted_at":"2025-08-20T01:26:56Z","title":"On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T18:41:17.589351Z"},"links":{"cited_paper":"/paper/1710.09430","citing_paper":"/paper/2508.14338"},"observation_digest":"sha256:525d637254050096fc04a104160d8988d36476336a36c43a0e3c7a64a1eedead","observation_id":"adedd71d-8d4a-4fc1-af59-3aca0247fecb","resolution":{"observed_at":"2026-08-05T18:41:22.593576Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.09430","last_updated":"2018-07-21T21:13:33Z","snapshot_observed_at":"2026-07-06T06:06:06.859267Z","submitted_at":"2017-10-25T19:28:13Z","title":"A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.09430","snapshot_observed_at":"2026-08-04T09:38:48.774020Z","title":"A markov chain theory approach to characterizing the minimax optimality of stochastic gradient descent (for least squares)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.14717","last_updated":"2026-07-27T17:12:10Z","snapshot_observed_at":"2026-08-07T22:51:49.378334Z","submitted_at":"2025-10-16T14:17:38Z","title":"Seesaw: Accelerating Training by Balancing Learning Rate and Batch Size Scheduling","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T09:38:48.774020Z"},"links":{"cited_paper":"/paper/1710.09430","citing_paper":"/paper/2510.14717"},"observation_digest":"sha256:a1739e22ab20274fd76876bb34f711f2eac17bdf43f37f80a70306aca2a1d60a","observation_id":"3b5ce679-d2f7-4092-aa1b-8d95d27549b7","resolution":{"observed_at":"2026-08-04T09:38:48.774020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1710.09430/citation-record","integrity":"/paper/1710.09430/integrity","json":"/paper/1710.09430/citation-record.json","paper":"/paper/1710.09430"},"outbound":[],"paper":{"arxiv_id":"1710.09430","last_updated":"2018-07-21T21:13:33Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T06:06:06.859267Z","submitted_at":"2017-10-25T19:28:13Z","title":"A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1710.09430."}