{"as_of":"2026-08-10T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eeb8ce10c3cd4bf75a35ca2b7021aca623d9c55d8f104e5fcaf160e28bc3a879","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T21:19:39.410483Z","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-05-20T19:33:42.228966Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.10464","last_updated":"2021-07-27T12:39:59Z","snapshot_observed_at":"2026-08-08T19:05:50.738569Z","submitted_at":"2020-11-20T15:52:45Z","title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.10464","snapshot_observed_at":"2026-08-08T21:19:39.410483Z","title":"and Lyu, L","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.04850","last_updated":"2025-07-13T02:51:38Z","snapshot_observed_at":"2026-08-10T10:59:35.957829Z","submitted_at":"2025-02-07T11:39:27Z","title":"Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T21:19:39.410483Z"},"links":{"cited_paper":"/paper/2011.10464","citing_paper":"/paper/2502.04850"},"observation_digest":"sha256:d5a5a08df635e2b9a715262ae08ac08d0e95572e24f298c433786b34d44b40b4","observation_id":"4bdac17f-56d1-401d-bb6d-3fc886371417","resolution":{"observed_at":"2026-08-08T21:19:39.410483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.10464","last_updated":"2021-07-27T12:39:59Z","snapshot_observed_at":"2026-08-08T19:05:50.738569Z","submitted_at":"2020-11-20T15:52:45Z","title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.10464","snapshot_observed_at":"2026-08-08T18:58:27.382317Z","title":"Xu and L","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05547","last_updated":"2025-02-08T12:28:20Z","snapshot_observed_at":"2026-08-08T18:50:46.577102Z","submitted_at":"2025-02-08T12:28:20Z","title":"Dual Defense: Enhancing Privacy and Mitigating Poisoning Attacks in Federated Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T18:58:27.382317Z"},"links":{"cited_paper":"/paper/2011.10464","citing_paper":"/paper/2502.05547"},"observation_digest":"sha256:64449e1345e0c9e42b1509c5bc6ac143c3afe1fca423c964a2842b2898ffcf11","observation_id":"8e717594-794a-4243-b76c-f888902c15c2","resolution":{"observed_at":"2026-08-08T18:58:27.382317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.10464","last_updated":"2021-07-27T12:39:59Z","snapshot_observed_at":"2026-08-08T19:05:50.738569Z","submitted_at":"2020-11-20T15:52:45Z","title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.10464","snapshot_observed_at":"2026-08-05T13:16:20.341420Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.00799","last_updated":"2025-08-31T11:16:16Z","snapshot_observed_at":"2026-08-10T16:04:13.007021Z","submitted_at":"2025-08-31T11:16:16Z","title":"Fairness in Federated Learning: Trends, Challenges, and Opportunities","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T13:16:20.341420Z"},"links":{"cited_paper":"/paper/2011.10464","citing_paper":"/paper/2509.00799"},"observation_digest":"sha256:a4154bd4133bb339b614fa44911d491813a6b58a75fbea8c2b558b01c2a97581","observation_id":"5332c2e1-d618-47ce-af49-ee1717186685","resolution":{"observed_at":"2026-08-05T13:16:20.341420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.10464","last_updated":"2021-07-27T12:39:59Z","snapshot_observed_at":"2026-08-08T19:05:50.738569Z","submitted_at":"2020-11-20T15:52:45Z","title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","version":2},"cited_work":{"arxiv_id":"2011.10464","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.10464","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.10464 , year=","venue":null,"work_id":"56575d03-730d-441b-94a4-5c0312415250","year":2011},"citing_paper":{"arxiv_id":"2604.04611","last_updated":"2026-04-06T11:54:05Z","snapshot_observed_at":"2026-07-06T22:53:33.177713Z","submitted_at":"2026-04-06T11:54:05Z","title":"Dynamic Free-Rider Detection in Federated Learning via Simulated Attack Patterns","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T19:52:18.630344Z"},"links":{"cited_paper":"/paper/2011.10464","citing_paper":"/paper/2604.04611"},"observation_digest":"sha256:eaba9b66cceeee875c8a49b6716236a0d2baf7c2b7bde9402a4e30fb9eef76a8","observation_id":"c7645203-c87f-457d-a771-a9084caf0192","resolution":{"observed_at":"2026-05-10T22:25:51.838861Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.10464","last_updated":"2021-07-27T12:39:59Z","snapshot_observed_at":"2026-08-08T19:05:50.738569Z","submitted_at":"2020-11-20T15:52:45Z","title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","version":2},"cited_work":{"arxiv_id":"2011.10464","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.10464","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.10464 , year=","venue":null,"work_id":"56575d03-730d-441b-94a4-5c0312415250","year":2011},"citing_paper":{"arxiv_id":"2605.15573","last_updated":"2026-05-15T03:33:20Z","snapshot_observed_at":"2026-07-06T23:26:51.110846Z","submitted_at":"2026-05-15T03:33:20Z","title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-20T19:30:13.469451Z"},"links":{"cited_paper":"/paper/2011.10464","citing_paper":"/paper/2605.15573"},"observation_digest":"sha256:3c3631b9318542cd47a921cea91f6ea206c8af8a2c42fe87f4260d232afbe0a1","observation_id":"1b8ec5b0-317f-4733-b455-8ce4463bbe09","resolution":{"observed_at":"2026-05-20T19:33:42.232557Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2011.10464/citation-record","integrity":"/paper/2011.10464/integrity","json":"/paper/2011.10464/citation-record.json","paper":"/paper/2011.10464"},"outbound":[],"paper":{"arxiv_id":"2011.10464","last_updated":"2021-07-27T12:39:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T19:05:50.738569Z","submitted_at":"2020-11-20T15:52:45Z","title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2011.10464."}