Pith. sign in

Paper Citation Record · LEDGER

The Space Complexity of Learning-Unlearning Algorithms

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

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-07T06:34:17.273281+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:16fcc0631da03b480d9c3327fb39018c4b42f46d8dc63c3fae38d638155fce0e

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:43.447161Z digest=sha256:9a956c7a2d250b5b7c165facb42f4c00884abb28f747c0aa5a770108569751c1

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

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

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:14432a2ae559c053c947b285edb4abb0745da24a77a2346502dfd373bbf4e726

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:43.883206Z digest=sha256:82af3df1ec04f0a6d15816b54017c63cef07b6b49e953f80372e9c79b7cf31d4

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

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

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

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

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

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:5585a5aafc314ae56df8ff012c61bb00b3c6e96fd49ff49e599192592002deaf

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:346c9034894319e1da4c183bb08e32a8503100e53fe47cc4461ac1b78ef1f3f4

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

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:4692cfcdeb89f9c39531fd913a978c5ec5c5f80246b5f1e18527f1d7bc6bd2e8

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

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

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

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:485a6e91e674160fd5cc5987ac0ba212b30c7d56471510ba6af9977606c9c3a6

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

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

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

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

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

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

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

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:6776dd6e266144c773b68779f54237703e383c9f6005fd17aebdb5ac7288aca8

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

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-07T06:34:17.273281+00:00.

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

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

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

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

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

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:1f2d15834468b7cb99910802584e36e176769ea47044889f13370ffe396f59b4

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:639738b0653e22207ca3e400873b5bdc3c1dd9fbf4e1475322e6896e4e80c818

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

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:490823b874e104a766dae8326ca92588e4515d9b4de76595d780e08870ad656d

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.441208Z digest=sha256:773e44d01d29cb912e85b155a54ddf9f5c8f1f33f5404645a6a93102c3429e50

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.726759Z digest=sha256:117c7c020ef4b2234296f5f8bdf076fb76f53ef9abea27ca07a2008a13d0177d

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.795629Z digest=sha256:4ebc101f570b0b633324158052af224fd52306843d0f1511bb330c633c2b2ae7

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:47.893008Z digest=sha256:32a44b98b74daa7aa5626eb2a8b796bcaadf0959b41717a87480b02e0d647f18

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

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:36f8297293eb6c3684f438acbf9acd8285c8ef86d21574b67dd4a6dcb420c7b9

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.582517Z digest=sha256:96a1fa7d047bf9eaef4cf8f7e051fa4bafbdeafaf907aa92328b74a2981ab0a3

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:49.762177Z digest=sha256:8a0c92340670ab67653b6304e8924d677bd4cd0566598a016651c592435e9644

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.252251Z digest=sha256:5cb30a9556cb55b2d65bfd430db685a18c137604fb44ca1978915e0044ff64e4

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.305536Z digest=sha256:733cd2d0f54017270b3aa7ef292042d4b00d203f14cce17ca2688df1446a49c9

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.565871Z digest=sha256:5116a4172f244c2b94a591c140d9e97d93ec6fb003a524466386a742b65f7eff

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.649938Z digest=sha256:2ef7f99ed7715114ae0a513eb0449a588881ab0660d04eb52f8928c9d0ad0afa

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:50.946823Z digest=sha256:7a2ab522dbbcbf89eb1d9f35a6b262195712502b2b08a9e3c8f1970dbff4c7f4

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.328995Z digest=sha256:9b6a15eb713ef2b587257ea317c0104bda762890b79098b182cee3c01ace55b6

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

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

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:9d8e6cd460877db8b8a07946da5eb0c0fa94af4fe8e1390caa0002bf55a1bbf6

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:51.939910Z digest=sha256:4450453981f40d402931a7ef8339941fbb23bb8b2b6a7e115449826bb4ba1472

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

source=arxiv_source observed=2026-08-07T00:53:52.040000Z digest=sha256:1d36b0da9fbb1e0359bf4533c4789773fdc3d8bfb37e11ecd78a1f98be1053b1

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

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-07T06:34:17.273281+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.