{"as_of":"2026-08-17T17:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f9f0750d7b23907206cd0d68ecbf379f831d9ced2c287c9af797e4f60d767f35","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:28:00.066921Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2506.17974/citation-record","integrity":"/paper/2506.17974/integrity","json":"/paper/2506.17974/citation-record.json","paper":"/paper/2506.17974"},"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-06T23:28:03.660030Z","title":"Sparse communication for distributed gradient descent","venue":null,"work_id":"ccd3b7bb-3222-4037-8825-51623183183a","year":2017},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:58.916166Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:929df7898ce2961bd81c76b4da1bc542acf331ce0bf40e25a5b30411cf0efd9a","observation_id":"30baebc3-3e9e-4c9c-9b92-aab802499bc9","resolution":{"observed_at":"2026-08-06T23:28:03.736229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:03.471308Z","title":"Qsgd: Communication-efficient sgd via gradient quantization and encoding","venue":null,"work_id":"ddb0e076-2518-4aa9-ba0d-61a4d9b31bda","year":2017},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:58.967339Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:07d279c6a330c49a9424053eef5f53aa6b9f1ba5db4c9614461e652eb38bf47f","observation_id":"80862cda-08e6-4e4e-8629-edac2f0b73aa","resolution":{"observed_at":"2026-08-06T23:28:03.547166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:03.239828Z","title":"Demystifying the communication characteristics for distributed transformer models","venue":null,"work_id":"44142f5b-b1ba-457b-a636-56e082007a20","year":2024},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.026078Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:e9613ee4c760fd5550a076ced8aaf95d12161385998907ba7b49b8c33f5c2588","observation_id":"3be4623d-031e-45df-9a40-4d0b7de5dc89","resolution":{"observed_at":"2026-08-06T23:28:03.348730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:02.984359Z","title":"Communication-efficient distributed learning: A comprehensive survey.IEEE Transactions on Parallel and Distributed Systems, 2023","venue":null,"work_id":"9553c67a-f71d-4a51-88ef-867e538ff1c5","year":2023},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.105021Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:e0df8ff2c8bf2613600c1f3cfec3f0ca98ec73391be04c740a99ac67eed00b7a","observation_id":"36d43c78-6b4c-496e-8e1c-f7d1b924e17e","resolution":{"observed_at":"2026-08-06T23:28:03.157053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:02.778602Z","title":"Inverting gradients-how easy is it to break privacy in federated learning?Advances in neural information processing systems, 33:16937–16947, 2020","venue":null,"work_id":"97e1408c-2c29-4c5a-a7d6-37b1301be413","year":2020},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.157453Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:3f91a247bd44ae956d0e2c9d5770784f74605d939c118dfe503be42c181398fd","observation_id":"af32b8d8-d22d-4c03-8ccb-444943ff674f","resolution":{"observed_at":"2026-08-06T23:28:02.860622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.02677","last_updated":"2018-04-30T21:53:41Z","snapshot_observed_at":"2026-08-09T05:23:26.365677Z","submitted_at":"2017-06-08T16:51:53Z","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02677","snapshot_observed_at":"2026-08-06T23:27:59.225453Z","title":"Accurate, large minibatch sgd: Training imagenet in 1 hour.arXiv preprint arXiv:1706.02677, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.225453Z"},"links":{"cited_paper":"/paper/1706.02677","citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:e7602a570f107b50459d1a393c9f572772bd39d576cc9f2c40acbeb950ab6e23","observation_id":"a7a09ee8-14a3-44dd-8478-d816926349ee","resolution":{"observed_at":"2026-08-06T23:27:59.225453Z","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-06T23:28:02.515576Z","title":"Deep residual learning for image recognition","venue":null,"work_id":"3b74f62d-c72c-494d-ad06-0decaf9e6467","year":2016},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.276697Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:403ddac83ebbeb059305ab8d94cefc9724c314acab1eba806cc4a71c6b8d9583","observation_id":"53e0a37f-7c1a-4578-a5a8-7632281e3d19","resolution":{"observed_at":"2026-08-06T23:28:02.641243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03470","last_updated":"2025-06-04T00:55:01Z","snapshot_observed_at":"2026-08-15T12:22:47.822541Z","submitted_at":"2025-06-04T00:55:01Z","title":"Models of Heavy-Tailed Mechanistic Universality","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03470","snapshot_observed_at":"2026-08-06T23:27:59.310642Z","title":"Models of heavy-tailed mechanistic universality.arXiv preprint arXiv:2506.03470, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.310642Z"},"links":{"cited_paper":"/paper/2506.03470","citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:842e72f5a5090b92942d27cce653dc6818f58e540ec4e0e37ffc194dec39e177","observation_id":"475df728-d13a-411d-9aeb-ac152c95e0ae","resolution":{"observed_at":"2026-08-06T23:27:59.310642Z","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-06T23:28:02.304747Z","title":"Error feedback fixes signsgd and other gradient compression schemes","venue":null,"work_id":"f595c5a5-712c-4ef1-9424-2b80bdda98ca","year":2019},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.379613Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:fe986c40af8fedf0baaf7088d65aa97318116e6a9ad307b4a8a99053ed6348fb","observation_id":"7830f693-52e6-4841-b429-c86ffd5f8a98","resolution":{"observed_at":"2026-08-06T23:28:02.436266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21491","last_updated":"2025-04-29T12:30:32Z","snapshot_observed_at":"2026-08-16T13:05:13.363281Z","submitted_at":"2024-10-28T20:02:05Z","title":"Trustworthiness of Stochastic Gradient Descent in Distributed Learning","version":3},"cited_work":{"arxiv_id":"2410.21491","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.21491","snapshot_observed_at":"2026-08-06T23:28:00.339471Z","title":"Trustworthiness of Stochastic Gradient Descent in Distributed Learning","venue":"cs.LG","work_id":"eaa0b7d3-c388-46f7-8faf-f418f85a78e3","year":2024},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.435545Z"},"links":{"cited_paper":"/paper/2410.21491","citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:76ff68a038d2632db1180994b1eef15c459459e535adcc2712a2d80afe4103b6","observation_id":"f8da7032-3460-4a86-8a98-c782cfb6440f","resolution":{"observed_at":"2026-08-06T23:28:00.386232Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10109","last_updated":"2025-04-14T11:16:07Z","snapshot_observed_at":"2026-08-16T16:36:05.296620Z","submitted_at":"2025-04-14T11:16:07Z","title":"Lightweight Trustworthy Distributed Clustering","version":1},"cited_work":{"arxiv_id":"2504.10109","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.10109","snapshot_observed_at":"2026-08-06T23:28:00.162637Z","title":"Lightweight Trustworthy Distributed Clustering","venue":"cs.DC","work_id":"c99a3033-c4d9-4c57-88c5-902b14d6848b","year":2025},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.496917Z"},"links":{"cited_paper":"/paper/2504.10109","citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:cdd226dc2e9f84e70531a55329e7dab6349bb9ef9b0b02fe9b3c529c12a3ae72","observation_id":"ff7ca46b-691c-4f8f-9880-2437bbe9e93f","resolution":{"observed_at":"2026-08-06T23:28:00.209616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:01.910099Z","title":null,"venue":null,"work_id":"3b98c92e-866a-4cec-afd1-8819bfe8d56c","year":2023},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.556543Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:1d2353b4e6a87323de2ec16e41bf69bb90b914b8c9257895776c21fc817b1d29","observation_id":"06adc5e6-f9bd-4cd4-a486-31af6a65343d","resolution":{"observed_at":"2026-08-06T23:28:02.150064Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:01.678789Z","title":"Communication efficient privacy-preserving distributed optimization using adaptive differential quantization.Signal Processing, 194:108456, 2022","venue":null,"work_id":"ec927f5b-6d0c-4bbf-9d70-1c2e2b20baf8","year":2022},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.616760Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:e404c74aa392ad240b94274bea5125e2aeced809c708c670f3afabf102027917","observation_id":"54035d10-afb7-4e6a-bfd9-944a5751e7bc","resolution":{"observed_at":"2026-08-06T23:28:01.769140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:01.508789Z","title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","venue":null,"work_id":"418b3cb3-139c-423a-99bb-8655ed6eac27","year":2018},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.702670Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:fdbc37dab9c004071f9af7ba22650aead18f6ce6c8faab841f177ffdb5ad363f","observation_id":"eba66c33-6512-4440-8016-2dab27676dc9","resolution":{"observed_at":"2026-08-06T23:28:01.611484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:01.252832Z","title":"Provably communication-efficient data-parallel sgd via nonuniform quantization","venue":null,"work_id":"5a60ef5d-bab7-43c5-8d72-ae20386c70fa","year":null},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.752076Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:af5fc1715b266df8590729e548693df01cd52c59001947de964495b58d4c2128","observation_id":"54854488-37fe-4f49-b6be-3223eb792235","resolution":{"observed_at":"2026-08-06T23:28:01.400055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:00.966135Z","title":"1-bit stochastic gradient descent and its application to data-parallel distributed training of speech dnns","venue":null,"work_id":"8ff1ef67-12b6-4305-8ac9-b08ccf0bc3d7","year":2014},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.814099Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:35e474d04e675d2d8e4d3e29316a31e4a77b415d512f2255fb90bd1b8273adb7","observation_id":"0c6aa2cc-a9ad-4652-9b29-2440bb9291e9","resolution":{"observed_at":"2026-08-06T23:28:01.093874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03600","last_updated":"2019-07-19T00:47:44Z","snapshot_observed_at":"2026-08-14T18:02:01.603978Z","submitted_at":"2018-11-08T18:33:41Z","title":"Measuring the Effects of Data Parallelism on Neural Network Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03600","snapshot_observed_at":"2026-08-06T23:27:59.916061Z","title":"Measuring the effects of data parallelism on neural network training.arXiv preprint arXiv:1811.03600, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.916061Z"},"links":{"cited_paper":"/paper/1811.03600","citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:fc7eb44e0a9a8145857980186fb43b94ac6fd81dd27a3306bcd45e7e19a0659e","observation_id":"c096474a-abda-49ee-9b5c-dfffe43f1cfb","resolution":{"observed_at":"2026-08-06T23:27:59.916061Z","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-06T23:28:00.876878Z","title":"A distributed synchronous sgd algorithm with global top-k sparsification for low bandwidth networks","venue":null,"work_id":"8a707073-96e1-4e5b-8b0a-ab3305a1c3ed","year":2019},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T23:27:59.974737Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:ce3ee4b7a4ed98da8c4baca01b85aeb1209ae75a812f2223402d1d96414a129e","observation_id":"7e45dddd-623a-4c99-a765-bf7036a6c499","resolution":{"observed_at":"2026-08-06T23:28:00.904716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:00.709306Z","title":"Sparsified sgd with memory","venue":null,"work_id":"17daba76-0a08-4450-89c1-ad620a6badc8","year":2018},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T23:28:00.015818Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:28d556f952f3bdfebc53a5825d7fe694817c7e5d6b2e01997d90726c1c462fe2","observation_id":"7fdd9601-a637-41fd-b908-35237e92aafc","resolution":{"observed_at":"2026-08-06T23:28:00.795657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T23:28:00.551757Z","title":"Powersgd: Practical low-rank gradient compression for distributed optimization","venue":null,"work_id":"e37b0a72-8544-414e-ac8c-c655df02f3a4","year":2019},"citing_paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T23:28:00.066921Z"},"links":{"citing_paper":"/paper/2506.17974"},"observation_digest":"sha256:44ebd4843c95b1543c9d47d6b50c9b305a677f7b0d512db98aed7771a8ec352a","observation_id":"5ad9f07e-75ab-4d40-9d14-0c426ff55100","resolution":{"observed_at":"2026-08-06T23:28:00.606362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.17974","last_updated":"2025-06-22T10:21:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T11:22:18.769966Z","submitted_at":"2025-06-22T10:21:49Z","title":"Trustworthy Efficient Communication for Distributed Learning using LQ-SGD Algorithm"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":14},"total_outbound_references":20},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2506.17974."}