{"as_of":"2026-08-07T21:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f77599ef1eb9eb78bcc8e88698447afd740dfc2b7716bef5e83ac30f2d94251d","coverage":[{"denominator":109,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:53:52.653253Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.13048/citation-record","integrity":"/paper/2506.13048/integrity","json":"/paper/2506.13048/citation-record.json","paper":"/paper/2506.13048"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:43.343764Z","title":"The space complexity of approximating the frequency moments","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:43.343764Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:16fcc0631da03b480d9c3327fb39018c4b42f46d8dc63c3fae38d638155fce0e","observation_id":"adf816d7-3a85-42fd-aff8-86b2b9b2bae2","resolution":{"observed_at":"2026-08-07T00:53:43.343764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14445","last_updated":"2024-03-21T14:52:03Z","snapshot_observed_at":"2026-07-06T17:48:24.076444Z","submitted_at":"2024-03-21T14:52:03Z","title":"History-Independent Concurrent Objects","version":1},"cited_work":{"arxiv_id":"2403.14445","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.14445","snapshot_observed_at":"2026-08-07T00:53:54.298688Z","title":"History-Independent Concurrent Objects","venue":"cs.DC","work_id":"e32fa61e-f45a-49ff-8dbc-035cd99b46b8","year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:43.447161Z"},"links":{"cited_paper":"/paper/2403.14445","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:9a956c7a2d250b5b7c165facb42f4c00884abb28f747c0aa5a770108569751c1","observation_id":"fc7b0f37-9ff0-48b2-9e1f-4131e471dca2","resolution":{"observed_at":"2026-08-07T00:53:54.372959Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:43.601253Z","title":"Time-space tradeoffs for learning finite functions from random evaluations, with applications to polynomials","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:43.601253Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:c547e91547db5992e3c973557b24d6630b8fcb137a9babfd6d204d45f7d702ef","observation_id":"c11f315b-c1e2-4fd5-a3be-005fff850f47","resolution":{"observed_at":"2026-08-07T00:53:43.601253Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:43.692290Z","title":"Leace: Perfect linear concept erasure in closed form","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:43.692290Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:c8ddadea8fc4cf6ec8bff252128e58ade414bc11d3a3d96a445b061cadf424ea","observation_id":"916eb486-f477-410a-82b4-011b92a79840","resolution":{"observed_at":"2026-08-07T00:53:43.692290Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:43.783498Z","title":"History-independent dynamic partitioning: Operation-order privacy in ordered data structures","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:43.783498Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:14432a2ae559c053c947b285edb4abb0745da24a77a2346502dfd373bbf4e726","observation_id":"9628adbf-5935-46a6-8702-7517465973c8","resolution":{"observed_at":"2026-08-07T00:53:43.783498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06720","last_updated":"2024-04-10T04:15:50Z","snapshot_observed_at":"2026-07-06T17:58:05.136931Z","submitted_at":"2024-04-10T04:15:50Z","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","version":1},"cited_work":{"arxiv_id":"2404.06720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.06720","snapshot_observed_at":"2026-08-07T00:53:54.177858Z","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","venue":"math.OC","work_id":"1d65573d-19c8-4e5f-9f23-2772d39fb923","year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:43.883206Z"},"links":{"cited_paper":"/paper/2404.06720","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:82af3df1ec04f0a6d15816b54017c63cef07b6b49e953f80372e9c79b7cf31d4","observation_id":"09bfe4b6-ca42-452b-91cc-5620de368d52","resolution":{"observed_at":"2026-08-07T00:53:54.212674Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.005148Z","title":"Strongly history-independent hashing with applications","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.005148Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:e797b2f018599a36a1ec0acc070a9d02056ce4ad01b1fa02fd4ecb0ddad45c85","observation_id":"aa879cbd-95dc-4ff4-9571-06a198661b5f","resolution":{"observed_at":"2026-08-07T00:53:44.005148Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.067648Z","title":"Machine unlearning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.067648Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:3bae07bf2259196c17e1af8bfbbe5a5192a599b6d30b27452fc106e446ec753a","observation_id":"dcdb9132-8a6b-4330-bbe8-b843d298e2c0","resolution":{"observed_at":"2026-08-07T00:53:44.067648Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.181151Z","title":"Proper learning, helly number, and an optimal svm bound","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.181151Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:dba76b66a074afba1cedd2a85531557d97fd90449f856892525523a89e26d4de","observation_id":"d66743b7-c7a5-4448-aa4b-c8103aa90b40","resolution":{"observed_at":"2026-08-07T00:53:44.181151Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.295255Z","title":"Proper learning, helly number, and an optimal SVM bound","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.295255Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:7dd0f61ab8d0c2644f3b66ae5ee9a71e070d0f29e486fa48f6ee7eb4dd40bd65","observation_id":"8fea8acf-2366-46f7-817f-12aa8aac17e3","resolution":{"observed_at":"2026-08-07T00:53:44.295255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03547","last_updated":"2019-09-08T21:19:34Z","snapshot_observed_at":"2026-08-03T11:42:10.222324Z","submitted_at":"2019-09-08T21:19:34Z","title":"Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.03547","snapshot_observed_at":"2026-08-07T00:53:44.395203Z","title":null,"venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.395203Z"},"links":{"cited_paper":"/paper/1909.03547","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:cbb716156d4727c9e2fea47f58a5fa9769d280d4ccc2ded5bb6fbf5f61f6bc10","observation_id":"f3067376-9ca0-46be-b672-9977793e8bc9","resolution":{"observed_at":"2026-08-07T00:53:44.395203Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.458531Z","title":"Machine unlearning for random forests","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.458531Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:5585a5aafc314ae56df8ff012c61bb00b3c6e96fd49ff49e599192592002deaf","observation_id":"064f5973-1a0d-493c-a5a6-3de58a685294","resolution":{"observed_at":"2026-08-07T00:53:44.458531Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.515792Z","title":"Lower and upper bounds on obtaining history independence","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.515792Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:346c9034894319e1da4c183bb08e32a8503100e53fe47cc4461ac1b78ef1f3f4","observation_id":"1b8f89e2-6397-4ed4-997e-85a43128418e","resolution":{"observed_at":"2026-08-07T00:53:44.515792Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.587499Z","title":"Towards making systems forget with machine unlearning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.587499Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:2f1a99b020e0703d4ce87903c0495b0781d855b54e94a4e4a2ff522021aa071e","observation_id":"a855d14e-c947-4246-84d3-75f3d7a1c40a","resolution":{"observed_at":"2026-08-07T00:53:44.587499Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.707399Z","title":"Membership inference attacks from first principles","venue":null,"work_id":null,"year":1914},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.707399Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:4692cfcdeb89f9c39531fd913a978c5ec5c5f80246b5f1e18527f1d7bc6bd2e8","observation_id":"4b9b3d0c-4e8d-47a8-bfa9-a511139599ec","resolution":{"observed_at":"2026-08-07T00:53:44.707399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.13188","last_updated":"2023-01-30T18:53:09Z","snapshot_observed_at":"2026-08-03T19:59:42.715353Z","submitted_at":"2023-01-30T18:53:09Z","title":"Extracting Training Data from Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.13188","snapshot_observed_at":"2026-08-07T00:53:44.836085Z","title":"Extracting training data from diffusion models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.836085Z"},"links":{"cited_paper":"/paper/2301.13188","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:f9b110b83fa7c66c97d6d316c950cd183fad4464790f9b5a4c48a314848feacf","observation_id":"2af37432-feb2-4ae7-87b0-a26ccfaafb84","resolution":{"observed_at":"2026-08-07T00:53:44.836085Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:44.974769Z","title":"Quantifying memorization across neural language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:44.974769Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:e0a5fb99bb5bc2b9eef1ca92b272e8c850f5e8abc6a96147de93e345db70c641","observation_id":"e8065d20-519b-44ed-b194-7cc83326c3f1","resolution":{"observed_at":"2026-08-07T00:53:44.974769Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.112316Z","title":"Incremental and decremental support vector machine learning","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.112316Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:f33741140d823696a0a369cc6ad6e8bbd717c5f8993d04803b682eabdc9eee4f","observation_id":"884d6421-2691-4fa5-9f5b-457f86a739e0","resolution":{"observed_at":"2026-08-07T00:53:45.112316Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.211779Z","title":"California consumer privacy act (ccpa)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.211779Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:485a6e91e674160fd5cc5987ac0ba212b30c7d56471510ba6af9977606c9c3a6","observation_id":"53382161-7a9b-4cf0-9ccf-7024648220a0","resolution":{"observed_at":"2026-08-07T00:53:45.211779Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.278908Z","title":"Langevin unlearning: A new perspective of noisy gradient descent for machine unlearning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.278908Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:af824bbc4daafb7a79ae33ceeecd9326600ac49e5815a7a64e89a00686f5a48f","observation_id":"751386d4-d4c5-4f27-b49d-a4815b0fe56e","resolution":{"observed_at":"2026-08-07T00:53:45.278908Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.351537Z","title":"Forget unlearning: Towards true data-deletion in machine learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.351537Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:6e76086d2d2af7d504cf76fc833f14e6e24943fdf262b118eac8536d89550e8f","observation_id":"1e31f86b-4f0b-43dd-9eae-622e48248734","resolution":{"observed_at":"2026-08-07T00:53:45.351537Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.416338Z","title":"Towards formalizing the gdpr’s notion of singling out","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.416338Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:4b156e524deb7442ec70f2f16119a8db8897804a0c1690fcfbad223d50c80e5a","observation_id":"b7c79541-b00e-4421-8276-dc1b21b3c9c0","resolution":{"observed_at":"2026-08-07T00:53:45.416338Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.498029Z","title":"Control, confidentiality, and the right to be forgotten","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.498029Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:c9574487c93dd6588a317681b4a62af6dcd29a199cdb6496f5ea73bf0325b1a1","observation_id":"316c96d9-9f4f-4ba4-98b0-5a52f43cf764","resolution":{"observed_at":"2026-08-07T00:53:45.498029Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.624097Z","title":"Characterizations of an empirical influence function for detecting influential cases in regression","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.624097Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:ed560979b32d4d17e888e7e869a58336ad0219d999b4a3fe0e0a85b1d02ab5dd","observation_id":"7eb3523c-944e-4e4a-ab53-e0cf4c6e8084","resolution":{"observed_at":"2026-08-07T00:53:45.624097Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.781100Z","title":"The two-armed-bandit problem with time-invariant finite memory","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.781100Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:8efbdf3ff7f80ac4e4346c1cb842eedc0cbfab5d55ba8ea2c7d9088051bbf53b","observation_id":"66bdea04-19c9-46ce-b5c2-72d1d5b6f6ba","resolution":{"observed_at":"2026-08-07T00:53:45.781100Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:45.937068Z","title":"Hypothesis testing with finite statistics","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:45.937068Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:a7df281b6e211063efcbf556ddfc0500db08c727c37c86dda4455f9dc741637a","observation_id":"149f722f-26df-42b5-ac9a-e36f5f428b7e","resolution":{"observed_at":"2026-08-07T00:53:45.937068Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:46.030337Z","title":"Optimal finite memory learning algorithms for the finite sample problem","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.030337Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:6776dd6e266144c773b68779f54237703e383c9f6005fd17aebdb5ac7288aca8","observation_id":"354bb9c2-425e-43d8-b8a1-81ee3295034d","resolution":{"observed_at":"2026-08-07T00:53:46.030337Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:46.191849Z","title":"Lifelong anomaly detection through unlearning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.191849Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:bf579eafb8f9674372e8c6ff657bf4ea638ae57a5e06efff28c58aab6ae1e6e3","observation_id":"a7ecf9b9-1744-48f2-a3d4-c28a10a552b1","resolution":{"observed_at":"2026-08-07T00:53:46.191849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.13169","last_updated":"2023-08-22T16:42:25Z","snapshot_observed_at":"2026-07-06T15:20:01.683152Z","submitted_at":"2023-04-25T22:02:09Z","title":"SAFE: Machine Unlearning With Shard Graphs","version":2},"cited_work":{"arxiv_id":"2304.13169","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.13169","snapshot_observed_at":"2026-08-07T00:53:53.944052Z","title":"SAFE: Machine Unlearning With Shard Graphs","venue":"cs.LG","work_id":"0ae7d49f-d3c9-465b-a2ee-25434eca9533","year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.363129Z"},"links":{"cited_paper":"/paper/2304.13169","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:a1fe67e0d92b8c27fbbdda0b457ac157c755b5d7c9523251b1ed5aa39189e41d","observation_id":"147fadf0-0cd5-4551-a412-04c785d82443","resolution":{"observed_at":"2026-08-07T00:53:53.977126Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:46.442995Z","title":"Calibrating noise to sensitivity in private data analysis","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.442995Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:2f7d76113d0143d6830680d7f4f161ffea000bdbdaca17a01e6b28198b4390db","observation_id":"957f2fc1-ec27-4b4a-bf97-edb2c6dcc8ab","resolution":{"observed_at":"2026-08-07T00:53:46.442995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09126","last_updated":"2025-03-05T09:30:22Z","snapshot_observed_at":"2026-07-06T14:06:41.075058Z","submitted_at":"2022-10-17T14:19:52Z","title":"Verifiable and Provably Secure Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.09126","snapshot_observed_at":"2026-08-07T00:53:46.562314Z","title":"Verifiable and provably secure machine unlearning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.562314Z"},"links":{"cited_paper":"/paper/2210.09126","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:7ec3d28a8d1cae060b21bcffb87613fa59d52996398fb4b6880521571b68f46f","observation_id":"b0fc417b-67c0-4447-b087-13730e32123c","resolution":{"observed_at":"2026-08-07T00:53:46.562314Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:46.666229Z","title":"Active learning via perfect selective classification","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.666229Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:2a008a7e74fcb384f96382e1f51074c842c95eadad614f1c1da4dbef8ff89a58","observation_id":"82d4e55e-244e-43d7-8d1e-c796e9b45492","resolution":{"observed_at":"2026-08-07T00:53:46.666229Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:46.807166Z","title":"On the foundations of noise-free selective classification","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.807166Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:be033f8867acd44f9e2acc381a4c0695e4dca5145e3ddaa10301bfc5860f04e1","observation_id":"100061fb-65ed-44a4-9860-7cba925b9b62","resolution":{"observed_at":"2026-08-07T00:53:46.807166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02238","last_updated":"2023-10-04T05:20:19Z","snapshot_observed_at":"2026-08-06T15:19:35.944642Z","submitted_at":"2023-10-03T17:48:14Z","title":"Who's Harry Potter? Approximate Unlearning in LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02238","snapshot_observed_at":"2026-08-07T00:53:46.902359Z","title":"Who's harry potter? approximate unlearning in llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:46.902359Z"},"links":{"cited_paper":"/paper/2310.02238","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:1f2d15834468b7cb99910802584e36e176769ea47044889f13370ffe396f59b4","observation_id":"aa0ba5a9-6e66-4982-a548-b54f0c95ec7c","resolution":{"observed_at":"2026-08-07T00:53:46.902359Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:47.036071Z","title":"Probabilistic counting algorithms for data base applications","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.036071Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:639738b0653e22207ca3e400873b5bdc3c1dd9fbf4e1475322e6896e4e80c818","observation_id":"bd66749f-631b-4936-97fd-c825ac11eeee","resolution":{"observed_at":"2026-08-07T00:53:47.036071Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:47.191290Z","title":"Sample compression, learnability, and the vapnik-chervonenkis dimension","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.191290Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:c1efd90cf993cd8742007a5a65a6fb581b92022410fef51f1a5fea05661f7119","observation_id":"cb3e22c5-799c-4ba8-b541-d3fc6b7edad2","resolution":{"observed_at":"2026-08-07T00:53:47.191290Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:47.326709Z","title":"Formalizing data deletion in the context of the right to be forgotten","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.326709Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:490823b874e104a766dae8326ca92588e4515d9b4de76595d780e08870ad656d","observation_id":"ff6052cb-a969-4f24-8fb9-5fd0768fc5c4","resolution":{"observed_at":"2026-08-07T00:53:47.326709Z","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-07T00:54:03.520484Z","title":"Extractor-based time-space lower bounds for learning","venue":null,"work_id":"e19e0fdf-74ac-4f83-b660-b4fdbe8b9c1c","year":2018},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.441208Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:773e44d01d29cb912e85b155a54ddf9f5c8f1f33f5404645a6a93102c3429e50","observation_id":"8f10e3ea-5a70-4c88-97c2-f7e7fe5c9470","resolution":{"observed_at":"2026-08-07T00:54:03.578110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:03.372355Z","title":"Regulation (EU) 2016/679 of the European parliament and of the council of 27 April 2016","venue":null,"work_id":"49d0eb4b-bb9b-4836-80a1-a2ac12b2014b","year":2016},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.570372Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:c8588796ff2dd3f70d52340f4b2ccc6dc00fb779e072589cf6391eeca3a1ebee","observation_id":"073adce5-b0f4-4394-b652-8b1a8b1fc829","resolution":{"observed_at":"2026-08-07T00:54:03.448694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:03.221402Z","title":"Ticketed learning-unlearning schemes, 2023","venue":null,"work_id":"c5bb761e-2439-4a89-ab66-a63c53667e6c","year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.726759Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:117c7c020ef4b2234296f5f8bdf076fb76f53ef9abea27ca07a2008a13d0177d","observation_id":"b0d6a0e0-4bcd-4942-807d-99241fd13e49","resolution":{"observed_at":"2026-08-07T00:54:03.300848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:03.084513Z","title":"Making AI forget you: Data deletion in machine learning","venue":null,"work_id":"79163730-6d3a-4a46-892a-c4aa29251eb3","year":2019},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.795629Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:4ebc101f570b0b633324158052af224fd52306843d0f1511bb330c633c2b2ae7","observation_id":"79d56218-dc0a-449e-96f7-3214aad97467","resolution":{"observed_at":"2026-08-07T00:54:03.141461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:02.913139Z","title":"Deletion-compliance in the absence of privacy","venue":null,"work_id":"7728f86f-6e25-49c3-97b6-0413c197bbae","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:47.893008Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:32a44b98b74daa7aa5626eb2a8b796bcaadf0959b41717a87480b02e0d647f18","observation_id":"b21eddd2-40ef-4196-b51c-cb04a12c9008","resolution":{"observed_at":"2026-08-07T00:54:02.997665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.06640","last_updated":"2023-02-22T12:33:14Z","snapshot_observed_at":"2026-07-06T12:28:07.214555Z","submitted_at":"2022-01-17T21:49:21Z","title":"Towards Adversarial Evaluations for Inexact Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.06640","snapshot_observed_at":"2026-08-07T00:53:48.044883Z","title":"Towards adversarial evaluations for inexact machine unlearning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.044883Z"},"links":{"cited_paper":"/paper/2201.06640","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:a3ed9e4757d317b942a9817403c8648a77a5aac5c23cc3af22c2259b724c43fe","observation_id":"eb2a5d9c-bf22-4beb-a556-ab72719c5d11","resolution":{"observed_at":"2026-08-07T00:53:48.044883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14015","last_updated":"2024-10-17T16:47:51Z","snapshot_observed_at":"2026-08-06T06:24:54.403848Z","submitted_at":"2024-02-21T18:54:37Z","title":"Corrective Machine Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14015","snapshot_observed_at":"2026-08-07T00:53:48.136832Z","title":"Corrective machine unlearning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.136832Z"},"links":{"cited_paper":"/paper/2402.14015","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:36f8297293eb6c3684f438acbf9acd8285c8ef86d21574b67dd4a6dcb420c7b9","observation_id":"3c323d82-1ed6-4984-95e4-859139f4e62a","resolution":{"observed_at":"2026-08-07T00:53:48.136832Z","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-07T00:54:02.739731Z","title":"Eternal sunshine of the spotless net: Selective forgetting in deep networks","venue":null,"work_id":"33340a0c-647b-4bc4-8c1f-823e8931a29e","year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.278427Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:de7260fd0b70743d08bd46217987eaaeece1a6a0ec77221d4581910e35c6d524","observation_id":"9cd13c39-26dc-4368-af6e-271e295d560e","resolution":{"observed_at":"2026-08-07T00:54:02.811217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.02960","last_updated":"2020-10-29T02:23:28Z","snapshot_observed_at":"2026-07-06T09:02:38.469130Z","submitted_at":"2020-03-05T23:17:35Z","title":"Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observations","version":3},"cited_work":{"arxiv_id":"2003.02960","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.02960","snapshot_observed_at":"2026-08-07T00:53:53.788856Z","title":"Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observations","venue":"cs.LG","work_id":"274903b4-d436-4cdd-8a5a-63ee5ac1d939","year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.434751Z"},"links":{"cited_paper":"/paper/2003.02960","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:d1c9f220f6dc3485adcfeb5f1b7eb915c787ce9884a1036eedff018fe5905139","observation_id":"d3068d8f-f7d5-4cec-ae0d-6b699d7deb6f","resolution":{"observed_at":"2026-08-07T00:53:53.847807Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:02.584421Z","title":"Mixed-privacy forgetting in deep networks","venue":null,"work_id":"b8a590df-18da-49c3-a687-2b72dd954cfd","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.491360Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:52ba5aa6e7eb806d74bd359d08bf7268fbeafecf664705dfaae4170ec51d0cb8","observation_id":"3081f71e-2713-483d-b686-a6fa6a5985f4","resolution":{"observed_at":"2026-08-07T00:54:02.639385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:02.444361Z","title":"Amnesiac machine learning","venue":null,"work_id":"25123d0c-7d4f-4bc0-be3a-d0d449073fd2","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.538381Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:d6c380dfff3e68c223a439752c5087121fc7dc904c9e10f86f164f65aa30833f","observation_id":"a1bef77d-4521-4df1-811b-c35da4a1b36a","resolution":{"observed_at":"2026-08-07T00:54:02.507112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:02.291378Z","title":"Certified data removal from machine learning models","venue":null,"work_id":"0617ae60-7fc2-4fe8-8feb-4feb3ada47d2","year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.620155Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:6cdb87bac12524a6efbe245bf61a54313855f1af7ca5adc5770bab1baf7c9884","observation_id":"d2aa1868-193d-47b1-a617-0063c4ebd4bb","resolution":{"observed_at":"2026-08-07T00:54:02.361740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:02.106552Z","title":"Adaptive machine unlearning","venue":null,"work_id":"282fa026-7c89-4ab4-b563-94d2680477ba","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.736886Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:2787dddbd0052e34706dc43f226841a4333dac2e151a6938d3ed1c0836670c2f","observation_id":"73a945f4-2a83-44a2-a902-0ab53de78266","resolution":{"observed_at":"2026-08-07T00:54:02.193202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:01.968340Z","title":"Theoretical foundations of active learning","venue":null,"work_id":"451d645d-df29-4df1-a084-ff2efbd5ef9d","year":2009},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.840967Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:34a454eea50a0b030b6deaaddf0f564dc9575647ced0909900a879891af52b90","observation_id":"7a20a3d0-0819-450b-b503-0ba366c9e495","resolution":{"observed_at":"2026-08-07T00:54:02.046128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:01.826838Z","title":"The star number and eluder dimension: Elementary observations about the dimensions of disagreement","venue":null,"work_id":"f32efced-cb9c-4a42-90a0-92a986a80802","year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:48.916834Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:efe5c7faaf6425730ec723aaa7d55a2c9d3ee38557c2c4865db03afd02f82b69","observation_id":"f15472b4-5d7d-42b0-8d8a-35a922fe11ab","resolution":{"observed_at":"2026-08-07T00:54:01.919500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:01.676385Z","title":"Minimax analysis of active learning","venue":null,"work_id":"fa31170b-2200-431a-97ad-72f076e69c4d","year":2015},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.030407Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:9e358ce4d4daee709cf548de77cfe9bcb18fbb47c403fe176c3869cea7acf6a9","observation_id":"8c3b88a1-0e69-43d6-b14a-134ed3a5cde3","resolution":{"observed_at":"2026-08-07T00:54:01.747057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:01.535058Z","title":"Characterizing history independent data structures","venue":null,"work_id":"03e2e7e4-e8f4-4332-9b47-febb1d0171b1","year":2005},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.143210Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:b106d6c5a55e4f8d387ba5682674cf3a6a012ded2d971502cb40e8c73e065326","observation_id":"498da90f-5cae-4ae5-b838-8b9f477929f4","resolution":{"observed_at":"2026-08-07T00:54:01.599003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:01.412978Z","title":"Learning with finite memory","venue":null,"work_id":"0b806762-80e2-4e26-bdf5-867e2040f25d","year":1969},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.262576Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:536afd5a31472bc67ec1e9086beeb5898e8fb99356e761f7c1dfba0e1b570fd1","observation_id":"4e2eff0c-97d7-4c01-8694-5d4118134ee9","resolution":{"observed_at":"2026-08-07T00:54:01.474481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00886","last_updated":"2023-09-02T09:55:29Z","snapshot_observed_at":"2026-07-06T16:13:34.788427Z","submitted_at":"2023-09-02T09:55:29Z","title":"Tight Bounds for Machine Unlearning via Differential Privacy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00886","snapshot_observed_at":"2026-08-07T00:53:49.294110Z","title":"Tight bounds for machine unlearning via differential privacy","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.294110Z"},"links":{"cited_paper":"/paper/2309.00886","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:cc593cd9a2869b6a222a8691b295e1941c5402b57c6a5ae66860a6db2589a202","observation_id":"b148207e-e347-4b2e-989b-eeb2235b4097","resolution":{"observed_at":"2026-08-07T00:53:49.294110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17546","last_updated":"2023-09-11T16:58:48Z","snapshot_observed_at":"2026-08-04T04:34:05.607113Z","submitted_at":"2022-10-31T17:57:55Z","title":"Preventing Verbatim Memorization in Language Models Gives a False Sense of Privacy","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17546","snapshot_observed_at":"2026-08-07T00:53:49.442234Z","title":"Preventing verbatim memorization in language models gives a false sense of privacy","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.442234Z"},"links":{"cited_paper":"/paper/2210.17546","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:df9c411ebd1bb4a840ce6b50bfc5ccefa0e9afc0c02717381addd72f4e8ddeda","observation_id":"5fbd1d25-49fa-4b91-b060-83ad70069541","resolution":{"observed_at":"2026-08-07T00:53:49.442234Z","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-07T00:54:01.287637Z","title":"Approximate data deletion from machine learning models","venue":null,"work_id":"bf7c20ee-6840-40b4-b885-924e698274d8","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.582517Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:96a1fa7d047bf9eaef4cf8f7e051fa4bafbdeafaf907aa92328b74a2981ab0a3","observation_id":"735832ed-473e-4ac6-9b4b-f35b64d237cf","resolution":{"observed_at":"2026-08-07T00:54:01.354556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01504","last_updated":"2022-12-19T11:52:40Z","snapshot_observed_at":"2026-08-06T13:31:03.854761Z","submitted_at":"2022-10-04T10:18:11Z","title":"Knowledge Unlearning for Mitigating Privacy Risks in Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01504","snapshot_observed_at":"2026-08-07T00:53:49.666006Z","title":"Knowledge unlearning for mitigating privacy risks in language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.666006Z"},"links":{"cited_paper":"/paper/2210.01504","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:ac985ca36c089fc3a9b0eb663f2e7477de2d1a01c25968a4b8e3132593372a0b","observation_id":"9f2944cc-1ca8-4034-88ab-778843dfb8c2","resolution":{"observed_at":"2026-08-07T00:53:49.666006Z","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":"10.1007/978-1-4613-0071-7_7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:53.430859Z","title":"q-Binomial Coefficients and Linear Algebra over Finite Fields, pages 21--26","venue":null,"work_id":"4a8100a0-c587-4317-b8a6-4630516baff4","year":2002},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.762177Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:8a0c92340670ab67653b6304e8924d677bd4cd0566598a016651c592435e9644","observation_id":"a10c4cf7-1a8a-45b9-918f-61fe27f9c66e","resolution":{"observed_at":"2026-08-07T00:53:53.484586Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:01.124087Z","title":"Multiple incremental decremental learning of support vector machines","venue":null,"work_id":"f78f7f14-97f8-4d9c-b5b6-47c632240df4","year":2010},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.895331Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:f5bc74efb155573b00524d96f5de361f64e3f864c42edf6344162eee3d4a0ddd","observation_id":"8fd98fd6-8f2b-48bc-9a7e-8a2e19391755","resolution":{"observed_at":"2026-08-07T00:54:01.213161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:00.984868Z","title":"Time-space hardness of learning sparse parities","venue":null,"work_id":"ab8f082e-51aa-46dc-87a8-dd302e8663d7","year":2017},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:49.983081Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:1762108e9049ae06209cb420df48ecd714ec694ec4a963893585d17b8d06ed56","observation_id":"ab46b3fa-6fe9-4056-b015-6f8828538769","resolution":{"observed_at":"2026-08-07T00:54:01.055847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:00.852499Z","title":"Towards bridging the gaps between the right to explanation and the right to be forgotten","venue":null,"work_id":"f07d9997-8c04-452b-aeec-cc3ded93d64f","year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.050402Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:8c95d1cc087a3cbe4202920ff0745ac76fcc30ee366e3324269c7bfcd15dd3b2","observation_id":"f92b66a8-91d6-4075-a36c-fb667d2435ab","resolution":{"observed_at":"2026-08-07T00:54:00.925617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-08-07T00:53:50.128823Z","title":"Towards unbounded machine unlearning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.128823Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:b001f54f5653bf72387745b67b94257a7cf6a6d0cc4e7f81fc0a2c667bc57bb5","observation_id":"3be89b94-6fd7-4ef5-a3d7-b40e2f1af942","resolution":{"observed_at":"2026-08-07T00:53:50.128823Z","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-07T00:54:00.696772Z","title":"Understanding the eluder dimension","venue":null,"work_id":"3f58d9f0-f3b4-440a-9e3c-ea1dd8ab0e53","year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.182712Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:f2b50e7486e1f36f08cbf3dd77b79618b7dc693e10ad387729d2a223b531e24c","observation_id":"531e2d42-d223-4006-a71f-212ba7bc34d1","resolution":{"observed_at":"2026-08-07T00:54:00.770539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:00.509130Z","title":"Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm","venue":null,"work_id":"f8798138-1d8a-489b-98df-33aee57c9adc","year":1988},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.252251Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:5cb30a9556cb55b2d65bfd430db685a18c137604fb44ca1978915e0044ff64e4","observation_id":"32c7dce9-4824-4169-aa52-50bcadb59fdc","resolution":{"observed_at":"2026-08-07T00:54:00.605260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:00.356692Z","title":"Relating data compression and learnability","venue":null,"work_id":"80ab19b0-2b3d-403f-818f-019476451520","year":1986},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.305536Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:733cd2d0f54017270b3aa7ef292042d4b00d203f14cce17ca2688df1446a49c9","observation_id":"1edcd1c8-bd95-4be9-ab74-497ddf0eaaaf","resolution":{"observed_at":"2026-08-07T00:54:00.431914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:00.202379Z","title":"Efficient convex optimization requires superlinear memory","venue":null,"work_id":"ce6084d4-94f1-4ab5-85fd-e8bbc053b9d3","year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.419759Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:03d2056128f2bb9f20ad757672d54597269a351eb934415c10b619fd7affe09d","observation_id":"1dfcf09d-0ee2-46e4-abc0-e76ea4498568","resolution":{"observed_at":"2026-08-07T00:54:00.277659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:54:00.081050Z","title":"Graph stream algorithms: a survey","venue":null,"work_id":"e59d65fc-8306-4bbc-8618-d0ce8c268ca8","year":2014},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.516170Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:234b687f8a6542c6d3009f3a8b4b28c2b76f2b1aedc4259d8a3861f57bfc4b9e","observation_id":"6a32090a-9b80-4fa4-bf6a-acb6f45c5b99","resolution":{"observed_at":"2026-08-07T00:54:00.135990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:59.966131Z","title":"Finding repeated elements","venue":null,"work_id":"2bde3376-c5f9-430a-9c24-605e42affbf5","year":1982},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.565871Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:5116a4172f244c2b94a591c140d9e97d93ec6fb003a524466386a742b65f7eff","observation_id":"0683565e-d463-4fd8-842a-751e68d3b386","resolution":{"observed_at":"2026-08-07T00:54:00.025501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:59.809377Z","title":"Sample compression schemes for vc classes","venue":null,"work_id":"645f6144-89b9-4a66-b75d-eabcb8a0dae4","year":2016},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.649938Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:2ef7f99ed7715114ae0a513eb0449a588881ab0660d04eb52f8928c9d0ad0afa","observation_id":"87325784-725d-4335-9cc0-9fb7b401a7da","resolution":{"observed_at":"2026-08-07T00:53:59.886028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:59.510564Z","title":"Mixing implies lower bounds for space bounded learning","venue":null,"work_id":"94a74457-f9f6-48df-adf6-ad8e559cf332","year":2017},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.731319Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:06f3338bde5945a7c2e360eb604545d1746ff1af87002643334957e5f604c02a","observation_id":"e3fe5ba0-2932-4188-a726-0e946f42b570","resolution":{"observed_at":"2026-08-07T00:53:59.666866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:59.243165Z","title":"Entropy samplers and strong generic lower bounds for space bounded learning","venue":null,"work_id":"7dda74c4-fedf-4296-ab9d-a8991cd0b4d3","year":2018},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.805400Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:12517a1121786bf24d1e7090c800de3ed8e29de6313bef26248a5c2e66519f13","observation_id":"dbf53f68-194d-4a0b-887e-4f572e755d54","resolution":{"observed_at":"2026-08-07T00:53:59.371797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07353","last_updated":"2020-08-17T14:26:18Z","snapshot_observed_at":"2026-07-06T09:47:48.007337Z","submitted_at":"2020-08-17T14:26:18Z","title":"On the Sample Complexity of Reinforcement Learning with Policy Space Generalization","version":1},"cited_work":{"arxiv_id":"2008.07353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2008.07353","snapshot_observed_at":"2026-08-07T00:53:53.640352Z","title":"On the Sample Complexity of Reinforcement Learning with Policy Space Generalization","venue":"cs.LG","work_id":"5ecaf4da-f3c5-4943-94f5-d84858ee93f4","year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.889556Z"},"links":{"cited_paper":"/paper/2008.07353","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:fcd4cbcae28e330fe2604cde957227aceb72c918d3b81aa4c683070ccfa19f3b","observation_id":"bd5a3d6c-21ac-4d2e-a107-12af7358e728","resolution":{"observed_at":"2026-08-07T00:53:53.699191Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:58.963555Z","title":"Selection and sorting with limited storage","venue":null,"work_id":"fa836a99-4fff-4921-8e9b-86439c1c73c7","year":1980},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.946823Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:7a2ab522dbbcbf89eb1d9f35a6b262195712502b2b08a9e3c8f1970dbff4c7f4","observation_id":"9f6d740f-8ef5-4018-8383-c4abab5fdb20","resolution":{"observed_at":"2026-08-07T00:53:59.091885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:58.708843Z","title":"Data streams: Algorithms and applications","venue":null,"work_id":"7011a060-d3e1-45ca-9e3f-d27a7a56f46e","year":2005},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.044834Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:73e6134806d41234abde5c389b80f132f342214972ccc5340b4740617e4a57b9","observation_id":"ef104c02-e787-4c65-b2bd-79fc8e3c7a91","resolution":{"observed_at":"2026-08-07T00:53:58.816444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:58.558355Z","title":"Anti-persistence: History independent data structures","venue":null,"work_id":"edc4676e-835e-498d-a55a-7b08b4bd7c7f","year":2001},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.102238Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:fe90b8e656e4c5189ac837ff1e9b354d315c953972b66728cdcee3846e21b4e1","observation_id":"e47611c1-98d7-497f-b2b3-11af76d875e0","resolution":{"observed_at":"2026-08-07T00:53:58.640971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:58.363758Z","title":"History-independent cuckoo hashing","venue":null,"work_id":"f5b6d2de-24f2-4b75-92af-d7b5422a1201","year":2008},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.181557Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:d5318ddb6f3c50b54cf496f5ad0f64de81e7b13f90b8f6d58b56c514f6b2ab26","observation_id":"3718186d-1f41-448b-925c-7fec89b61239","resolution":{"observed_at":"2026-08-07T00:53:58.438095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:58.240601Z","title":"Descent-to-delete: Gradient-based methods for machine unlearning","venue":null,"work_id":"83bedd59-3653-4781-a284-eb0e9c96b595","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.266131Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:68dc8800f67906a3e968b38ba4d8973c9c826dff12d693845d112143e82dc403","observation_id":"66ab4b3d-0968-4d62-aa70-cbba1bf73131","resolution":{"observed_at":"2026-08-07T00:53:58.304578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:58.086733Z","title":"Variational B ayesian unlearning","venue":null,"work_id":"edb95bc2-6539-4bc6-a937-d0334f9897cf","year":2020},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.328995Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:9b6a15eb713ef2b587257ea317c0104bda762890b79098b182cee3c01ace55b6","observation_id":"4e34d3c5-ff52-4abe-8635-dfa2c2659931","resolution":{"observed_at":"2026-08-07T00:53:58.153293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.02299","last_updated":"2024-09-17T11:55:58Z","snapshot_observed_at":"2026-08-02T02:19:01.218373Z","submitted_at":"2022-09-06T08:51:53Z","title":"A Survey of Machine Unlearning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02299","snapshot_observed_at":"2026-08-07T00:53:51.385970Z","title":"A survey of machine unlearning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.385970Z"},"links":{"cited_paper":"/paper/2209.02299","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:f5fc59a986d9f200b1badd6d1faad84de38b1b7b69fbb3c388d60b248e33720e","observation_id":"a1cf27e8-f4db-41c4-8e6c-ef682a7b303c","resolution":{"observed_at":"2026-08-07T00:53:51.385970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07579","last_updated":"2024-06-06T06:31:08Z","snapshot_observed_at":"2026-07-06T16:31:16.784700Z","submitted_at":"2023-10-11T15:19:31Z","title":"In-Context Unlearning: Language Models as Few Shot Unlearners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07579","snapshot_observed_at":"2026-08-07T00:53:51.478659Z","title":"In-context unlearning: Language models as few shot unlearners","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.478659Z"},"links":{"cited_paper":"/paper/2310.07579","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:ae8b241f776b7cde10ddaece8c58ca95184c997dfb995ab49305cdbe19cdf2e9","observation_id":"1cb29f7a-c77c-4ace-b6d5-ed89e935059d","resolution":{"observed_at":"2026-08-07T00:53:51.478659Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:53:51.523088Z","title":"Machine unlearning fails to remove data poisoning attacks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.523088Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:9d8e6cd460877db8b8a07946da5eb0c0fa94af4fe8e1390caa0002bf55a1bbf6","observation_id":"ff140332-5cba-4437-b51f-a9020ad3fe20","resolution":{"observed_at":"2026-08-07T00:53:51.523088Z","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-07T00:53:57.949056Z","title":"Near optimal memory-regret tradeoff for online learning","venue":null,"work_id":"71aa06b4-c30a-4757-b2c9-1420a02cc19f","year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.570942Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:e78a509cf0c55384ff2fd26859cfd90c4b7fb459d2366991a52fdde48404dd20","observation_id":"f1054e0f-c36a-4507-90c9-546090bf8890","resolution":{"observed_at":"2026-08-07T00:53:58.015053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:57.815735Z","title":"Big data and sketching","venue":null,"work_id":"ce6dfd7b-d741-40f5-b91c-51b0587ad3e9","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.629698Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:0d247eff5383151ad44900623368665bad2b33c9c78e834aa2a2201299b6b245","observation_id":"1a06dc7b-1a8c-4317-89dc-8abfe015aaa2","resolution":{"observed_at":"2026-08-07T00:53:57.879295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:57.669692Z","title":"Linear adversarial concept erasure","venue":null,"work_id":"e9f9eacb-8e8f-4ee0-aa92-e668f1edcdbe","year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.694606Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:1dcadee6b7462008aa76012089b0648dcc6316800f28825b86907c2ca4d801d1","observation_id":"222db1a8-6814-464b-92ba-7fcaafb3e22a","resolution":{"observed_at":"2026-08-07T00:53:57.731313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:57.504281Z","title":"Adversarial concept erasure in kernel space","venue":null,"work_id":"64de7c34-97f6-4f69-ac83-f2dfacbf8f5f","year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.745787Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:797edca1a9f65bfe09be627aef931f01479f17bd4ac00eb97b8d90cf6b3305b2","observation_id":"543103a8-3e1e-40a1-8379-1994403cdc31","resolution":{"observed_at":"2026-08-07T00:53:57.599862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:57.374493Z","title":"Fast learning requires good memory: A time-space lower bound for parity learning","venue":null,"work_id":"d46dcffc-2eeb-4843-ac33-490c87caebfb","year":2016},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.800553Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:5e18779ac031e4d284963c7cbbf4fcdcb9db1c1a02273ff69da02842acb979f8","observation_id":"c5def2c6-3681-4baf-ba80-c21b40dceae5","resolution":{"observed_at":"2026-08-07T00:53:57.435143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:57.227377Z","title":"Incremental and decremental learning for linear support vector machines","venue":null,"work_id":"60e11355-8521-45d6-a852-014fce46178d","year":2007},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.873106Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:c46bfd330c7df6863fbabdfcb78721da41f67171fd4839434e74d24295f9286c","observation_id":"48c988ff-f9fe-4296-8e40-b53acc627e88","resolution":{"observed_at":"2026-08-07T00:53:57.303243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:57.078046Z","title":"Eluder dimension and the sample complexity of optimistic exploration","venue":null,"work_id":"f977b97e-938a-41cc-b540-8411c08a6dcf","year":2013},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.939910Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:4450453981f40d402931a7ef8339941fbb23bb8b2b6a7e115449826bb4ba1472","observation_id":"8e2a05ee-6b5b-4536-96c3-d69da2a43f18","resolution":{"observed_at":"2026-08-07T00:53:57.163630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:56.938698Z","title":"Remember what you want to forget: Algorithms for machine unlearning","venue":null,"work_id":"66ed8daa-fafb-441e-8cb7-87caeecca950","year":2021},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:51.983187Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:95d395260781ff41c5fde6e14783fefab76ed490cdc2a4f194257ea553145359","observation_id":"a8c49c5a-f3b0-420d-b34e-f7597abd1568","resolution":{"observed_at":"2026-08-07T00:53:57.010794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:56.802247Z","title":"Fundamental limits of online and distributed algorithms for statistical learning and estimation","venue":null,"work_id":"69bbdd64-d4b5-496a-8fa9-824879981737","year":2014},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.040000Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:1d36b0da9fbb1e0359bf4533c4789773fdc3d8bfb37e11ecd78a1f98be1053b1","observation_id":"d36f23d1-7df8-4daf-8431-7c36f8589b67","resolution":{"observed_at":"2026-08-07T00:53:56.883424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:56.611413Z","title":"Memory-sample tradeoffs for linear regression with small error","venue":null,"work_id":"1b4c6ab4-7384-473a-846e-063f520222b3","year":2019},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.095088Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:f73105337d43e8d3f0a6f5b787031daab46456f41d5bed09eb58d488336962f9","observation_id":"b4c07d4c-6969-4970-8b30-add0ddc055f5","resolution":{"observed_at":"2026-08-07T00:53:56.712367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:56.486331Z","title":"Membership inference attacks against machine learning models","venue":null,"work_id":"ca1bfebc-1920-4c21-87e0-27f6b14fba7d","year":2017},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.168378Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:a992c74a9420360276bff7a88fb3772a1a1cac237823c5a0dff3585135beaf01","observation_id":"0f7071d2-04ef-4a73-8c6a-7e53e96cd3af","resolution":{"observed_at":"2026-08-07T00:53:56.552501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:56.343116Z","title":"Memory bounds for the experts problem","venue":null,"work_id":"88331692-8ace-4895-b0f1-dedf1e4efa0c","year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.252752Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:e710ba812f56914e5d6c24b2d7453ac07ef9048ff001d45029f7810d7ce417e1","observation_id":"9cba75a1-23d9-4ec2-9ca2-57194e13183f","resolution":{"observed_at":"2026-08-07T00:53:56.438209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:56.184205Z","title":"Minimax rates for memory-bounded sparse linear regression","venue":null,"work_id":"da3b4036-d97e-46d2-8b6f-6fa6e22be0c8","year":2015},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.337977Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:ad1131f9dac2a508b2d01bfc1afa22aed87839382ba98bd72d957fcef9d13600","observation_id":"ec964fca-8a71-4148-a90d-db34f4ece3f6","resolution":{"observed_at":"2026-08-07T00:53:56.263771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:56.024747Z","title":"Memory, communication, and statistical queries","venue":null,"work_id":"dbd1e544-464a-4637-8287-2e200bc17047","year":2016},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.394724Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:fc01f664a0698bc09a187cc845b803877dc38fa9cafbafddb0669f8e527bde95","observation_id":"f2c4be79-4540-47d1-91e6-a6140c0b0b33","resolution":{"observed_at":"2026-08-07T00:53:56.093689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:55.899253Z","title":"Algorithms that approximate data removal: New results and limitations","venue":null,"work_id":"dc1cb0a0-83c4-4f47-b4d0-00d72f7bc3dd","year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.479964Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:b7b5ac0f5cee8f92649f07be6bea38911d0dd9c4e4e799a55e47437ffb0986c8","observation_id":"34d235ed-62c4-4c04-af30-bb26d700343a","resolution":{"observed_at":"2026-08-07T00:53:55.964978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:55.747447Z","title":"Unrolling SGD : Understanding factors influencing machine unlearning","venue":null,"work_id":"f4116e80-1078-4341-83a8-76dbbf2db990","year":2022},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.569811Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:cc8887d12036050a9279f42a0874f9db957450a5e638d16c134e8b55c51a2d47","observation_id":"842c1b65-7080-490c-bd19-5e54a0352608","resolution":{"observed_at":"2026-08-07T00:53:55.822868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T00:53:55.617376Z","title":"Incremental and decremental proximal support vector classification using decay coefficients","venue":null,"work_id":"9ad18892-1c2b-4fdd-add0-01572825562a","year":2003},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:52.653253Z"},"links":{"citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:d685717a6cb7cabe9845315d9c2a037cccd87bb2c763a85cede53f9ef2ae3feb","observation_id":"a08f813f-afdd-4e6a-8fa7-6c15581b25d4","resolution":{"observed_at":"2026-08-07T00:53:55.690001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T00:34:51.599821Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":43,"verified_exact":6,"verified_fuzzy":51},"total_outbound_references":109},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 100 of 109 outbound references and 0 inbound Pith citation observations for arXiv:2506.13048."}