{"as_of":"2026-08-23T01:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cad3fb387133c125901ef5ddf6409608d58da2348a70cba8e3a96e41b9466b36","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:28:40.735789Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T04:28:11.248635Z","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-07-02T12:16:57.120715Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"cited_work":{"arxiv_id":"2509.02820","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.02820","snapshot_observed_at":"2026-07-02T12:16:57.120715Z","title":"Unlearning that lasts: Utility-preserving, robust, and almost irre- versible forgetting in llms","venue":null,"work_id":"40104ec1-dfa9-493c-8644-15efc69277ff","year":2025},"citing_paper":{"arxiv_id":"2510.00761","last_updated":"2026-04-18T07:30:06Z","snapshot_observed_at":"2026-08-16T07:19:23.004984Z","submitted_at":"2025-10-01T10:50:14Z","title":"Downgrade to Upgrade: Optimizer Simplification Enhances Robustness in LLM Unlearning","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-18T10:44:53.516653Z"},"links":{"cited_paper":"/paper/2509.02820","citing_paper":"/paper/2510.00761"},"observation_digest":"sha256:bfdc5c8f47033071937dfe81324e94be7343482955ecd12a6b13470fe91c52be","observation_id":"cb10a965-a641-4d3f-8a00-b263d5a28302","resolution":{"observed_at":"2026-05-18T10:46:17.053029Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"cited_work":{"arxiv_id":"2509.02820","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.02820","snapshot_observed_at":"2026-07-02T12:16:57.120715Z","title":"Unlearning that lasts: Utility-preserving, robust, and almost irre- versible forgetting in llms","venue":null,"work_id":"40104ec1-dfa9-493c-8644-15efc69277ff","year":2025},"citing_paper":{"arxiv_id":"2606.06320","last_updated":"2026-06-04T15:56:32Z","snapshot_observed_at":"2026-08-17T15:00:45.073208Z","submitted_at":"2026-06-04T15:56:32Z","title":"Learning What to Forget: Improving LLM Unlearning via Learned Token-Level Importance","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-06-28T02:16:58.823847Z"},"links":{"cited_paper":"/paper/2509.02820","citing_paper":"/paper/2606.06320"},"observation_digest":"sha256:3bb7b83c33b44617fc6d6fc3e181ca881d776ca84563363fc82093f38a51867c","observation_id":"91cb5d41-6be8-4c92-884c-95e4d121bd11","resolution":{"observed_at":"2026-07-02T12:16:57.122823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02820","snapshot_observed_at":"2026-07-13T04:30:23.082717Z","title":"Unlearning that lasts: Utility-preserving, robust, and almost irreversible forgetting in LLMs.arXiv preprint arXiv:2509.02820, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09236","last_updated":"2026-07-10T09:31:29Z","snapshot_observed_at":"2026-08-15T03:12:07.959025Z","submitted_at":"2026-07-10T09:31:29Z","title":"Forget Narrowly, Retain Broadly: Unlearning as an Asymmetric Generalization Problem","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-13T04:30:23.082717Z"},"links":{"cited_paper":"/paper/2509.02820","citing_paper":"/paper/2607.09236"},"observation_digest":"sha256:a8f34c6981fd6a3a9775ba1fe05b2823b164718cb24056ffaa5b42b33512ae3c","observation_id":"0d9cf354-fbb8-4515-b469-46b9408cdd6b","resolution":{"observed_at":"2026-07-13T04:30:23.082717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02820","snapshot_observed_at":"2026-07-30T21:56:17.841021Z","title":"Unlearning that lasts: Utility-preserving, robust, and almost irreversible forgetting in llms.arXivpreprint arXiv:2509.02820, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26760","last_updated":"2026-08-04T08:51:55Z","snapshot_observed_at":"2026-08-18T22:20:05.492530Z","submitted_at":"2026-07-29T10:58:44Z","title":"Metis: Memory Foundation Model","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-30T21:56:17.841021Z"},"links":{"cited_paper":"/paper/2509.02820","citing_paper":"/paper/2607.26760"},"observation_digest":"sha256:e45098e02dcb17e787a7dd92e245ba5fcf8d0fcfbc68bcccbdd70e2395b6a6a2","observation_id":"63c9ea56-c298-4175-9d2f-b6be3a0a1765","resolution":{"observed_at":"2026-07-30T21:56:17.841021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02820","snapshot_observed_at":"2026-08-05T04:28:11.248635Z","title":"Unlearning that lasts: Utility-preserving, robust, and almost irreversible forgetting in llms.arXivpreprint arXiv:2509.02820, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26760","last_updated":"2026-08-04T08:51:55Z","snapshot_observed_at":"2026-08-18T22:20:05.492530Z","submitted_at":"2026-07-29T10:58:44Z","title":"Metis: Memory Foundation Model","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T04:28:11.248635Z"},"links":{"cited_paper":"/paper/2509.02820","citing_paper":"/paper/2607.26760"},"observation_digest":"sha256:bae2ad30cb21e471d592f3c53e5eb21c0ab55e886c0815ab4c840bcaaf4ea978","observation_id":"2ceb0af2-ccf6-4c26-9f98-aa41dc373ec8","resolution":{"observed_at":"2026-08-05T04:28:11.248635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.02820","snapshot_observed_at":"2026-08-01T00:35:50.412088Z","title":"Tamirisa, R.; Bharathi, B.; Phan, L.; Zhou, A.; Gatti, A.; Suresh, T.; Lin, M.; Wang, J.; Wang, R.; Arel, R.; Pichapati, V.;Hendrycks,D.;etal.2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27836","last_updated":"2026-07-30T08:15:58Z","snapshot_observed_at":"2026-08-21T02:26:41.001087Z","submitted_at":"2026-07-30T08:15:58Z","title":"Crossing the Margin Cliff: Toward Relearn-Robust LLM Unlearning via Margin Calibration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T00:35:50.412088Z"},"links":{"cited_paper":"/paper/2509.02820","citing_paper":"/paper/2607.27836"},"observation_digest":"sha256:200d3ed547d0a3e23d17ca22612fc474d363b5e5543e845d240a9e0913641b6c","observation_id":"fbaaf8d7-2c17-4c41-bc3d-f5517d08b3e4","resolution":{"observed_at":"2026-08-01T00:35:50.412088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.02820/citation-record","integrity":"/paper/2509.02820/integrity","json":"/paper/2509.02820/citation-record.json","paper":"/paper/2509.02820"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:43.969526Z","title":"Details on LKF and our new evaluation protocol","venue":null,"work_id":"5e9239e5-33b6-4d51-b7f6-f532df20cfca","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:38.889481Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:a326fb62e0bc6f2fac8fde81c3b8747171c3f74a7fe0a246e3a2445af9577f31","observation_id":"4e305bfc-2a8a-4416-9d66-4a9e411350be","resolution":{"observed_at":"2026-08-05T11:28:44.070872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:43.745614Z","title":"Experimental details","venue":null,"work_id":"95429a3f-9016-4286-9949-171b26b1fc13","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:38.994810Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:9fe6c4b9dfc4a78958010a02b90f46d61212ba4e844b66a0873dda600be81ee8","observation_id":"c69cc84b-0121-42fb-a842-74f6d454b686","resolution":{"observed_at":"2026-08-05T11:28:43.830626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:43.569613Z","title":"Additional evaluation experiments","venue":null,"work_id":"2b8d0f7d-e258-4db2-b47e-9f241d0ae1da","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:39.117265Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:71ebe45ae7a5e2bc99c84db3e4b52b4857d6d1110cd61d4c900b8c1b4ea9b321","observation_id":"96ffc872-793d-419f-9ac3-fa50bb1c8525","resolution":{"observed_at":"2026-08-05T11:28:43.666908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:43.431106Z","title":"Additional unlearning experiments","venue":null,"work_id":"795f2f30-0b59-4371-a16a-61acfa471978","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:39.295753Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:afe3464c7785516a4d980334fbf2e2c645a4d05f6ed6304d35f5a101b8232a0b","observation_id":"c99885bf-6b80-4ed1-824c-2d1a331899f4","resolution":{"observed_at":"2026-08-05T11:28:43.505997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:43.163404Z","title":"Extended discussions and proofs A D ATASET AND PARAPHRASING DETAILS In this section, we explain in detail the LKF generation process and the paraphrasing details","venue":null,"work_id":"b061e3e1-e689-48b7-8f78-4d8736a83f96","year":2023},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:39.454785Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:1cd777fe1201c4a6eeb0660b4c489ee782d09c90b05f9b967cb06e8fd2eb383b","observation_id":"d723e676-8342-4c51-80d8-2522333c190e","resolution":{"observed_at":"2026-08-05T11:28:43.293543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:42.994085Z","title":"We first select five historical events for the forget set around which we generate factual QA pairs","venue":null,"work_id":"ff9a81d5-5d0c-4a13-8cf7-77d51a634322","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:39.591567Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:796b468b6e5091de26a63c8cc6c489a87e75241e4a6ea99b94a5a6bb1a78bc76","observation_id":"20c292b4-6f21-44da-92d1-4df1854263fa","resolution":{"observed_at":"2026-08-05T11:28:43.108059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:42.832315Z","title":"We use GPT-4 (OpenAI, 2023) and Gemini 2.5 (Google- Gemini-Team, 2025) to generate candidate QA pairs for each forget concept following the template in Figure 6","venue":null,"work_id":"3168e717-7115-434f-88d4-d60a7489f8dd","year":2023},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:39.708676Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:dbc4f396cbd36c4ccf76bc24293753a6e6f71934b24344399c9a87ab283a8fd9","observation_id":"4dea74fd-51d7-4664-b753-c7e9add214aa","resolution":{"observed_at":"2026-08-05T11:28:42.921841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:42.592176Z","title":"All candidate QA pairs are manually verified for factual correctness, using Wikipedia and other reliable public sources, to ensure high-quality ground-truth","venue":null,"work_id":"a2543d77-1d32-402e-8438-59e9b10d0ee2","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:39.836488Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:88a58f4e7d1dc6517f3196fac10918624ceeab07606e03cf21518ea1dfce3292","observation_id":"6861a70b-bbd0-4b09-bda9-b7b153cd761c","resolution":{"observed_at":"2026-08-05T11:28:42.730187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:42.374261Z","title":"For each event in the forget set, we select a set of topically related but distinct events for the retain set","venue":null,"work_id":"95803426-9d7e-4336-850f-2933cfafb8fc","year":2004},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:39.978784Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:3fe2fa80479f337c77a0a89418c872949ff27925dbc47cb3a3b7ad58c73eccbd","observation_id":"bd3afd7e-6a64-4490-a905-69115432ea53","resolution":{"observed_at":"2026-08-05T11:28:42.467410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:42.098429Z","title":"Candidate QA pairs for the retain events are generated using a similar template approach as for the forget set (see Figure 6)","venue":null,"work_id":"d80a5185-404d-4d06-afa4-9f3024b955d2","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:40.122820Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:eef155219d01af42ef043929a72db598f00b72c62c2e069c14bc21a39fdaca9c","observation_id":"3125bc6b-f484-4768-b8c1-3a9f685f0430","resolution":{"observed_at":"2026-08-05T11:28:42.242513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:41.925601Z","title":"role\": \"system","venue":null,"work_id":"42df3e0e-4450-451a-b877-5f8ba8088f1c","year":2023},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:40.237298Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:04f93bded5e88ff8780e996ae0d32ced24e3ed9675cf4b7a38a36702c3292391","observation_id":"853e7e56-78e5-4fa1-b081-2d1301ac530d","resolution":{"observed_at":"2026-08-05T11:28:42.016913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:41.697477Z","title":"This relearning set is disjoint of both the LKF forget and retain sets","venue":null,"work_id":"0f3ce815-4529-4308-801e-0016c505fcef","year":null},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:40.369535Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:59bd5688bf8cef3d132a65dcc2c705f4b8141df9ec09743a4402c01a4c1f98b9","observation_id":"cc292932-6ab6-4c56-894d-02abcba0aaa3","resolution":{"observed_at":"2026-08-05T11:28:41.789673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:41.432223Z","title":"adversarial","venue":null,"work_id":"39fd7573-c1dc-4e2c-8984-decd38dc9fcf","year":2025},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:40.495624Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:354114e82d73fa12e5d42793d482812e3e83b383ca81cb1dd4fd6bc756f5021d","observation_id":"702b90fb-32b9-4c9d-b523-5fc35d0aaef6","resolution":{"observed_at":"2026-08-05T11:28:41.562169Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:41.159441Z","title":"I Love Lucy,","venue":null,"work_id":"bbf04e17-2b89-4c4a-849a-926f216ffbcc","year":1950},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:40.617099Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:7d9f6698a18d5bbedb9abb4b3230782b968983d7335bec214dcf380f08590ff7","observation_id":"8aae47f4-1d05-4ed4-9913-613657870d15","resolution":{"observed_at":"2026-08-05T11:28:41.246140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T11:28:40.906751Z","title":"Schrodinger’s cat","venue":null,"work_id":"77c14785-e9e1-4e20-912b-698cb8c31cc8","year":1935},"citing_paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T11:28:40.735789Z"},"links":{"citing_paper":"/paper/2509.02820"},"observation_digest":"sha256:116ef0a2600478d69bbcdd27d036cb566ebb4d00951f03e25a82f83bf8d56d8f","observation_id":"2b7adb9f-701b-4425-82ab-4059a5411a13","resolution":{"observed_at":"2026-08-05T11:28:41.037915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.02820","last_updated":"2025-09-02T20:38:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T20:05:09.998204Z","submitted_at":"2025-09-02T20:38:53Z","title":"Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":15},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 6 inbound Pith citation observations for arXiv:2509.02820."}