Pith. sign in

Paper Citation Record · LEDGER

The Space Complexity of Learning-Unlearning Algorithms

As of 9 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-08T06:32:00.761636+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:e9b37cbacf64acabfea590f28f54242093172652e0af748dda97f37d02ae4610

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:43.447161Z digest=sha256:318c6a6b52404ed29e34e275bb7d94bbce7b2674e8de3d84c87521061eff2f8b

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:3066dfb73226e908225f0157677d5583b57307ca0bb90cf975f1bb3de5ed22cd

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:21b672d939be39ea452aaf5062ae5d133b51dda67f1fbe19bb319485ecb0159c

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:63200525683d06f81c8d7c9efa4ff2cd5c1b514e50bbc72b9578d4e1018636bb

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:43.883206Z digest=sha256:944171bb7fa9626f45b56852a1b8bf99ad2d9dcb3814f6fd13cddcb9b3cd58d4

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:bcc81a0605380397bb828485c1e84dae5f80e6828b2ae3138787afc82de25004

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:cd71d8536159923769f6607a963351c3efa452d473000577a4c76902e5a4d3a6

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:ee32cf3d0c6cc683c26b5d189d493cf2d504aa9cf6360b1f9e082c50411f3a21

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:38bc37496dbed30c2ac856b531d134cc74be904a009bf752ec795ecc5c6af614

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:c483a0753d9f6f1f6ad998af269c51a72a08b8b1dfa7f1195b269b7a9d517e80

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:a524ac73c5c1699b6fd34eb25dc052c71bc7917f3431fd97d694783825787205

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:8310fc79da65931c632eb5df0656f4ee2d1561dc6b2433ea1f13c4e3677a2ddc

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:2e58ff6697fbe3203f0a5c3d41a15db09bf7fdbce550c5c3c30e1a6965ac33e2

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:2d9bd8295518c3a4cd87bcd9542132fb9d8944580bdec7206deb445bd0684e5c

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:45b176802c3b54af913f087b6417788ff06f7375f50352ab71ac05926c855759

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:2e467edb04f90248f3f70ede5f9e1a76e00b18c8e5870cd04b9259339d1f9a92

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:6f52cbf29b43c93c082b26904c0802038cc13f5c5525506f652419b705228fd0

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:e59b170767fde77e084aadcfcfddefa8871bbe2e9aeb9f88ffe3ca1d097835cb

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:b5055e2dd04990a41a287aaf21b36240e89aabaea43e0e2755709a59a991fa0b

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:8da31df5a03b2aa4ee22df4e81f9f6f08d6d58d6ae86f7514717f79bf9230dda

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:ab4e6c3f82ac0a080a151d0b09d9ebaa65b4831f18b027387e28be4279643f16

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:02f918a00eaa2d24eaf26d66444b5f1f6fdbca7d676c1102539b588d6bbaba6e

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:f2ecff41dfae46670aa0c717fe78ed0244e5dce0ed2b2111164cc10de08bf9a2

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:e474bbbea7e9644234db95c7a74c54a10229d4a6ede0c91e9cd967b60cf2ddf7

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:5e209725b95b4ba98e10c157471fa5091d20f168e912f0304a0ecf517d7a460d

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:1252ee8b21345bb452920e2932eb9ac2a2907bffe7477f983e4390636fa905f4

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:bf70fee6342401773763cf2611eefadcae64e1e994d614c3737017ce9fa161ec

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-08T06:32:00.761636+00:00.

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

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:46d2652012632d45cb8b98a122bea65cb67d3fbe5d371f2c5f752e8d29fd71ef

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:3ed6fa1141ea3b81621efcfd3fbccb8c6110bf0df249236537e643a12b1d6157

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:ea400d314584047df97c3ee70840681ff8d147714f5236e796fc2099686bbd29

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:7f97f00d0783ff32f00b98f4774323bbc2de0b1848da5bc19cac56abb608780a

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:112e840d09ca9825ebe96eef8c050eccff4e6b08246ea70da43dee7f1aa0948d

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:b2a352c9b40147545779f2a0b192c685bf5274a2bfb1236f848f4480e811e98d

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:a21528f81ecb24fb31df05aa50ae25914917be0af89cae9ea908e0c97289a93a

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:0515664c32c3fd74e9eeb9178e8ece3628f128331bc5e47a0da55b1aad2101f9

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.441208Z digest=sha256:0431325d06afa9705e3f72811502033563fb9cbbb64df180cfb476ec9285fb9a

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.726759Z digest=sha256:704569fdf7608c32f495900f3df40a5f5ea26c98d9923cf70ab14d6e91748166

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.893008Z digest=sha256:8250ccb10f1ce9e4071ba109fdc6e71341d7bbc32fff8d176d0693f5df3d4755

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:7830fabd1e32da89150a94d77878d3c815226d48ecb21481ba217bcdc4d9cc69

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:516687f0d42eb05816e1063c270747917ef33a6479c29c334810d07d4b9874dd

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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:4cffe54bff64932037d8f8136aa4e212e77e74000c5195c2fb2b088ba546d6e4

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:77d5b7bc3ab9a70b5d4ffbb4d753521cbc3ecd2d1d6ae5060a049df31875f477

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.582517Z digest=sha256:0ce13c83c7bfe480cf0f1a52bb44ce3addbde3ab04456fdaeacbbae4b78567cc

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:02bae068d37371a8f5718c93ca935d2115a6c918fe5258e9abcb8c3318d80bc3

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.762177Z digest=sha256:0b960a3a9a2ccb289bc48f401320ddcbdfea26e3bd36622dac3fce21c9702472

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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:0458673d8af5ecf2ddc36fea7315d9e2ba31e64106e0c9fc0e16d8daa93e4209

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.252251Z digest=sha256:7601be8e1f8cfc78a60fdd0e7cd7ca865e2ef7d7c8a4597421f93f0182fc1fe3

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.305536Z digest=sha256:44d580ebd4b4de73f62fe39f13321f9e0a5149938b7a73a208068c73db604ac1

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.565871Z digest=sha256:73e526a04eacb071ea4d94981bddec726122127bafd58c0feed943795fc00db0

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.649938Z digest=sha256:3b733c019803320556be2b87ad1c792921fc4242ab8e70d1e0baddee068dab9d

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.946823Z digest=sha256:74edc77094fb43a7c90211a79672db5da2bc395187eb15f5ecf73135f080fe92

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.328995Z digest=sha256:19f8477bdfe4088552ed2f6179a0c791726bb89971a12d5c87008afca6ee8301

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:a7dc3dfaf9195ad35f6adb39d92f598e3b4cf240d5efd35eda17d48b5a32df2b

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:aa55077bb87c63608d1dd112befb8e6f7d195ea07aedd5dffd48117e808aba0a

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:ada0a5e7205d3cb7068ac1a407a222592c84939e268cca4034cba86cea83cbed

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.939910Z digest=sha256:2b55f6d5c5a9c21b3f1c33b7da0d2a45da8f610dc01880117f4fd639e80d30f9

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.040000Z digest=sha256:266e098d55f43d78ce5423428494cdf62fe5d2d5564cc5d82448e68fd222a4c5

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.168378Z digest=sha256:411635a756673feddec2980c564b543283c90ff665251a9dba03b6de492f6271

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.337977Z digest=sha256:69472fb1dbe4cf31cb47f589252ab0cae36af4cf842f7be3133b327503a1f471

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

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-08T06:32:00.761636+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.