{"as_of":"2026-08-10T12:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfb4757e17079d013330f7ae7045d0667ba14d9c0d1d8251d8f5f39a4e965382","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-10T06:31:04.303077+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-09T23:03:11.244920Z","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:49a52507910503720beeef90970d392841271e57686495708b3330ff4aea408f","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-08-10T07:34:35.599137Z","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-09T23:03:11.244920Z","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:de1c9469acf5e3ce871e6aec90d1dfb4d9eedd6323024be6d939dfe839a8aeba","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:52dedfc141d70b49316523bf53971a311106d02a919917dd2f49553355b8c1a1","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-09T23:03:11.244920Z","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:4e5719028c4873d9a0608ababc86b1585d92eeb7abe1b97440952a029334c554","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-09T23:03:11.244920Z","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:3ae5f2de2c0578bab90d91460d9900a1ee4b9ebf86cb87e7dbd141ba9597e2fc","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-08-08T01:41:56.173918Z","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-09T23:03:11.244920Z","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:32d0d133396fa2c8cf6382fcc26bc171a38c0f0de17894e45fd0425afcb5de08","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:04525695fc71abc45180ede50d3b5f0273fe0eee8d6e29c0f6df28462dd8f47e","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-09T23:03:11.244920Z","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:7aafd07a666fafddd9687223cb1a61a1cf6713a6c54bfa5ee66926f6bb1a5c86","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-09T23:03:11.244920Z","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:c7fd9f7e01366277473a937de7258330e727f8f40bfa0cda2c37581f0ffdf79e","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-09T23:03:11.244920Z","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:2acba1331c0b674d57ff79f075de88f85771dff661b4b76daf469e8084047d10","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-09T22:31:04.488703Z","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-09T23:03:11.244920Z","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:c76024e0005d90c5f40fe55667d745b3c41ce9a6ec4e842e06000c63d0902bfe","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-09T23:03:11.244920Z","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:3620080ece1b0ccab288d086e4cff8b37e69538977054f91c22ba57e2baab8a5","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-09T23:03:11.244920Z","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:50e1379582c7efe8de16cad8058ae0f231b69867add6b35bd5bbe7a06ff645f8","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-09T23:03:11.244920Z","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:6ed1225c8b965361f8a131ce544e54e30d2ca1c955ae44cc524cf3c931a838bc","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-09T23:03:11.244920Z","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:49288fa075df7acf79d0b57c26ce3f87f739c06d20ae6097bfbabe4c5e5c7367","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-10T00:05:23.342667Z","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-09T23:03:11.244920Z","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:12b072a0cd97c325dc65f6bdfeb7b147810c717f83054e8507fbc0aae58e75db","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-09T23:03:11.244920Z","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:3641f8f1f4136c4b980fcdc34c1b0f5f306b8bd7a49aab6ee9f849d02b258c39","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-09T23:03:11.244920Z","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:5812a694512502c9066ccf9bc2149eb48d9a8d262ae9939bf269676302d37d6c","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-09T23:03:11.244920Z","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:baa6bf368b74126c7cebb5bc4dd468d6a87cd09b49cb49828ecf3dad10395513","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-09T23:03:11.244920Z","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:91ee857e0301225dc5b95418c1cc174d67fbef73d91f77eb282f32a1d76c97d2","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-09T23:03:11.244920Z","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:d0b9bbecb14a97c6be4c7153c5558a3a85bc129592a9e23d1ba83e2b2e19def1","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-09T23:03:11.244920Z","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:b8876920042513411a0287b5c85c3386a8b14789a1fb855df4e550362bd37215","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-09T23:03:11.244920Z","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:5b5d30f1fd6489f8cd2dde5a61139313c80e2523ff2660ab96a4457b92972e2b","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-09T23:03:11.244920Z","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:600203c899660c85fa137482e0b345ce872c0eaf6a8f819f75f5659f913991d1","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-09T23:03:11.244920Z","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:4e68a88df6d6ace609b5f590c3b1eb01ef19a8af8dd97c66b6f01cdd09cf3551","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-09T23:03:11.244920Z","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:0126a9179494d8ecb736b0dae9c0bc8fab9a962a2979dfa8fb0ad17cc05a2e1b","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-09T23:03:11.244920Z","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:10ba26d883a92a348ada0622f3c4511b9d6a24282e9aaaa2c9a1184d85f904d9","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-09T23:03:11.244920Z","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:f833f20938640a4ba72d902f60e691b29361b030e905aef4b01273e664319731","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-09T23:03:11.244920Z","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:54590c3257000fa549631cb4e14d7c2de9332974348ddb69195114c830a59222","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:7ccc723a087379682da8df59dcd8b59fd77ff90e619cc16d7a82980e70d18445","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-09T23:03:11.244920Z","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:91ed08036000b3b5dbfc333616ed10685690d7f967220d81cf1eb84a9da91e0c","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-09T23:03:11.244920Z","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:c055cbe054cbf200b15af025dfd737c000c379c839617462a7bd728640aa8e45","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-09T23:03:11.244920Z","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:bc89f23d31a706573e9326b283e7d168d908be6a67159c1e4982b5f024772899","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-09T23:03:11.244920Z","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:9b72c9db216bd0787411e86f641300c362cfe7fed5bd0dee2484c20f9e22d591","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-09T23:03:11.244920Z","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:de3f2c407161971ec6370daf035e076823a45382e1547afff5b9e4237203ab28","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-09T23:03:11.244920Z","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:1d397622a8b54b98fbf510fdcf8541cc89a41ff5402dfbdd879cc1c1ec8b9b53","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-09T23:03:11.244920Z","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:236c81b9e45b81ecfcb5be121ff150b41ab023e3f78fb61885323b802de294b1","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-09T23:03:11.244920Z","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:b8f4348f299b7ea68be9c6ee352e590d34e6e949680f9df5526fac2ab7d279ee","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:f1d0e838d757478811f3de0f2cfe3c4f476f3ff01e22b0081561dee7a929949c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:3298f3edd18b74913421f90d7ba639edd155a1838f385dad1591df5740401de6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:de401ca45aecaaf6c9793c82be0248e8cbe960122328d151cd4b679470e1ba70","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:325e970d6e262853f15f5737af9e85f5bf3ea246f3b09ddb9fe1bf1af1523f45","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-09T15:44:33.947369Z","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-09T23:03:11.244920Z","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:c167bfc7ae3037deec9da58cd8b24ed6856df1ea69e5870e3f89ffbc95f2fa72","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-10T00:34:46.700262Z","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-09T23:03:11.244920Z","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:efd3a83cbd95a0c7c00df2ed77bd99093697a4a29c81a84141447c95ab88ca8c","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-09T23:03:11.244920Z","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:2549bb8d8d8e260e77cd58996502b2b529852d2ce59b18b8a6eacecb85aacef4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-09T20:10:46.337187Z","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-09T23:03:11.244920Z","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:f7fb05ebfdc83aa60e6fb72cef48d0c7433bd6a2c4f05fccbbfcc33bffcf6374","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:6edc2f39b68be8ca35e573754a626aa29b73351533a09e9bfd7443e4c7720c52","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:79b19e8af864f5a09c339a74c672a7a71999a9d1236944c7ef333b92f5a48b20","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:e58f988e0624875545c2540d417df0794e2f8b2695b8c8cf174a94a3989aa835","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:37415ba4450b988459832815270a4676eeb0ce3808497af185f491a4b4ae7de7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:8235f4cce8aaef584e66d0fa639264befdac41f5615cefc9d03448d31260a83f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:a10c2e8acbf74ac06d9b4a7fbb3df7b1b85c9862a7c9e5e3bede090f616defbe","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:2e1276abbea5acd4c3079520c1036837221ac38cece68b7b41a49c1c90a0dc7b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:15152477c8ec26ccb1c852077c2b9fc221ca2c87bde0cd2b921cfa46a2492841","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:ba3f5a30f6fcaedd514846a254017364ed7b1b53694f50159a904b38140b5a87","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:df61a9eb8930957487a427a74928937cc1d1ea4faad9b3afcd2623b66c4f2385","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-09T23:03:11.244920Z","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:44127b5597cd283a427d374e40f366c7e170751e600bb90d2e8cc9299e0b37cf","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-09T23:03:11.244920Z","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:a2513ab08d877857757fbe2c0e137bb5509a32d8e8fb0f953676327a5cad0834","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T15:28:56.392520Z","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-09T23:03:11.244920Z","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:6bf7c77d18e64ced995ed1199405b60c64145021bd132e81e164152e92e646e8","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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"q-Binomial Coefficients and Linear Algebra over Finite Fields, pages 21--26","venue":"Universitext","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-09T23:03:11.244920Z","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:fe87561763f0cba99e624f568be44ecb460797b39edc8a02f619a51dbf4bb52c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:7d26663cb6343365806c00c008933f0db15585b3c1c005d28878df0f81f898df","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:19b14844da5d4bb4bce8c63c63cec7ac21cff88e60d731edfaf2a30d8f500ad8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:9254277981e5e5e5a486d93bab64960ca1683979a41638bf662284d33a3ad9e6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T04:15:13.129095Z","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-09T23:03:11.244920Z","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:dc0478f46c7d238a488c9e24743d5178f0039938bbcb7d23d3b93ee04e17ec18","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-09T23:03:11.244920Z","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:5979d0c9855a29f50332d46a6186c2646d8a02e54ed06a9c8b40c542d25fc05f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:ad8a9fa2e03972dbdbc1b8f4eba5c6293f6e1d20c3810bebab6d681481ebabae","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:5a58a5e1195192a17dc7b5e2542cc3f30f298b84ed2b9060a054be446f0344fc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:29aa5cc7b883e7e4fad397eb5bf7d770e25c06164ca820e945c5ff1552457d7c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:da22111f5b2edf7b818ec300319eccdcd6712e6c15f92c13288b7ee950a489d6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:5f4152fcb76abf2b3f3c805867fbdbfa97b667ccb0c4dbba394d62185eb84cca","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:b79523227a082512c711d7e6a3b4d91878ef7af7119cf8754c79dd8792a5bcae","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:0ef016d9f29c5649c5184ea62807b74bd8cd10eef8da46f38462a5bf53cb34b8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:e154b5cb9afa82ab286df0c61fbd09f8be2119353c339a656fbb993b0d87034d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:a515a5fde00eaa8ae9ad40d2377f40a8a9a5355ce504dd523df0ffe9413421c7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:6bbb00728143bfe913e13e9b19a4062677ad57e88f3258d8bcd9e53dbd0466df","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:a5c456b3276b677bbe19bd7ccc3feeab5d231bca0767cd39aacee59230c688cc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:01aec0b8ca879a5411565d1a7b5e7dc8b0089182d29f9e6eb4ed0da1c4c86a13","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:65798b29792f756fe5b4d5a6eb94d22ced8acc3d558c773b5756cdac8714cb4e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:6fade8341216cae44c71f8b54ae8dad6274d99e8b192de80eabc70ce93d9dd0f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:01af9f89648c79044dabfdbe9fb33b8fad90522f9afb3f914418b6fd7e6b2349","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:4b8cd123bb25dcbb4c278c5f07a546174fbe538afa18ad08ac9e534e0116d27a","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-09T23:03:11.244920Z","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:30e057eaa95a44a450894c12f82c99460a5d38b8aa1e43eb4878cebc1bc46ba7","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-09T23:03:11.244920Z","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:af02b378c9a1419e3798fe62f2af40a1ef7c934c8f783d81a21c39f2ddf8a27f","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-09T23:03:11.244920Z","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:6cd0bb1278698b5ab96dd038ecce5886d38ad0ee8503436fca40572bb12128dd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:8ecbd11a8253be873346ce1c748175fff669d99c31f4e02a5fc3e256b6435ea9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:7689b6b2f90d5160761b4c6cafcab72ff5f9e8ee58970311f008be894ff1829d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:597038cc746799a2943cb61fadded43c3618b497d19fd1d3549a61acae75d0b1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:8037d95b9d78c9c01cb3de887f7ce44f98d799bf0b1d6a2afdc08ac1fd66be2e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:d353aff955a70e46e5cd7e2c6f378516ffa82f3d39035688daa7298652f70ad5","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:ef9c0eeb6813dd1481880a15795388bb588d49c16dca0693ab7941f9ac9aea72","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:c7d352a8fd95ef929eb4388bddf3daa14abb8408cd1f4cbf4c846da78a88f20c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:7c8848d86e99235a0424b476dbc9d5e96dfa1307d2cf256ad8dcc7e94f484103","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:81595349e96ac8707852b2d9c76efee72ba8d2afe5a6338659dadb894262e33a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:492eb21326db0d3f75a6d6cf39c04bc07fea80494830e916106369dcbd65e642","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:e0d1c0bc4f3090769a03f66cf2742133c136442f35c7c610084943ed7fabc9cc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:5eb752ba24e47e2b1e83bff6f57c06c5caddafb75befbedd5bf5e3b7aee36d30","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:96b33dd400f1952b190305763cc682d9eb2584812d085b9c3ca5e2befe9e0631","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:71c2202a94acf80b193d928341edfe6fd43343c83128bb3b052d47726ba52eb7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:45b6b9474c337134b82844eec1868fe40a36e2aa095ab77aa0cdd93d53fc8009","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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:6b8cebf73840d012e3fe4acd40a8cb23f704460dff9bf0ad9541853aee332169","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T23:03:11.244920Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 100 of 109 outbound references and 0 inbound Pith citation observations for arXiv:2506.13048."}