{"as_of":"2026-08-13T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2cc0d3a55a502872df7ec77c17ed469a2aaa2bc0b950184524f7846239cd30d2","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-13T06:32:02.005865+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-12T10:35:58.254176Z","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-12T10:35:58.367386Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.11018","last_updated":"2024-01-19T20:35:02Z","snapshot_observed_at":"2026-08-13T04:38:53.564923Z","submitted_at":"2024-01-19T20:35:02Z","title":"Communication Efficient and Provable Federated Unlearning","version":1},"cited_work":{"arxiv_id":"2401.11018","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.11018","snapshot_observed_at":"2026-08-12T10:35:58.367386Z","title":"Communication Efficient and Provable Federated Unlearning","venue":"cs.LG","work_id":"98279a76-1d7d-4ff6-b9a7-b2196e9fe003","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.254176Z"},"links":{"cited_paper":"/paper/2401.11018","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:96760d32f4137cdb99ebf3a2164a4006b07ca016af3f352a951d94dd4c88f07b","observation_id":"25c469d5-958e-49d1-be95-39573c52db38","resolution":{"observed_at":"2026-08-12T10:35:58.373159Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.11018/citation-record","integrity":"/paper/2401.11018/integrity","json":"/paper/2401.11018/citation-record.json","paper":"/paper/2401.11018"},"outbound":[],"paper":{"arxiv_id":"2401.11018","last_updated":"2024-01-19T20:35:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:38:53.564923Z","submitted_at":"2024-01-19T20:35:02Z","title":"Communication Efficient and Provable Federated Unlearning"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2401.11018."}