{"as_of":"2026-07-17T08:03:00Z","canonical_paper_id":"4NZMC2SB","canonical_url":"https://pith.science/paper/4NZMC2SB/integrity","context_digest":"sha256:54fc65b96e11bfa619b4f73198d1c9fb8157270e69f8f4f655b98566f86c1f25","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/2206.05558","bundle_json":"/pith/4NZMC2SBBXWRAYNL5O4EXUFBNC/bundle.json","citation_record":"/paper/4NZMC2SB/citation-record","evidence":"/evidence","html":"/paper/4NZMC2SB/integrity","integrity_json":"/paper/4NZMC2SB/integrity.json","json":"/paper/4NZMC2SB/integrity.json","legacy_integrity_json":"/pith/4NZMC2SB/integrity.json","paper":"/paper/4NZMC2SB","reference_changes":"/flags?citing=4NZMC2SB"},"paper":{"arxiv_id":"2206.05558","latest_version":1,"primary_cat":"cs.LG","title":"Communication-Efficient Robust Federated Learning with Noisy Labels"},"pith_number":"pith:2022:4NZMC2SBBXWRAYNL5O4EXUFBNC","pith_short":"4NZMC2SBBXWRAYNL5O4EXUFBNC","record":{"arxiv_id":"2206.05558","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2206.05558. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}