{"as_of":"2026-08-05T04:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9cd2ce1fe0e846558a479ec01816e6df0ca10ef05c8960ce8f47b21fd336a224","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T06:41:55.732230Z","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-30T06:44:18.924141Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.16168","last_updated":"2025-06-03T13:26:09Z","snapshot_observed_at":"2026-07-06T20:26:50.822135Z","submitted_at":"2025-01-27T16:07:26Z","title":"Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity","version":3},"cited_work":{"arxiv_id":"2501.16168","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.16168","snapshot_observed_at":"2026-06-30T06:44:18.924141Z","title":"Ringmaster asgd: The first asynchronous sgd with optimal time complexity.arXiv preprint arXiv:2501.16168","venue":null,"work_id":"68308976-f620-4daa-818f-c9ed9a905479","year":null},"citing_paper":{"arxiv_id":"2605.02043","last_updated":"2026-05-14T15:54:43Z","snapshot_observed_at":"2026-07-06T23:15:11.601042Z","submitted_at":"2026-05-03T20:24:24Z","title":"Bringing Order to Asynchronous SGD: Towards Optimality under Data-Dependent Delays with Momentum","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:26.518245Z"},"links":{"cited_paper":"/paper/2501.16168","citing_paper":"/paper/2605.02043"},"observation_digest":"sha256:943ec7ca7b778522f6a282daced6899cdf67aee82b80733bfcf0f853b28c85b1","observation_id":"7b13fbfb-7eff-4fb4-a8ce-2f669e5622f8","resolution":{"observed_at":"2026-05-09T05:50:26.048552Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16168","last_updated":"2025-06-03T13:26:09Z","snapshot_observed_at":"2026-07-06T20:26:50.822135Z","submitted_at":"2025-01-27T16:07:26Z","title":"Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity","version":3},"cited_work":{"arxiv_id":"2501.16168","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.16168","snapshot_observed_at":"2026-06-30T06:44:18.924141Z","title":"Ringmaster asgd: The first asynchronous sgd with optimal time complexity.arXiv preprint arXiv:2501.16168","venue":null,"work_id":"68308976-f620-4daa-818f-c9ed9a905479","year":null},"citing_paper":{"arxiv_id":"2605.02043","last_updated":"2026-05-14T15:54:43Z","snapshot_observed_at":"2026-07-06T23:15:11.601042Z","submitted_at":"2026-05-03T20:24:24Z","title":"Bringing Order to Asynchronous SGD: Towards Optimality under Data-Dependent Delays with Momentum","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-15T06:48:32.212277Z"},"links":{"cited_paper":"/paper/2501.16168","citing_paper":"/paper/2605.02043"},"observation_digest":"sha256:d8a28561c01c731cd41a8c0865fc3805254a288f130eba606213d6a205a1f449","observation_id":"00d5fdb3-4839-4915-bed7-eb4a69156dca","resolution":{"observed_at":"2026-05-15T06:49:49.221756Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16168","last_updated":"2025-06-03T13:26:09Z","snapshot_observed_at":"2026-07-06T20:26:50.822135Z","submitted_at":"2025-01-27T16:07:26Z","title":"Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity","version":3},"cited_work":{"arxiv_id":"2501.16168","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.16168","snapshot_observed_at":"2026-06-30T06:44:18.924141Z","title":"Ringmaster asgd: The first asynchronous sgd with optimal time complexity.arXiv preprint arXiv:2501.16168","venue":null,"work_id":"68308976-f620-4daa-818f-c9ed9a905479","year":null},"citing_paper":{"arxiv_id":"2606.30634","last_updated":"2026-06-29T17:57:50Z","snapshot_observed_at":"2026-08-02T16:54:35.399479Z","submitted_at":"2026-06-29T17:57:50Z","title":"One-Step Gradient Delay is Not a Barrier for Large-Scale Asynchronous Pipeline Parallel LLM Pretraining","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T06:41:55.732230Z"},"links":{"cited_paper":"/paper/2501.16168","citing_paper":"/paper/2606.30634"},"observation_digest":"sha256:0ec461c4d54ba8015544a7bab2e4a3a95cf1358bd459d1e0942b15e6d41bbf1f","observation_id":"d9e4273c-eb7a-4db1-9dd2-7018e9b453a0","resolution":{"observed_at":"2026-06-30T06:44:18.925672Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.16168/citation-record","integrity":"/paper/2501.16168/integrity","json":"/paper/2501.16168/citation-record.json","paper":"/paper/2501.16168"},"outbound":[],"paper":{"arxiv_id":"2501.16168","last_updated":"2025-06-03T13:26:09Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:26:50.822135Z","submitted_at":"2025-01-27T16:07:26Z","title":"Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.16168."}