{"as_of":"2026-08-17T15:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c95174845edd0a5fa8e6195ffc25e8ba452f6fd1b14354add2b3c052f14d4db2","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:05:02.774207Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:22:07.383297Z","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-12T09:06:25.807054Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2412.11496","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.11496","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Capacity of hierarchical secure coded gradient aggregation with straggling communication links","venue":null,"work_id":"e5211967-0bbe-4cc9-bdd4-290c2100e939","year":2024},"citing_paper":{"arxiv_id":"2604.26344","last_updated":"2026-04-29T06:52:14Z","snapshot_observed_at":"2026-08-11T05:14:00.647170Z","submitted_at":"2026-04-29T06:52:14Z","title":"On the Capacity of Hierarchical Secure Aggregation with Groupwise Keys","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-07T13:00:29.309914Z"},"links":{"cited_paper":"/paper/2412.11496","citing_paper":"/paper/2604.26344"},"observation_digest":"sha256:74ea9bbf60993f3dcb2622a7ce0bf0f59f89833cb8ccc3f798bf0e0b5f9e423e","observation_id":"b36c80b2-22d3-43a9-89f8-d60bfd01b3ee","resolution":{"observed_at":"2026-05-12T09:06:25.810347Z","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":"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},"cited_work":{"arxiv_id":"2412.11496","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.11496","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Capacity of hierarchical secure coded gradient aggregation with straggling communication links","venue":null,"work_id":"e5211967-0bbe-4cc9-bdd4-290c2100e939","year":2024},"citing_paper":{"arxiv_id":"2605.01849","last_updated":"2026-05-05T14:59:44Z","snapshot_observed_at":"2026-07-06T23:15:01.968194Z","submitted_at":"2026-05-03T12:37:48Z","title":"Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-09T17:00:03.472226Z"},"links":{"cited_paper":"/paper/2412.11496","citing_paper":"/paper/2605.01849"},"observation_digest":"sha256:4ad3f876b324cc1f67f494816eec635c95ce4f2b2d30150866670a5b902e2ec5","observation_id":"22e0e139-e4d4-40fc-b534-9030769a1c7b","resolution":{"observed_at":"2026-05-11T16:26:08.749614Z","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":"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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11496","snapshot_observed_at":"2026-08-15T15:22:07.383297Z","title":"Capacity of hierarchical secure coded gradient aggregation with straggling communication links,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01566","last_updated":"2026-08-03T00:54:23Z","snapshot_observed_at":"2026-08-17T13:54:45.652379Z","submitted_at":"2026-08-03T00:54:23Z","title":"Linear network codes for vector-linear network function computation over three-layer networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:22:07.383297Z"},"links":{"cited_paper":"/paper/2412.11496","citing_paper":"/paper/2608.01566"},"observation_digest":"sha256:41f3ca1e8b7658321668f4284b503dc618c00229a43fac2d874bdc675a717562","observation_id":"9fb87aa4-eb5e-4c97-a751-73ecfa9fa5a0","resolution":{"observed_at":"2026-08-15T15:22:07.383297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.11496/citation-record","integrity":"/paper/2412.11496/integrity","json":"/paper/2412.11496/citation-record.json","paper":"/paper/2412.11496"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.129472Z","title":"Communication-efficient learning of deep networks from decentralized data,","venue":null,"work_id":"613302c9-fd6a-4608-bd32-66c62d2bfe70","year":2017},"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":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.687168Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:163cd71850c3a39e71fe198efa6b1237607d23ccdec595492bb20cbcfe2148e2","observation_id":"b9e181f5-04e0-4b2c-a192-b400184a0675","resolution":{"observed_at":"2026-08-11T15:05:03.132922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.690555Z","title":"Federated learning: Challenges, methods, and future directions,","venue":null,"work_id":null,"year":2020},"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":2,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.690555Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:b307250d064ced9eeb8521e0f4764d501d0563ddefe56f2a87e11a7549372682","observation_id":"398ddde3-0a20-442f-b864-f60fab2a15c4","resolution":{"observed_at":"2026-08-11T15:05:02.690555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.117379Z","title":"Deep leakage from gradients,","venue":null,"work_id":"ce804a16-ee57-49de-81e4-704fbfbad38f","year":2019},"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":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.693336Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:98b32f0f779af2f2c09b2f9b23f8438066794337fd9e844890fb8cfb62e093b8","observation_id":"c3f1d244-07b2-4dff-931f-b10350e18738","resolution":{"observed_at":"2026-08-11T15:05:03.120088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.109404Z","title":"Practical secure aggregation for privacy-preserving machine learning,","venue":null,"work_id":"58587b42-4065-4a65-9fe7-a40c92c80a73","year":2017},"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":4,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.696363Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:fb8679bbd3be1cc05b1abb7a044da0fbbb9be4c5196e5a561c229866de7dcf6d","observation_id":"156f4f67-79a7-425e-be8a-821b3d9659c6","resolution":{"observed_at":"2026-08-11T15:05:03.112372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.699101Z","title":"Lightsecagg: a lightweight and versatile design for secure aggregation in federated learning,","venue":null,"work_id":null,"year":2022},"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":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.699101Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:c7b4358816fab7addc5e4df2e3d05e991bd1ae7a35702c367e146d53ad282319","observation_id":"a7b4f8a6-0b1a-496d-b38a-8951ac66c324","resolution":{"observed_at":"2026-08-11T15:05:02.699101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.701996Z","title":"Turbo-aggregate: Breaking the quadratic aggregation barrier in secure 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":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.701996Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:9fbf29ee2f0b891c46988081e2e32bfe28495fe2d9ddd34e880b0a3e49901664","observation_id":"899b82ea-28d9-4f6e-85d0-21814cab39ef","resolution":{"observed_at":"2026-08-11T15:05:02.701996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.704719Z","title":"Information theoretic secure aggregation with user dropouts,","venue":null,"work_id":null,"year":2022},"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":7,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.704719Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:0baf1070ecd543374731abcb6e005c8e006353dba364afb89aae06dc293152df","observation_id":"b18b21ff-362f-46fd-b725-a5597aa59e5c","resolution":{"observed_at":"2026-08-11T15:05:02.704719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.088388Z","title":"Swiftagg: Communication-efficient and dropout-resistant secure aggregation for federated learning with worst-case security guarantees,","venue":null,"work_id":"782f9131-829f-4a62-9f98-9753097fbca1","year":2022},"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":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.707207Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:ea4dd9887fb61e08e13462dcace600ef95cee70aa34059bf9046b11d3f6c9402","observation_id":"e49c6d59-8031-4958-b745-f0c835745621","resolution":{"observed_at":"2026-08-11T15:05:03.091622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.080532Z","title":"Swiftagg+: Achieving asymptotically optimal communication loads in secure aggregation for federated learning,","venue":null,"work_id":"bfb7a087-fc2d-40a0-82ac-97f4e17189a3","year":2023},"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":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.709939Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:d8ed89f1ba95b9333a05f1f93006cf70cb8e96da8377d341cb27623ff6f04fcb","observation_id":"2f7f94fd-311b-4c32-96a5-57167db91492","resolution":{"observed_at":"2026-08-11T15:05:03.083466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.072247Z","title":"Secure summation: Capacity region, groupwise key, and feasibility,","venue":null,"work_id":"85f4d4f6-18c0-482a-91ea-c6ff827ebba0","year":2024},"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":10,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.712518Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:864292e29c5d36ea0f1858cb47b895fd570bcbfa1e31953ca961b827c0e35348","observation_id":"ffd80d99-1d11-4214-97a4-f38ca86c13e8","resolution":{"observed_at":"2026-08-11T15:05:03.075546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.063922Z","title":"On the information theoretic secure aggregation with uncoded groupwise keys,","venue":null,"work_id":"22bc7865-a130-4f91-b4f0-d99c4bee254c","year":2024},"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":11,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.715052Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:4cf4fd3ad92d80946cc070b62e60052ccb1ff93c2e4209ea5e267332256f5ac7","observation_id":"679541e9-9f8d-421f-8342-b8bae8e8c3c5","resolution":{"observed_at":"2026-08-11T15:05:03.066917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.055872Z","title":"The capacity region of information theoretic secure aggregation with uncoded groupwise keys,","venue":null,"work_id":"565f0761-75de-43c0-b374-7ba0d2da555d","year":2024},"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":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.717813Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:39ac86dcef8c3a26d9b4a2eaacb052af29b7da76a4f4a0177f89c0a0e7909563","observation_id":"822a4960-cb4f-442e-b211-2c6b6f4101f2","resolution":{"observed_at":"2026-08-11T15:05:03.058839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.720241Z","title":"Securing secure aggregation: Mitigating multi-round privacy leakage in federated learn- ing,","venue":null,"work_id":null,"year":2023},"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":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.720241Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:867c3075fade88ef6edef85ebf752273cd06c6138c2b62e36f46bef4ec2527d9","observation_id":"ef653c67-c2c8-4731-9739-d3bf02551959","resolution":{"observed_at":"2026-08-11T15:05:02.720241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02177","last_updated":"2021-10-05T17:07:02Z","snapshot_observed_at":"2026-08-16T17:51:43.423295Z","submitted_at":"2021-10-05T17:07:02Z","title":"Secure Aggregation for Buffered Asynchronous Federated Learning","version":1},"cited_work":{"arxiv_id":"2110.02177","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.02177","snapshot_observed_at":"2026-08-11T15:05:02.939293Z","title":"Secure Aggregation for Buffered Asynchronous Federated Learning","venue":"cs.LG","work_id":"c4261a1d-bb4a-40a1-bd7d-e616363aea86","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":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.722915Z"},"links":{"cited_paper":"/paper/2110.02177","citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:f142822b76e9be4cdfc570a5bea89a355eea6a565c93a86e24b54411e3cf9a80","observation_id":"53b08e45-f321-4419-b710-cb65a7bdf853","resolution":{"observed_at":"2026-08-11T15:05:02.942787Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.043946Z","title":"Federated learning with buffered asynchronous aggregation,","venue":null,"work_id":"e470baca-2208-416f-a248-f705b932fe16","year":2022},"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":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.725807Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:1c18339b396d4fb8b1aeca2ce5adff290e261e3fdd7e88f24f2a00da4f69b7d1","observation_id":"79904ee9-3ed4-4e76-a035-e0f24bd7a17d","resolution":{"observed_at":"2026-08-11T15:05:03.046736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2009.11248","last_updated":"2020-09-23T16:49:02Z","snapshot_observed_at":"2026-08-16T06:39:41.604269Z","submitted_at":"2020-09-23T16:49:02Z","title":"FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11248","snapshot_observed_at":"2026-08-11T15:05:02.728198Z","title":"Fastsecagg: Scalable secure aggregation for privacy-preserving federated learning,","venue":null,"work_id":null,"year":2009},"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":16,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.728198Z"},"links":{"cited_paper":"/paper/2009.11248","citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:076c57b458add9c4240f9c13b951c6569e1b41c5a5c25db7935ba3519aacd818","observation_id":"e47dc6fe-69f7-495c-92db-e626afd40cf0","resolution":{"observed_at":"2026-08-11T15:05:02.728198Z","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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.036005Z","title":"Heterosag: Secure aggregation with heterogeneous quantization in federated learning,","venue":null,"work_id":"fe965a65-420d-42f7-82de-23623b136c44","year":2022},"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":18,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.733874Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:af734878c6b6415d18e8df8f8f34439ebe0f3f0cc54cec226625e48f45466da1","observation_id":"0b61cf56-d403-4de0-992e-10fd8c3a296e","resolution":{"observed_at":"2026-08-11T15:05:03.039301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.736410Z","title":"Secure single-server aggregation with (poly)logarithmic overhead,","venue":null,"work_id":null,"year":2020},"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":19,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.736410Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:d281b1b4ca1449efb21299b2946d74912d18c8ee0ed1ef454005e31cc2f1fdc4","observation_id":"0776c98f-280c-4548-bd10-6da05b3056f8","resolution":{"observed_at":"2026-08-11T15:05:02.736410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.028143Z","title":"Secure gradient aggregation with sparsifi- cation for resource-limited federated learning,","venue":null,"work_id":"66d425c2-3f6d-43e0-8f51-bcc647e2cf82","year":2024},"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":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.739093Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:8b748c638a83c021e17797e5cb4d552cd3545dc3faec7b578b46c30d2620351b","observation_id":"68591d1d-fc56-46e6-ba08-369697955660","resolution":{"observed_at":"2026-08-11T15:05:03.031274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.020606Z","title":"Client-edge-cloud hierarchical federated learning,","venue":null,"work_id":"878979d4-172d-4c00-9be1-0093df8b8105","year":2020},"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":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.741550Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:b48ee104574dbf4fb119e9e97ebc25575de7b8c2c5eb576cb2178f48f36b642f","observation_id":"16b19e8c-daa8-4b07-883a-f84a44370a0f","resolution":{"observed_at":"2026-08-11T15:05:03.023408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.012866Z","title":"Communication-efficient federated learning with adaptive aggregation for heterogeneous client-edge-cloud network,","venue":null,"work_id":"c9af9708-a077-4af4-aa6b-d24f6a6c8f33","year":2024},"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":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.744082Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:c83aabf3ad67baa90736aa026f9a0e5fbf730478d186b2e89d2ac01304914af8","observation_id":"693ac88b-5363-4cde-8a12-c7d6da2094a7","resolution":{"observed_at":"2026-08-11T15:05:03.016022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:03.004850Z","title":"Demystifying why local aggregation helps: Convergence analysis of hierarchical sgd,","venue":null,"work_id":"85bf029b-584c-49b3-b942-e4ee460561e9","year":2022},"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":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.746668Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:4728d1ce512af723945f9b612f869d8af2e493dd0c18d34d207845ab713bce92","observation_id":"5eff6224-3bff-4914-824e-b02e3b4730b7","resolution":{"observed_at":"2026-08-11T15:05:03.007623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.997045Z","title":"Federated learning over multi- hop wireless networks with in-network aggregation,","venue":null,"work_id":"a202679b-714f-4258-a731-a6960b4f6fd3","year":2022},"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":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.750214Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:ffffdbd1d5c07335d90411e13801be8d2c92a8f0ac5d99c6470d4fe6c3436f0e","observation_id":"42a82425-0498-4891-9613-05aad2907b83","resolution":{"observed_at":"2026-08-11T15:05:02.999875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.988994Z","title":"Design and optimization of hierarchical gradient coding for distributed learning at edge devices,","venue":null,"work_id":"e1ca21a3-c5b3-4a56-8091-54929ca045bc","year":2024},"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":25,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.752673Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:91d033aa58f28e940fdeac2175129fdafb23940dc26b121e6df3d31e490367ed","observation_id":"46b3ff5d-3aa9-4651-82de-2dbff5a59ec7","resolution":{"observed_at":"2026-08-11T15:05:02.991989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.980751Z","title":"Hier- archical coded gradient aggregation for learning at the edge,","venue":null,"work_id":"86d47990-bdb2-4563-9d32-628403e27220","year":2020},"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":26,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.755001Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:fe3051ca5bd17b097cc89b19e6b48ac4dce9e6bea249cf4e0346868f7cca8ab0","observation_id":"ceb1c17b-0fcb-463f-897e-92a57798b5d3","resolution":{"observed_at":"2026-08-11T15:05:02.983874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.972793Z","title":"Two-layer coded gradient aggregation with straggling communication links,","venue":null,"work_id":"70c71d2f-54cc-42fb-af58-2547361199d3","year":2020},"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":27,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.757488Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:32550291ad298de323f7c0d7d36b4fae1005621fcd3952aa0632b6fabfedb109","observation_id":"14c0e768-f5c3-4500-bdc2-864bcc080675","resolution":{"observed_at":"2026-08-11T15:05:02.975691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.964693Z","title":"Coded gradient aggregation: A tradeoff between communication costs at edge nodes and at helper nodes,","venue":null,"work_id":"ba88d986-4959-489e-9d14-e1e911a72c51","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":28,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.760032Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:c79bd3d830ef24a2b0762fa79ebf32858ad0ebb15d56d535dd8ce38656aa65b4","observation_id":"b7b995a6-db4d-4761-8b6a-1c8daea0e893","resolution":{"observed_at":"2026-08-11T15:05:02.967944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.956581Z","title":"Hierarchical coded gradient aggregation based on layered mds codes,","venue":null,"work_id":"b671ce8c-d813-410c-8703-1565530ee8f2","year":2023},"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":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.762492Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:a495ca138b3c27510b14ed953a9534665e3847c871ef0e537922079640360c37","observation_id":"e525d3ec-ad2c-4eaf-a320-83865cccfed8","resolution":{"observed_at":"2026-08-11T15:05:02.959658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.948285Z","title":"Private aggregation in wireless federated learning with heterogeneous clusters,","venue":null,"work_id":"4b449079-6236-4f94-9ad7-3a49bb685cd6","year":2023},"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":30,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.765037Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:f89ce3ea95ea437982836798f2984e529376e46268b3dd5d8a88d0971dc8f33a","observation_id":"e35af7d7-e98f-40c0-8893-ad99bf8dccb3","resolution":{"observed_at":"2026-08-11T15:05:02.951333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2306.14088","last_updated":"2024-07-18T09:12:20Z","snapshot_observed_at":"2026-08-16T15:21:23.903011Z","submitted_at":"2023-06-25T01:31:54Z","title":"Private Aggregation in Hierarchical Wireless Federated Learning with Partial and Full Collusion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14088","snapshot_observed_at":"2026-08-11T15:05:02.767689Z","title":"Private aggregation in hierarchical wireless federated learning with partial and full collusion,","venue":null,"work_id":null,"year":2024},"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":31,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.767689Z"},"links":{"cited_paper":"/paper/2306.14088","citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:19815bb01079089e43dc6f7a93183e7cfefc3fd973f8f2375b4ac3e7b6160ad8","observation_id":"2cc6789a-7dd4-4931-9126-239e76d4e9d6","resolution":{"observed_at":"2026-08-11T15:05:02.767689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:05:02.771549Z","title":"Optimal communication and key rate region for hierarchical secure aggregation with user collusion,","venue":null,"work_id":null,"year":2024},"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":32,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.771549Z"},"links":{"citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:78e251d766ff89b2824b4ebf4e55520b613bf85777927a0c60e9c8cdd43ad887","observation_id":"1fd3db42-3f0b-49f3-bb19-1efe3e8116d1","resolution":{"observed_at":"2026-08-11T15:05:02.771549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15067","last_updated":"2024-09-23T14:38:20Z","snapshot_observed_at":"2026-08-16T13:16:14.441639Z","submitted_at":"2024-09-23T14:38:20Z","title":"SHFL: Secure Hierarchical Federated Learning Framework for Edge Networks","version":1},"cited_work":{"arxiv_id":"2409.15067","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.15067","snapshot_observed_at":"2026-08-11T15:05:02.795037Z","title":"SHFL: Secure Hierarchical Federated Learning Framework for Edge Networks","venue":"cs.LG","work_id":"1ec6bbb6-c702-4107-943d-a29776974a1f","year":2024},"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":33,"source":"pdf_text","source_observed_at":"2026-08-11T15:05:02.774207Z"},"links":{"cited_paper":"/paper/2409.15067","citing_paper":"/paper/2412.11496"},"observation_digest":"sha256:2b32b9850d549f9462c0c3996291549ddb79cca6b6be9b8ee0ecfa0751e886ed","observation_id":"cfcaa615-553d-4124-ae4c-b36257ee93c4","resolution":{"observed_at":"2026-08-11T15:05:02.800184Z","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"}}],"paper":{"arxiv_id":"2412.11496","last_updated":"2025-04-24T11:47:44Z","latest_version":2,"primary_category":"cs.IT","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"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":21},"total_outbound_references":33},"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 33 of 33 outbound references and 3 inbound Pith citation observations for arXiv:2412.11496."}