{"as_of":"2026-08-08T21:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5fa2a68e44fb387c93a044f7f1ee2f6c0070ce46a8382fbfc38ab339abbc8c09","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:14:44.280997Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-16T11:07:39.276906Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":"2302.09880","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards unbounded machine unlearning","venue":null,"work_id":"5a470220-1259-4ea4-b78d-c8db103d16f9","year":2023},"citing_paper":{"arxiv_id":"2401.06121","last_updated":"2024-01-11T18:57:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-11T18:57:12Z","title":"TOFU: A Task of Fictitious Unlearning for LLMs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-16T11:07:39.215164Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2401.06121"},"observation_digest":"sha256:872f4f5fcb35398d1f6aa7a80be858f0200a6f79c5022059ae69fab46e4a60b4","observation_id":"262b02f3-9cc0-438a-ae40-513f03a18a0a","resolution":{"observed_at":"2026-05-16T11:07:39.279381Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-08-07T06:14:44.280997Z","title":"Towards unbounded machine unlearning, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06073","last_updated":"2025-06-06T13:30:40Z","snapshot_observed_at":"2026-08-07T05:58:30.695869Z","submitted_at":"2025-06-06T13:30:40Z","title":"System-Aware Unlearning Algorithms: Use Lesser, Forget Faster","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T06:14:44.280997Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2506.06073"},"observation_digest":"sha256:ce6ae32c206a01196ea6acb00487ab90b63cd061e266f3aaaf5a8c8ee60e0c25","observation_id":"2ec23b30-fc55-4941-af2d-cf9d659c74c1","resolution":{"observed_at":"2026-08-07T06:14:44.280997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-08-07T00:53:50.128823Z","title":"Towards unbounded machine unlearning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-08T00:45:51.797303Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:50.128823Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:0458673d8af5ecf2ddc36fea7315d9e2ba31e64106e0c9fc0e16d8daa93e4209","observation_id":"3be89b94-6fd7-4ef5-a3d7-b40e2f1af942","resolution":{"observed_at":"2026-08-07T00:53:50.128823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-08-07T00:30:35.135760Z","title":"arXiv:2302.09880 [cs.LG] https: //arxiv.org/abs/2302.09880","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13972","last_updated":"2025-07-03T17:45:38Z","snapshot_observed_at":"2026-08-08T05:07:17.543197Z","submitted_at":"2025-06-16T20:22:07Z","title":"Membership Inference Attacks as Privacy Tools: Reliability, Disparity and Ensemble","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T00:30:35.135760Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2506.13972"},"observation_digest":"sha256:5a240acec42d6b9af5eca435e508870bd0691d4b7b12406d943647807323f201","observation_id":"becacbd2-3666-47e4-8e07-1ae40a455b79","resolution":{"observed_at":"2026-08-07T00:30:35.135760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-08-06T15:43:55.803673Z","title":"Kurmanji, P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.15280","last_updated":"2025-07-21T06:30:25Z","snapshot_observed_at":"2026-08-06T15:33:26.284365Z","submitted_at":"2025-07-21T06:30:25Z","title":"Machine Unlearning for Streaming Forgetting","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:55.803673Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2507.15280"},"observation_digest":"sha256:9ddf8108a8d4fbf39f8eafc86af95a253859e6d277b75ae54b30257ed3c837c2","observation_id":"797d0a27-f12d-4ee3-a08c-2559a4ef2789","resolution":{"observed_at":"2026-08-06T15:43:55.803673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":"2302.09880","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards unbounded machine unlearning","venue":null,"work_id":"5a470220-1259-4ea4-b78d-c8db103d16f9","year":2023},"citing_paper":{"arxiv_id":"2604.09391","last_updated":"2026-04-10T15:06:50Z","snapshot_observed_at":"2026-08-08T11:15:18.080351Z","submitted_at":"2026-04-10T15:06:50Z","title":"Efficient Unlearning through Maximizing Relearning Convergence Delay","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:24.974659Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2604.09391"},"observation_digest":"sha256:111586938f31e7659e73529bc289f4cfa9de8d97011361f8b35c39b4b2f3b58e","observation_id":"84cd682e-5edf-42d4-ab0f-751ce55cc7a5","resolution":{"observed_at":"2026-05-11T08:30:56.612640Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.09880","snapshot_observed_at":"2026-08-01T14:11:43.503645Z","title":"Nathaniel Li, Alexander Pan, Anjali Gopal, Summer Yue, Daniel Berrios, Alice Gatti, Justin D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19442","last_updated":"2026-07-21T08:59:54Z","snapshot_observed_at":"2026-08-07T14:23:11.137618Z","submitted_at":"2026-07-21T08:59:54Z","title":"Unlearning as Distribution Restoration: A Controlled Counterfactual Study, a Validated Selective Screen, and the Limits of Oracle-Free Certification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T14:11:43.503645Z"},"links":{"cited_paper":"/paper/2302.09880","citing_paper":"/paper/2607.19442"},"observation_digest":"sha256:4fc35327091859f8803baf0f57152b0da6da7a836a60a404873e0205a9741fb0","observation_id":"ee689732-e088-4efb-beed-fdae4b194b76","resolution":{"observed_at":"2026-08-01T14:11:43.503645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.09880/citation-record","integrity":"/paper/2302.09880/integrity","json":"/paper/2302.09880/citation-record.json","paper":"/paper/2302.09880"},"outbound":[],"paper":{"arxiv_id":"2302.09880","last_updated":"2023-10-30T10:14:02Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-31T03:34:03.102296Z","submitted_at":"2023-02-20T10:15:36Z","title":"Towards Unbounded Machine Unlearning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2302.09880."}