Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Communication-Computation Efficient Secure Aggregation for Federated Learning
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2012.05433.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T05:33:30.300060Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-02T20:17:22.298768Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 5ecf2a00-0f8c-45ef-9145-739b1fc12b3c · inbound
Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links cites this paper.
Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links Communication-Computation Efficient Secure Aggregation for Federated Learning
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T15:05:02.730922Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f25407f4-19f5-444a-918b-0ee9506d7bc3 · inbound
On the Optimal Source Key Size of Secure Gradient Coding cites this paper.
On the Optimal Source Key Size of Secure Gradient Coding Communication-Computation Efficient Secure Aggregation for Federated Learning
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T05:33:30.300060Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5e526ae4-a993-4f10-bd1f-2ebd5b3b82ee · inbound
EBS-CFL: Efficient and Byzantine-robust Secure Clustered Federated Learning cites this paper.
EBS-CFL: Efficient and Byzantine-robust Secure Clustered Federated Learning Communication-Computation Efficient Secure Aggregation for Federated Learning
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T20:04:47.686373Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4a125297-309b-4161-b09b-3fc9a005ec8f · inbound
Information-Theoretic Decentralized Secure Aggregation with User Dropouts cites this paper.
Information-Theoretic Decentralized Secure Aggregation with User Dropouts Communication-Computation Efficient Secure Aggregation for Federated Learning
Reference 36
- Resolution
- verified exact
- arxiv_id, observed 2026-05-22T04:14:37.512083Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 3171a294-30bf-4f3c-b928-f65618397e1c · inbound
The Capacity of Information-Theoretic Secure Aggregation in Federated Learning cites this paper.
The Capacity of Information-Theoretic Secure Aggregation in Federated Learning Communication-Computation Efficient Secure Aggregation for Federated Learning
Reference 15
- Resolution
- verified exact
- arxiv_id, observed 2026-07-02T20:17:22.300226Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.