{"as_of":"2026-08-08T06:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:687009a55ee041826eb490a50ee2a403bdfee2d9a8f5b33753d556eb6c11f407","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:30:20.657655Z","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-05-12T10:36:30.609971Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-08-07T13:30:20.657655Z","title":"Understanding top-k sparsifica- tion in distributed deep learning","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.21684","last_updated":"2025-05-27T19:11:22Z","snapshot_observed_at":"2026-08-07T19:56:38.719142Z","submitted_at":"2025-05-27T19:11:22Z","title":"Incentivizing Permissionless Distributed Learning of LLMs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:30:20.657655Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2505.21684"},"observation_digest":"sha256:489c500db3de36b3df1f86c1ce1a7427eadf8f2fc11a1a8cab731806ebe3688c","observation_id":"fe360e9a-7311-4540-916f-f8614cb9d405","resolution":{"observed_at":"2026-08-07T13:30:20.657655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-08-07T12:45:29.206107Z","title":"Understanding top-k sparsification in distributed deep learning","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.23725","last_updated":"2026-06-02T01:19:21Z","snapshot_observed_at":"2026-08-07T12:36:41.591936Z","submitted_at":"2025-05-29T17:55:37Z","title":"MuLoCo: Muon is a practical inner optimizer for DiLoCo","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T12:45:29.206107Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2505.23725"},"observation_digest":"sha256:a6f0e42f768d186b8f1693da462b64fc012caa7eb188484d41c196cf64be8e1a","observation_id":"07b3119b-99ca-4b5f-85fa-091ee75a360b","resolution":{"observed_at":"2026-08-07T12:45:29.206107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-08-06T18:19:59.438283Z","title":null,"venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2507.09029","last_updated":"2026-05-31T02:40:58Z","snapshot_observed_at":"2026-08-06T18:03:36.091427Z","submitted_at":"2025-07-11T21:25:11Z","title":"Model Parallelism With Subnetwork Data Parallelism","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T18:19:59.438283Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2507.09029"},"observation_digest":"sha256:2fb5da2d13b6a58a331ba7c8e6d1a0b8bbdd6cdc4b0a00e20944c9d0c743a84b","observation_id":"468b79fc-86a8-4f9a-a816-c9e55809958c","resolution":{"observed_at":"2026-08-06T18:19:59.438283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-08-05T17:50:42.822540Z","title":"2014-274","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.15706","last_updated":"2026-07-23T09:18:31Z","snapshot_observed_at":"2026-08-07T19:57:01.269382Z","submitted_at":"2025-08-21T16:48:19Z","title":"Overcoming the Communication-Performance Tradeoff in LLM Pretraining","version":3},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-05T17:50:42.822540Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2508.15706"},"observation_digest":"sha256:a4814f10024e5d06d06fb3bda576e831d8933b43bef3fbb6e6e3dae763feb5de","observation_id":"b4982b35-9e66-4f74-905e-e11c073a41fe","resolution":{"observed_at":"2026-08-05T17:50:42.822540Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":"1911.08772","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5e1db15b-84f6-47b4-81e9-fdfaf91a357a","year":2019},"citing_paper":{"arxiv_id":"2604.27844","last_updated":"2026-04-30T13:29:59Z","snapshot_observed_at":"2026-07-06T23:13:15.994987Z","submitted_at":"2026-04-30T13:29:59Z","title":"ZipCCL: Efficient Lossless Data Compression of Communication Collectives for Accelerating LLM Training","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-07T05:22:35.487173Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2604.27844"},"observation_digest":"sha256:3211d5a4db29bd2bff602503ba0b13c956a14d5427b1511f90a4bde090d51598","observation_id":"5da72fa0-0d20-4f83-9335-8511185881c0","resolution":{"observed_at":"2026-05-12T10:36:30.612184Z","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":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-07-11T15:21:14.811340Z","title":"Understanding top-k sparsi- fication in distributed deep learning,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2607.04676","last_updated":"2026-07-06T05:06:37Z","snapshot_observed_at":"2026-08-05T03:48:38.428175Z","submitted_at":"2026-07-06T05:06:37Z","title":"Adaptive Space-efficient Collectives for Dynamic and Unstructured Sparsity on GPU Platforms","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-11T15:21:14.811340Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2607.04676"},"observation_digest":"sha256:9ead5978ae35b00fa0100a2abb17a8e2a637337dc6d4e248ecf3fd6915969a11","observation_id":"b0064440-be2e-42b2-85e0-c03c1bcbfae4","resolution":{"observed_at":"2026-07-11T15:21:14.811340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-07-11T15:21:14.811340Z","title":"Available: https://doi.org/10.48550/arXiv.1911.08772","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2607.04676","last_updated":"2026-07-06T05:06:37Z","snapshot_observed_at":"2026-08-05T03:48:38.428175Z","submitted_at":"2026-07-06T05:06:37Z","title":"Adaptive Space-efficient Collectives for Dynamic and Unstructured Sparsity on GPU Platforms","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-11T15:21:14.811340Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2607.04676"},"observation_digest":"sha256:3f5ea0ecdafdaa0d684a168a79815d1a56bf59b20477bb7ace6e49883e2b6184","observation_id":"ede3020f-5b66-40ea-b5b6-839b9d1bc459","resolution":{"observed_at":"2026-07-11T15:21:14.811340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08772","snapshot_observed_at":"2026-07-11T11:54:21.248897Z","title":"Understanding top- k sparsification in distributed deep learning,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2607.04889","last_updated":"2026-07-06T10:13:35Z","snapshot_observed_at":"2026-08-04T21:38:51.720962Z","submitted_at":"2026-07-06T10:13:35Z","title":"Energy Efficiency Maximization for Hybrid RIS-Aided Communications via Deep Unfolding","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T11:54:21.248897Z"},"links":{"cited_paper":"/paper/1911.08772","citing_paper":"/paper/2607.04889"},"observation_digest":"sha256:1e416e0d82e32a83a7d3d3150dc73c6401c197b54e1cf495afe8a04f6fe3c350","observation_id":"15851a4e-e754-4ea3-9783-8e63a3a1c87e","resolution":{"observed_at":"2026-07-11T11:54:21.248897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1911.08772/citation-record","integrity":"/paper/1911.08772/integrity","json":"/paper/1911.08772/citation-record.json","paper":"/paper/1911.08772"},"outbound":[],"paper":{"arxiv_id":"1911.08772","last_updated":"2019-11-20T08:50:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:38:25.007761Z","submitted_at":"2019-11-20T08:50:59Z","title":"Understanding Top-k Sparsification in Distributed Deep Learning"},"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 8 inbound Pith citation observations for arXiv:1911.08772."}