{"as_of":"2026-08-07T05:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9474c1c0ad5fa76b77b2b5159e46c213b36a7604b0f3a7b5260d1baaee922ac3","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-06T06:34:29.942622+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-01T09:37:10.222846Z","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-05-20T16:43:34.729266Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.09671","last_updated":"2019-01-28T14:21:32Z","snapshot_observed_at":"2026-07-06T07:29:25.620611Z","submitted_at":"2019-01-28T14:21:32Z","title":"ErasureHead: Distributed Gradient Descent without Delays Using Approximate Gradient Coding","version":1},"cited_work":{"arxiv_id":"1901.09671","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.09671","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ErasureHead: Distributed Gradient Descent without Delays Using Approximate Gradient Coding","venue":"cs.LG","work_id":"d65bc367-49d6-4e56-afbc-20c7a509afd2","year":2019},"citing_paper":{"arxiv_id":"2605.15890","last_updated":"2026-05-15T12:21:17Z","snapshot_observed_at":"2026-08-06T05:10:09.757941Z","submitted_at":"2026-05-15T12:21:17Z","title":"Communication-Efficient Approximate Gradient Coding for Distributed Learning in Heterogeneous Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T16:41:43.244129Z"},"links":{"cited_paper":"/paper/1901.09671","citing_paper":"/paper/2605.15890"},"observation_digest":"sha256:a0df79d00cf69990b5cd5ac69e9a2de83ce1be66dc60e33b5d94063a83192556","observation_id":"10f4ae85-791e-41e2-9c2e-557ee056ab4b","resolution":{"observed_at":"2026-05-20T16:43:34.730840Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09671","last_updated":"2019-01-28T14:21:32Z","snapshot_observed_at":"2026-07-06T07:29:25.620611Z","submitted_at":"2019-01-28T14:21:32Z","title":"ErasureHead: Distributed Gradient Descent without Delays Using Approximate Gradient Coding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09671","snapshot_observed_at":"2026-08-01T09:37:10.222846Z","title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding,","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2607.20739","last_updated":"2026-07-22T21:36:57Z","snapshot_observed_at":"2026-08-05T11:58:45.339363Z","submitted_at":"2026-07-22T21:36:57Z","title":"Pipelined Gradient Coding","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T09:37:10.222846Z"},"links":{"cited_paper":"/paper/1901.09671","citing_paper":"/paper/2607.20739"},"observation_digest":"sha256:e23d8781e8e68e3dc048c2ad83465ad102328a6f661fba0d65c44f5474f2a430","observation_id":"be85424f-a0d9-4f62-9867-5fff9907310b","resolution":{"observed_at":"2026-08-01T09:37:10.222846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1901.09671/citation-record","integrity":"/paper/1901.09671/integrity","json":"/paper/1901.09671/citation-record.json","paper":"/paper/1901.09671"},"outbound":[],"paper":{"arxiv_id":"1901.09671","last_updated":"2019-01-28T14:21:32Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:29:25.620611Z","submitted_at":"2019-01-28T14:21:32Z","title":"ErasureHead: Distributed Gradient Descent without Delays Using Approximate Gradient Coding"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1901.09671."}