{"as_of":"2026-08-17T02:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69ca0fb1947ebdeed9c819f1b5b5ffbd937c7a0a56a9066e7f78ae10b68062d1","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:33:30.465128Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.20662/citation-record","integrity":"/paper/2504.20662/integrity","json":"/paper/2504.20662/citation-record.json","paper":"/paper/2504.20662"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:29.886746Z","title":"Practical secure aggregation for privacy-preserving machine learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:29.886746Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:3fa56d031b0da860ec811fe097717177949377563d7df32d29676cb51b67f465","observation_id":"84629871-ae37-4058-a9e8-19eeaaafee1a","resolution":{"observed_at":"2026-08-16T05:33:29.886746Z","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-16T05:33:29.989003Z","title":"Privacy-preserving deep learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:29.989003Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:c17617b0f4535725d2f5fb7fd16531a19ced1994a72812239ccd8dcd836c029a","observation_id":"b1d0a28b-9c46-47f0-a41d-770160e738ee","resolution":{"observed_at":"2026-08-16T05:33:29.989003Z","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-16T05:33:30.071232Z","title":"How to share a secret,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.071232Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:c764e40ea7c3fadbbe5ba95b526ed9028057dde4f29524a65397ec83fb27acec","observation_id":"3d67f376-5f13-43bd-9fce-bc159917f884","resolution":{"observed_at":"2026-08-16T05:33:30.071232Z","resolver_source":null,"status":"malformed_identifier"},"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-16T05:33:30.077008Z","title":"Non-interactive and information-theoretic secure ver- ifiable secret sharing,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.077008Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:f7186605c8534bf1e8bac268d406c62f70c5a7191025ff9de40c7bac550f1ccc","observation_id":"244859bd-6e9f-4d34-9998-93e915815d9d","resolution":{"observed_at":"2026-08-16T05:33:30.077008Z","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-16T05:33:31.655984Z","title":"On the complexity of verifiable secret sharing and multiparty computation,","venue":null,"work_id":"e0e01ae9-ad72-4c12-969a-e64ec5db86b0","year":2000},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.083905Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:2e3e2954e6e61157b1a0411ae0cba26ccd1e370c3f60d234076c05fe642e7eac","observation_id":"04f4945f-ab8e-4306-b5db-032cefcca749","resolution":{"observed_at":"2026-08-16T05:33:31.761342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2212.62214","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:30.591273Z","title":"Multiparty unconditionally secure protocols,","venue":null,"work_id":"72996356-daec-4866-9bcb-53a47ddfcaed","year":1988},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.089347Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:b0e984316a1694c864e7e9e95f10eb5585172999b46c7e70d244992c68dc3309","observation_id":"6d165359-ebbd-4ab5-b6d7-6834b9483e88","resolution":{"observed_at":"2026-08-16T05:33:30.638884Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T05:33:31.638322Z","title":"Healthcare data gateways: found healthcare intelligence on blockchain with novel privacy risk control,","venue":null,"work_id":"2c205565-f3f6-4d97-9256-b327d7ba74e1","year":2016},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.094719Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:cdd6077ed05950a81305ae81c76a382d40ed2934643a2f20492d7e8d5646cac7","observation_id":"5dece941-36cc-4b4e-81d5-3ca1c8c23e7e","resolution":{"observed_at":"2026-08-16T05:33:31.643552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T05:33:31.405917Z","title":"Gradient coding: Avoiding stragglers in distributed learning,","venue":null,"work_id":"b8ebe296-7249-44c5-8887-4f290730e70b","year":2017},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.162601Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:b966267571ac10c1c146b92174ff1ce7cbe7a895855af20ce518ba0e36406f88","observation_id":"c60d4e37-78b0-4578-897d-5d835ecef539","resolution":{"observed_at":"2026-08-16T05:33:31.516726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T05:33:30.266844Z","title":"Communication-computation efficient gradient coding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.266844Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:db37b56c0eddb3e9b4a23f43bcd1eb83443991f00ce83600fc321c71b0c0b045","observation_id":"efbdbc97-571b-46f6-8062-e6c8ba3ea3ad","resolution":{"observed_at":"2026-08-16T05:33:30.266844Z","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-16T05:33:30.286236Z","title":"Optimal communication- computation trade-off in heterogeneous gradient coding,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.286236Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:1ca2e347f92b7790e463440a64db41ab56c4e04d82be694812e10dc357e0fd1d","observation_id":"3a1c4221-b0e8-4603-a8f8-1bd5d04d16d8","resolution":{"observed_at":"2026-08-16T05:33:30.286236Z","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-16T05:33:31.207327Z","title":"On secure distributed linearly separable computation,","venue":null,"work_id":"d4f7befb-3865-4dce-b897-f6d91ee7373d","year":2022},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.290651Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:6a40275b6cd1c5d4a7426840eab8ae2d6bbbe9f5819bd493e95b7cd24768e76c","observation_id":"8268bf43-d892-4825-ab7b-7487adb90606","resolution":{"observed_at":"2026-08-16T05:33:31.267999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T05:33:31.188478Z","title":"Safelearn: Secure aggregation for private federated learning,","venue":null,"work_id":"1df753f9-10ab-4bf3-b667-a88c9fb2bcb9","year":2021},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.294922Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:3ab881175591e8db9e472313f30be37e935b2863d4dbbbc70a45598e2226bfb8","observation_id":"c530ab4a-4c65-460b-888f-fa953b6196f9","resolution":{"observed_at":"2026-08-16T05:33:31.195408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T18:59:39.427692Z","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-16T23:08:30.821579Z","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:77f26463d4cac95d3dede01f6dbfdda13e8b611ded664bbeadf2de9e2c1e3f33","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:31.103714Z","title":"Lightsecagg: a lightweight and versatile design for secure aggregation in federated learning,","venue":null,"work_id":"589fbbca-ab95-44b0-a8be-3140c3c4f04f","year":2022},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.305745Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:1dcfb77edefeee0873ac897e80ddd1db33c8a6f6192df64cb2a816d0b890ca20","observation_id":"54885d9e-f776-459e-b8c1-c53fbd599983","resolution":{"observed_at":"2026-08-16T05:33:31.176085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T05:33:31.019288Z","title":"Swiftagg: Communication-efficient and dropout-resistant secure aggregation for federated learning with worst-case security guarantees,","venue":null,"work_id":"5332491d-0bfa-4a4b-9ccb-bbb26351aa7a","year":2022},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.310011Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:00e48ba5d15016957ab805e541166ec41316b62c50018047fff46586658f98bb","observation_id":"ea9cef17-922d-4ddf-abc9-51ac7eb9ffc6","resolution":{"observed_at":"2026-08-16T05:33:31.025634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T05:33:30.349946Z","title":"Information theoretic secure aggregation with user dropouts,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.349946Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:7e1a93ef9a021d887fdcb9548bbc71f2100f6e469e82715c49655b72395b89ef","observation_id":"8c1ecdc2-0506-46cc-8cbd-d99b192ac986","resolution":{"observed_at":"2026-08-16T05:33:30.349946Z","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-16T05:33:30.414444Z","title":"Interference alignment and degrees of freedom of the k-user interference channel,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.414444Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:0a9b06615a830713a6f415dd1207a611071e2900b0bdd41b54f080bfdbc80e51","observation_id":"08b8c662-1974-4af0-ba63-796dafc005b2","resolution":{"observed_at":"2026-08-16T05:33:30.414444Z","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-16T05:33:30.903169Z","title":"Degrees of freedom for the mimo interference channel,","venue":null,"work_id":"53c5d545-178b-49ec-9b57-777af8302bfd","year":2007},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.459308Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:5ed4eb4c6dfbc5efb4779a4121975804f2626e7c337660149774a926d0e1b0c1","observation_id":"b4a76222-bc2a-4e49-b10b-a49893305ca6","resolution":{"observed_at":"2026-08-16T05:33:30.979888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T05:33:30.843182Z","title":"Fundamental limits of distributed linearly separable computation under cyclic assign- ment,","venue":null,"work_id":"95ecdfd5-85ef-4767-8898-f23ab4c4682f","year":2023},"citing_paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:30.465128Z"},"links":{"citing_paper":"/paper/2504.20662"},"observation_digest":"sha256:c10a3c68aa21519f02c968b6497f3e5e41a821ac77c71bc0464fde6d4f7190c0","observation_id":"efe8254f-c5f1-4b7a-91af-10cfc945444b","resolution":{"observed_at":"2026-08-16T05:33:30.848388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.20662","last_updated":"2025-04-29T11:37:31Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T23:08:30.821579Z","submitted_at":"2025-04-29T11:37:31Z","title":"On the Optimal Source Key Size of Secure Gradient Coding"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":19},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2504.20662."}