{"as_of":"2026-08-22T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:409483ea1e3cd8e04d7ccbb76f916edee29ca788fa5bb0309199e3dc6520ed9c","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:44:37.320932Z","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-13T23:03:24.650178Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.06761","last_updated":"2026-07-10T19:41:55Z","snapshot_observed_at":"2026-08-22T05:36:46.800310Z","submitted_at":"2024-06-10T19:41:25Z","title":"Wally: Batched Private Nearest Neighbor Search at Scale","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06761","snapshot_observed_at":"2026-08-07T05:44:37.320932Z","title":"Scalable private search with wally","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07868","last_updated":"2025-06-09T15:35:15Z","snapshot_observed_at":"2026-08-17T00:40:01.388732Z","submitted_at":"2025-06-09T15:35:15Z","title":"Securing Unbounded Differential Privacy Against Timing Attacks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:37.320932Z"},"links":{"cited_paper":"/paper/2406.06761","citing_paper":"/paper/2506.07868"},"observation_digest":"sha256:ce8e5c218be0234ba5359463369ee975ce03973aa2feb8b7f82c50bf60e32f3d","observation_id":"60c0d859-6940-483b-a1e2-40f0ca50d6ae","resolution":{"observed_at":"2026-08-07T05:44:37.320932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06761","last_updated":"2026-07-10T19:41:55Z","snapshot_observed_at":"2026-08-22T05:36:46.800310Z","submitted_at":"2024-06-10T19:41:25Z","title":"Wally: Batched Private Nearest Neighbor Search at Scale","version":7},"cited_work":{"arxiv_id":"2406.06761","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06761","snapshot_observed_at":"2026-07-14T00:18:17.246224Z","title":null,"venue":null,"work_id":"9bdf0a8d-ef49-4074-851c-61d701feafdd","year":2024},"citing_paper":{"arxiv_id":"2604.00546","last_updated":"2026-05-29T23:31:36Z","snapshot_observed_at":"2026-08-14T21:02:59.560242Z","submitted_at":"2026-04-01T06:43:36Z","title":"Lightweight, Practical Encrypted Face Recognition with GPU Support","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-13T23:02:25.924721Z"},"links":{"cited_paper":"/paper/2406.06761","citing_paper":"/paper/2604.00546"},"observation_digest":"sha256:b41be1133636339644df026486b4617efe8ba44a864cb217537f51e306fedfb8","observation_id":"9f697ccc-b9bd-4eec-9b24-615089194396","resolution":{"observed_at":"2026-07-14T00:18:17.246224Z","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":"2406.06761","last_updated":"2026-07-10T19:41:55Z","snapshot_observed_at":"2026-08-22T05:36:46.800310Z","submitted_at":"2024-06-10T19:41:25Z","title":"Wally: Batched Private Nearest Neighbor Search at Scale","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06761","snapshot_observed_at":"2026-07-13T15:02:19.760064Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.00546","last_updated":"2026-05-29T23:31:36Z","snapshot_observed_at":"2026-08-14T21:02:59.560242Z","submitted_at":"2026-04-01T06:43:36Z","title":"Lightweight, Practical Encrypted Face Recognition with GPU Support","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T15:02:19.760064Z"},"links":{"cited_paper":"/paper/2406.06761","citing_paper":"/paper/2604.00546"},"observation_digest":"sha256:aa26adacfe89015876e536d46a74d88fe399a1bb6a1091d32330b10c096ad54e","observation_id":"742a2acf-3e20-41b7-9cc5-fb36c3d6c223","resolution":{"observed_at":"2026-07-13T15:02:19.760064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06761","last_updated":"2026-07-10T19:41:55Z","snapshot_observed_at":"2026-08-22T05:36:46.800310Z","submitted_at":"2024-06-10T19:41:25Z","title":"Wally: Batched Private Nearest Neighbor Search at Scale","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06761","snapshot_observed_at":"2026-08-03T15:47:12.394750Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28999","last_updated":"2026-08-04T05:14:18Z","snapshot_observed_at":"2026-08-07T23:09:40.492701Z","submitted_at":"2026-07-31T03:53:24Z","title":"MESS: Fast and Private Semantic Search on Multi-Graph HNSW","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T15:47:12.394750Z"},"links":{"cited_paper":"/paper/2406.06761","citing_paper":"/paper/2607.28999"},"observation_digest":"sha256:1fddbe6e159961a366b2edbddf9cc3b76d0891f278ac55e119e8e51809a34cd8","observation_id":"c920d623-7af3-4843-be98-15185fcc3ef3","resolution":{"observed_at":"2026-08-03T15:47:12.394750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06761","last_updated":"2026-07-10T19:41:55Z","snapshot_observed_at":"2026-08-22T05:36:46.800310Z","submitted_at":"2024-06-10T19:41:25Z","title":"Wally: Batched Private Nearest Neighbor Search at Scale","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06761","snapshot_observed_at":"2026-08-05T04:27:55.949618Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28999","last_updated":"2026-08-04T05:14:18Z","snapshot_observed_at":"2026-08-07T23:09:40.492701Z","submitted_at":"2026-07-31T03:53:24Z","title":"MESS: Fast and Private Semantic Search on Multi-Graph HNSW","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T04:27:55.949618Z"},"links":{"cited_paper":"/paper/2406.06761","citing_paper":"/paper/2607.28999"},"observation_digest":"sha256:313d77cba7eefcc70e5081431129b22d99e141be79b27e3dd6aab6ecec988e47","observation_id":"d6eee0bd-6fd7-4e9a-bd6b-4a9accfd9b44","resolution":{"observed_at":"2026-08-05T04:27:55.949618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.06761/citation-record","integrity":"/paper/2406.06761/integrity","json":"/paper/2406.06761/citation-record.json","paper":"/paper/2406.06761"},"outbound":[],"paper":{"arxiv_id":"2406.06761","last_updated":"2026-07-10T19:41:55Z","latest_version":7,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-22T05:36:46.800310Z","submitted_at":"2024-06-10T19:41:25Z","title":"Wally: Batched Private Nearest Neighbor Search at Scale"},"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 5 inbound Pith citation observations for arXiv:2406.06761."}