{"as_of":"2026-08-11T08:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c19ba5451ab993ff6394acd31876dda55427766d2889f18891fb35e758902626","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-04T20:27:30.288886Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.08868","last_updated":"2025-05-29T20:44:31Z","snapshot_observed_at":"2026-08-10T10:55:23.123281Z","submitted_at":"2024-08-16T17:52:22Z","title":"A Hassle-free Algorithm for Private Learning in Practice: Don't Use Tree Aggregation, Use BLTs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08868","snapshot_observed_at":"2026-08-04T20:27:30.288886Z","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":60,"source":"pdf_text","source_observed_at":"2026-08-04T20:27:30.288886Z"},"links":{"cited_paper":"/paper/2408.08868","citing_paper":"/paper/2509.08709"},"observation_digest":"sha256:e1fbf31dd610064658f2ce5cb06b7e6602a291469c7391ca54eda3135167d41c","observation_id":"4fb08601-4b78-4133-877a-888af16210ea","resolution":{"observed_at":"2026-08-04T20:27:30.288886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08868","last_updated":"2025-05-29T20:44:31Z","snapshot_observed_at":"2026-08-10T10:55:23.123281Z","submitted_at":"2024-08-16T17:52:22Z","title":"A Hassle-free Algorithm for Private Learning in Practice: Don't Use Tree Aggregation, Use BLTs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08868","snapshot_observed_at":"2026-08-03T18:53:01.239229Z","title":"B., Xu, Z., and Zhang, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.03238","last_updated":"2026-07-09T21:40:53Z","snapshot_observed_at":"2026-08-04T23:00:48.940171Z","submitted_at":"2025-12-02T21:14:39Z","title":"How to DP-fy Your Data: A Practical Guide to Generating Synthetic Data With Differential Privacy","version":2},"reference_index":164,"source":"arxiv_source","source_observed_at":"2026-08-03T18:53:01.239229Z"},"links":{"cited_paper":"/paper/2408.08868","citing_paper":"/paper/2512.03238"},"observation_digest":"sha256:9670bceadee064da3b136e8d69a6164e0107c26a53e93ecfcb9af96a005628a5","observation_id":"1ffbd3fa-1378-4ae1-bfae-930961b449bb","resolution":{"observed_at":"2026-08-03T18:53:01.239229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08868","last_updated":"2025-05-29T20:44:31Z","snapshot_observed_at":"2026-08-10T10:55:23.123281Z","submitted_at":"2024-08-16T17:52:22Z","title":"A Hassle-free Algorithm for Private Learning in Practice: Don't Use Tree Aggregation, Use BLTs","version":3},"cited_work":{"arxiv_id":"2408.08868","doi":"10.48550/arxiv.2408.08868","metadata_source":"pith","pith_arxiv_id":"2408.08868","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Hassle-free Algorithm for Private Learning in Practice: Don't Use Tree Aggregation, Use BLTs","venue":"cs.LG","work_id":"ffb7c02d-c4f8-4208-8b58-03a8cae1b588","year":2024},"citing_paper":{"arxiv_id":"2607.20727","last_updated":"2026-07-22T20:54:44Z","snapshot_observed_at":"2026-08-07T16:29:18.849035Z","submitted_at":"2026-07-22T20:54:44Z","title":"Edit-Neighboring Data Streams and Privacy under Continual Observation","version":1},"reference_index":130,"source":"arxiv_source","source_observed_at":"2026-08-01T09:41:24.509144Z"},"links":{"cited_paper":"/paper/2408.08868","citing_paper":"/paper/2607.20727"},"observation_digest":"sha256:e64b80dfbaa7f90311f96e651ede7fb167969505eb70df8032d90d3ade3944b3","observation_id":"3633bc1c-0497-44a7-aac6-a8ac3e16bbf6","resolution":{"observed_at":"2026-08-01T09:43:27.995182Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.08868/citation-record","integrity":"/paper/2408.08868/integrity","json":"/paper/2408.08868/citation-record.json","paper":"/paper/2408.08868"},"outbound":[],"paper":{"arxiv_id":"2408.08868","last_updated":"2025-05-29T20:44:31Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T10:55:23.123281Z","submitted_at":"2024-08-16T17:52:22Z","title":"A Hassle-free Algorithm for Private Learning in Practice: Don't Use Tree Aggregation, Use BLTs"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.08868."}