{"as_of":"2026-08-09T06:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:66d7e4e0af8cb9a017647ba5a22d451c9b263e6b37c87e2b9b7fdf0742551771","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-08T06:32:00.761636+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-07T15:42:52.462000Z","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-17T18:00:50.274190Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.04701","last_updated":"2024-10-14T15:52:31Z","snapshot_observed_at":"2026-08-07T14:28:09.592784Z","submitted_at":"2023-05-08T13:32:41Z","title":"Differentially Private Attention Computation","version":2},"cited_work":{"arxiv_id":"2305.04701","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04701","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differentially private attention computation","venue":null,"work_id":"0e7dd120-362f-4207-95c2-3727002be24e","year":2023},"citing_paper":{"arxiv_id":"2306.14048","last_updated":"2023-12-18T19:10:00Z","snapshot_observed_at":"2026-08-06T19:19:02.165567Z","submitted_at":"2023-06-24T20:11:14Z","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","version":3},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-05-17T18:00:50.053377Z"},"links":{"cited_paper":"/paper/2305.04701","citing_paper":"/paper/2306.14048"},"observation_digest":"sha256:a55d3b93028dc4b3c3d21078a8c44604f514bbe4e0964442acb245248888bf4c","observation_id":"bda7a126-8e8f-4c3f-ab0f-1e5290c0f36f","resolution":{"observed_at":"2026-05-17T18:00:50.277018Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04701","last_updated":"2024-10-14T15:52:31Z","snapshot_observed_at":"2026-08-07T14:28:09.592784Z","submitted_at":"2023-05-08T13:32:41Z","title":"Differentially Private Attention Computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.04701","snapshot_observed_at":"2026-08-07T15:42:52.462000Z","title":"Differentially private attention computation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14840","last_updated":"2025-05-20T19:12:43Z","snapshot_observed_at":"2026-08-08T17:27:21.465455Z","submitted_at":"2025-05-20T19:12:43Z","title":"Subquadratic Algorithms and Hardness for Attention with Any Temperature","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:42:52.462000Z"},"links":{"cited_paper":"/paper/2305.04701","citing_paper":"/paper/2505.14840"},"observation_digest":"sha256:b8db02501cccf0ac31a292ba9fea8adc3808a707df3db7489a19dcab3330c139","observation_id":"799a7b38-a586-4eeb-b831-df2531f5fef1","resolution":{"observed_at":"2026-08-07T15:42:52.462000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04701","last_updated":"2024-10-14T15:52:31Z","snapshot_observed_at":"2026-08-07T14:28:09.592784Z","submitted_at":"2023-05-08T13:32:41Z","title":"Differentially Private Attention Computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.04701","snapshot_observed_at":"2026-08-07T10:34:58.384844Z","title":"Differentially private attention computation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05503","last_updated":"2025-06-05T18:40:33Z","snapshot_observed_at":"2026-08-07T10:17:54.125014Z","submitted_at":"2025-06-05T18:40:33Z","title":"On Differential Privacy for Adaptively Solving Search Problems via Sketching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.384844Z"},"links":{"cited_paper":"/paper/2305.04701","citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:88bfab22ff9baed432ebe7e877e8c90fd99e999a731b18c40d1aa44fb33f1180","observation_id":"f34364bd-94f7-49ce-9141-6122672aae05","resolution":{"observed_at":"2026-08-07T10:34:58.384844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.04701/citation-record","integrity":"/paper/2305.04701/integrity","json":"/paper/2305.04701/citation-record.json","paper":"/paper/2305.04701"},"outbound":[],"paper":{"arxiv_id":"2305.04701","last_updated":"2024-10-14T15:52:31Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T14:28:09.592784Z","submitted_at":"2023-05-08T13:32:41Z","title":"Differentially Private Attention Computation"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2305.04701."}