{"as_of":"2026-08-22T20:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d22a454ea6ffbd0348ee0f6b93bc1249ee0b89f4e9a27c67b084ccec42fa6eb","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:40:29.608547Z","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-23T06:42:39.792431Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.01704","last_updated":"2025-06-11T21:39:20Z","snapshot_observed_at":"2026-08-21T21:17:35.910908Z","submitted_at":"2024-05-02T20:03:13Z","title":"Privacy-aware Berrut Approximated Coded Computing for Federated Learning","version":3},"cited_work":{"arxiv_id":"2405.01704","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.01704","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Privacy-aware Berrut approximated coded computing for federated learning","venue":null,"work_id":"cb8621db-2371-4ffa-86f9-cc5512a2aeba","year":2024},"citing_paper":{"arxiv_id":"2501.00371","last_updated":"2026-05-08T23:21:46Z","snapshot_observed_at":"2026-07-06T20:15:08.295841Z","submitted_at":"2024-12-31T09:47:55Z","title":"Structured Codes for Distributed Matrix Multiplication","version":4},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-05-23T06:38:33.388040Z"},"links":{"cited_paper":"/paper/2405.01704","citing_paper":"/paper/2501.00371"},"observation_digest":"sha256:4c0467969dfdabf6bad119dbac28d26921ee57f340f221348f19279d3b223b13","observation_id":"928b52ca-e011-4a2a-b3b5-84f102e3b0b1","resolution":{"observed_at":"2026-05-23T06:42:39.794813Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01704","last_updated":"2025-06-11T21:39:20Z","snapshot_observed_at":"2026-08-21T21:17:35.910908Z","submitted_at":"2024-05-02T20:03:13Z","title":"Privacy-aware Berrut Approximated Coded Computing for Federated Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.01704","snapshot_observed_at":"2026-08-15T22:40:29.608547Z","title":"Privacy-aware Berrut approximated coded computing for federated learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.06759","last_updated":"2025-05-10T21:27:40Z","snapshot_observed_at":"2026-08-21T09:41:50.349596Z","submitted_at":"2025-05-10T21:27:40Z","title":"Privacy-aware Berrut Approximated Coded Computing applied to general distributed learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T22:40:29.608547Z"},"links":{"cited_paper":"/paper/2405.01704","citing_paper":"/paper/2505.06759"},"observation_digest":"sha256:4e392016aa75203815effca296cc5ce5c42029a9f368d43ca009b885bfde3b58","observation_id":"24ba1a7e-6099-49e5-9721-bbf49466eb2d","resolution":{"observed_at":"2026-08-15T22:40:29.608547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.01704/citation-record","integrity":"/paper/2405.01704/integrity","json":"/paper/2405.01704/citation-record.json","paper":"/paper/2405.01704"},"outbound":[],"paper":{"arxiv_id":"2405.01704","last_updated":"2025-06-11T21:39:20Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-21T21:17:35.910908Z","submitted_at":"2024-05-02T20:03:13Z","title":"Privacy-aware Berrut Approximated Coded Computing 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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.01704."}