{"as_of":"2026-08-09T00:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f565a4c8a2ed680f86b0ab4a3cd0dea34a4b0cf8f3052bb71340b19e3d978dbe","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-08T06:32:00.761636+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-07T23:13:41.946966Z","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-07-03T08:57:47.437370Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.00255","last_updated":"2023-07-31T04:34:34Z","snapshot_observed_at":"2026-08-04T06:57:33.903249Z","submitted_at":"2022-02-01T07:27:34Z","title":"DoCoM: Compressed Decentralized Optimization with Near-Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.00255","snapshot_observed_at":"2026-08-07T23:13:41.946966Z","title":"Docom: Compressed decentralized op- timization with near-optimal sample complexity,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08964","last_updated":"2025-07-04T04:45:30Z","snapshot_observed_at":"2026-08-07T23:01:51.179732Z","submitted_at":"2025-02-13T04:59:21Z","title":"Decentralized Stochastic Optimization over Unreliable Networks via Two-timescales Updates","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T23:13:41.946966Z"},"links":{"cited_paper":"/paper/2202.00255","citing_paper":"/paper/2502.08964"},"observation_digest":"sha256:67a92fdd1718ffbfc40a25d0efe4b10969ecfe63d1ea5ec89b9b95909b750f13","observation_id":"01b638d9-8a76-4132-bcdd-4a65b7e57b65","resolution":{"observed_at":"2026-08-07T23:13:41.946966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00255","last_updated":"2023-07-31T04:34:34Z","snapshot_observed_at":"2026-08-04T06:57:33.903249Z","submitted_at":"2022-02-01T07:27:34Z","title":"DoCoM: Compressed Decentralized Optimization with Near-Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":"2202.00255","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00255","snapshot_observed_at":"2026-07-03T08:57:47.437370Z","title":"Docom: Compressed decentralized optimization with near- optimal sample complexity.arXiv preprint arXiv:2202.00255, 2022","venue":null,"work_id":"6691e415-a060-48d9-90ab-4d80c523035d","year":2022},"citing_paper":{"arxiv_id":"2607.01755","last_updated":"2026-07-02T06:11:38Z","snapshot_observed_at":"2026-08-06T11:40:02.475588Z","submitted_at":"2026-07-02T06:11:38Z","title":"Decentralized Stochastic Subgradient-type Methods with Communication Compression for Nonsmooth Nonconvex Optimization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-03T08:48:04.553667Z"},"links":{"cited_paper":"/paper/2202.00255","citing_paper":"/paper/2607.01755"},"observation_digest":"sha256:eb6e116327d6cd4d2ec350d66a700520fdb8bcba640d63cdd9e0ba8885caa912","observation_id":"d8119580-324d-489d-bb4b-1437f4cd3d21","resolution":{"observed_at":"2026-07-03T08:57:47.438864Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2202.00255/citation-record","integrity":"/paper/2202.00255/integrity","json":"/paper/2202.00255/citation-record.json","paper":"/paper/2202.00255"},"outbound":[],"paper":{"arxiv_id":"2202.00255","last_updated":"2023-07-31T04:34:34Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T06:57:33.903249Z","submitted_at":"2022-02-01T07:27:34Z","title":"DoCoM: Compressed Decentralized Optimization with Near-Optimal Sample 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2202.00255."}