{"as_of":"2026-08-11T21:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83953058e58d1fe4fb20b544512aee1bc02fdec513c36b1f6b57aaf98553a587","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T22:57:09.865097Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:29:54.534535Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T23:29:54.708419Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"cited_work":{"arxiv_id":"2407.20068","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.20068","snapshot_observed_at":"2026-08-10T23:29:54.708419Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","venue":"cs.CR","work_id":"6af1ee27-021e-44f1-98f4-80c9b8631887","year":2024},"citing_paper":{"arxiv_id":"2412.20456","last_updated":"2024-12-29T12:51:34Z","snapshot_observed_at":"2026-08-10T23:18:56.476873Z","submitted_at":"2024-12-29T12:51:34Z","title":"Sub-optimal Learning in Meta-Classifier Attacks: A Study of Membership Inference on Differentially Private Location Aggregates","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T23:29:54.534535Z"},"links":{"cited_paper":"/paper/2407.20068","citing_paper":"/paper/2412.20456"},"observation_digest":"sha256:c7bc57c7529def43ca6c63419d5edabb452161942c7185edbdc093995164a5b4","observation_id":"828377bb-b170-43f6-87a4-53a4388ef933","resolution":{"observed_at":"2026-08-10T23:29:54.712560Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/2407.20068/citation-record","integrity":"/paper/2407.20068/integrity","json":"/paper/2407.20068/citation-record.json","paper":"/paper/2407.20068"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rappor: Randomized aggregatable privacy-preserving ordinal response","venue":null,"work_id":"e42e4ed3-2f4c-4bcb-a116-402f84419024","year":2014},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:1dd2a0e0672fd068e14cd9915e70a5fe04121c2f87ff90fa77de43bf17f15b23","observation_id":"80c44021-61b4-49b4-9446-3e21d3af6c02","resolution":{"observed_at":"2026-05-23T22:58:35.109746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Boosting and differential privacy","venue":null,"work_id":"95aec193-4658-4761-9b6e-550a4a255134","year":2010},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:07aab8a9a14ed31129c75c7d002fe3b2dfcd11db6324b77ef865f41ee4cf2f69","observation_id":"3ee9ee0b-a1ea-4b23-b385-c519bc44eb09","resolution":{"observed_at":"2026-05-23T22:58:35.101182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tight on budget? tight bounds for r-fold approximate differential privacy","venue":null,"work_id":"18800f7d-03fe-45b4-b8f7-851646f5635c","year":2018},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:d42bec871c2d5f5ace0d42559ccdabfcf6d25a4d680d54d0c302079c47a3de25","observation_id":"e48b0b78-7a6e-40ef-a7a7-cefc4a7963f4","resolution":{"observed_at":"2026-05-23T22:58:35.104468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rényi differential privacy","venue":null,"work_id":"5506706e-d029-4fe9-87ef-89fd0e2c980e","year":2017},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:6b5a2db5cb87f78862f96c8db200c23c7432e822cc61324e2224eb001a6a8056","observation_id":"1ff002ba-4940-4d59-8973-b23899921cb3","resolution":{"observed_at":"2026-05-23T22:58:35.107188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Privkv: Key-value data collection with local differential privacy","venue":null,"work_id":"f1e3dcc8-f168-4cb7-bcdf-bacdfd66965e","year":2019},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:828a3cbb04aee34b7ef9f10f757ecb81171688f1ed8674e4db0912273e8dbc0e","observation_id":"585fb884-c02d-457f-8e79-005bf6e2c77c","resolution":{"observed_at":"2026-05-23T22:58:35.098087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Collecting triangle counts with edge relationship local differential privacy","venue":null,"work_id":"a67061dd-ea71-4f3b-87b3-457c9808bc39","year":2022},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:cdfb03e5a28f313feb287e9b7962222fbd87bab0cdff073c1c0daee2634454cc","observation_id":"cc2b6847-9dc0-4e50-812b-1bf869eab042","resolution":{"observed_at":"2026-05-23T22:58:35.094919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2304.05516","last_updated":"2023-05-26T16:04:43Z","snapshot_observed_at":"2026-07-06T15:14:36.586919Z","submitted_at":"2023-04-11T21:48:42Z","title":"Echo of Neighbors: Privacy Amplification for Personalized Private Federated Learning with Shuffle Model","version":2},"cited_work":{"arxiv_id":"2304.05516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.05516","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Echo of neighbors: Privacy amplification for personalized private federated learning with shuffle model","venue":null,"work_id":"8dbb027d-b317-40ec-9d59-968af5e736a1","year":null},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"cited_paper":"/paper/2304.05516","citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:e4322fd6c433d04ebf1379bd80aabc60a0f362a67b7bdcad7357183496bd7ec2","observation_id":"214b08b9-d3b2-4459-bf4f-f0e297884f62","resolution":{"observed_at":"2026-05-23T22:58:34.423037Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24432/c5360w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Zijian Zheng, Ron Kohavi, and Llew Mason","venue":"UC Irvine","work_id":"6f5ec42d-1eb6-4447-b2b7-f937f0de239a","year":null},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:ce598837c0dd7bb15258761640139d11700be3bbf458b9d4c1344e1d987b4b9b","observation_id":"e409d8fd-149d-43fa-be4a-7f2d8ed34ac7","resolution":{"observed_at":"2026-05-23T22:58:33.778475Z","resolver_source":"doi","status":"verified_exact"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24432/c5xw20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T10:06:09.313008Z","title":"Becker, R","venue":"UC Irvine","work_id":"87bf1dec-b317-4d1c-834f-647506c211f5","year":1996},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:c018459d4f3037fd52dce409f918394f422d9fadb92f7f655b635b215d76e0e0","observation_id":"c5751952-df6a-4f2e-b7cb-9c9472a9a5c5","resolution":{"observed_at":"2026-05-23T22:58:33.773274Z","resolver_source":"doi","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-04T00:08:29.277373+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-04T00:08:29.277373+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.5428","last_updated":"2014-11-21T20:41:04Z","snapshot_observed_at":"2026-07-06T04:01:06.025894Z","submitted_at":"2014-11-20T03:10:47Z","title":"Differentially Private Algorithms for Empirical Machine Learning","version":2},"cited_work":{"arxiv_id":"1411.5428","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.5428","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differentially Private Algorithms for Empirical Machine Learning","venue":"cs.LG","work_id":"f9bbbd89-32d8-4879-a67a-506620d3c295","year":2014},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"cited_paper":"/paper/1411.5428","citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:ba3b041780aa1dd9c30647ac2361ec6e245999c3e38905e76911ef6abd7f0d47","observation_id":"a15c2be5-90fe-4ab2-8ab2-d0ddbac3a623","resolution":{"observed_at":"2026-05-23T22:58:34.427220Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2103.01294","last_updated":"2021-06-04T14:46:30Z","snapshot_observed_at":"2026-08-04T02:45:16.258329Z","submitted_at":"2021-03-01T20:31:50Z","title":"Wide Network Learning with Differential Privacy","version":3},"cited_work":{"arxiv_id":"2103.01294","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.01294","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wide network learning with differential privacy","venue":null,"work_id":"eeb100e6-714f-4652-9bc7-5d26091b77ec","year":null},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"cited_paper":"/paper/2103.01294","citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:38c84a2b5798f63530adf0ccc6710f10ef6c6924276976504b996984cfaabb47","observation_id":"77522696-efe8-4bfb-a485-98185f772fed","resolution":{"observed_at":"2026-05-23T22:58:34.431392Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2302.14099","last_updated":"2023-02-27T19:18:01Z","snapshot_observed_at":"2026-08-03T09:03:45.137442Z","submitted_at":"2023-02-27T19:18:01Z","title":"On Differentially Private Online Predictions","version":1},"cited_work":{"arxiv_id":"2302.14099","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.14099","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On differentially private online predictions","venue":null,"work_id":"0b80313c-ef65-44d8-9206-09a7b48d0610","year":null},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"cited_paper":"/paper/2302.14099","citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:6b0d3e1e1af8ea16fe932ed8d3486077d82a37feb7559be0eb3294055d7068c6","observation_id":"f2d37909-07df-43cd-ac83-b8e74164947f","resolution":{"observed_at":"2026-05-23T22:58:34.418669Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2201.13376","last_updated":"2022-01-31T17:39:04Z","snapshot_observed_at":"2026-08-03T18:54:43.603931Z","submitted_at":"2022-01-31T17:39:04Z","title":"Differentially Private Top-k Selection via Canonical Lipschitz Mechanism","version":1},"cited_work":{"arxiv_id":"2201.13376","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2201.13376","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Differentially private top-k selection via canonical lipschitz mechanism","venue":null,"work_id":"77206e4a-a7ef-4804-989d-5c8c5f51c1b8","year":null},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"cited_paper":"/paper/2201.13376","citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:5320c911eef51090bab4b367c7995cdfe950203b39e0b759ede8d98ec41539e3","observation_id":"0614131b-406b-40d9-9001-db8329519fbf","resolution":{"observed_at":"2026-05-23T22:58:34.414425Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2105.07260","last_updated":"2021-06-05T21:33:00Z","snapshot_observed_at":"2026-07-06T11:09:44.900908Z","submitted_at":"2021-05-15T16:33:32Z","title":"The Permute-and-Flip Mechanism is Identical to Report-Noisy-Max with Exponential Noise","version":3},"cited_work":{"arxiv_id":"2105.07260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.07260","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The permute-and-flip mechanism is identical to report-noisy-max with exponential noise","venue":null,"work_id":"c3b285dc-4a74-4a08-92af-c9898a52dfbc","year":2019},"citing_paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T22:57:09.865097Z"},"links":{"cited_paper":"/paper/2105.07260","citing_paper":"/paper/2407.20068"},"observation_digest":"sha256:01e7e441260447bda37d5fd9f3c909edd22170701f8d557f09011ca869f2e1a7","observation_id":"090252e9-bd9b-4f23-a640-d9ccf48fb2d5","resolution":{"observed_at":"2026-05-23T22:58:34.409973Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}}],"paper":{"arxiv_id":"2407.20068","last_updated":"2024-07-29T14:54:28Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-07T17:54:57.099399Z","submitted_at":"2024-07-29T14:54:28Z","title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":7,"verified_fuzzy":6},"total_outbound_references":14},"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 14 of 14 outbound references and 1 inbound Pith citation observation for arXiv:2407.20068."}