{"as_of":"2026-08-16T15:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a0f3f024b786691a1c1dff6d47a936ba546e4970bc6fbdb6d18da5e8a7c9326","coverage":[{"denominator":110,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:21:39.947423Z","state":"measured"},{"denominator":106,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":106,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-15T14:17:57.144501Z","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-06-29T19:03:51.460176Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13312","snapshot_observed_at":"2026-08-07T04:58:53.560741Z","title":"Guard: Generation-time llm unlearning via adaptive restriction and detection,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09227","last_updated":"2025-06-10T20:30:39Z","snapshot_observed_at":"2026-08-14T07:33:23.070386Z","submitted_at":"2025-06-10T20:30:39Z","title":"SoK: Machine Unlearning for Large Language Models","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T04:58:53.560741Z"},"links":{"cited_paper":"/paper/2505.13312","citing_paper":"/paper/2506.09227"},"observation_digest":"sha256:9d841bec832b50b7e9e0590fcafaa2a592051634e11770e46a836cad7f44a773","observation_id":"288ca9e8-4228-4e6d-8f97-4209e5d4640f","resolution":{"observed_at":"2026-08-07T04:58:53.560741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"cited_work":{"arxiv_id":"2505.13312","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13312","snapshot_observed_at":"2026-06-29T19:03:51.460176Z","title":"arXiv preprint arXiv:2505.13312 , year=","venue":null,"work_id":"a3193463-b729-4ce6-9386-ce3a30bbbe96","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":30,"source":"pdf_text","source_observed_at":"2026-05-18T10:44:53.516653Z"},"links":{"cited_paper":"/paper/2505.13312","citing_paper":"/paper/2510.00761"},"observation_digest":"sha256:ac92b26320f8b26020ac7c19a311acf62d05603813179e77c326de72630ed355","observation_id":"76661dab-7cfa-45be-9e30-edf81ba2859b","resolution":{"observed_at":"2026-05-18T10:46:17.073910Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"cited_work":{"arxiv_id":"2505.13312","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13312","snapshot_observed_at":"2026-06-29T19:03:51.460176Z","title":"arXiv preprint arXiv:2505.13312 , year=","venue":null,"work_id":"a3193463-b729-4ce6-9386-ce3a30bbbe96","year":2025},"citing_paper":{"arxiv_id":"2605.10065","last_updated":"2026-05-11T06:43:42Z","snapshot_observed_at":"2026-08-11T16:41:42.310503Z","submitted_at":"2026-05-11T06:43:42Z","title":"NCO: A Versatile Plug-in for Handling Negative Constraints in Decoding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T05:08:07.862797Z"},"links":{"cited_paper":"/paper/2505.13312","citing_paper":"/paper/2605.10065"},"observation_digest":"sha256:f131a8bb431e267e13e1959b6337e2a899f0f312f37491d71d36129ce0dab1fb","observation_id":"366e5cca-85ef-464b-9600-766316b61a7d","resolution":{"observed_at":"2026-05-12T05:36:25.927251Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"cited_work":{"arxiv_id":"2505.13312","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13312","snapshot_observed_at":"2026-06-29T19:03:51.460176Z","title":"arXiv preprint arXiv:2505.13312 , year=","venue":null,"work_id":"a3193463-b729-4ce6-9386-ce3a30bbbe96","year":2025},"citing_paper":{"arxiv_id":"2605.16776","last_updated":"2026-05-16T03:15:35Z","snapshot_observed_at":"2026-08-14T10:46:02.829450Z","submitted_at":"2026-05-16T03:15:35Z","title":"Distinguishable Deletion: Unifying Knowledge Erasure and Refusal for Large Language Model Unlearning","version":1},"reference_index":112,"source":"arxiv_source","source_observed_at":"2026-05-19T21:49:07.440832Z"},"links":{"cited_paper":"/paper/2505.13312","citing_paper":"/paper/2605.16776"},"observation_digest":"sha256:52c77156188fdcd1abebc7056bdeab7bf2b767a0174ccfbb3a8230ba039af7c2","observation_id":"d50c33c0-e594-4a35-897b-5a94ad803b95","resolution":{"observed_at":"2026-05-19T21:52:48.232469Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"cited_work":{"arxiv_id":"2505.13312","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.13312","snapshot_observed_at":"2026-06-29T19:03:51.460176Z","title":"arXiv preprint arXiv:2505.13312 , year=","venue":null,"work_id":"a3193463-b729-4ce6-9386-ce3a30bbbe96","year":2025},"citing_paper":{"arxiv_id":"2606.00105","last_updated":"2026-05-26T12:49:34Z","snapshot_observed_at":"2026-08-06T23:34:57.222708Z","submitted_at":"2026-05-26T12:49:34Z","title":"Visual-Noise Guided In-Context Distillation for Multimodal Large Language Model Unlearning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-29T18:55:36.515230Z"},"links":{"cited_paper":"/paper/2505.13312","citing_paper":"/paper/2606.00105"},"observation_digest":"sha256:cd85a4c45ad41b99f66a6addeab53f8ecc7d9a020b68808455084ccca4ab3f9f","observation_id":"2ba229bb-95b0-4938-baca-89fde522a047","resolution":{"observed_at":"2026-06-29T19:03:51.462591Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.13312","snapshot_observed_at":"2026-08-15T14:17:57.144501Z","title":"arXiv preprint arXiv:2505.13312 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11408","last_updated":"2026-08-11T20:16:20Z","snapshot_observed_at":"2026-08-15T23:10:06.032724Z","submitted_at":"2026-08-11T20:16:20Z","title":"Measure, Don't Optimize: Forecasting Recovery in LLM Unlearning","version":1},"reference_index":183,"source":"arxiv_source","source_observed_at":"2026-08-15T14:17:57.144501Z"},"links":{"cited_paper":"/paper/2505.13312","citing_paper":"/paper/2608.11408"},"observation_digest":"sha256:7d2031174701e5cecc0fce4d182b03f69736f8f57fdd1bf93ad379943892b995","observation_id":"1b8db8b2-702a-4227-96ea-b911df4b3608","resolution":{"observed_at":"2026-08-15T14:17:57.144501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.13312/citation-record","integrity":"/paper/2505.13312/integrity","json":"/paper/2505.13312/citation-record.json","paper":"/paper/2505.13312"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-15T20:21:39.556543Z","title":"Gpt-4 technical report.arXiv preprint arXiv:2303.08774, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.556543Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:1d15f22b50838d93e1f7d82004da0834d8b66b38c173c60774ce7e44883d9eac","observation_id":"59830744-7cdf-417c-940a-795affc8ee24","resolution":{"observed_at":"2026-08-15T20:21:39.556543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06559","last_updated":"2024-06-02T06:24:38Z","snapshot_observed_at":"2026-08-16T13:47:04.019484Z","submitted_at":"2024-06-02T06:24:38Z","title":"Harnessing Business and Media Insights with Large Language Models","version":1},"cited_work":{"arxiv_id":"2406.06559","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.06559","snapshot_observed_at":"2026-08-15T20:21:41.011375Z","title":"Harnessing Business and Media Insights with Large Language Models","venue":"cs.CL","work_id":"02ebf2c7-9e27-4c3c-82c0-6494d25ec3fc","year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.562410Z"},"links":{"cited_paper":"/paper/2406.06559","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:6e36f4427a20e67701cf8b36b8d74d02e3949a4cf6f54a9ca3446e74d4ccee10","observation_id":"6cd35024-e9e8-46df-a7b3-5a203f871fbc","resolution":{"observed_at":"2026-08-15T20:21:41.016965Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04952","last_updated":"2025-01-09T03:59:10Z","snapshot_observed_at":"2026-08-15T06:27:30.398438Z","submitted_at":"2025-01-09T03:59:10Z","title":"Open Problems in Machine Unlearning for AI Safety","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04952","snapshot_observed_at":"2026-08-15T20:21:39.566982Z","title":"Open problems in machine unlearning for ai safety.arXiv preprint arXiv:2501.04952, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.566982Z"},"links":{"cited_paper":"/paper/2501.04952","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:53d2d580f969cdf5bcdc05f8065e8b4f6a21200c3705bc73d3ea08cd5af4bc29","observation_id":"4da7e7ef-2787-48a5-ba27-6211cc0ed0f5","resolution":{"observed_at":"2026-08-15T20:21:39.566982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12038","last_updated":"2024-08-05T21:48:22Z","snapshot_observed_at":"2026-08-16T13:42:05.418045Z","submitted_at":"2024-06-17T19:11:40Z","title":"Soft Prompting for Unlearning in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12038","snapshot_observed_at":"2026-08-15T20:21:39.571160Z","title":"Soft prompting for unlearning in large language models.arXiv preprint arXiv:2406.12038, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.571160Z"},"links":{"cited_paper":"/paper/2406.12038","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:8952f5b5d0a4920461e686b1e1dba9a0575e2f264026144ebf532f92999cc66c","observation_id":"bd5b10f9-d16d-435a-b6eb-61ddea204b5c","resolution":{"observed_at":"2026-08-15T20:21:39.571160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.575365Z","title":"Piqa: Reasoning about physical commonsense in natural language","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.575365Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:aa9f58ca0a20e8211c585709cb5479df1b800fed995864b6f2661b4324141779","observation_id":"8c272b9c-5431-469d-b45a-13d6625f97df","resolution":{"observed_at":"2026-08-15T20:21:39.575365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.579134Z","title":"Choquette-Choo, Hengrui Jia, Adelin Travers, Baiwu Zhang, David Lie, and Nicolas Papernot","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.579134Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:f06b24052a6a38b9973a30304652f6712d166599c5cbc19fb7b78bb712bea55c","observation_id":"9669de93-0ac9-4921-affa-042c0cb34eec","resolution":{"observed_at":"2026-08-15T20:21:39.579134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.583475Z","title":"Towards making systems forget with machine unlearning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.583475Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:fdbf9c74b644474080f20c9baf8f083559c5e70beb9ae2d33e971653c849c85d","observation_id":"c4774f3e-2d5e-49dc-ae80-f660ba121b6e","resolution":{"observed_at":"2026-08-15T20:21:39.583475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.587034Z","title":"Extracting training data from large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.587034Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:eee2968b53437ee3e169575e53229ac00d7af6e11ef0753a9d95838eb61c6eed","observation_id":"d926f621-11f4-4fa1-a6e9-03f91be9c50d","resolution":{"observed_at":"2026-08-15T20:21:39.587034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06621","last_updated":"2025-04-24T21:55:38Z","snapshot_observed_at":"2026-08-16T13:26:50.627099Z","submitted_at":"2024-08-13T04:18:32Z","title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06621","snapshot_observed_at":"2026-08-15T20:21:39.590621Z","title":"Towards robust and cost- efficient knowledge unlearning for large language models.arXiv preprint arXiv:2408.06621, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.590621Z"},"links":{"cited_paper":"/paper/2408.06621","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:5f508f2a941d62a986ccc911b3da8160942111b09e89fd67ebfb58c9aa879201","observation_id":"63cac78f-caec-4c7c-b3ef-4849c6991a1a","resolution":{"observed_at":"2026-08-15T20:21:39.590621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.20150","last_updated":"2023-10-31T03:35:59Z","snapshot_observed_at":"2026-08-16T14:47:23.256137Z","submitted_at":"2023-10-31T03:35:59Z","title":"Unlearn What You Want to Forget: Efficient Unlearning for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.20150","snapshot_observed_at":"2026-08-15T20:21:39.594390Z","title":"Unlearn what you want to forget: Efficient unlearning for llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.594390Z"},"links":{"cited_paper":"/paper/2310.20150","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:b3f7bf952af3d53128aa4cea6e27c0c110f36c2fb69a954772b83db00f2eb6d4","observation_id":"e67c9252-53d6-460f-ae8c-93dd78e8d000","resolution":{"observed_at":"2026-08-15T20:21:39.594390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.598404Z","title":"Safeeraser: Enhancing safety in multimodal large language models through multimodal machine unlearning.arXiv preprint arXiv:2502.12520, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.598404Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:e30c24b81dd59f503b718e77b1eaabb518c03e2b1544f8d4189458fb660dcad0","observation_id":"795a1b16-4cf5-4f8c-8d6c-81c19f67d745","resolution":{"observed_at":"2026-08-15T20:21:39.598404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01547","last_updated":"2019-11-25T13:02:04Z","snapshot_observed_at":"2026-07-06T08:34:41.399203Z","submitted_at":"2019-11-05T00:31:38Z","title":"On the Measure of Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.01547","snapshot_observed_at":"2026-08-15T20:21:39.602071Z","title":"On the measure of intelligence.arXiv preprint arXiv:1911.01547, 2019","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.602071Z"},"links":{"cited_paper":"/paper/1911.01547","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:3a926e0d480ae7c40a767c5b91ccbb2dfa09238fe539061714f4cb72f57aff94","observation_id":"78324e51-e8a5-4995-8ba7-5522c410350c","resolution":{"observed_at":"2026-08-15T20:21:39.602071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.605851Z","title":"How to protect copyright data in optimization of large language models? InProceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 17871–17879, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.605851Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:08015cc128a82906b306db252ec016c124b26125554be0bac06c72c5a102d630","observation_id":"5f22c080-3620-45a1-bd69-6304a2868fcb","resolution":{"observed_at":"2026-08-15T20:21:39.605851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18369","last_updated":"2024-07-06T09:00:18Z","snapshot_observed_at":"2026-08-16T13:36:35.454231Z","submitted_at":"2024-07-06T09:00:18Z","title":"AI Safety in Generative AI Large Language Models: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18369","snapshot_observed_at":"2026-08-15T20:21:39.609549Z","title":"Ai safety in generative ai large language models: A survey.arXiv preprint arXiv:2407.18369, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.609549Z"},"links":{"cited_paper":"/paper/2407.18369","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:fe81df57c5521ad3078cfb8b2a5f3470c582309bc94cb8ba73e1995a4d3303e9","observation_id":"57363400-a85a-4127-8497-fd062178bb27","resolution":{"observed_at":"2026-08-15T20:21:39.609549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-08-14T15:52:43.138964Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-15T20:21:39.613574Z","title":"Boolq: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.613574Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:49456f2c0d1536694d49256da299c5cc3d4479b8a46464d31f9c97fdfee52264","observation_id":"04644530-9b6a-4396-b69d-f53967498be5","resolution":{"observed_at":"2026-08-15T20:21:39.613574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.617093Z","title":"The pascal recognising textual entailment challenge","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.617093Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:3c687df16f8d06b925163bb4b7b6c512f00b3cd3887889624fcff09d8017d0c6","observation_id":"6e070968-4e64-4626-b0a2-548efa6199f6","resolution":{"observed_at":"2026-08-15T20:21:39.617093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.620782Z","title":"Security and privacy challenges of large language models: A survey.ACM Computing Surveys, 57(6):1–39, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.620782Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:4650ee59937925cb1c9d43ed2dda4c82afb8ba419f58f700a75406346968fac4","observation_id":"b4b2f4a3-e683-44c6-bde9-755c4c66a25a","resolution":{"observed_at":"2026-08-15T20:21:39.620782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07687","last_updated":"2024-06-11T20:07:22Z","snapshot_observed_at":"2026-08-16T13:44:00.339745Z","submitted_at":"2024-06-11T20:07:22Z","title":"Adversarial Machine Unlearning","version":1},"cited_work":{"arxiv_id":"2406.07687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.07687","snapshot_observed_at":"2026-08-15T20:21:40.855625Z","title":"Adversarial Machine Unlearning","venue":"cs.LG","work_id":"b3b7fd74-1835-455d-a958-b398c21aecf8","year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.624222Z"},"links":{"cited_paper":"/paper/2406.07687","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:4570002eef7566b52f9dca87560224ee175523b284bb95093522795a6d6d6869","observation_id":"84359218-d36b-4e41-951e-b04eaef1400e","resolution":{"observed_at":"2026-08-15T20:21:40.859684Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07698","last_updated":"2024-06-11T20:26:26Z","snapshot_observed_at":"2026-08-16T13:44:00.028536Z","submitted_at":"2024-06-11T20:26:26Z","title":"Label Smoothing Improves Machine Unlearning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07698","snapshot_observed_at":"2026-08-15T20:21:39.627986Z","title":"Label smoothing improves machine unlearning.arXiv preprint arXiv:2406.07698, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.627986Z"},"links":{"cited_paper":"/paper/2406.07698","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:98edbd60ac69e90a1c087efe5d1cd37eba838424a0fa1de7f1ba8614f175307a","observation_id":"cd00f7dc-2756-4d40-9bc0-bb807867eb94","resolution":{"observed_at":"2026-08-15T20:21:39.627986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-15T07:53:52.288832Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00383","snapshot_observed_at":"2026-08-15T20:21:39.632001Z","title":"Unified parameter-efficient unlearning for llms.arXiv preprint arXiv:2412.00383, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.632001Z"},"links":{"cited_paper":"/paper/2412.00383","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:9516a0bce7c4df8abb9e04a21da6fe448bfe8026ec573e5b4bb09126efabbd87","observation_id":"de8b167c-7078-4cd0-bb9d-fe1092dffd6d","resolution":{"observed_at":"2026-08-15T20:21:39.632001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12103","last_updated":"2025-02-23T02:54:39Z","snapshot_observed_at":"2026-08-16T05:02:34.588263Z","submitted_at":"2024-11-18T22:31:17Z","title":"Does Unlearning Truly Unlearn? A Black Box Evaluation of LLM Unlearning Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.12103","snapshot_observed_at":"2026-08-15T20:21:39.635552Z","title":"Does unlearning truly unlearn? a black box evaluation of llm unlearning methods.arXiv preprint arXiv:2411.12103, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.635552Z"},"links":{"cited_paper":"/paper/2411.12103","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:90952c5a5458bdb7afc6e323c15fa7dc8b0270ff6de486bb7852cdbe6ed5ca9f","observation_id":"837101bf-a743-4538-ad67-b0e4f0518cb1","resolution":{"observed_at":"2026-08-15T20:21:39.635552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07841","last_updated":"2024-09-16T13:18:23Z","snapshot_observed_at":"2026-08-16T14:19:15.347006Z","submitted_at":"2024-02-12T17:52:05Z","title":"Do Membership Inference Attacks Work on Large Language Models?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07841","snapshot_observed_at":"2026-08-15T20:21:39.639005Z","title":"Do membership inference attacks work on large language models?arXiv preprint arXiv:2402.07841, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.639005Z"},"links":{"cited_paper":"/paper/2402.07841","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:2ee477897f2ba0102c5b0ac0b021a38a7ea808398685bbf3fa84d08fbca6c076","observation_id":"42509284-e13c-4b5b-87d7-4d0566ba7f2b","resolution":{"observed_at":"2026-08-15T20:21:39.639005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02238","last_updated":"2023-10-04T05:20:19Z","snapshot_observed_at":"2026-08-16T14:55:24.066689Z","submitted_at":"2023-10-03T17:48:14Z","title":"Who's Harry Potter? Approximate Unlearning in LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02238","snapshot_observed_at":"2026-08-15T20:21:39.643116Z","title":"Who’s harry potter? approximate unlearning in llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.643116Z"},"links":{"cited_paper":"/paper/2310.02238","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:f8ba89eee121dc6106b18f9f09b26c8f5b35e60381111323cc29280135f6755c","observation_id":"ce9b0b8b-1dff-4fd6-915e-096a97adefcf","resolution":{"observed_at":"2026-08-15T20:21:39.643116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01306","last_updated":"2024-11-19T18:12:45Z","snapshot_observed_at":"2026-08-12T21:18:02.964833Z","submitted_at":"2024-02-02T10:53:36Z","title":"KTO: Model Alignment as Prospect Theoretic Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01306","snapshot_observed_at":"2026-08-15T20:21:39.646965Z","title":"Kto: Model alignment as prospect theoretic optimization.arXiv preprint arXiv:2402.01306, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.646965Z"},"links":{"cited_paper":"/paper/2402.01306","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:7e6632629f0851d7bec1985c180be7c8973c71aeac5f05d59e8a8746ac13f586","observation_id":"1a0788e1-329f-4771-81ef-bccff379a19b","resolution":{"observed_at":"2026-08-15T20:21:39.646965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.650766Z","title":"General data protection regulation (gdpr)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.650766Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:43a8b06b213d98adbac4322e82e1b1f0e6b5a7b67355ffadbf6baa8d02a41628","observation_id":"9640f48a-7dc5-4ec0-a09b-3e5ba29a4bbe","resolution":{"observed_at":"2026-08-15T20:21:39.650766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05374","last_updated":"2025-05-27T03:29:37Z","snapshot_observed_at":"2026-08-15T06:28:11.712099Z","submitted_at":"2025-02-07T23:03:55Z","title":"Towards LLM Unlearning Resilient to Relearning Attacks: A Sharpness-Aware Minimization Perspective and Beyond","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05374","snapshot_observed_at":"2026-08-15T20:21:39.655060Z","title":"Towards llm unlearning resilient to relearning attacks: A sharpness-aware minimization perspective and beyond.arXiv preprint arXiv:2502.05374, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.655060Z"},"links":{"cited_paper":"/paper/2502.05374","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:aa02731cc2517fd02bff95621387a7a9ef1499882005ec43585a64ae955a9ff0","observation_id":"4c5b9907-cbbb-4e22-ab34-27a97f9a87e1","resolution":{"observed_at":"2026-08-15T20:21:39.655060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.659032Z","title":"Challenging forgets: Unveiling the worst-case forget sets in machine unlearning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.659032Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:b8f16c2a860e8380c42c3509bef38da9b22d82f6f547c3821da3cf8cc4ebc746","observation_id":"babe65c6-c9ad-40f1-acc4-81cff5d1cb7a","resolution":{"observed_at":"2026-08-15T20:21:39.659032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.662611Z","title":"Simplicity prevails: Rethinking negative preference optimization for llm unlearning.arXiv preprint arXiv:2410.07163, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.662611Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:4c5bab3e4c2b7a8d8d6e55fa31ab9970f0fbfb82ad9b1c1479083a89ae57933f","observation_id":"ae4d99af-86e4-4e28-97db-a2e9e87111f7","resolution":{"observed_at":"2026-08-15T20:21:39.662611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12508","last_updated":"2024-04-04T07:45:38Z","snapshot_observed_at":"2026-08-03T17:30:25.153454Z","submitted_at":"2023-10-19T06:17:17Z","title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12508","snapshot_observed_at":"2026-08-15T20:21:39.666199Z","title":"Salun: Em- powering machine unlearning via gradient-based weight saliency in both image classification and generation.arXiv preprint arXiv:2310.12508, 2023","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.666199Z"},"links":{"cited_paper":"/paper/2310.12508","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:aadee172e739be1c738a2447c38726fc2f7b355bfa74848f72c7e053f85bc2da","observation_id":"94448519-80bc-4577-b1ba-95377946d51a","resolution":{"observed_at":"2026-08-15T20:21:39.666199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10223","last_updated":"2025-03-03T01:21:39Z","snapshot_observed_at":"2026-08-16T13:34:22.588125Z","submitted_at":"2024-07-14T14:26:17Z","title":"On Large Language Model Continual Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10223","snapshot_observed_at":"2026-08-15T20:21:39.670473Z","title":"Practical unlearning for large language models.arXiv preprint arXiv:2407.10223, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.670473Z"},"links":{"cited_paper":"/paper/2407.10223","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:d088ebe0ed73e6f22e6312ac5fa01b274621750c8361110d0b3a66337839bbc2","observation_id":"c34afa4d-9f93-4265-aa69-ea7cebef6afe","resolution":{"observed_at":"2026-08-15T20:21:39.670473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-15T20:21:39.674724Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.674724Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:2e080a730b8b8a74d6ed375113e6bda45d6677b75b75bcd7a3400ede71a6c9d4","observation_id":"f16bec1a-cbcf-49ae-a2c7-168bf07281fe","resolution":{"observed_at":"2026-08-15T20:21:39.674724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.678446Z","title":"The times sues openai and microsoft over ai use of copyrighted work.The New York Times, 27, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.678446Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:5fd469132cd6a49e9032c00cd22621f3eb980e1235018602b2e94b37e10e5b2f","observation_id":"162d452f-c133-45f9-9e61-ef953f0ce1b8","resolution":{"observed_at":"2026-08-15T20:21:39.678446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11844","last_updated":"2024-09-18T09:55:48Z","snapshot_observed_at":"2026-08-16T13:17:33.692354Z","submitted_at":"2024-09-18T09:55:48Z","title":"MEOW: MEMOry Supervised LLM Unlearning Via Inverted Facts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.11844","snapshot_observed_at":"2026-08-15T20:21:39.682213Z","title":"Meow: Memory supervised llm unlearning via inverted facts.arXiv preprint arXiv:2409.11844, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.682213Z"},"links":{"cited_paper":"/paper/2409.11844","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:dfa038416167a40584f254c200a4c2ab05815df30ccfbf831656e95a407985d8","observation_id":"03cb774f-e99b-4dc3-9c49-b3df6648b284","resolution":{"observed_at":"2026-08-15T20:21:39.682213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-15T20:21:39.687052Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.687052Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:b7314bee30c99fced60533bcf0b220ca0158b2d236ccd543ebca45d3721acb7e","observation_id":"bf50a7f0-1072-40c0-a4dd-9550f160c0e7","resolution":{"observed_at":"2026-08-15T20:21:39.687052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.690939Z","title":"news-please - a generic news crawler and extractor","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.690939Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:b7cc8a1bccb13b44f76af7c7a87ccacd37602fbf82820fafab025e1a060699b9","observation_id":"58569e69-6e24-4ef9-abe3-00d0c911c610","resolution":{"observed_at":"2026-08-15T20:21:39.690939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14988","last_updated":"2024-03-22T06:46:40Z","snapshot_observed_at":"2026-08-16T14:07:26.685654Z","submitted_at":"2024-03-22T06:46:40Z","title":"Risk and Response in Large Language Models: Evaluating Key Threat Categories","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14988","snapshot_observed_at":"2026-08-15T20:21:39.694584Z","title":"Risk and response in large language models: Evaluating key threat categories.arXiv preprint arXiv:2403.14988, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.694584Z"},"links":{"cited_paper":"/paper/2403.14988","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:a8680a6af6fe0edf21a2d99fd9034754d90092f56f43794d34db0194e6f40cdc","observation_id":"a1ebcff5-35a3-45cd-8d92-14ec835ff773","resolution":{"observed_at":"2026-08-15T20:21:39.694584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11051","last_updated":"2025-05-27T14:55:38Z","snapshot_observed_at":"2026-08-16T12:58:02.710801Z","submitted_at":"2025-02-16T09:23:50Z","title":"MMUnlearner: Reformulating Multimodal Machine Unlearning in the Era of Multimodal Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11051","snapshot_observed_at":"2026-08-15T20:21:39.698337Z","title":"Mmunlearner: Reformulating multimodal machine unlearning in the era of multimodal large language models.arXiv preprint arXiv:2502.11051, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.698337Z"},"links":{"cited_paper":"/paper/2502.11051","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:6e2454957b6c9f89021ec73c2ed0a64cfd7af69e7e598664d25cadf439848e34","observation_id":"79bb6542-fa72-47d8-b057-2c135af6338b","resolution":{"observed_at":"2026-08-15T20:21:39.698337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04089","last_updated":"2023-03-31T15:27:01Z","snapshot_observed_at":"2026-08-13T03:27:01.609831Z","submitted_at":"2022-12-08T05:50:53Z","title":"Editing Models with Task Arithmetic","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.04089","snapshot_observed_at":"2026-08-15T20:21:39.702400Z","title":"Editing models with task arithmetic.arXiv preprint arXiv:2212.04089, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.702400Z"},"links":{"cited_paper":"/paper/2212.04089","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:789e1d73269020bb1c5e32cbe0a13eb5b7e121c9a199dd25cee808211cb70f29","observation_id":"8c24270b-13b6-487a-b5f0-e92186600cec","resolution":{"observed_at":"2026-08-15T20:21:39.702400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01504","last_updated":"2022-12-19T11:52:40Z","snapshot_observed_at":"2026-08-13T14:13:28.459055Z","submitted_at":"2022-10-04T10:18:11Z","title":"Knowledge Unlearning for Mitigating Privacy Risks in Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01504","snapshot_observed_at":"2026-08-15T20:21:39.707245Z","title":"Knowledge unlearning for mitigating privacy risks in language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.707245Z"},"links":{"cited_paper":"/paper/2210.01504","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:18012ceba09c13daa45e6ee47d827b8ff74ee066e0b9365953f4f72ddb7b62eb","observation_id":"84045de5-f00d-41b5-883b-1d39308d109e","resolution":{"observed_at":"2026-08-15T20:21:39.707245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.711423Z","title":"Reversing the forget-retain objectives: An efficient llm unlearning framework from logit difference.Advances in Neural Information Processing Systems, 37:12581–12611, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.711423Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:b7b2326ff56e816f3d925597f62b6af3fa9eb497cac18c0dce82db9ecd8537c4","observation_id":"88845c75-1d97-44d3-b94a-001dad3ac8a1","resolution":{"observed_at":"2026-08-15T20:21:39.711423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.715201Z","title":"Model sparsity can simplify machine unlearning.Advances in Neural Information Processing Systems, 36:51584–51605, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.715201Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:5a02341a1fbb71017904f7a6f0e9d9a1b0a2a99886b89fce0cb1682546d0a8c3","observation_id":"a56ff115-db5d-4c13-b7ed-51e1a4ed5df8","resolution":{"observed_at":"2026-08-15T20:21:39.715201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17509","last_updated":"2025-04-12T21:23:46Z","snapshot_observed_at":"2026-08-16T13:06:47.311518Z","submitted_at":"2024-10-23T02:22:07Z","title":"WAGLE: Strategic Weight Attribution for Effective and Modular Unlearning in Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.17509","snapshot_observed_at":"2026-08-15T20:21:39.718875Z","title":"Wagle: Strategic weight attribution for effective and modular unlearning in large language models.arXiv preprint arXiv:2410.17509, 2024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.718875Z"},"links":{"cited_paper":"/paper/2410.17509","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:50399eae31e840bb6645d8801681f9372450b8e7237fa425b2b606858563ef91","observation_id":"0395c996-c3d9-4284-b592-cc1e441ddd04","resolution":{"observed_at":"2026-08-15T20:21:39.718875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.18239","last_updated":"2024-06-24T20:24:53Z","snapshot_observed_at":"2026-08-16T13:57:11.558894Z","submitted_at":"2024-04-28T16:31:32Z","title":"SOUL: Unlocking the Power of Second-Order Optimization for LLM Unlearning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.18239","snapshot_observed_at":"2026-08-15T20:21:39.723036Z","title":"Soul: Unlocking the power of second-order optimization for llm unlearning.arXiv preprint arXiv:2404.18239, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.723036Z"},"links":{"cited_paper":"/paper/2404.18239","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:ad06aa373a6930cbdde3f83965ac2880e56f903f60e69454c1053f55c0866026","observation_id":"6bce8cd3-759a-419a-aa05-8259dd49bfc1","resolution":{"observed_at":"2026-08-15T20:21:39.723036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.03551","last_updated":"2017-05-13T21:12:37Z","snapshot_observed_at":"2026-08-13T08:58:47.096400Z","submitted_at":"2017-05-09T21:35:07Z","title":"TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.03551","snapshot_observed_at":"2026-08-15T20:21:39.726819Z","title":"Triviaqa: A large scale distantly supervised challenge dataset for reading comprehension.arXiv preprint arXiv:1705.03551, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.726819Z"},"links":{"cited_paper":"/paper/1705.03551","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:16e058ef99587265d8cb8ba46a5458c9a3939ad07d0932773fa993ac1bff8462","observation_id":"16904a84-8cce-4e4b-bbda-ba6b0b03d3ba","resolution":{"observed_at":"2026-08-15T20:21:39.726819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.13771","last_updated":"2023-10-20T19:14:59Z","snapshot_observed_at":"2026-08-16T14:50:16.783073Z","submitted_at":"2023-10-20T19:14:59Z","title":"Copyright Violations and Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.13771","snapshot_observed_at":"2026-08-15T20:21:39.730672Z","title":"Copyright violations and large language models.arXiv preprint arXiv:2310.13771, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.730672Z"},"links":{"cited_paper":"/paper/2310.13771","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:af89d52aa7ec8d0b7e5068d3d76c50885bf81fdbbdd535ae3c38bb7399572e7f","observation_id":"23c23a87-23dd-4613-992a-29cfc6ec8d99","resolution":{"observed_at":"2026-08-15T20:21:39.730672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.17591","last_updated":"2025-03-11T17:32:22Z","snapshot_observed_at":"2026-08-16T12:55:36.516710Z","submitted_at":"2025-02-24T19:16:39Z","title":"Proactive Privacy Amnesia for Large Language Models: Safeguarding PII with Negligible Impact on Model Utility","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.17591","snapshot_observed_at":"2026-08-15T20:21:39.734390Z","title":"Proactive privacy amnesia for large language models: Safeguarding pii with negligible impact on model utility.arXiv preprint arXiv:2502.17591, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.734390Z"},"links":{"cited_paper":"/paper/2502.17591","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:def540ca59e09ed753d779dbd0a02cc1c8df8a32a6691e72fe3e7a3bddadf66d","observation_id":"17678326-0258-4c81-8131-760815dfba94","resolution":{"observed_at":"2026-08-15T20:21:39.734390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04683","last_updated":"2017-12-05T19:36:03Z","snapshot_observed_at":"2026-08-14T21:06:35.519870Z","submitted_at":"2017-04-15T19:31:41Z","title":"RACE: Large-scale ReAding Comprehension Dataset From Examinations","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04683","snapshot_observed_at":"2026-08-15T20:21:39.738654Z","title":"Race: Large-scale reading comprehension dataset from examinations.arXiv preprint arXiv:1704.04683, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.738654Z"},"links":{"cited_paper":"/paper/1704.04683","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:67dbb77b51f6a9bbd3bbc77b8ff0dc81fb4516a998fd5b3338f9936cc8faf87c","observation_id":"0e3927f4-7f40-404b-9088-1e221bb46c0b","resolution":{"observed_at":"2026-08-15T20:21:39.738654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05463","last_updated":"2023-09-11T14:01:45Z","snapshot_observed_at":"2026-08-02T22:47:03.212781Z","submitted_at":"2023-09-11T14:01:45Z","title":"Textbooks Are All You Need II: phi-1.5 technical report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05463","snapshot_observed_at":"2026-08-15T20:21:39.742286Z","title":"Textbooks are all you need ii: phi-1.5 technical report.arXiv preprint arXiv:2309.05463, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.742286Z"},"links":{"cited_paper":"/paper/2309.05463","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:afe7cc24c7978c04bcca90abd98429e133e400198b5610b4e00ebefc51cb6d5f","observation_id":"8d5f37e4-8ef1-4e69-a877-c36b5c774f10","resolution":{"observed_at":"2026-08-15T20:21:39.742286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.12343","last_updated":"2024-03-01T15:17:21Z","snapshot_observed_at":"2026-08-16T14:33:16.872943Z","submitted_at":"2023-12-19T17:16:43Z","title":"LatestEval: Addressing Data Contamination in Language Model Evaluation through Dynamic and Time-Sensitive Test Construction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.12343","snapshot_observed_at":"2026-08-15T20:21:39.746110Z","title":"Avoiding data contamination in language model evaluation: Dynamic test construction with latest materials.arXiv preprint arXiv:2312.12343, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.746110Z"},"links":{"cited_paper":"/paper/2312.12343","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:46680d8e8e103699913b2cee27e0cebe3e66dac4fe30a6d072f76a3172184d0c","observation_id":"bda671ae-0d82-4431-9cb8-d2a5da076362","resolution":{"observed_at":"2026-08-15T20:21:39.746110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.750058Z","title":"Rouge: A package for automatic evaluation of summaries","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.750058Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:68f81fded909c38e09863ee6fff98356d12b32b0dcbebb5510f7d7b7f572dec4","observation_id":"e7cb8c9e-d472-4ead-8982-7756e303457b","resolution":{"observed_at":"2026-08-15T20:21:39.750058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.07958","last_updated":"2022-05-08T02:43:02Z","snapshot_observed_at":"2026-08-03T16:26:48.747700Z","submitted_at":"2021-09-08T17:15:27Z","title":"TruthfulQA: Measuring How Models Mimic Human Falsehoods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.07958","snapshot_observed_at":"2026-08-15T20:21:39.753800Z","title":"Truthfulqa: Measuring how models mimic human falsehoods.arXiv preprint arXiv:2109.07958, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.753800Z"},"links":{"cited_paper":"/paper/2109.07958","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:802725b13a7ba5c2599a009cf287a2892e9cb48c6c6757fdfb52d6fc38e5d89e","observation_id":"b10c6e58-420e-4515-8901-bf9716b9e7a6","resolution":{"observed_at":"2026-08-15T20:21:39.753800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.757639Z","title":"Continual learning and private unlearning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.757639Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:1823c997e8be783efb2fbde70f04e5637e458cde4e08c486e6baaeb7cff332c4","observation_id":"501f7b88-fab1-4d67-bfe5-ee13f4ed1b1e","resolution":{"observed_at":"2026-08-15T20:21:39.757639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.761302Z","title":"Large language model unlearning via embedding-corrupted prompts.Advances in Neural Information Processing Systems, 37:118198–118266, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.761302Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:95b69d24b932b60a98ea825875f2e05e4f6b022c2a5135609e49631e816fc5d4","observation_id":"b8089cb9-5de1-4a34-aaff-d1ee756e1523","resolution":{"observed_at":"2026-08-15T20:21:39.761302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11338","last_updated":"2026-04-19T00:17:32Z","snapshot_observed_at":"2026-07-06T19:03:52.342045Z","submitted_at":"2024-08-21T04:45:12Z","title":"Automatic Dataset Construction (ADC): Sample Collection, Data Curation, and Beyond","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11338","snapshot_observed_at":"2026-08-15T20:21:39.765014Z","title":"Automatic dataset construction (adc): Sample collection, data curation, and beyond.arXiv preprint arXiv:2408.11338, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.765014Z"},"links":{"cited_paper":"/paper/2408.11338","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:4a6c46a8709679f8ac22874bd327204558ea99a6f08fd8cd6bba86b1885baa0d","observation_id":"fe36371e-b580-4183-9a4b-93ca1b0d6d88","resolution":{"observed_at":"2026-08-15T20:21:39.765014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.769505Z","title":"Rethinking machine unlearning for large language models.Nature Machine Intelligence, pages 1–14, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.769505Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:6dd61b82c98ebd48355ed35d8940d5fa460ac8f44706e97dc79af7c5c4f58da2","observation_id":"a748563d-be7f-4703-ba3b-4c37df9805d8","resolution":{"observed_at":"2026-08-15T20:21:39.769505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.05374","last_updated":"2024-03-21T00:21:14Z","snapshot_observed_at":"2026-08-02T17:09:20.540788Z","submitted_at":"2023-08-10T06:43:44Z","title":"Trustworthy LLMs: a Survey and Guideline for Evaluating Large Language Models' Alignment","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.05374","snapshot_observed_at":"2026-08-15T20:21:39.772952Z","title":"Trustworthy llms: a survey and guideline for evaluating large language models’ alignment.arXiv preprint arXiv:2308.05374, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.772952Z"},"links":{"cited_paper":"/paper/2308.05374","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:d3ce6156141fc7f5afe5c298cdfe605f5ac63a02de14213377808593502e8450","observation_id":"1e3977c3-4a62-42be-b086-cb3e2577124a","resolution":{"observed_at":"2026-08-15T20:21:39.772952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.17242","last_updated":"2025-03-03T03:08:43Z","snapshot_observed_at":"2026-08-16T13:38:21.171831Z","submitted_at":"2024-12-23T03:30:34Z","title":"On the Generalization and Adaptation Ability of Machine-Generated Text Detectors in Academic Writing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17242","snapshot_observed_at":"2026-08-15T20:21:39.776733Z","title":"On the generalization ability of machine- generated text detectors.arXiv preprint arXiv:2412.17242, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.776733Z"},"links":{"cited_paper":"/paper/2412.17242","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:dedd361b2c23725cff0b4279e8c60c2f25893627de79a9908096c5e5e393f4e7","observation_id":"f636834a-8c06-42ab-9bdb-0c94d52890f3","resolution":{"observed_at":"2026-08-15T20:21:39.776733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-14T20:13:52.872565Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-15T20:21:39.780492Z","title":"Decoupled weight decay regularization.arXiv preprint arXiv:1711.05101, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.780492Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:60b00865129c0b89fb5f3b0ec1d6f21796e7ac9e9b2654b00ea34141011ba1bc","observation_id":"4ed40bcb-92dc-4cc2-9c87-6f7b96ae5d14","resolution":{"observed_at":"2026-08-15T20:21:39.780492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16835","last_updated":"2024-02-26T18:57:37Z","snapshot_observed_at":"2026-08-16T14:15:11.368083Z","submitted_at":"2024-02-26T18:57:37Z","title":"Eight Methods to Evaluate Robust Unlearning in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16835","snapshot_observed_at":"2026-08-15T20:21:39.784884Z","title":"Eight methods to evaluate robust unlearning in llms.arXiv preprint arXiv:2402.16835, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.784884Z"},"links":{"cited_paper":"/paper/2402.16835","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:59821d8cd01dca57c144cddcdab6e92fcf29dab285e542b9908be2b26e5121f9","observation_id":"cf1ae6c6-7723-4cdc-b08b-417e90cea1b1","resolution":{"observed_at":"2026-08-15T20:21:39.784884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06121","last_updated":"2024-01-11T18:57:12Z","snapshot_observed_at":"2026-08-16T14:08:04.457126Z","submitted_at":"2024-01-11T18:57:12Z","title":"TOFU: A Task of Fictitious Unlearning for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06121","snapshot_observed_at":"2026-08-15T20:21:39.788944Z","title":"Tofu: A task of fictitious unlearning for llms.arXiv preprint arXiv:2401.06121, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.788944Z"},"links":{"cited_paper":"/paper/2401.06121","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:5ea503d66859454bbc091a6cb4fbfc28bc973c3d966d254ffd319b296c5c7e7f","observation_id":"0828432f-d54c-47a7-9a97-d7328c564cb3","resolution":{"observed_at":"2026-08-15T20:21:39.788944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.792867Z","title":"Llm dataset inference: Did you train on my dataset?Advances in Neural Information Processing Systems, 37:124069– 124092, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.792867Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:441b862228eac9882d8aab7ee6d5904a0a586c4b18d402914776b27fdbc60247","observation_id":"2ff95b63-54f9-43d7-91dc-b8ec4906bb1a","resolution":{"observed_at":"2026-08-15T20:21:39.792867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13474","last_updated":"2024-12-17T17:45:07Z","snapshot_observed_at":"2026-08-16T13:16:52.832959Z","submitted_at":"2024-09-20T13:05:07Z","title":"Alternate Preference Optimization for Unlearning Factual Knowledge in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13474","snapshot_observed_at":"2026-08-15T20:21:39.796331Z","title":"Alternate preference optimization for unlearning factual knowledge in large language models.arXiv preprint arXiv:2409.13474, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.796331Z"},"links":{"cited_paper":"/paper/2409.13474","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:d3ef16ab4fa57a8e20689ed0043273b817608941dfb629c6739d543b7fe3f1f6","observation_id":"617b9275-e143-4565-9f3d-df1baf3259f9","resolution":{"observed_at":"2026-08-15T20:21:39.796331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-15T20:21:39.802037Z","title":"Pointer sentinel mixture models.arXiv preprint arXiv:1609.07843, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.802037Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:37cc05bb26c173cbea03b6dc32a70e3d5cb72d0ecde7d44e83630702d6708e33","observation_id":"edc72172-c8ae-40ed-8382-a9409496ee30","resolution":{"observed_at":"2026-08-15T20:21:39.802037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02789","last_updated":"2018-09-08T11:47:16Z","snapshot_observed_at":"2026-08-14T07:00:02.529732Z","submitted_at":"2018-09-08T11:47:16Z","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.02789","snapshot_observed_at":"2026-08-15T20:21:39.806132Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering.arXiv preprint arXiv:1809.02789, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.806132Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:09720eef2cf464479180ebe7c30a12efc1da554b435cf0870896a24dd95d19c1","observation_id":"2f6d2854-2598-4d37-9427-d97843bbc75d","resolution":{"observed_at":"2026-08-15T20:21:39.806132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17884","last_updated":"2024-06-28T23:27:10Z","snapshot_observed_at":"2026-08-16T14:48:24.694924Z","submitted_at":"2023-10-27T04:15:30Z","title":"Can LLMs Keep a Secret? Testing Privacy Implications of Language Models via Contextual Integrity Theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17884","snapshot_observed_at":"2026-08-15T20:21:39.809889Z","title":"Can llms keep a secret? testing privacy implications of language models via contextual integrity theory.arXiv preprint arXiv:2310.17884, 2023","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.809889Z"},"links":{"cited_paper":"/paper/2310.17884","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:47a377bffe44864d814d7fbb3e8504c9c68b295aa8f96fd8a22781c9a2dcce06","observation_id":"5a83c2b9-daa0-4ad9-ace8-4dc9882ef711","resolution":{"observed_at":"2026-08-15T20:21:39.809889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.814010Z","title":"Quantifying the privacy risks of learning high-dimensional graphical models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.814010Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:8f8d2b944d5f63237aeef77f44e939e230409768a249923fe2690dcfe25437dd","observation_id":"fde59b03-eb54-481d-9487-bad9bd347b4b","resolution":{"observed_at":"2026-08-15T20:21:39.814010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.818528Z","title":"Unlearnable algorithms for in-context learning.arXiv preprint arXiv:2402.00751, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.818528Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:8a2bbb0af78a7d8fd6450e25521b481d3635c1014d38b9e78ce42527cb1e8e34","observation_id":"f559cfc0-ce9a-449f-a011-0d642fd5423d","resolution":{"observed_at":"2026-08-15T20:21:39.818528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.822276Z","title":"Rectified linear units improve restricted boltzmann machines","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.822276Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:31e35a16bfc039ced2621a562d61fea35ed79532b343586631093698c265d1c6","observation_id":"c59558da-a620-4fc9-9172-f4a4bed27697","resolution":{"observed_at":"2026-08-15T20:21:39.822276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.825974Z","title":"Token cleaning: Fine-grained data selection for llm supervised fine-tuning.arXiv preprint arXiv:2502.01968, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.825974Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:4f93d0aafa9c628407c37a1564bd813bf638f8467222563e29368db43cae3ed6","observation_id":"f0c5cc9d-d11e-43e8-9cae-50a5712ac8b3","resolution":{"observed_at":"2026-08-15T20:21:39.825974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.829338Z","title":"Improving data efficiency via curating LLM-driven rating systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.829338Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:629e084d63f2db9776b56614a5a4737d912a45940c4dbf083cd389a8cdc2f9bc","observation_id":"804a9e64-4ad9-417d-98f7-199939e8049a","resolution":{"observed_at":"2026-08-15T20:21:39.829338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.833907Z","title":"Bleu: a method for automatic evaluation of machine translation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.833907Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:89c334ff35133a31fe34df26f7b325bf5eae77fffc2db2770b17f52d290a2856","observation_id":"71a06f07-7ff9-4264-8560-d6d2b901f7b9","resolution":{"observed_at":"2026-08-15T20:21:39.833907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07579","last_updated":"2024-06-06T06:31:08Z","snapshot_observed_at":"2026-08-16T14:53:01.775752Z","submitted_at":"2023-10-11T15:19:31Z","title":"In-Context Unlearning: Language Models as Few Shot Unlearners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07579","snapshot_observed_at":"2026-08-15T20:21:39.837453Z","title":"In-context unlearning: Language models as few shot unlearners.arXiv preprint arXiv:2310.07579, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.837453Z"},"links":{"cited_paper":"/paper/2310.07579","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:6d118c1443f137ebf6e4353a6d500330873ceef40aa89a30c6a63547a0850d80","observation_id":"c88d18ce-f1cc-49c2-801a-bc07ac169b67","resolution":{"observed_at":"2026-08-15T20:21:39.837453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.841648Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.841648Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:832d2f663252a2eedad8165bb45de477c5114cc92b7c1ae123c2aec423720fbf","observation_id":"c82ba4b4-e44b-45f8-8d58-748ce222b784","resolution":{"observed_at":"2026-08-15T20:21:39.841648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.845431Z","title":"Exploring the limits of transfer learning with a unified text-to-text transformer.Journal of machine learning research, 21(140):1–67, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.845431Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:3b81b92229bcc247d1876179e6d648fc6bb120ba13e47362fdc139db1953c0b3","observation_id":"72e70db7-5fde-4790-89be-1d40495af6e2","resolution":{"observed_at":"2026-08-15T20:21:39.845431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.05250","last_updated":"2016-10-11T02:42:36Z","snapshot_observed_at":"2026-08-15T14:23:50.348670Z","submitted_at":"2016-06-16T16:36:00Z","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05250","snapshot_observed_at":"2026-08-15T20:21:39.849331Z","title":"Squad: 100,000+ questions for machine comprehension of text.arXiv preprint arXiv:1606.05250, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.849331Z"},"links":{"cited_paper":"/paper/1606.05250","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:69c2af58a67f3d9b531cbc236d47b6dec71388edc1d100de73d3058dd269b31b","observation_id":"a2299086-9103-4dbf-ab89-afa0f30a1519","resolution":{"observed_at":"2026-08-15T20:21:39.849331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15097","last_updated":"2025-02-27T04:41:34Z","snapshot_observed_at":"2026-08-16T12:56:30.194702Z","submitted_at":"2025-02-20T23:30:45Z","title":"LUME: LLM Unlearning with Multitask Evaluations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15097","snapshot_observed_at":"2026-08-15T20:21:39.853165Z","title":"Lume: Llm unlearning with multitask evaluations.arXiv preprint arXiv:2502.15097, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.853165Z"},"links":{"cited_paper":"/paper/2502.15097","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:887929b61e4a3d799e88cad08839b1f46893aa787b44f512558db940bc79927d","observation_id":"9d6236bd-7d0f-423c-b430-b45740270c74","resolution":{"observed_at":"2026-08-15T20:21:39.853165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-15T20:21:39.857342Z","title":"Sentence-bert: Sentence embeddings using siamese bert- networks.arXiv preprint arXiv:1908.10084, 2019","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.857342Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:2a988015b02890e5befcb8208bd995f4c33fb36e2d7516e3056eb9584212b4e7","observation_id":"3e29911c-287c-4e37-acee-2f260c51e111","resolution":{"observed_at":"2026-08-15T20:21:39.857342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.861092Z","title":"Scholastic Incorporated, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.861092Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:8543a75272e1f57b2629337fe5b062bb38186fb0cc52f398052fa7ba7b3a83ec","observation_id":"e4ec0f6e-0d7b-4c16-8451-b0962d4350b5","resolution":{"observed_at":"2026-08-15T20:21:39.861092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.864885Z","title":"Winogrande: An adversarial winograd schema challenge at scale.Communications of the ACM, 64(9):99–106, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.864885Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:80142e46e4ec085637e0eded4078153bfa4237e701a3795d9168a5e5eb58c88e","observation_id":"ae260f04-c9c9-4202-9fdd-81110a24b291","resolution":{"observed_at":"2026-08-15T20:21:39.864885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16789","last_updated":"2024-03-09T22:26:06Z","snapshot_observed_at":"2026-08-08T18:07:29.632928Z","submitted_at":"2023-10-25T17:21:23Z","title":"Detecting Pretraining Data from Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16789","snapshot_observed_at":"2026-08-15T20:21:39.868297Z","title":"Detecting pretraining data from large language models.arXiv preprint arXiv:2310.16789, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.868297Z"},"links":{"cited_paper":"/paper/2310.16789","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:8c6c8ed951c09e60bf4621162d5a9efae9e03529518bc4dbf03103e5e50d93a7","observation_id":"e8c21e6a-28bb-44e3-9adc-64c137c5aa72","resolution":{"observed_at":"2026-08-15T20:21:39.868297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06460","last_updated":"2024-07-14T20:14:02Z","snapshot_observed_at":"2026-08-16T13:35:57.672523Z","submitted_at":"2024-07-08T23:47:29Z","title":"MUSE: Machine Unlearning Six-Way Evaluation for Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06460","snapshot_observed_at":"2026-08-15T20:21:39.871983Z","title":"Muse: Machine unlearning six- way evaluation for language models.arXiv preprint arXiv:2407.06460, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.871983Z"},"links":{"cited_paper":"/paper/2407.06460","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:3fc736823041b1435a47933f51cd6716a7f0575f7173e0d580c03021607b22a9","observation_id":"2dfbce3b-c3c3-498e-abc0-679dba0b83e5","resolution":{"observed_at":"2026-08-15T20:21:39.871983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.876291Z","title":"Large language models encode clinical knowledge.Nature, 620(7972):172–180, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.876291Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:7957f7aa85a112e0ddb982775c9d407a6da0b04a7575357cf2817e3ebf969039","observation_id":"7b53763d-bd1c-4ad0-b732-df2112c71c6e","resolution":{"observed_at":"2026-08-15T20:21:39.876291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07298","last_updated":"2024-05-06T15:52:03Z","snapshot_observed_at":"2026-08-16T14:53:09.624434Z","submitted_at":"2023-10-11T08:32:46Z","title":"Beyond Memorization: Violating Privacy Via Inference with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.07298","snapshot_observed_at":"2026-08-15T20:21:39.880350Z","title":"Beyond memorization: Violating privacy via inference with large language models.arXiv preprint arXiv:2310.07298, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.880350Z"},"links":{"cited_paper":"/paper/2310.07298","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:168c322ab6e47a859c921ffb272d6b1ee672d0a3e23548d9b8ebb3585cc87de1","observation_id":"2baaf251-8055-4499-b99b-c2a655b296fd","resolution":{"observed_at":"2026-08-15T20:21:39.880350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09085","last_updated":"2022-11-16T18:06:33Z","snapshot_observed_at":"2026-08-13T16:29:32.694746Z","submitted_at":"2022-11-16T18:06:33Z","title":"Galactica: A Large Language Model for Science","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09085","snapshot_observed_at":"2026-08-15T20:21:39.884163Z","title":"Galactica: A large language model for science.arXiv preprint arXiv:2211.09085, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.884163Z"},"links":{"cited_paper":"/paper/2211.09085","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:e00549b11b64d48f6643825f87e6295c9d2f9a35ceefaf5dfb587b6c763001a1","observation_id":"fe7f63e8-b3a0-4db9-b65a-b3644cb1a661","resolution":{"observed_at":"2026-08-15T20:21:39.884163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-15T20:21:39.887676Z","title":"Gemini: a family of highly capable multimodal models.arXiv preprint arXiv:2312.11805, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.887676Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:992f84433c0354dfd863c2f06a26696c99c0fe016db3cab339f376f7286be0fe","observation_id":"5e75d97f-394b-4e23-ad84-94fbe293e8a2","resolution":{"observed_at":"2026-08-15T20:21:39.887676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.891622Z","title":"The falcon 3 family of open models, December 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.891622Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:9122ca93e46668f0eecc76ba70d260a08d90c0d521a09ca2ebf11c961775b310","observation_id":"71b8607b-f3dd-4c22-abe2-b083031b5d49","resolution":{"observed_at":"2026-08-15T20:21:39.891622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03329","last_updated":"2024-06-11T15:47:39Z","snapshot_observed_at":"2026-08-16T15:21:16.503322Z","submitted_at":"2024-03-05T21:19:06Z","title":"Guardrail Baselines for Unlearning in LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03329","snapshot_observed_at":"2026-08-15T20:21:39.895079Z","title":"Guardrail baselines for unlearning in llms.arXiv preprint arXiv:2403.03329, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.895079Z"},"links":{"cited_paper":"/paper/2403.03329","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:2f40249a5d0c41bf54d242423e17a11eaad780dc48f99a970a09d29ee3d1b084","observation_id":"52c73be3-98bb-4f4d-beab-8c61a52af5d4","resolution":{"observed_at":"2026-08-15T20:21:39.895079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.899090Z","title":"Memorization without overfitting: Analyzing the training dynamics of large language models.Advances in Neural Information Processing Systems, 35:38274–38290, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.899090Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:30588695652f2b65c411611a38c688dade8366a5960fc2feeb6d7998c9f3fbad","observation_id":"647484dd-bf91-40c5-9502-28218dee089b","resolution":{"observed_at":"2026-08-15T20:21:39.899090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-15T20:21:39.902583Z","title":"Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.902583Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:5b4257a08a336eca67eb105cea7df839d26a5cbcd00470557b618d98297eb2f8","observation_id":"12906d9d-2c2b-4a14-819f-f363c71df942","resolution":{"observed_at":"2026-08-15T20:21:39.902583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06535","last_updated":"2023-05-11T02:44:29Z","snapshot_observed_at":"2026-08-16T15:33:59.342689Z","submitted_at":"2023-05-11T02:44:29Z","title":"KGA: A General Machine Unlearning Framework Based on Knowledge Gap Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.06535","snapshot_observed_at":"2026-08-15T20:21:39.906241Z","title":"Kga: A general machine unlearning framework based on knowledge gap alignment.arXiv preprint arXiv:2305.06535, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.906241Z"},"links":{"cited_paper":"/paper/2305.06535","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:26943a113098c5ac6d93cc3ab21d07ebcb08126f12b73da6dd6a44aa4c5fbab1","observation_id":"5778b8d2-bf7a-4bdd-8830-f41a563f70c8","resolution":{"observed_at":"2026-08-15T20:21:39.906241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11143","last_updated":"2024-10-14T23:43:33Z","snapshot_observed_at":"2026-08-16T13:09:23.596592Z","submitted_at":"2024-10-14T23:43:33Z","title":"LLM Unlearning via Loss Adjustment with Only Forget Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11143","snapshot_observed_at":"2026-08-15T20:21:39.910131Z","title":"Llm unlearning via loss adjustment with only forget data","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.910131Z"},"links":{"cited_paper":"/paper/2410.11143","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:7e1c9663f621dce55376667b8ecd427d5d7ad9890ecf83c0d3649d246cc005c3","observation_id":"ec87b60b-66dd-4b03-bec4-fade92c7afa3","resolution":{"observed_at":"2026-08-15T20:21:39.910131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.913972Z","title":"Distributionally robust post-hoc classifiers under prior shifts","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.913972Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:868667696debb09285b64113c704bd4c5ff406af04533e1cc3492bfd621398f5","observation_id":"dd25faeb-d8b9-4cb3-8ba8-ec5af3903cf0","resolution":{"observed_at":"2026-08-15T20:21:39.913972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10412","last_updated":"2024-06-06T18:33:02Z","snapshot_observed_at":"2026-08-16T14:18:07.336985Z","submitted_at":"2024-02-16T02:32:06Z","title":"Measuring and Reducing LLM Hallucination without Gold-Standard Answers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10412","snapshot_observed_at":"2026-08-15T20:21:39.917798Z","title":"Measuring and reducing llm hallucination without gold-standard answers.arXiv preprint arXiv:2402.10412, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.917798Z"},"links":{"cited_paper":"/paper/2402.10412","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:f567ad31eb60a1671c005e1d0286d5d14f544d626babcab60623cf8078d587c2","observation_id":"7d47862e-113f-4b1d-9df9-28d593fd60af","resolution":{"observed_at":"2026-08-15T20:21:39.917798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.12088","last_updated":"2022-03-27T06:51:57Z","snapshot_observed_at":"2026-08-13T17:47:52.014143Z","submitted_at":"2021-10-22T22:42:11Z","title":"Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.12088","snapshot_observed_at":"2026-08-15T20:21:39.922316Z","title":"Learning with noisy labels revisited: A study using real-world human annotations.arXiv preprint arXiv:2110.12088, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.922316Z"},"links":{"cited_paper":"/paper/2110.12088","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:a185663ed50f7e4f80b6c8b12aaea3b465f50387645a95471161123bbb348c7b","observation_id":"78e11f5c-d982-4dab-a9ab-29e7344220b2","resolution":{"observed_at":"2026-08-15T20:21:39.922316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.01206","last_updated":"2024-04-01T16:08:18Z","snapshot_observed_at":"2026-08-16T14:04:36.183609Z","submitted_at":"2024-04-01T16:08:18Z","title":"Machine Unlearning for Traditional Models and Large Language Models: A Short Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.01206","snapshot_observed_at":"2026-08-15T20:21:39.926816Z","title":"Machine unlearning for traditional models and large language models: A short survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.926816Z"},"links":{"cited_paper":"/paper/2404.01206","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:c6faf6f568068494012c465c88ff0b6234570bae3559e875e69a53d2af28b6d4","observation_id":"b5641037-d00f-43b6-a2d5-7544d8b58ac4","resolution":{"observed_at":"2026-08-15T20:21:39.926816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.18132","last_updated":"2025-05-20T13:43:20Z","snapshot_observed_at":"2026-08-16T12:47:34.908575Z","submitted_at":"2025-03-23T16:25:08Z","title":"MathAgent: Leveraging a Mixture-of-Math-Agent Framework for Real-World Multimodal Mathematical Error Detection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18132","snapshot_observed_at":"2026-08-15T20:21:39.931675Z","title":"Mathagent: Leveraging a mixture-of-math-agent framework for real-world multimodal mathematical error detection.arXiv preprint arXiv:2503.18132, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.931675Z"},"links":{"cited_paper":"/paper/2503.18132","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:dee3a51c17aaac31198c2416c827cdd24c394820c031d53d26a55f5cf774d174","observation_id":"6f274635-e810-4eda-97bf-49f0ade0dbcf","resolution":{"observed_at":"2026-08-15T20:21:39.931675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-15T20:21:39.935651Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.935651Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:6b672040408f35b82ef70294fe5be59ab73eedc36412fed69ae8853d4b35e434","observation_id":"19048c04-94c3-432a-a530-6193a414e309","resolution":{"observed_at":"2026-08-15T20:21:39.935651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15159","last_updated":"2024-05-30T15:44:51Z","snapshot_observed_at":"2026-08-16T14:15:59.402287Z","submitted_at":"2024-02-23T07:43:26Z","title":"Machine Unlearning of Pre-trained Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15159","snapshot_observed_at":"2026-08-15T20:21:39.939755Z","title":"Machine unlearning of pre-trained large language models.arXiv preprint arXiv:2402.15159, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.939755Z"},"links":{"cited_paper":"/paper/2402.15159","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:5a1a8d61a1bab67217b0976d528812d550624ccb0f25cd416b9bb2481a56bbcb","observation_id":"7d6750f5-3e60-4840-b185-9e181fef34a4","resolution":{"observed_at":"2026-08-15T20:21:39.939755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:39.943769Z","title":"Large language model unlearning.Advances in Neural Information Processing Systems, 37:105425–105475, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.943769Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:66da5a3e922228f938fc0c6ae11431bd992dddf4e3b9b0a69c82e8ef53095ca1","observation_id":"a6c32854-0696-45a1-a519-675f6ed005b8","resolution":{"observed_at":"2026-08-15T20:21:39.943769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:21:41.071585Z","title":"Enhanced membership inference attacks against machine learning models","venue":null,"work_id":"9efd2409-5f7a-4164-a3b5-8c81c24a0b80","year":2022},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.947423Z"},"links":{"citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:fa05e04eef64b7a036f1f4ef37640ab7767c52b3ba12dc062cef6e361d45515d","observation_id":"d3ef7cb7-4634-4f32-b1c1-688cd0b14ca0","resolution":{"observed_at":"2026-08-15T20:21:41.076001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":97,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":110},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 100 of 110 outbound references and 6 inbound Pith citation observations for arXiv:2505.13312."}