{"as_of":"2026-08-10T18:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:87558871d43b5fc48d629c454c0027903a429808f27e713c8359d88d287d715a","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-10T06:31:04.303077+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-08-09T13:53:06.107911Z","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-04T21:32:36.169607Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.06573","last_updated":"2018-11-29T14:57:17Z","snapshot_observed_at":"2026-08-08T04:46:42.496552Z","submitted_at":"2018-06-18T09:37:39Z","title":"Distributed learning with compressed gradients","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.06573","snapshot_observed_at":"2026-08-09T13:53:06.107911Z","title":"R., and Johansson, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.02002","last_updated":"2025-07-30T08:25:58Z","snapshot_observed_at":"2026-08-09T15:36:50.248580Z","submitted_at":"2025-02-04T04:30:03Z","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T13:53:06.107911Z"},"links":{"cited_paper":"/paper/1806.06573","citing_paper":"/paper/2502.02002"},"observation_digest":"sha256:505e58956e70f011f1e9245497c9496866e9ada3bbac033708f745bbfe2966d0","observation_id":"91fde719-9efb-43c7-8d97-927efbeb484a","resolution":{"observed_at":"2026-08-09T13:53:06.107911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.06573","last_updated":"2018-11-29T14:57:17Z","snapshot_observed_at":"2026-08-08T04:46:42.496552Z","submitted_at":"2018-06-18T09:37:39Z","title":"Distributed learning with compressed gradients","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.06573","snapshot_observed_at":"2026-08-05T11:23:49.357820Z","title":"Distributed learning with compressed gradients","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.02970","last_updated":"2026-05-29T09:37:19Z","snapshot_observed_at":"2026-08-05T11:23:39.748947Z","submitted_at":"2025-09-03T03:14:58Z","title":"Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T11:23:49.357820Z"},"links":{"cited_paper":"/paper/1806.06573","citing_paper":"/paper/2509.02970"},"observation_digest":"sha256:822b13ec05693f6c6371f898adcc594be841191a01c4cdc9a22fb54928eb304d","observation_id":"243eac7d-0bad-4998-8947-9f6a2b8c8e19","resolution":{"observed_at":"2026-08-05T11:23:49.357820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.06573","last_updated":"2018-11-29T14:57:17Z","snapshot_observed_at":"2026-08-08T04:46:42.496552Z","submitted_at":"2018-06-18T09:37:39Z","title":"Distributed learning with compressed gradients","version":2},"cited_work":{"arxiv_id":"1806.06573","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.06573","snapshot_observed_at":"2026-08-04T21:32:36.169607Z","title":"Distributed learning with compressed gradients","venue":"math.OC","work_id":"0c7958d5-f4c9-44ee-b3f7-793fea26f20a","year":2018},"citing_paper":{"arxiv_id":"2509.07972","last_updated":"2025-09-09T17:56:03Z","snapshot_observed_at":"2026-08-04T21:32:29.559391Z","submitted_at":"2025-09-09T17:56:03Z","title":"Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T21:32:34.555629Z"},"links":{"cited_paper":"/paper/1806.06573","citing_paper":"/paper/2509.07972"},"observation_digest":"sha256:5786b99756aa49ee6ecd4742c41b30e4ad9e0cf007d45a72086d9fedc0c08b3d","observation_id":"afccdaec-29b4-4ae4-b533-bbf112fe3a6f","resolution":{"observed_at":"2026-08-04T21:32:36.237186Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1806.06573/citation-record","integrity":"/paper/1806.06573/integrity","json":"/paper/1806.06573/citation-record.json","paper":"/paper/1806.06573"},"outbound":[],"paper":{"arxiv_id":"1806.06573","last_updated":"2018-11-29T14:57:17Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T04:46:42.496552Z","submitted_at":"2018-06-18T09:37:39Z","title":"Distributed learning with compressed gradients"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1806.06573."}