{"as_of":"2026-08-09T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f711738d17f861f916f3327345e8afd32f806678addf93cff72ff0b0a85d0a2","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T21:30:38.122700Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.05898/citation-record","integrity":"/paper/2607.05898/integrity","json":"/paper/2607.05898/citation-record.json","paper":"/paper/2607.05898"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.11908","last_updated":"2019-07-27T13:32:15Z","snapshot_observed_at":"2026-07-06T08:10:40.079646Z","submitted_at":"2019-07-27T13:32:15Z","title":"Local Differential Privacy: a tutorial","version":1},"cited_work":{"arxiv_id":"1907.11908","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.11908","snapshot_observed_at":"2026-07-08T21:35:37.711088Z","title":"Local Differential Privacy: a tutorial","venue":"cs.CR","work_id":"4c9af776-d5a9-4363-8b18-87a68cf5f1d1","year":2019},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/1907.11908","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:69d9fbbb00e11ffba5f490f17a1d7fe3142c1eb30f316d1325cc91306ba18d74","observation_id":"51d84c9a-b55c-4388-8fc6-29df2f2d9350","resolution":{"observed_at":"2026-07-08T21:35:37.712222Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.03570","last_updated":"2022-04-12T16:50:11Z","snapshot_observed_at":"2026-08-07T19:39:02.256723Z","submitted_at":"2021-12-07T08:47:00Z","title":"Membership Inference Attacks From First Principles","version":2},"cited_work":{"arxiv_id":"2112.03570","doi":"10.48550/arxiv.2112.03570","metadata_source":"pith","pith_arxiv_id":"2112.03570","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Membership Inference Attacks From First Principles","venue":"cs.CR","work_id":"50ed9480-ff4e-4b8a-88f4-4f72bef47880","year":2021},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/2112.03570","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:c3749ee60702fb842497f09c8306192af5bf8d6f13bab64c8e3483fa93dc01fa","observation_id":"a907bc4a-aa16-4537-87c6-6c393d2134b8","resolution":{"observed_at":"2026-07-08T21:35:37.694884Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0120.348475","doi":"10.1145/3460120.3484750","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"unbounded","venue":null,"work_id":"1143b765-491c-4699-a42f-36559e88ff56","year":2021},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:fdb006e0a7422381eb3e8ecbe4072da5d308dcc72a4430430d538090e6edaa41","observation_id":"c5a9d605-cd33-427b-9a56-2aa9b1483387","resolution":{"observed_at":"2026-07-08T21:35:37.602530Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.26569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T21:35:37.703394Z","title":"Cheng, P","venue":null,"work_id":"5420a33a-b5e0-4c42-944e-81f8c1975ac5","year":2026},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:36fa8364c3044ea41d59302454f397e1d398e740253c24c0ef3100bf3e3f18de","observation_id":"26aa60c6-66ce-4275-a01c-f91204987c88","resolution":{"observed_at":"2026-07-08T21:35:37.705041Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/0400000042","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T07:06:02.863394Z","title":"2014.The Algorithmic Foundations of Differential Privacy","venue":"Foundations and Trends® in Theoretical Computer Science","work_id":"2b98a090-16f8-424b-b782-6b54235093c7","year":2014},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:f6b0c142ff6356f5aa2f5ff06ae09dbea795eed074e8aa184929af96c9d86938","observation_id":"128c9eb7-6256-438c-abf3-20c8badb4f60","resolution":{"observed_at":"2026-07-08T21:35:37.605782Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-03T18:38:38.595881+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T18:38:38.595881+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.20893","last_updated":"2026-07-11T00:05:42Z","snapshot_observed_at":"2026-08-09T08:23:16.465043Z","submitted_at":"2025-06-25T23:53:56Z","title":"On the Necessity of Output Distribution Reweighting for Effective Class Unlearning","version":5},"cited_work":{"arxiv_id":"2506.20893","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.20893","snapshot_observed_at":"2026-07-14T01:19:53.864690Z","title":"Antonio A","venue":null,"work_id":"3cc733d0-da22-400d-831a-13793739c13c","year":null},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/2506.20893","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:ed2c5835c5b950a806422ca76a586e58beea08730a8fbe44a78943e2c9266d6c","observation_id":"d5dc7cbd-7d25-4a08-a467-b036f3cea758","resolution":{"observed_at":"2026-07-14T01:19:53.864690Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.06985","last_updated":"2025-06-10T19:29:50Z","snapshot_observed_at":"2026-08-07T05:42:14.933753Z","submitted_at":"2025-06-08T03:55:28Z","title":"Certified Unlearning for Neural Networks","version":2},"cited_work":{"arxiv_id":"2506.06985","doi":"10.48550/arxiv.2506.06985","metadata_source":"pith","pith_arxiv_id":"2506.06985","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Certified","venue":"cs.LG","work_id":"454c7434-498d-4e57-a0f7-a7e067de2db5","year":2025},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/2506.06985","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:831751ec0ce986542d4001c766b854c6ac391ae3e971d926a7d2218d0bc42a11","observation_id":"86cf1d17-a777-42ea-8a1d-3e6d21ba8b78","resolution":{"observed_at":"2026-07-08T21:35:37.709904Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.09778","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T21:35:37.715787Z","title":"Milad Nasr, Shuang Song, Abhradeep Thakurta, Nicolas Papernot, and Nicholas Carlini","venue":null,"work_id":"3490762f-70fb-4049-9942-89525af93beb","year":2024},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:524ea2ca7f820eae079e0a3e5463f10784eacc479c1a6e60c10ee9bc37ca37ac","observation_id":"33f20d46-06a6-46d0-b2f5-04a878ba87c8","resolution":{"observed_at":"2026-07-08T21:35:37.717399Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.04535","last_updated":"2021-01-11T18:47:11Z","snapshot_observed_at":"2026-08-03T20:17:52.922893Z","submitted_at":"2021-01-11T18:47:11Z","title":"Adversary Instantiation: Lower Bounds for Differentially Private Machine Learning","version":1},"cited_work":{"arxiv_id":"2101.04535","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.04535","snapshot_observed_at":"2026-07-08T21:35:37.698780Z","title":"Adversary Instantiation: Lower Bounds for Differentially Private Machine Learning","venue":"cs.LG","work_id":"15019ad4-565c-4888-b8db-a1b6a4d3df01","year":2021},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/2101.04535","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:a4332832e43aff9089b1f571fb73c3b61493604738ebfc41e3f5834c01046607","observation_id":"56adf3c5-d326-49a3-8b29-111313616d2f","resolution":{"observed_at":"2026-07-08T21:35:37.699950Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1610.05820","last_updated":"2017-03-31T22:17:07Z","snapshot_observed_at":"2026-07-06T05:15:08.120372Z","submitted_at":"2016-10-18T22:38:33Z","title":"Membership Inference Attacks against Machine Learning Models","version":2},"cited_work":{"arxiv_id":"1610.05820","doi":null,"metadata_source":"pith","pith_arxiv_id":"1610.05820","snapshot_observed_at":"2026-07-08T21:35:37.701091Z","title":"Membership Inference Attacks against Machine Learning Models","venue":"cs.CR","work_id":"ef505872-fc17-4e28-8d69-75518964324c","year":2016},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/1610.05820","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:f7196bbb6350fa869e36f8b79efcdf5ffdd801a3125947faad06f9be5da5990d","observation_id":"9a68df50-837d-4478-807a-8f9e447ef829","resolution":{"observed_at":"2026-07-08T21:35:37.702290Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08846","last_updated":"2023-05-15T17:57:56Z","snapshot_observed_at":"2026-08-09T02:18:40.088599Z","submitted_at":"2023-05-15T17:57:56Z","title":"Privacy Auditing with One (1) Training Run","version":1},"cited_work":{"arxiv_id":"2305.08846","doi":"10.48550/arxiv.2305.08846","metadata_source":"pith","pith_arxiv_id":"2305.08846","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"https://arxiv.org/pdf/2305.08846","venue":"cs.LG","work_id":"e114055f-4e1e-4f3b-9540-1c773340f9bd","year":2023},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/2305.08846","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:3d80dc755aa8aeb9ea570d6d403c6edea02095c9e2c73cd7aaa0235d33b53119","observation_id":"5d245d98-8f8e-4cfd-ab5c-4dcea7514038","resolution":{"observed_at":"2026-07-08T21:35:37.714555Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1198/jasa.2009.tm08651","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https://doi.org/ 10.1198/jasa.2009.tm08651","venue":"Journal of the American Statistical Association","work_id":"d56b767f-9f2e-452a-92db-0e9afb75ac3f","year":2009},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:057f6af7c17a59f472510431508e0891cd4b3a9e33be9da3ec420ed71ed1d47e","observation_id":"3f848e8a-71fa-4170-bbb9-bf0a39558a93","resolution":{"observed_at":"2026-07-08T21:35:37.604080Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:50:22.698736+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:50:22.698736+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00920","last_updated":"2026-04-21T23:36:43Z","snapshot_observed_at":"2026-07-06T18:55:49.577776Z","submitted_at":"2024-08-01T21:22:10Z","title":"Towards Certified Unlearning for Deep Neural Networks","version":4},"cited_work":{"arxiv_id":"2408.00920","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.00920","snapshot_observed_at":"2026-07-08T21:35:37.696029Z","title":"Towards Certified Unlearning for Deep Neural Networks","venue":"cs.LG","work_id":"6fb84423-2aa4-47a9-a599-49acd38657af","year":2024},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"cited_paper":"/paper/2408.00920","citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:adc487a45840d0db6b5ddd41ed386e94a6c65d47a94bc971247216a2e26a2520","observation_id":"24efbdc3-53e3-4518-bc9c-7163d59e9074","resolution":{"observed_at":"2026-07-08T21:35:37.697381Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:38.009467Z","title":null,"venue":null,"work_id":"a7c65b90-cdfa-447d-9f31-fe7a8d600fa1","year":2015},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:d69809fa46070cc6c727596a63c8ff40102075fc60ee0157c151aa32bfcf28d7","observation_id":"c5f0fd6e-4ae8-458a-ad0f-8f22b14c0f6e","resolution":{"observed_at":"2026-07-08T21:35:38.010587Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:37.996671Z","title":"16 Define the upper tailP ε(v) :=Pr u=v πε(u)","venue":null,"work_id":"c2cf3bd5-8c6d-44ff-878b-d8631598a166","year":2000},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:6ac6c1b11ca2a3d9b566ebe1b687e0d3b10c8d095cc95b9032db18900dca7de5","observation_id":"b4fe7a65-1f8c-4b44-9623-c41fd7251d33","resolution":{"observed_at":"2026-07-08T21:35:37.997811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:38.002079Z","title":"From the training portion, we designate 10% of the points as the forget set Df (4,500 points), and use the remaining 40,500 points as the retain set Dr","venue":null,"work_id":"e5af04cb-64ab-41ea-9160-af668b7aaadf","year":2009},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:a3a934425298d194c852d2442b49700c5a40b9bd6494c0aac45d6d58ed9ad740","observation_id":"3e1387e8-31fd-43bf-a9b7-f2c3d7176e6f","resolution":{"observed_at":"2026-07-08T21:35:38.003362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:37.992810Z","title":"A discussion of why this split between auditor instantiations is appropriate is given in Section F.4, with a more detailed study in Section F","venue":null,"work_id":"f0866f8c-a356-4779-96f0-04c3629d9586","year":2017},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:b2d0fd98746b6b4bfb06730013e8c857383ca4e02bd33a44c41d69880e454d64","observation_id":"5df96742-13ed-4e7c-a615-03d6c8405cfc","resolution":{"observed_at":"2026-07-08T21:35:37.994131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:37.994682Z","title":"The retain samples and sampled forget samples are then pooled and shuffled to form the training dataset","venue":null,"work_id":"19880504-cdad-493e-815a-e79aba9f864d","year":2025},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:23acf621b6b4ab6c14543c99744c420a82245289707185bdc36c56bc7728edde","observation_id":"1054eea2-faf3-4b97-add4-439cc9336e31","resolution":{"observed_at":"2026-07-08T21:35:37.995965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:37.998400Z","title":"Model.The model is a 2-layer stacked character-level LSTM following McMahan et al","venue":null,"work_id":"4410490c-193b-4475-afb1-fd8a335ae2d4","year":2017},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:bb3b60fc7ede3446f3b51a01318261ad5989851f2baa91e4d39ab4660a079086","observation_id":"90a972a5-c78f-4147-a676-0d2c377a77c6","resolution":{"observed_at":"2026-07-08T21:35:37.999598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:38.000153Z","title":"further, however, perfect overlap becomes harder to attain — the auditor is forced to commit to low-confidence batches, which dilute the overlap score and pull the bound back down","venue":null,"work_id":"a8507ba6-6336-40b4-ab2b-8adc1c0f93e7","year":2000},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:312091f63b2003242accc479a7a97e677f7809ffbd2cb7609e8186a162f5e4ff","observation_id":"c3ac2bda-97ba-4eb4-81c1-ed8e025befc5","resolution":{"observed_at":"2026-07-08T21:35:38.001474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:38.007657Z","title":null,"venue":null,"work_id":"5f0ce748-fd82-4515-b541-9bfaf7be28f5","year":2025},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:548c72f8dfa780882372bab31c0111a351e218d7bda382d81899f49c70e797be","observation_id":"e94e4c6e-de47-47ef-b333-43582c009d95","resolution":{"observed_at":"2026-07-08T21:35:38.008879Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:37.990838Z","title":"To obtain tighter bounds in this regime we use L= 500 runs","venue":null,"work_id":"a9264a95-0658-4f7f-96e6-1e685177ad5b","year":2025},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:f2e894fc03168aeb546f6c7d69eca9575c4a4ac53d23dfab189cbfc503d00308","observation_id":"ce264f85-26dd-4518-8deb-536b96c89ca1","resolution":{"observed_at":"2026-07-08T21:35:37.992203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:38.004027Z","title":"Shakespeare.We vary q∈ {1,2,4} , Ef ∈ {5,7} , and λ∈ {0.5,1.0,1.5}","venue":null,"work_id":"e8974737-08c8-4e3b-a866-ab6bd593822d","year":2021},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:f02a8e7630e15320074d9f6e0697e5a4eb36ef46a91a29aa0b2fa37d7f93a94b","observation_id":"d1f436f0-0172-410f-8366-3d1e54d28f09","resolution":{"observed_at":"2026-07-08T21:35:38.005246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:38.005896Z","title":null,"venue":null,"work_id":"84f3313b-d15f-49d9-b7bb-86a8ad8a22bd","year":2021},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:51a1754c7ca393d92dbd44b2fb21cc029ea275fb3e9d517fed19d64b0a7995fd","observation_id":"1d8998bf-03f0-47a4-8a92-7daf7cc2df04","resolution":{"observed_at":"2026-07-08T21:35:38.007058Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-08T21:35:38.011158Z","title":"[2021]); this is because the norm bound (∆) used for the addition of Gaussian noise is closer to what is actually attained empirically","venue":null,"work_id":"5cf63584-da3b-4ced-ba48-0ec114677424","year":2021},"citing_paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-08T21:30:38.122700Z"},"links":{"citing_paper":"/paper/2607.05898"},"observation_digest":"sha256:0329864fc562c5689cea1ff74d3d801cb809fc17f17e9c902d87de7b8ab7e280","observation_id":"6bc596f3-f53e-4de5-a9ed-c626fb16afc8","resolution":{"observed_at":"2026-07-08T21:35:38.012459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.05898","last_updated":"2026-07-07T06:51:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T13:06:33.920930Z","submitted_at":"2026-07-07T06:51:55Z","title":"Auditing of Unlearning Algorithms"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":2,"verified_exact":6,"verified_fuzzy":9},"total_outbound_references":25},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.05898."}