{"as_of":"2026-08-09T07:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:250824aa0b312adeeebe21ec7e614c83571e39310b70326dbdd728b7a0e5513e","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:33:07.827582Z","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-07T14:33:09.842586Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.14737","last_updated":"2024-03-21T13:54:36Z","snapshot_observed_at":"2026-07-31T08:52:38.648008Z","submitted_at":"2024-03-21T13:54:36Z","title":"FedMef: Towards Memory-efficient Federated Dynamic Pruning","version":1},"cited_work":{"arxiv_id":"2403.14737","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.14737","snapshot_observed_at":"2026-08-07T14:33:09.842586Z","title":"FedMef: Towards Memory-efficient Federated Dynamic Pruning","venue":"cs.LG","work_id":"dbc51b48-35e9-4988-bfc8-a1051894ffc7","year":2024},"citing_paper":{"arxiv_id":"2505.18563","last_updated":"2025-05-24T07:06:36Z","snapshot_observed_at":"2026-08-07T14:27:16.669960Z","submitted_at":"2025-05-24T07:06:36Z","title":"PacTrain: Pruning and Adaptive Sparse Gradient Compression for Efficient Collective Communication in Distributed Deep Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:07.827582Z"},"links":{"cited_paper":"/paper/2403.14737","citing_paper":"/paper/2505.18563"},"observation_digest":"sha256:ee26608968e148dc0dfb558e45882b9ef1c83e9d47547c3882de550ed4ee99c4","observation_id":"5531f0b4-2c7b-4375-a194-6241cb0d90e3","resolution":{"observed_at":"2026-08-07T14:33:10.010083Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.14737/citation-record","integrity":"/paper/2403.14737/integrity","json":"/paper/2403.14737/citation-record.json","paper":"/paper/2403.14737"},"outbound":[],"paper":{"arxiv_id":"2403.14737","last_updated":"2024-03-21T13:54:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-31T08:52:38.648008Z","submitted_at":"2024-03-21T13:54:36Z","title":"FedMef: Towards Memory-efficient Federated Dynamic Pruning"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.14737."}