Pith. sign in

Paper Citation Record · LEDGER

The Space Complexity of Learning-Unlearning Algorithms

As of 14 August 2026, this Paper Citation Record lists 100 of 109 outbound references and 0 inbound Pith citation observations for arXiv:2506.13048.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.13048 v1

Coverage vector

measured 100 of 109 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T00:53:52.653253Z

measured 100 of 100 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

100 of 109 outbound references displayed

  • verified exact6
  • verified fuzzy51
  • unresolved43
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation adf816d7-3a85-42fd-aff8-86b2b9b2bae2 · outbound

This paper cites The space complexity of approximating the frequency moments.

The Space Complexity of Learning-Unlearning Algorithms The space complexity of approximating the frequency moments

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:43.343764Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:43.343764Z digest=sha256:4d105be41dd5c91e76ffab877588493ec151fb961b6837e375a50169b0cfc8e0

Observation fc7b0f37-9ff0-48b2-9e1f-4131e471dca2 · outbound

This paper cites History-Independent Concurrent Objects.

The Space Complexity of Learning-Unlearning Algorithms History-Independent Concurrent Objects

Reference 2

Resolution
verified exact
local_arxiv, observed 2026-08-07T00:53:54.372959Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:43.447161Z digest=sha256:0df6ba238ffc709f3e9894884c93b695f567e788b74746e7199c641aa47dbcfd

Observation c11f315b-c1e2-4fd5-a3be-005fff850f47 · outbound

This paper cites Time-space tradeoffs for learning finite functions from random evaluations, with applications to polynomials.

The Space Complexity of Learning-Unlearning Algorithms Time-space tradeoffs for learning finite functions from random evaluations, with applications to polynomials

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:43.601253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:43.601253Z digest=sha256:c901ad1e97d16c76819a398f1372274a5365932e409e6aa90dd2581778dbe2e6

Observation 916eb486-f477-410a-82b4-011b92a79840 · outbound

This paper cites Leace: Perfect linear concept erasure in closed form.

The Space Complexity of Learning-Unlearning Algorithms Leace: Perfect linear concept erasure in closed form

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:43.692290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:43.692290Z digest=sha256:9ab4abf13c50d06e0ee951b6b3798ec383691d8447af9be0ea925f526adb08b8

Observation 9628adbf-5935-46a6-8702-7517465973c8 · outbound

This paper cites History-independent dynamic partitioning: Operation-order privacy in ordered data structures.

The Space Complexity of Learning-Unlearning Algorithms History-independent dynamic partitioning: Operation-order privacy in ordered data structures

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:43.783498Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:43.783498Z digest=sha256:5b79f33efc933e8412a64ca20e0a23ec2f7fc5f5673b34f35786145321b5e16a

Observation 09bfe4b6-ca42-452b-91cc-5620de368d52 · outbound

This paper cites Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems.

The Space Complexity of Learning-Unlearning Algorithms Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems

Reference 6

Resolution
verified exact
local_arxiv, observed 2026-08-07T00:53:54.212674Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:43.883206Z digest=sha256:7638d845810e424f4b30575a8213cc5e37ecad76e089b98ea1cc6c388f2cba5d

Observation aa879cbd-95dc-4ff4-9571-06a198661b5f · outbound

This paper cites Strongly history-independent hashing with applications.

The Space Complexity of Learning-Unlearning Algorithms Strongly history-independent hashing with applications

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.005148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.005148Z digest=sha256:2ff910c47939a7537b8d1f16fb155b4430f80a38ab4e41fd76cef464f057a9b3

Observation dcdb9132-8a6b-4330-bbe8-b843d298e2c0 · outbound

This paper cites Machine unlearning.

The Space Complexity of Learning-Unlearning Algorithms Machine unlearning

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.067648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.067648Z digest=sha256:c504a5738556b5c9134fa808dd35b67bb213e84741dc96b2894efcf45777a706

Observation d66743b7-c7a5-4448-aa4b-c8103aa90b40 · outbound

This paper cites Proper learning, helly number, and an optimal svm bound.

The Space Complexity of Learning-Unlearning Algorithms Proper learning, helly number, and an optimal svm bound

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.181151Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.181151Z digest=sha256:3825e6a9eecd343dccf796af7e018f2600f0491befd30e6cb95ec6584d142a62

Observation 8fea8acf-2366-46f7-817f-12aa8aac17e3 · outbound

This paper cites Proper learning, helly number, and an optimal SVM bound.

The Space Complexity of Learning-Unlearning Algorithms Proper learning, helly number, and an optimal SVM bound

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.295255Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.295255Z digest=sha256:2211849942236acd1a65517dafeefff5a91dd27914968f88d15a4a5b6ade200c

Observation f3067376-9ca0-46be-b672-9977793e8bc9 · outbound

This paper cites Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility.

The Space Complexity of Learning-Unlearning Algorithms Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.395203Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.395203Z digest=sha256:7114b8c402bb719d29aaecbe82d1e4ac3f43cd3772ffcb941417c9486ef04d47

Observation 064f5973-1a0d-493c-a5a6-3de58a685294 · outbound

This paper cites Machine unlearning for random forests.

The Space Complexity of Learning-Unlearning Algorithms Machine unlearning for random forests

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.458531Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.458531Z digest=sha256:68052c2ec0e6e8e271af23b8dd04a308cdacd5a5b468562c115117cd1e357d44

Observation 1b8f89e2-6397-4ed4-997e-85a43128418e · outbound

This paper cites Lower and upper bounds on obtaining history independence.

The Space Complexity of Learning-Unlearning Algorithms Lower and upper bounds on obtaining history independence

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.515792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.515792Z digest=sha256:36c37a1da1c922e4d70d5a23067dfec5a759a3f4ce550449be1c93736f205b07

Observation a855d14e-c947-4246-84d3-75f3d7a1c40a · outbound

This paper cites Towards making systems forget with machine unlearning.

The Space Complexity of Learning-Unlearning Algorithms Towards making systems forget with machine unlearning

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.587499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.587499Z digest=sha256:2aea80da8a7dedd2847ebd6d2c8ff90db95033ea4fd539c2b82cd0ef05cea38e

Observation 4b9b3d0c-4e8d-47a8-bfa9-a511139599ec · outbound

This paper cites Membership inference attacks from first principles.

The Space Complexity of Learning-Unlearning Algorithms Membership inference attacks from first principles

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.707399Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.707399Z digest=sha256:2d27e55c5d58ddc8e78d698b8a11c4bdf3661efe7b07d35d9c78990e0faeabf9

Observation 2af37432-feb2-4ae7-87b0-a26ccfaafb84 · outbound

This paper cites Extracting Training Data from Diffusion Models.

The Space Complexity of Learning-Unlearning Algorithms Extracting Training Data from Diffusion Models

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.836085Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.836085Z digest=sha256:51d27b62db38db5cc7084f947423351f745938bb61be68109ff232454b7fee91

Observation e8065d20-519b-44ed-b194-7cc83326c3f1 · outbound

This paper cites Quantifying memorization across neural language models.

The Space Complexity of Learning-Unlearning Algorithms Quantifying memorization across neural language models

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:44.974769Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:44.974769Z digest=sha256:b49e21f9026d54007018c7069fca0b04ffaa9eb485bed2863692d28a747213f4

Observation 884d6421-2691-4fa5-9f5b-457f86a739e0 · outbound

This paper cites Incremental and decremental support vector machine learning.

The Space Complexity of Learning-Unlearning Algorithms Incremental and decremental support vector machine learning

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.112316Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.112316Z digest=sha256:cf76ea8b5c5cfb00924f7c7d6f0101966d31f2a66a1bb99c5f766c597708d0d8

Observation 53382161-7a9b-4cf0-9ccf-7024648220a0 · outbound

This paper cites California consumer privacy act (ccpa).

The Space Complexity of Learning-Unlearning Algorithms California consumer privacy act (ccpa)

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.211779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.211779Z digest=sha256:f8e381dcd412c351770dc6c78226d049e89babc5be197d5796f5a45f94e5c5d3

Observation 751386d4-d4c5-4f27-b49d-a4815b0fe56e · outbound

This paper cites Langevin unlearning: A new perspective of noisy gradient descent for machine unlearning.

The Space Complexity of Learning-Unlearning Algorithms Langevin unlearning: A new perspective of noisy gradient descent for machine unlearning

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.278908Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.278908Z digest=sha256:1c83a08607842052cfbd2a258405e0271c9c6e4bcecd708e8544f28aec14421f

Observation 1e31f86b-4f0b-43dd-9eae-622e48248734 · outbound

This paper cites Forget unlearning: Towards true data-deletion in machine learning.

The Space Complexity of Learning-Unlearning Algorithms Forget unlearning: Towards true data-deletion in machine learning

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.351537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.351537Z digest=sha256:702204d02667e3ba63d5682b5636c99ef1fc75f5f73b39a596ba27913ab17a25

Observation b7c79541-b00e-4421-8276-dc1b21b3c9c0 · outbound

This paper cites Towards formalizing the gdpr’s notion of singling out.

The Space Complexity of Learning-Unlearning Algorithms Towards formalizing the gdpr’s notion of singling out

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.416338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.416338Z digest=sha256:e07f14ab046d8d45a8f6de5f8609cfe3bd82e9fc7ebb1bd868a46f3924a275de

Observation 316c96d9-9f4f-4ba4-98b0-5a52f43cf764 · outbound

This paper cites Control, confidentiality, and the right to be forgotten.

The Space Complexity of Learning-Unlearning Algorithms Control, confidentiality, and the right to be forgotten

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.498029Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.498029Z digest=sha256:01625bb45df0a5d7cb27d034d5a37e73659275392781c6bb7e98aa622b6e5727

Observation 7eb3523c-944e-4e4a-ab53-e0cf4c6e8084 · outbound

This paper cites Characterizations of an empirical influence function for detecting influential cases in regression.

The Space Complexity of Learning-Unlearning Algorithms Characterizations of an empirical influence function for detecting influential cases in regression

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.624097Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.624097Z digest=sha256:0b69865735c1cc5551ac5736a8662c5d0fea9c8a0605f30e7fee2438b846f2bd

Observation 66bdea04-19c9-46ce-b5c2-72d1d5b6f6ba · outbound

This paper cites The two-armed-bandit problem with time-invariant finite memory.

The Space Complexity of Learning-Unlearning Algorithms The two-armed-bandit problem with time-invariant finite memory

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.781100Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.781100Z digest=sha256:08fccce3cbcbdfc64fbf3e217d1752188e870c2d0cc703bb4a2bf9d96ecdce97

Observation 149f722f-26df-42b5-ac9a-e36f5f428b7e · outbound

This paper cites Hypothesis testing with finite statistics.

The Space Complexity of Learning-Unlearning Algorithms Hypothesis testing with finite statistics

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:45.937068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:45.937068Z digest=sha256:42caf116b41c9b0ee79a132962e723578a5edd61e1e8ab737bb3c851cb5c96f9

Observation 354bb9c2-425e-43d8-b8a1-81ee3295034d · outbound

This paper cites Optimal finite memory learning algorithms for the finite sample problem.

The Space Complexity of Learning-Unlearning Algorithms Optimal finite memory learning algorithms for the finite sample problem

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:46.030337Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:46.030337Z digest=sha256:17a71e46582ae5ae69802fe5d42c20e6ffc85001fbe5a8400ce2794219d2aa0b

Observation a7ecf9b9-1744-48f2-a3d4-c28a10a552b1 · outbound

This paper cites Lifelong anomaly detection through unlearning.

The Space Complexity of Learning-Unlearning Algorithms Lifelong anomaly detection through unlearning

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:46.191849Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:46.191849Z digest=sha256:91a3f204ae82550f54c29aaa03c701c2d883b7269182533619db48b08d5b1eb0

Observation 147fadf0-0cd5-4551-a412-04c785d82443 · outbound

This paper cites SAFE: Machine Unlearning With Shard Graphs.

The Space Complexity of Learning-Unlearning Algorithms SAFE: Machine Unlearning With Shard Graphs

Reference 29

Resolution
verified exact
local_arxiv, observed 2026-08-07T00:53:53.977126Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:46.363129Z digest=sha256:38773bb865479b06a613b07293a212b818e2e967e3fdb41fabb7492290028ebe

Observation 957f2fc1-ec27-4b4a-bf97-edb2c6dcc8ab · outbound

This paper cites Calibrating noise to sensitivity in private data analysis.

The Space Complexity of Learning-Unlearning Algorithms Calibrating noise to sensitivity in private data analysis

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:46.442995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:46.442995Z digest=sha256:5a2dfead2ff281bce0e6b3689d2e6d860b697b10917ef0d2ee13cd595ba75c6e

Observation b0fc417b-67c0-4447-b087-13730e32123c · outbound

This paper cites Verifiable and Provably Secure Machine Unlearning.

The Space Complexity of Learning-Unlearning Algorithms Verifiable and Provably Secure Machine Unlearning

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:46.562314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:46.562314Z digest=sha256:fb7742b8e665337c83dc6bdc01f162cedb7d64f4b424437447a261a40ef12a03

Observation 82d4e55e-244e-43d7-8d1e-c796e9b45492 · outbound

This paper cites Active learning via perfect selective classification.

The Space Complexity of Learning-Unlearning Algorithms Active learning via perfect selective classification

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:46.666229Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:46.666229Z digest=sha256:a9d1116503031c252818f5afd81b3298bf14323abda500b72c1f28e1e70876c9

Observation 100061fb-65ed-44a4-9860-7cba925b9b62 · outbound

This paper cites On the foundations of noise-free selective classification.

The Space Complexity of Learning-Unlearning Algorithms On the foundations of noise-free selective classification

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:46.807166Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:46.807166Z digest=sha256:857f09ec95f3aa7efaf4e41fded0489ffe5545cdbb98f4509920a76e1cc34633

Observation aa0ba5a9-6e66-4982-a548-b54f0c95ec7c · outbound

This paper cites Who's Harry Potter? Approximate Unlearning in LLMs.

The Space Complexity of Learning-Unlearning Algorithms Who's Harry Potter? Approximate Unlearning in LLMs

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:46.902359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:46.902359Z digest=sha256:1bfbdcac6ca34107e08a911e745011e72f6a22763fcc6de938f14db6fa3fe4c1

Observation bd66749f-631b-4936-97fd-c825ac11eeee · outbound

This paper cites Probabilistic counting algorithms for data base applications.

The Space Complexity of Learning-Unlearning Algorithms Probabilistic counting algorithms for data base applications

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:47.036071Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:47.036071Z digest=sha256:ee57728d4e09a45c5c4e3ed183ff373f840e3c6021075a0458d1b89aec5184eb

Observation cb3e22c5-799c-4ba8-b541-d3fc6b7edad2 · outbound

This paper cites Sample compression, learnability, and the vapnik-chervonenkis dimension.

The Space Complexity of Learning-Unlearning Algorithms Sample compression, learnability, and the vapnik-chervonenkis dimension

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:47.191290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:47.191290Z digest=sha256:61361591829965104c320e07f63cd2bbead83ac97d31d0820abfc9a66dbb8aed

Observation ff6052cb-a969-4f24-8fb9-5fd0768fc5c4 · outbound

This paper cites Formalizing data deletion in the context of the right to be forgotten.

The Space Complexity of Learning-Unlearning Algorithms Formalizing data deletion in the context of the right to be forgotten

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:47.326709Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:47.326709Z digest=sha256:bdc7469bbf1c809760b93f4b085594319a91f081350186bf325051a10e1c4746

Observation 8f10e3ea-5a70-4c88-97c2-f7e7fe5c9470 · outbound

This paper cites Extractor-based time-space lower bounds for learning.

The Space Complexity of Learning-Unlearning Algorithms Extractor-based time-space lower bounds for learning

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:03.578110Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.441208Z digest=sha256:0984d11f308e9a0bd27e15236547ce1894810b3e3229365cb8b8aad05e7b044a

Observation 073adce5-b0f4-4394-b652-8b1a8b1fc829 · outbound

This paper cites Regulation (EU) 2016/679 of the European parliament and of the council of 27 April 2016.

The Space Complexity of Learning-Unlearning Algorithms Regulation (EU) 2016/679 of the European parliament and of the council of 27 April 2016

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:03.448694Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.570372Z digest=sha256:19a17aad33c5a6dbce37b62fbc448b48e2518cd3d757bc828f9fb2fdc8214ac6

Observation b0d6a0e0-4bcd-4942-807d-99241fd13e49 · outbound

This paper cites Ticketed learning-unlearning schemes, 2023.

The Space Complexity of Learning-Unlearning Algorithms Ticketed learning-unlearning schemes, 2023

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:03.300848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.726759Z digest=sha256:769d85a16759ddae0be5d163f8b8675b72fd64d3b517852002b6b9155ef7f3cc

Observation 79d56218-dc0a-449e-96f7-3214aad97467 · outbound

This paper cites Making AI forget you: Data deletion in machine learning.

The Space Complexity of Learning-Unlearning Algorithms Making AI forget you: Data deletion in machine learning

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:03.141461Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.795629Z digest=sha256:7b41640ccf85a1db508c8b0dd594d5b7e3dfa81692eabf9172331554fb3c09ae

Observation b21eddd2-40ef-4196-b51c-cb04a12c9008 · outbound

This paper cites Deletion-compliance in the absence of privacy.

The Space Complexity of Learning-Unlearning Algorithms Deletion-compliance in the absence of privacy

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:02.997665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.893008Z digest=sha256:87a74457abb5027744cd775d71832b91460f09ec1b453d7977917620078c947d

Observation eb2a5d9c-bf22-4beb-a556-ab72719c5d11 · outbound

This paper cites Towards Adversarial Evaluations for Inexact Machine Unlearning.

The Space Complexity of Learning-Unlearning Algorithms Towards Adversarial Evaluations for Inexact Machine Unlearning

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:48.044883Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:48.044883Z digest=sha256:dbe8a67fdc662d7cc5d832222e3eba2aa256da7c0e43dc178aa9311eca35386b

Observation 3c323d82-1ed6-4984-95e4-859139f4e62a · outbound

This paper cites Corrective Machine Unlearning.

The Space Complexity of Learning-Unlearning Algorithms Corrective Machine Unlearning

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:48.136832Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:48.136832Z digest=sha256:f4e4a7ab2b34cc8a26a3b324c6c904e60f459925bad4ef269205c0ee6cd9729a

Observation 9cd13c39-26dc-4368-af6e-271e295d560e · outbound

This paper cites Eternal sunshine of the spotless net: Selective forgetting in deep networks.

The Space Complexity of Learning-Unlearning Algorithms Eternal sunshine of the spotless net: Selective forgetting in deep networks

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:02.811217Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.278427Z digest=sha256:6b86a9494b58f69d752ffadbba830afae0bf064d890809284eee5861d816756f

Observation d3068d8f-f7d5-4cec-ae0d-6b699d7deb6f · outbound

This paper cites Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observations.

The Space Complexity of Learning-Unlearning Algorithms Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observations

Reference 46

Resolution
verified exact
local_arxiv, observed 2026-08-07T00:53:53.847807Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.434751Z digest=sha256:71cbcdcab21c94b99afa5291677fd7874875abd493c3145d97c0d768ae41aefe

Observation 3081f71e-2713-483d-b686-a6fa6a5985f4 · outbound

This paper cites Mixed-privacy forgetting in deep networks.

The Space Complexity of Learning-Unlearning Algorithms Mixed-privacy forgetting in deep networks

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:02.639385Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.491360Z digest=sha256:312736d943923ab54f95c7c9273e598c61d3bff3fd4a4e8d1b596fdaf31db508

Observation a1bef77d-4521-4df1-811b-c35da4a1b36a · outbound

This paper cites Amnesiac machine learning.

The Space Complexity of Learning-Unlearning Algorithms Amnesiac machine learning

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:02.507112Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.538381Z digest=sha256:54e2105711ae1077c6f4ec249ce3108c37e7445919f6b322833e53d8b6916c08

Observation d2aa1868-193d-47b1-a617-0063c4ebd4bb · outbound

This paper cites Certified data removal from machine learning models.

The Space Complexity of Learning-Unlearning Algorithms Certified data removal from machine learning models

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:02.361740Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.620155Z digest=sha256:14791dbfec0370b0c473e98b0e1c193c0a1eeb99065fea07646e80031029eade

Observation 73a945f4-2a83-44a2-a902-0ab53de78266 · outbound

This paper cites Adaptive machine unlearning.

The Space Complexity of Learning-Unlearning Algorithms Adaptive machine unlearning

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:02.193202Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.736886Z digest=sha256:001c3dd52c31fdb6f0cb4cba0ebc759fa8a03232e6925a0c095a97d438232bd4

Observation 7a20a3d0-0819-450b-b503-0ba366c9e495 · outbound

This paper cites Theoretical foundations of active learning.

The Space Complexity of Learning-Unlearning Algorithms Theoretical foundations of active learning

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:02.046128Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.840967Z digest=sha256:a0e167be08530f03e03321006f3aa4a45af9d1ffeddafe3507fad3ef99c43f22

Observation f15472b4-5d7d-42b0-8d8a-35a922fe11ab · outbound

This paper cites The star number and eluder dimension: Elementary observations about the dimensions of disagreement.

The Space Complexity of Learning-Unlearning Algorithms The star number and eluder dimension: Elementary observations about the dimensions of disagreement

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:01.919500Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:48.916834Z digest=sha256:9c7d5f6277602eefdad91f9337fe14d593080e5f29bca949027aefc181cb900e

Observation 8c3b88a1-0e69-43d6-b14a-134ed3a5cde3 · outbound

This paper cites Minimax analysis of active learning.

The Space Complexity of Learning-Unlearning Algorithms Minimax analysis of active learning

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:01.747057Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.030407Z digest=sha256:ce8c4ce3b23d0e34a871b77cec1061507acca42e031ef252cefd0583368bb896

Observation 498da90f-5cae-4ae5-b838-8b9f477929f4 · outbound

This paper cites Characterizing history independent data structures.

The Space Complexity of Learning-Unlearning Algorithms Characterizing history independent data structures

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:01.599003Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.143210Z digest=sha256:a99b81be423ff2ecd4440f20e0c27aa475f91ad4713612cef68bca10ef8092af

Observation 4e2eff0c-97d7-4c01-8694-5d4118134ee9 · outbound

This paper cites Learning with finite memory.

The Space Complexity of Learning-Unlearning Algorithms Learning with finite memory

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:01.474481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.262576Z digest=sha256:befeddb09498efbc5b1d9a982f9eb6444197ab48a28157f50a4f5874729d563e

Observation b148207e-e347-4b2e-989b-eeb2235b4097 · outbound

This paper cites Tight Bounds for Machine Unlearning via Differential Privacy.

The Space Complexity of Learning-Unlearning Algorithms Tight Bounds for Machine Unlearning via Differential Privacy

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:49.294110Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:49.294110Z digest=sha256:1338cbf0dce0110dc2d253604544ed41b5576e68edd088cd5675c3835e87211d

Observation 5fbd1d25-49fa-4b91-b060-83ad70069541 · outbound

This paper cites Preventing Verbatim Memorization in Language Models Gives a False Sense of Privacy.

The Space Complexity of Learning-Unlearning Algorithms Preventing Verbatim Memorization in Language Models Gives a False Sense of Privacy

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:49.442234Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:49.442234Z digest=sha256:8d753f03bddd6536335e6d58d531f0c22a4bc68b4f0a9a254bea0ae880cb7d21

Observation 735832ed-473e-4ac6-9b4b-f35b64d237cf · outbound

This paper cites Approximate data deletion from machine learning models.

The Space Complexity of Learning-Unlearning Algorithms Approximate data deletion from machine learning models

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:01.354556Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.582517Z digest=sha256:67849df5f8e66677aa7ee1812d3b1f1e7f19fac8860fe2cae22d92a9c73267ab

Observation 9f2944cc-1ca8-4034-88ab-778843dfb8c2 · outbound

This paper cites Knowledge Unlearning for Mitigating Privacy Risks in Language Models.

The Space Complexity of Learning-Unlearning Algorithms Knowledge Unlearning for Mitigating Privacy Risks in Language Models

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:49.666006Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:49.666006Z digest=sha256:78a9d6b59174f42694c4672dacc854f489ace9fdf2ebc21c2e087570963cfe23

Observation a10c4cf7-1a8a-45b9-918f-61fe27f9c66e · outbound

This paper cites q-Binomial Coefficients and Linear Algebra over Finite Fields, pages 21--26.

The Space Complexity of Learning-Unlearning Algorithms q-Binomial Coefficients and Linear Algebra over Finite Fields, pages 21--26

Reference 60

Resolution
verified exact
doi, observed 2026-08-07T00:53:53.484586Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.762177Z digest=sha256:54c73edf0e37ad7b2d67d748eb3bdede160af63fb24d34bce912eb1ab72fe706

Observation 8fd98fd6-8f2b-48bc-9a7e-8a2e19391755 · outbound

This paper cites Multiple incremental decremental learning of support vector machines.

The Space Complexity of Learning-Unlearning Algorithms Multiple incremental decremental learning of support vector machines

Reference 61

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:01.213161Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.895331Z digest=sha256:de8d7d86ab894d3b85e6a1e564348670d7811b99f0fc7ffbaf6bc66176b41be0

Observation ab46b3fa-6fe9-4056-b015-6f8828538769 · outbound

This paper cites Time-space hardness of learning sparse parities.

The Space Complexity of Learning-Unlearning Algorithms Time-space hardness of learning sparse parities

Reference 62

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:01.055847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.983081Z digest=sha256:8faaabb0cdff4f38b0367e3473d564ccc18d390f4722cf0ebfbfb90b5da813bd

Observation f92b66a8-91d6-4075-a36c-fb667d2435ab · outbound

This paper cites Towards bridging the gaps between the right to explanation and the right to be forgotten.

The Space Complexity of Learning-Unlearning Algorithms Towards bridging the gaps between the right to explanation and the right to be forgotten

Reference 63

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:00.925617Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.050402Z digest=sha256:a630d512f0a1cb2d7cb8faf8e1e639d188d909fe48b4154ce136b0646c5c4468

Observation 3be89b94-6fd7-4ef5-a3d7-b40e2f1af942 · outbound

This paper cites Towards Unbounded Machine Unlearning.

The Space Complexity of Learning-Unlearning Algorithms Towards Unbounded Machine Unlearning

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:50.128823Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:50.128823Z digest=sha256:b4258b729d98a66e548a83e6a60cd653d7bda8c3c1353f03e853f2f8196bad99

Observation 531e2d42-d223-4006-a71f-212ba7bc34d1 · outbound

This paper cites Understanding the eluder dimension.

The Space Complexity of Learning-Unlearning Algorithms Understanding the eluder dimension

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:00.770539Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.182712Z digest=sha256:62f0ba4684f4a2534dc7e0f91317e5d196f57f1b880cac257fee53c3af784cdb

Observation 32c7dce9-4824-4169-aa52-50bcadb59fdc · outbound

This paper cites Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm.

The Space Complexity of Learning-Unlearning Algorithms Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm

Reference 66

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:00.605260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.252251Z digest=sha256:9b07aa7332d7cd90d55189e28c9fb12fa7ff674f8ff64f09bc5688362b968f47

Observation 1edcd1c8-bd95-4be9-ab74-497ddf0eaaaf · outbound

This paper cites Relating data compression and learnability.

The Space Complexity of Learning-Unlearning Algorithms Relating data compression and learnability

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:00.431914Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.305536Z digest=sha256:812778856d84c523a30514c65bec2498d7f231eeb1300c5c0fbba0d629fd438a

Observation 1dfcf09d-0ee2-46e4-abc0-e76ea4498568 · outbound

This paper cites Efficient convex optimization requires superlinear memory.

The Space Complexity of Learning-Unlearning Algorithms Efficient convex optimization requires superlinear memory

Reference 68

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:00.277659Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.419759Z digest=sha256:aceb1bebcddbb9b207449b3f8895aeaa513bd229528238a34932433c429e6f20

Observation 6a32090a-9b80-4fa4-bf6a-acb6f45c5b99 · outbound

This paper cites Graph stream algorithms: a survey.

The Space Complexity of Learning-Unlearning Algorithms Graph stream algorithms: a survey

Reference 69

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:00.135990Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.516170Z digest=sha256:a2f60d7175735ee9b258253432942c0388df1564db07684789598393fcf78f28

Observation 0683565e-d463-4fd8-842a-751e68d3b386 · outbound

This paper cites Finding repeated elements.

The Space Complexity of Learning-Unlearning Algorithms Finding repeated elements

Reference 70

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:54:00.025501Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.565871Z digest=sha256:8dd1106b7ec494bcb8dd1999b11a4a7ec18e8d643a595e7daeadb94e51ebba55

Observation 87325784-725d-4335-9cc0-9fb7b401a7da · outbound

This paper cites Sample compression schemes for vc classes.

The Space Complexity of Learning-Unlearning Algorithms Sample compression schemes for vc classes

Reference 71

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:59.886028Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.649938Z digest=sha256:63e0a730ce4fd59515a96fcdea995e1791ed38f2b66dfe219a5f26c4f7808660

Observation e3fe5ba0-2932-4188-a726-0e946f42b570 · outbound

This paper cites Mixing implies lower bounds for space bounded learning.

The Space Complexity of Learning-Unlearning Algorithms Mixing implies lower bounds for space bounded learning

Reference 72

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:59.666866Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.731319Z digest=sha256:09f43b613af1aab733215bd41495116a93597fdf08ba842116e1ed4c8372e776

Observation dbf53f68-194d-4a0b-887e-4f572e755d54 · outbound

This paper cites Entropy samplers and strong generic lower bounds for space bounded learning.

The Space Complexity of Learning-Unlearning Algorithms Entropy samplers and strong generic lower bounds for space bounded learning

Reference 73

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:59.371797Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.805400Z digest=sha256:9add13f9523978ff647bae48fcd2e79db71cf10203eeb8acff185479e6128d60

Observation bd5a3d6c-21ac-4d2e-a107-12af7358e728 · outbound

This paper cites On the Sample Complexity of Reinforcement Learning with Policy Space Generalization.

The Space Complexity of Learning-Unlearning Algorithms On the Sample Complexity of Reinforcement Learning with Policy Space Generalization

Reference 74

Resolution
verified exact
local_arxiv, observed 2026-08-07T00:53:53.699191Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.889556Z digest=sha256:d90a960413a16c72379a7bf5415132d6593f26637ac810ee84b625ee8ac0dfd2

Observation 9f6d740f-8ef5-4018-8383-c4abab5fdb20 · outbound

This paper cites Selection and sorting with limited storage.

The Space Complexity of Learning-Unlearning Algorithms Selection and sorting with limited storage

Reference 75

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:59.091885Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.946823Z digest=sha256:2b21595044784a5c498fa51c0e92e5fe190507d890f35de4a254e6465a53986c

Observation ef104c02-e787-4c65-b2bd-79fc8e3c7a91 · outbound

This paper cites Data streams: Algorithms and applications.

The Space Complexity of Learning-Unlearning Algorithms Data streams: Algorithms and applications

Reference 76

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:58.816444Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.044834Z digest=sha256:f1fd8660b80dc5d0300c2e766878812807ec0688ffff0fd050b06e42545bd87d

Observation e47611c1-98d7-497f-b2b3-11af76d875e0 · outbound

This paper cites Anti-persistence: History independent data structures.

The Space Complexity of Learning-Unlearning Algorithms Anti-persistence: History independent data structures

Reference 77

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:58.640971Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.102238Z digest=sha256:cd85f171e299a43bccaa16eec7771618d190654d91df7af05ed9f22d2a37b282

Observation 3718186d-1f41-448b-925c-7fec89b61239 · outbound

This paper cites History-independent cuckoo hashing.

The Space Complexity of Learning-Unlearning Algorithms History-independent cuckoo hashing

Reference 78

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:58.438095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.181557Z digest=sha256:492c1ac6c5d2b59fb34096f2d983458c89f22c02946b5e38d0835a9dc1f587a4

Observation 66ab4b3d-0968-4d62-aa70-cbba1bf73131 · outbound

This paper cites Descent-to-delete: Gradient-based methods for machine unlearning.

The Space Complexity of Learning-Unlearning Algorithms Descent-to-delete: Gradient-based methods for machine unlearning

Reference 79

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:58.304578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.266131Z digest=sha256:c87ca526f098ed9ac1440b79b76e92c865ce0cb50dcf34a8dbfd756f53ccaffe

Observation 4e34d3c5-ff52-4abe-8635-dfa2c2659931 · outbound

This paper cites Variational B ayesian unlearning.

The Space Complexity of Learning-Unlearning Algorithms Variational B ayesian unlearning

Reference 80

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:58.153293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.328995Z digest=sha256:6a848aa8b67082d2f4f41a1d58fb756330b349c96e5e575bb94015a3954d8d2b

Observation a1cf27e8-f4db-41c4-8e6c-ef682a7b303c · outbound

This paper cites A Survey of Machine Unlearning.

The Space Complexity of Learning-Unlearning Algorithms A Survey of Machine Unlearning

Reference 81

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:51.385970Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:51.385970Z digest=sha256:048c95637a844a74cee4ffe87cb8cb3a7ed3f49da8594b75c06f33d0c6c53ea8

Observation 1cb29f7a-c77c-4ace-b6d5-ed89e935059d · outbound

This paper cites In-Context Unlearning: Language Models as Few Shot Unlearners.

The Space Complexity of Learning-Unlearning Algorithms In-Context Unlearning: Language Models as Few Shot Unlearners

Reference 82

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:51.478659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:51.478659Z digest=sha256:08c01d7f1807d854ac7a463f2c38624500f6cd1f2d097744dd5ed09449bb5a32

Observation ff140332-5cba-4437-b51f-a9020ad3fe20 · outbound

This paper cites Machine unlearning fails to remove data poisoning attacks.

The Space Complexity of Learning-Unlearning Algorithms Machine unlearning fails to remove data poisoning attacks

Reference 83

Resolution
unresolved
no resolver link, observed 2026-08-07T00:53:51.523088Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:53:51.523088Z digest=sha256:709ba3ca5719d23dc6f8839854e634f99a47a7af94eefea4993273b801cbe26c

Observation f1054e0f-c36a-4507-90c9-546090bf8890 · outbound

This paper cites Near optimal memory-regret tradeoff for online learning.

The Space Complexity of Learning-Unlearning Algorithms Near optimal memory-regret tradeoff for online learning

Reference 84

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:58.015053Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.570942Z digest=sha256:82cad794ee6e652074f82f68d7ad1cc475d6b9b86861dd58d9600c5097156603

Observation 1a06dc7b-1a8c-4317-89dc-8abfe015aaa2 · outbound

This paper cites Big data and sketching.

The Space Complexity of Learning-Unlearning Algorithms Big data and sketching

Reference 85

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:57.879295Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.629698Z digest=sha256:f85119a15fcceb7e2d149f94326f32994cf126d17478e806f38368406e2b38ea

Observation 222db1a8-6814-464b-92ba-7fcaafb3e22a · outbound

This paper cites Linear adversarial concept erasure.

The Space Complexity of Learning-Unlearning Algorithms Linear adversarial concept erasure

Reference 86

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:57.731313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.694606Z digest=sha256:eb266950272e213fad03f75f5fa481722f4abd51e50312b8eebfad45ac48b5d7

Observation 543103a8-3e1e-40a1-8379-1994403cdc31 · outbound

This paper cites Adversarial concept erasure in kernel space.

The Space Complexity of Learning-Unlearning Algorithms Adversarial concept erasure in kernel space

Reference 87

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:57.599862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.745787Z digest=sha256:ffce1f20a4c6eb747e91a15f95659ee26736947222668ef804f0ea0c61875973

Observation c5def2c6-3681-4baf-ba80-c21b40dceae5 · outbound

This paper cites Fast learning requires good memory: A time-space lower bound for parity learning.

The Space Complexity of Learning-Unlearning Algorithms Fast learning requires good memory: A time-space lower bound for parity learning

Reference 88

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:57.435143Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.800553Z digest=sha256:a4e1da6d5bd0852b9294049bfe3a2b1601cf0665d45292d001cf165e02778287

Observation 48c988ff-f9fe-4296-8e40-b53acc627e88 · outbound

This paper cites Incremental and decremental learning for linear support vector machines.

The Space Complexity of Learning-Unlearning Algorithms Incremental and decremental learning for linear support vector machines

Reference 89

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:57.303243Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.873106Z digest=sha256:fc6a19a297d3ea5bca6971a6def5eccfc894a8789bb22888b570908ba7eaf83c

Observation 8e2a05ee-6b5b-4536-96c3-d69da2a43f18 · outbound

This paper cites Eluder dimension and the sample complexity of optimistic exploration.

The Space Complexity of Learning-Unlearning Algorithms Eluder dimension and the sample complexity of optimistic exploration

Reference 90

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:57.163630Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.939910Z digest=sha256:3705fdfb1b36fcc4db26a7004680189dedb40a8b155b07a8349205c02ab8ae55

Observation a8c49c5a-f3b0-420d-b34e-f7597abd1568 · outbound

This paper cites Remember what you want to forget: Algorithms for machine unlearning.

The Space Complexity of Learning-Unlearning Algorithms Remember what you want to forget: Algorithms for machine unlearning

Reference 91

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:57.010794Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.983187Z digest=sha256:b846573c50fc8209927374b9ab49fa21523b94512eb9836585f72329f29bbc9d

Observation d36f23d1-7df8-4daf-8431-7c36f8589b67 · outbound

This paper cites Fundamental limits of online and distributed algorithms for statistical learning and estimation.

The Space Complexity of Learning-Unlearning Algorithms Fundamental limits of online and distributed algorithms for statistical learning and estimation

Reference 92

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:56.883424Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.040000Z digest=sha256:965ad2d57bbfb99115e1ba682c5f3a47fc0622e031dd2685c2640595bc305e06

Observation b4c07d4c-6969-4970-8b30-add0ddc055f5 · outbound

This paper cites Memory-sample tradeoffs for linear regression with small error.

The Space Complexity of Learning-Unlearning Algorithms Memory-sample tradeoffs for linear regression with small error

Reference 93

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:56.712367Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.095088Z digest=sha256:bedc5b6188993d684a34e1f6ce30b4fefe0c0c1adcefb25d73c18026cb1d91ca

Observation 0f7071d2-04ef-4a73-8c6a-7e53e96cd3af · outbound

This paper cites Membership inference attacks against machine learning models.

The Space Complexity of Learning-Unlearning Algorithms Membership inference attacks against machine learning models

Reference 94

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:56.552501Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.168378Z digest=sha256:0f6ce9b267047ff84a3734a216a7946c0e2617046fec1220819b5e856ce6d000

Observation 9cba75a1-23d9-4ec2-9ca2-57194e13183f · outbound

This paper cites Memory bounds for the experts problem.

The Space Complexity of Learning-Unlearning Algorithms Memory bounds for the experts problem

Reference 95

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:56.438209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.252752Z digest=sha256:9bda6e660167b74abd14ff642cddd2ae9db07a72cdc8786ba0a21adade8dc878

Observation ec964fca-8a71-4148-a90d-db34f4ece3f6 · outbound

This paper cites Minimax rates for memory-bounded sparse linear regression.

The Space Complexity of Learning-Unlearning Algorithms Minimax rates for memory-bounded sparse linear regression

Reference 96

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:56.263771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.337977Z digest=sha256:97a9c23e6779a331325e90ac6975562c651696bde777c6a94667bef5e23cddaa

Observation f2c4be79-4540-47d1-91e6-a6140c0b0b33 · outbound

This paper cites Memory, communication, and statistical queries.

The Space Complexity of Learning-Unlearning Algorithms Memory, communication, and statistical queries

Reference 97

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:56.093689Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.394724Z digest=sha256:c789347d56c4f6cb99dde264ec92c1fbbe692e638bba6b2fc3bf3ff3113312f4

Observation 34d235ed-62c4-4c04-af30-bb26d700343a · outbound

This paper cites Algorithms that approximate data removal: New results and limitations.

The Space Complexity of Learning-Unlearning Algorithms Algorithms that approximate data removal: New results and limitations

Reference 98

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:55.964978Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.479964Z digest=sha256:07b48c46436c7984a47cc4170c256c1a3f5d0515657ce18c5a2f541520e0e9b8

Observation 842c1b65-7080-490c-bd19-5e54a0352608 · outbound

This paper cites Unrolling SGD : Understanding factors influencing machine unlearning.

The Space Complexity of Learning-Unlearning Algorithms Unrolling SGD : Understanding factors influencing machine unlearning

Reference 99

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:55.822868Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.569811Z digest=sha256:d124c9ca8c73d1a9fb89cdb2570705275629be1a215fab61483757863330de1c

Observation a08f813f-afdd-4e6a-8fa7-6c15581b25d4 · outbound

This paper cites Incremental and decremental proximal support vector classification using decay coefficients.

The Space Complexity of Learning-Unlearning Algorithms Incremental and decremental proximal support vector classification using decay coefficients

Reference 100

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T00:53:55.690001Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.653253Z digest=sha256:9f62812605e6d72749172042e1f4290ce3066f2b955c56c0b84b99ba31daf35b

Pith citing papers

No inbound Pith citation observations are available.