{"as_of":"2026-08-10T23:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db67130a2b5f5d8344698252b0052bfd7860683e370fe85fe2e75b3c3613db6b","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:15:43.848810Z","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-02T08:46:49.045727Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.10764","snapshot_observed_at":"2026-08-10T19:15:43.848810Z","title":"Confidential federated computations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.10560","last_updated":"2025-01-17T21:30:55Z","snapshot_observed_at":"2026-08-10T19:05:47.407886Z","submitted_at":"2025-01-17T21:30:55Z","title":"Picachv: Formally Verified Data Use Policy Enforcement for Secure Data Analytics","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:15:43.848810Z"},"links":{"cited_paper":"/paper/2404.10764","citing_paper":"/paper/2501.10560"},"observation_digest":"sha256:b906601a572f832efd6c23ea67fe1f1f9ff3b4b74b68898a1a016525d50cbdfc","observation_id":"ce33ab3b-8c6c-490e-8f3b-39775825ea1f","resolution":{"observed_at":"2026-08-10T19:15:43.848810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.10764","snapshot_observed_at":"2026-08-08T21:19:39.212631Z","title":"Confidential federated computations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04850","last_updated":"2025-07-13T02:51:38Z","snapshot_observed_at":"2026-08-10T10:59:35.957829Z","submitted_at":"2025-02-07T11:39:27Z","title":"Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T21:19:39.212631Z"},"links":{"cited_paper":"/paper/2404.10764","citing_paper":"/paper/2502.04850"},"observation_digest":"sha256:1f2fdf45a79e3050d8fa261be208cb77250abcd0c87ca34745fbbc73b4c0ad17","observation_id":"d43f50d8-8e05-4c67-be5d-e6d4980a9351","resolution":{"observed_at":"2026-08-08T21:19:39.212631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations","version":2},"cited_work":{"arxiv_id":"2404.10764","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.10764","snapshot_observed_at":"2026-07-02T08:46:49.045727Z","title":"arXiv preprint arXiv:2404.10764 , year=","venue":null,"work_id":"8dc8ce80-94a8-4272-8ac0-63275c2edadd","year":2024},"citing_paper":{"arxiv_id":"2507.02770","last_updated":"2026-04-17T17:37:18Z","snapshot_observed_at":"2026-08-02T05:30:23.349864Z","submitted_at":"2025-07-03T16:31:07Z","title":"Blueprint, Bootstrap, and Bridge: A Security Look at NVIDIA GPU Confidential Computing","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T06:09:18.227980Z"},"links":{"cited_paper":"/paper/2404.10764","citing_paper":"/paper/2507.02770"},"observation_digest":"sha256:b4cc309147cd77c552242b6ffa70987066097847e12c4213abb64d32030ea173","observation_id":"3ab74b5c-9be2-4540-bf00-0c08cc3a1d2f","resolution":{"observed_at":"2026-05-19T06:12:07.207266Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.10764","snapshot_observed_at":"2026-08-04T20:27:30.201971Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08709","last_updated":"2025-09-11T03:44:47Z","snapshot_observed_at":"2026-08-10T13:45:48.729920Z","submitted_at":"2025-09-10T15:58:05Z","title":"Securing Private Federated Learning in a Malicious Setting: A Scalable TEE-Based Approach with Client Auditing","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T20:27:30.201971Z"},"links":{"cited_paper":"/paper/2404.10764","citing_paper":"/paper/2509.08709"},"observation_digest":"sha256:e36bcacd6d89cfb7c6c8026f4b8973b0c1a53f9266e84922f1c6045cdb7b6089","observation_id":"60836689-606c-45ee-afb5-7a645308405a","resolution":{"observed_at":"2026-08-04T20:27:30.201971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations","version":2},"cited_work":{"arxiv_id":"2404.10764","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.10764","snapshot_observed_at":"2026-07-02T08:46:49.045727Z","title":"arXiv preprint arXiv:2404.10764 , year=","venue":null,"work_id":"8dc8ce80-94a8-4272-8ac0-63275c2edadd","year":2024},"citing_paper":{"arxiv_id":"2605.15573","last_updated":"2026-05-15T03:33:20Z","snapshot_observed_at":"2026-07-06T23:26:51.110846Z","submitted_at":"2026-05-15T03:33:20Z","title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","version":1},"reference_index":150,"source":"arxiv_source","source_observed_at":"2026-05-20T19:30:13.469451Z"},"links":{"cited_paper":"/paper/2404.10764","citing_paper":"/paper/2605.15573"},"observation_digest":"sha256:e2da2839e2c5dd1220870687f788a15e96ac84d5747fc897b3759555072de394","observation_id":"f4f7a321-9cb0-4a0f-8b67-abb5d42ce836","resolution":{"observed_at":"2026-05-20T19:33:42.308017Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations","version":2},"cited_work":{"arxiv_id":"2404.10764","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.10764","snapshot_observed_at":"2026-07-02T08:46:49.045727Z","title":"arXiv preprint arXiv:2404.10764 , year=","venue":null,"work_id":"8dc8ce80-94a8-4272-8ac0-63275c2edadd","year":2024},"citing_paper":{"arxiv_id":"2606.02958","last_updated":"2026-06-01T23:28:29Z","snapshot_observed_at":"2026-07-06T23:43:17.879245Z","submitted_at":"2026-06-01T23:28:29Z","title":"Echelon: Auditable Aggregate-Only Language-Model Adaptation Across Privacy Boundaries","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T13:38:48.333498Z"},"links":{"cited_paper":"/paper/2404.10764","citing_paper":"/paper/2606.02958"},"observation_digest":"sha256:dfa5d3298742f00a161b8585afa3b029aa57323a77220fc8d1ace7ca03cf50b6","observation_id":"fd96d9f7-41af-4bae-9e47-8585e4a830f6","resolution":{"observed_at":"2026-07-02T00:06:23.682790Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations","version":2},"cited_work":{"arxiv_id":"2404.10764","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.10764","snapshot_observed_at":"2026-07-02T08:46:49.045727Z","title":"arXiv preprint arXiv:2404.10764 , year=","venue":null,"work_id":"8dc8ce80-94a8-4272-8ac0-63275c2edadd","year":2024},"citing_paper":{"arxiv_id":"2606.04899","last_updated":"2026-06-04T02:56:49Z","snapshot_observed_at":"2026-07-06T23:44:57.208389Z","submitted_at":"2026-06-03T14:01:10Z","title":"DIST-FL: Enhancing Security for TEE-based Aggregation in Federated Learning","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-28T05:46:08.181285Z"},"links":{"cited_paper":"/paper/2404.10764","citing_paper":"/paper/2606.04899"},"observation_digest":"sha256:2b394301f4775ab3998e544eb3b45971156ab12a6dee6b587ff2ad18a36aca45","observation_id":"7f56702a-21c2-4f85-9388-1020435a2f4f","resolution":{"observed_at":"2026-07-02T08:46:49.046997Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.10764/citation-record","integrity":"/paper/2404.10764/integrity","json":"/paper/2404.10764/citation-record.json","paper":"/paper/2404.10764"},"outbound":[],"paper":{"arxiv_id":"2404.10764","last_updated":"2025-03-03T18:15:09Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-07-06T18:01:05.698046Z","submitted_at":"2024-04-16T17:47:27Z","title":"Confidential Federated Computations"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2404.10764."}