{"as_of":"2026-08-17T23:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da0ee568d58483051f82f87ffb8fa7d387c46daca20769425589f1c5d6f4fb05","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-17T06:30:58.91139+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-16T05:33:30.300060Z","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-07-02T20:17:22.298768Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.05433","last_updated":"2021-07-12T14:08:24Z","snapshot_observed_at":"2026-08-17T14:33:01.915097Z","submitted_at":"2020-12-10T03:17:50Z","title":"Communication-Computation Efficient Secure Aggregation for Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.05433","snapshot_observed_at":"2026-08-11T15:05:02.730922Z","title":"Communication- computation efficient secure aggregation for federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.11496","last_updated":"2025-04-24T11:47:44Z","snapshot_observed_at":"2026-08-13T10:01:01.695549Z","submitted_at":"2024-12-16T07:16:41Z","title":"Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.730922Z"},"links":{"cited_paper":"/paper/2012.05433","citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:b2a9cbaca86fad0fbac5ffd61777314d125ca9816dac3a1fc09470575b24cf45","observation_id":"5ecf2a00-0f8c-45ef-9145-739b1fc12b3c","resolution":{"observed_at":"2026-08-11T15:05:02.730922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.05433","last_updated":"2021-07-12T14:08:24Z","snapshot_observed_at":"2026-08-17T14:33:01.915097Z","submitted_at":"2020-12-10T03:17:50Z","title":"Communication-Computation Efficient Secure Aggregation for Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.05433","snapshot_observed_at":"2026-08-16T05:33:30.300060Z","title":"Communication- computation efficient secure aggregation for federated learning,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-17T05:56:19.514356Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.300060Z"},"links":{"cited_paper":"/paper/2012.05433","citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:0ee3e826f243fd8c80a6c4cb978014ac03c233ebe17c83576d42bd34be4262bc","observation_id":"f25407f4-19f5-444a-918b-0ee9506d7bc3","resolution":{"observed_at":"2026-08-16T05:33:30.300060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.05433","last_updated":"2021-07-12T14:08:24Z","snapshot_observed_at":"2026-08-17T14:33:01.915097Z","submitted_at":"2020-12-10T03:17:50Z","title":"Communication-Computation Efficient Secure Aggregation for Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.05433","snapshot_observed_at":"2026-08-15T20:04:47.686373Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.13612","last_updated":"2025-06-16T15:39:10Z","snapshot_observed_at":"2026-08-17T19:14:10.596000Z","submitted_at":"2025-06-16T15:39:10Z","title":"EBS-CFL: Efficient and Byzantine-robust Secure Clustered Federated Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T20:04:47.686373Z"},"links":{"cited_paper":"/paper/2012.05433","citing_paper":"/paper/2506.13612"},"observation_digest":"sha256:33d5d36c3976046cfcbc1831542ed5d18fd4b218363c382fc26def5ba81de620","observation_id":"5e526ae4-a993-4f10-bd1f-2ebd5b3b82ee","resolution":{"observed_at":"2026-08-15T20:04:47.686373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.05433","last_updated":"2021-07-12T14:08:24Z","snapshot_observed_at":"2026-08-17T14:33:01.915097Z","submitted_at":"2020-12-10T03:17:50Z","title":"Communication-Computation Efficient Secure Aggregation for Federated Learning","version":3},"cited_work":{"arxiv_id":"2012.05433","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.05433","snapshot_observed_at":"2026-07-02T20:17:22.298768Z","title":"Communication- Computation Efficient Secure Aggregation for Federated Learning","venue":null,"work_id":"4240c839-8965-4f76-92d1-a8244ae558bb","year":2012},"citing_paper":{"arxiv_id":"2605.22261","last_updated":"2026-05-21T10:05:38Z","snapshot_observed_at":"2026-08-15T00:41:14.012645Z","submitted_at":"2026-05-21T10:05:38Z","title":"Information-Theoretic Decentralized Secure Aggregation with User Dropouts","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-22T04:12:57.842966Z"},"links":{"cited_paper":"/paper/2012.05433","citing_paper":"/paper/2605.22261"},"observation_digest":"sha256:ad7aa043010971894ef39b9e43c20c274ef3d4f9b3249d27775e27de8efca0ee","observation_id":"4a125297-309b-4161-b09b-3fc9a005ec8f","resolution":{"observed_at":"2026-05-22T04:14:37.512083Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2012.05433","last_updated":"2021-07-12T14:08:24Z","snapshot_observed_at":"2026-08-17T14:33:01.915097Z","submitted_at":"2020-12-10T03:17:50Z","title":"Communication-Computation Efficient Secure Aggregation for Federated Learning","version":3},"cited_work":{"arxiv_id":"2012.05433","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.05433","snapshot_observed_at":"2026-07-02T20:17:22.298768Z","title":"Communication- Computation Efficient Secure Aggregation for Federated Learning","venue":null,"work_id":"4240c839-8965-4f76-92d1-a8244ae558bb","year":2012},"citing_paper":{"arxiv_id":"2606.07277","last_updated":"2026-06-05T13:53:27Z","snapshot_observed_at":"2026-08-07T09:24:48.994909Z","submitted_at":"2026-06-05T13:53:27Z","title":"The Capacity of Information-Theoretic Secure Aggregation in Federated Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T20:37:58.641814Z"},"links":{"cited_paper":"/paper/2012.05433","citing_paper":"/paper/2606.07277"},"observation_digest":"sha256:71b4fd0ca7786f5d3498d618fd241a9803a521cfbaccbea20508bf49e96a7472","observation_id":"3171a294-30bf-4f3c-b928-f65618397e1c","resolution":{"observed_at":"2026-07-02T20:17:22.300226Z","resolver_source":"arxiv_id","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/2012.05433/citation-record","integrity":"/paper/2012.05433/integrity","json":"/paper/2012.05433/citation-record.json","paper":"/paper/2012.05433"},"outbound":[],"paper":{"arxiv_id":"2012.05433","last_updated":"2021-07-12T14:08:24Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T14:33:01.915097Z","submitted_at":"2020-12-10T03:17:50Z","title":"Communication-Computation Efficient Secure Aggregation for 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-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 5 inbound Pith citation observations for arXiv:2012.05433."}