{"as_of":"2026-08-17T23:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b0730681e2df58143098227c9bab28e621c1794e2a697d0c5cb6af386e1d7652","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-17T06:30:58.91139+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-15T20:07:26.438891Z","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-15T16:13:03.605409Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.04747","last_updated":"2020-10-18T22:37:16Z","snapshot_observed_at":"2026-08-17T12:33:24.373651Z","submitted_at":"2020-06-08T16:55:15Z","title":"Secure Byzantine-Robust Machine Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04747","snapshot_observed_at":"2026-08-15T20:07:26.438891Z","title":"Secure byzantine-robust machine learning,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.13561","last_updated":"2025-06-16T14:47:02Z","snapshot_observed_at":"2026-08-15T19:56:31.529918Z","submitted_at":"2025-06-16T14:47:02Z","title":"Perfect Privacy for Discriminator-Based Byzantine-Resilient Federated Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:07:26.438891Z"},"links":{"cited_paper":"/paper/2006.04747","citing_paper":"/paper/2506.13561"},"observation_digest":"sha256:e7d16ab97153475f948e09be4730d0eb349cc0af194de9d3dd3dab66733958af","observation_id":"7dc9b14b-3c7f-4719-97eb-6326a10ba0ce","resolution":{"observed_at":"2026-08-15T20:07:26.438891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04747","last_updated":"2020-10-18T22:37:16Z","snapshot_observed_at":"2026-08-17T12:33:24.373651Z","submitted_at":"2020-06-08T16:55:15Z","title":"Secure Byzantine-Robust Machine Learning","version":2},"cited_work":{"arxiv_id":"2006.04747","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.04747","snapshot_observed_at":"2026-08-15T16:13:03.605409Z","title":"Secure Byzantine-Robust Machine Learning","venue":"cs.LG","work_id":"d426f346-25d4-47a3-a682-9768b9128463","year":2020},"citing_paper":{"arxiv_id":"2509.08449","last_updated":"2025-09-10T09:47:51Z","snapshot_observed_at":"2026-08-16T21:11:25.186476Z","submitted_at":"2025-09-10T09:47:51Z","title":"DSFL: A Dual-Server Byzantine-Resilient Federated Learning Framework via Group-Based Secure Aggregation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T16:13:03.311514Z"},"links":{"cited_paper":"/paper/2006.04747","citing_paper":"/paper/2509.08449"},"observation_digest":"sha256:b9246e087e79bdc9c988b0647ff631df58a98740dd31e0fc314184ae1d9505aa","observation_id":"91cebfd1-5696-44eb-967a-f30c40c5ed01","resolution":{"observed_at":"2026-08-15T16:13:03.612389Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.04747/citation-record","integrity":"/paper/2006.04747/integrity","json":"/paper/2006.04747/citation-record.json","paper":"/paper/2006.04747"},"outbound":[],"paper":{"arxiv_id":"2006.04747","last_updated":"2020-10-18T22:37:16Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T12:33:24.373651Z","submitted_at":"2020-06-08T16:55:15Z","title":"Secure Byzantine-Robust Machine Learning"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2006.04747."}