{"as_of":"2026-08-16T05:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4098c304d3fda391c2ccc262528b1d41b2b28dc5c909deba0a133f69eec20e61","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:34:58.477896Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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-02T02:14:35.900597Z","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-19T21:17:48.440598Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.05503","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05503","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Z., Song, Z., Woodruff, D","venue":null,"work_id":"952df829-95fa-4a86-8192-43b49813cfdf","year":2025},"citing_paper":{"arxiv_id":"2510.17162","last_updated":"2026-04-09T08:15:33Z","snapshot_observed_at":"2026-07-06T22:33:34.164422Z","submitted_at":"2025-10-20T05:03:25Z","title":"ALPINE: Closed-Loop Adaptive Privacy Budget Allocation for Mobile Edge Crowdsensing","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T06:23:27.723503Z"},"links":{"cited_paper":"/paper/2506.05503","citing_paper":"/paper/2510.17162"},"observation_digest":"sha256:71c506c1f6103805aeb3c2d6888350a2bf592d88517b3a0fce38c4d656a73a70","observation_id":"e0f34e80-cd74-40de-adfa-d2195b7afb76","resolution":{"observed_at":"2026-05-18T06:25:58.752548Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.05503","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.05503","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Z., Song, Z., Woodruff, D","venue":null,"work_id":"952df829-95fa-4a86-8192-43b49813cfdf","year":2025},"citing_paper":{"arxiv_id":"2605.16618","last_updated":"2026-05-15T20:40:24Z","snapshot_observed_at":"2026-08-15T15:57:26.084589Z","submitted_at":"2026-05-15T20:40:24Z","title":"Adversarially Robust Approximate Furthest Neighbor","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-19T21:16:16.772920Z"},"links":{"cited_paper":"/paper/2506.05503","citing_paper":"/paper/2605.16618"},"observation_digest":"sha256:1f30b73c3916334ad108171d41f911de1c2d3d9630808fa08701816ac7beaa6a","observation_id":"bfa7bd76-c5c7-4508-b246-0112aa56a3bd","resolution":{"observed_at":"2026-05-19T21:17:48.443549Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05503","snapshot_observed_at":"2026-08-02T02:14:35.900597Z","title":"Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.14432","last_updated":"2026-07-15T23:55:51Z","snapshot_observed_at":"2026-08-14T18:05:38.733756Z","submitted_at":"2026-07-15T23:55:51Z","title":"The Adversarial Robustness of Sketching and Streaming Algorithms","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T02:14:35.900597Z"},"links":{"cited_paper":"/paper/2506.05503","citing_paper":"/paper/2607.14432"},"observation_digest":"sha256:9b95f1f9b8e6a92f1876286fdbae208ece3d8c30f197266f69c181ee46309fec","observation_id":"821916fd-9291-4586-9626-612061ccab8d","resolution":{"observed_at":"2026-08-02T02:14:35.900597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.05503/citation-record","integrity":"/paper/2506.05503/integrity","json":"/paper/2506.05503/citation-record.json","paper":"/paper/2506.05503"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.04701","last_updated":"2024-10-14T15:52:31Z","snapshot_observed_at":"2026-08-13T11:47:17.139198Z","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:191475d6db5c6f574ed216800a9f91aa2468938416bf043eddefe1fce11e91fb","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"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05750","last_updated":"2024-11-08T18:10:07Z","snapshot_observed_at":"2026-08-12T22:04:36.031675Z","submitted_at":"2024-11-08T18:10:07Z","title":"On Differentially Private String Distances","version":1},"cited_work":{"arxiv_id":"2411.05750","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.05750","snapshot_observed_at":"2026-08-07T10:34:58.804599Z","title":"On Differentially Private String Distances","venue":"cs.DS","work_id":"053cd270-1e65-47db-b7b6-83400a5fd6c1","year":2024},"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":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.392014Z"},"links":{"cited_paper":"/paper/2411.05750","citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:62fcbe3a1169028d8038586cb924d3238b9a1bd894402b9fcb7819886cf05d0f","observation_id":"fe23d3c1-956a-4b14-974f-107ace1e74a0","resolution":{"observed_at":"2026-08-07T10:34:58.812389Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2407.14717","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:58.626035Z","title":"Differential privacy of cross- attention with provable guarantee.arXiv preprint arXiv:2407.14717,","venue":null,"work_id":"ffd26997-e0d9-48b4-9f62-d096816a6818","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":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.430666Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:7923482a6a60d90c5afecbfe7e7e09b0255786656472c4ff1f0a6f0de85f4a63","observation_id":"3b9c4c5b-709e-44f0-9d35-ab0a36870963","resolution":{"observed_at":"2026-08-07T10:34:58.639677Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:58.987915Z","title":"On efficient retrieval of top similarity vectors","venue":null,"work_id":"20dcee4e-1b76-4d89-bf45-6be17ac14c58","year":2019},"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":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.452210Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:c4cd786e5595b79e5680c81c821fb18d95d6fa3c2af26922feeedb6efde1e0a1","observation_id":"da209cc9-12af-4ea9-8b67-fb15c8399f28","resolution":{"observed_at":"2026-08-07T10:34:58.993472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:58.961819Z","title":"New bounds for matrix multiplication: from alpha to omega","venue":null,"work_id":"2837c900-48e4-4a8b-b999-9d8f8ff38b0a","year":2024},"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":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.459237Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:8f6f46a3c40455404a31badd9a26f2b011c34432bcd7f83fc094ae84a651a04f","observation_id":"c48cd1f6-fbc7-48e7-a2a6-9b98bb184bb1","resolution":{"observed_at":"2026-08-07T10:34:58.970327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:58.938271Z","title":"Woodruff and Samson Zhou","venue":null,"work_id":"c8b6694b-8d1b-4ec4-945b-5ff37cfb6490","year":2024},"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":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.464645Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:f9abfc04c74bdb759736bf838a17f0e83f0a4f6e33bca21e7d793dc2314f3a21","observation_id":"98e021b3-2ba9-4e8d-93a8-109012727796","resolution":{"observed_at":"2026-08-07T10:34:58.944806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:58.908304Z","title":null,"venue":null,"work_id":"8a6c6f13-8f55-4ba1-a53f-a89b993a0602","year":2021},"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":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.471463Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:79d04b685e4df3d64266a9045db81dec58d9b24566cb55dd2cb07dea1d7d2298","observation_id":"e0b6195c-db5c-4fdc-96e3-65be8026cafb","resolution":{"observed_at":"2026-08-07T10:34:58.914871Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:58.878323Z","title":"Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, and Huishuai Zhang","venue":null,"work_id":"2d1c0787-14db-4221-b81f-c2fea960961a","year":2022},"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":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.477896Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:839227d1f3d2e8d508dbbda577b7a2efd24af5e1fecd99307762d0e21101695a","observation_id":"ed701b51-13b1-4cc1-975b-6af4bd441a39","resolution":{"observed_at":"2026-08-07T10:34:58.889097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.00693","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:58.773105Z","title":"Dpbloomfilter: Securing bloom filters with differential privacy.arXiv preprint arXiv:2502.00693,","venue":null,"work_id":"c67dfc7c-8a1c-42cf-b8c8-251a1301f654","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":2004,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.402351Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:b1c36da502b973d5640425db044c10cdf29b5f99f88e3539f2a3099f6a3fb8f0","observation_id":"bf6174cb-28ab-4862-949b-13968698ec5e","resolution":{"observed_at":"2026-08-07T10:34:58.784689Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.121557Z","title":"Evaluating differentially private machine learn- ing in practice","venue":null,"work_id":"ff284d5d-0da0-4141-afd4-dcad511264ac","year":1912},"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":2006,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.397343Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:41c09bed904247f317802f06b9d908fab3f0f35b74d1f1bdd5f27bb7f4d21bdf","observation_id":"ae5e2647-e4fa-4d83-ad5a-5b5b4a1242b1","resolution":{"observed_at":"2026-08-07T10:34:59.126793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.143138Z","title":"[CS21] Benjamin Coleman and Anshumali Shrivastava","venue":null,"work_id":"588e0369-eaa4-4def-85ba-d026926c8fd4","year":2021},"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":2012,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.371467Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:be0aed67e22e309813369000e0c52bede7f6cf43da7c723720943d39234ae8b3","observation_id":"b0a2fdfc-ca12-4879-b32d-5339333b683c","resolution":{"observed_at":"2026-08-07T10:34:59.150660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.096874Z","title":"Faster rectangular matrix multiplication by combination loss anal- ysis","venue":null,"work_id":"c9769c64-1d74-4c95-8b4c-53d9d1860413","year":2024},"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":2013,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.408067Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:1ad20e8c3bb0c4cd34537e7c6e2a6869dc28a2b9f56a96d15dd0a65d6f048984","observation_id":"d6ce2e36-00ad-46f4-9f36-70db1c1e8058","resolution":{"observed_at":"2026-08-07T10:34:59.106035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.013709Z","title":"Announcing scann: Efficient vector similarity search.https: // blog","venue":null,"work_id":"4fba9185-5a31-4c0f-831e-59263914b604","year":2020},"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":2014,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.445094Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:4715338a39cb902e7b9e1f6280e13f22c0983c074d132387b3bb2c1bddb4d99e","observation_id":"bb204669-56d3-407e-993e-5de0da9b6c93","resolution":{"observed_at":"2026-08-07T10:34:59.020855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.164560Z","title":"Near-optimal private and scalablek-clustering","venue":null,"work_id":"5421d043-c861-4ea0-9c06-4d1e9013837b","year":2022},"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":2019,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.365329Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:8fd3e35433cb638b6017598832ca502e5ca27ac0d88263af1c3d6ac2735ec2b9","observation_id":"6b771b8f-6365-471e-97ab-09cc4d132cdc","resolution":{"observed_at":"2026-08-07T10:34:59.171263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.190555Z","title":"Liu, Richard Peng, and Aaron Sidford","venue":null,"work_id":"b89293a0-58ee-4ca7-a21a-7d0f00f60571","year":2022},"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":2020,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.359472Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:86d74ba5d5086a6748e6ac49c1e612248b48f8cd102f326ad44730b5f45130f7","observation_id":"9037a66b-7c10-42d8-9656-f1b5ec17a8de","resolution":{"observed_at":"2026-08-07T10:34:59.203325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07706","last_updated":"2024-02-29T03:22:51Z","snapshot_observed_at":"2026-08-13T21:14:40.464852Z","submitted_at":"2023-12-12T20:09:07Z","title":"Near-Optimal Differentially Private k-Core Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.07706","snapshot_observed_at":"2026-08-07T10:34:58.379359Z","title":"Li, and Quanquan C","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":2021,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.379359Z"},"links":{"cited_paper":"/paper/2312.07706","citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:49a7582a00064c0f455ed1d443170759d575f031fe400e3fbaf00220826c3b4a","observation_id":"323fac80-19b6-452a-a994-8131e1107482","resolution":{"observed_at":"2026-08-07T10:34:58.379359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.221180Z","title":"Deep learning with differential privacy","venue":null,"work_id":"28452cb9-7628-447e-a6e1-9cb263521372","year":2016},"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":2022,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.352179Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:a4c9d70554a3d58645aba7c7ac5a5b19cc402961c47a7a8cf6870e17420bbb93","observation_id":"ef35fe82-2ad8-4c06-b530-15dc8172bfb3","resolution":{"observed_at":"2026-08-07T10:34:59.228291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.045921Z","title":"A survey of collaborative filtering tech- niques.Advances in artificial intelligence, 2009,","venue":null,"work_id":"7194a811-9780-40a8-b127-88caca099d68","year":2009},"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":2023,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.439533Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:fcfa6b949c8edd30bd426d051acbd9f78810bb0f964c389daef9cbedb3faa294","observation_id":"1ab30e8b-4e32-4641-92df-28e806381c27","resolution":{"observed_at":"2026-08-07T10:34:59.055327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01688","last_updated":"2025-03-24T00:13:57Z","snapshot_observed_at":"2026-08-14T05:13:22.274449Z","submitted_at":"2024-09-03T08:01:19Z","title":"Differentially Private Kernel Density Estimation","version":3},"cited_work":{"arxiv_id":"2409.01688","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.01688","snapshot_observed_at":"2026-08-07T10:34:58.667097Z","title":"Differentially Private Kernel Density Estimation","venue":"cs.DS","work_id":"e3a0f2b6-e56a-47e7-bb73-3a18da551ca7","year":2024},"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":2024,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.413696Z"},"links":{"cited_paper":"/paper/2409.01688","citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:74a69730bbb467a0fe4d5a2a676ac29648c4eced92168779f98118cc105af5dc","observation_id":"34a4c74f-e32f-46d9-a1a6-014d6f58d25d","resolution":{"observed_at":"2026-08-07T10:34:58.676399Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:34:59.069101Z","title":"Li, Dung Nguyen, and Anil Vullikanti","venue":null,"work_id":"7594d7e8-5414-4327-9826-f09b4903ce24","year":2023},"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":2025,"source":"pdf_text","source_observed_at":"2026-08-07T10:34:58.419745Z"},"links":{"citing_paper":"/paper/2506.05503"},"observation_digest":"sha256:a472719eb430700f1ce346e8d3f9042d38a29e342131639de88092990da4c763","observation_id":"d5c1773c-c78e-4942-b7a7-ffee04de8d30","resolution":{"observed_at":"2026-08-07T10:34:59.078316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05503","last_updated":"2025-06-05T18:40:33Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":4,"verified_fuzzy":13},"total_outbound_references":20},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 3 inbound Pith citation observations for arXiv:2506.05503."}