{"as_of":"2026-08-12T19:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:244c3d4d65ce21ea76a2c72c2a0c77fefb5245727011d56a2cc3831f95e259f8","coverage":[{"denominator":105,"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-12T05:31:01.030883Z","state":"measured"},{"denominator":102,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":102,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T22:55:43.595779Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T10:28:12.100716Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"cited_work":{"arxiv_id":"2412.00383","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00383","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8f93a173-d4b0-4f21-a6c3-142db98ac6bd","year":2024},"citing_paper":{"arxiv_id":"2605.19042","last_updated":"2026-05-18T19:05:40Z","snapshot_observed_at":"2026-07-06T23:29:47.081347Z","submitted_at":"2026-05-18T19:05:40Z","title":"Interference-Aware Multi-Task Unlearning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T10:25:57.025905Z"},"links":{"cited_paper":"/paper/2412.00383","citing_paper":"/paper/2605.19042"},"observation_digest":"sha256:3668962f50382f9d9fa1c92a17a1a9ab57894090b58d9d2201d37fb10f616d95","observation_id":"59f2578b-da08-4e60-a347-37587fa0c1c5","resolution":{"observed_at":"2026-05-20T10:28:12.102243Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","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-07-11T22:55:43.595779Z","title":"doi: 10.18653/v1/N19-1423","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03932","last_updated":"2026-07-04T15:52:16Z","snapshot_observed_at":"2026-08-10T00:16:50.746302Z","submitted_at":"2026-07-04T15:52:16Z","title":"MPSelectTune: Prompt-type Selection for Fine-tuning improves Concept Unlearning in LLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T22:55:43.595779Z"},"links":{"cited_paper":"/paper/2412.00383","citing_paper":"/paper/2607.03932"},"observation_digest":"sha256:ed5b0b5a74cc55df02ef218d93103423a6fbd7105e12d070537d4766670ebd22","observation_id":"2bbc6d04-fa87-4013-9b88-f359a8fa2831","resolution":{"observed_at":"2026-07-11T22:55:43.595779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00383/citation-record","integrity":"/paper/2412.00383/integrity","json":"/paper/2412.00383/citation-record.json","paper":"/paper/2412.00383"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1602.03943","last_updated":"2017-11-30T18:38:02Z","snapshot_observed_at":"2026-08-11T14:52:13.950357Z","submitted_at":"2016-02-12T01:38:05Z","title":"Second-Order Stochastic Optimization for Machine Learning in Linear Time","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.03943","snapshot_observed_at":"2026-08-12T05:31:00.515942Z","title":"Second order stochastic optimization in linear time","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.515942Z"},"links":{"cited_paper":"/paper/1602.03943","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:2567e00505c5d0d746bfbcc77c9c21b20615c81aa3c0edab3b5195fe97db1239","observation_id":"2ad3360d-e3f7-44c0-8ad6-40b8466045e5","resolution":{"observed_at":"2026-08-12T05:31:00.515942Z","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-12T05:31:00.523511Z","title":"Glassman","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.523511Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:648ff8e5adf973e3452af3d632280eaf15a6ed6d2d7112fd5ea5b0b0e5e78e0c","observation_id":"45e46501-a67f-476c-8e7e-ad1d51d28b80","resolution":{"observed_at":"2026-08-12T05:31:00.523511Z","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-12T05:31:00.529606Z","title":"Tallrec: An effective and efficient tuning framework to align large language model with recommendation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.529606Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:6d67fc827219029b93198481b33be4222a27cda09e27150634c9b1a0c48dcf3a","observation_id":"9d0a5263-d4fa-431e-9e78-02c6a59b60b5","resolution":{"observed_at":"2026-08-12T05:31:00.529606Z","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-12T05:31:00.535506Z","title":"Bartlett and Shahar Mendelson","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.535506Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:df9453a778697c5614bd2c738f1857503b9a871a16a63f6562d63ea0728c9b70","observation_id":"ab53bb16-446e-4ad3-9a97-07d1dc532067","resolution":{"observed_at":"2026-08-12T05:31:00.535506Z","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-12T05:31:00.540714Z","title":"Influence functions in deep learning are fragile","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.540714Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9ce03674496f21c562e1ac20fd8bb26b4f4269ec56911c4c94c5bb3300578eb0","observation_id":"a0677543-befc-4372-b57b-41750bd72ffd","resolution":{"observed_at":"2026-08-12T05:31:00.540714Z","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-12T05:31:00.548256Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.548256Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:eeb28d48c502a0d2f3ab30aaecf09f08e12340067c0a577093fe7545cc3a263a","observation_id":"945758f6-357c-4bf5-993b-dd4ebb307a45","resolution":{"observed_at":"2026-08-12T05:31:00.548256Z","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-12T05:31:00.554420Z","title":"Nonlinear programming","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.554420Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b655db336da5cdb7bbfce0efbdaf9e72a78730b19096caa22ac0637e7a315350","observation_id":"33902f26-4994-4701-8ba8-a1cacb2e5d00","resolution":{"observed_at":"2026-08-12T05:31:00.554420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02062","last_updated":"2024-04-02T16:01:18Z","snapshot_observed_at":"2026-08-11T02:52:13.646293Z","submitted_at":"2024-04-02T16:01:18Z","title":"Digital Forgetting in Large Language Models: A Survey of Unlearning Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02062","snapshot_observed_at":"2026-08-12T05:31:00.559557Z","title":"Digital forgetting in large language models: A survey of unlearning methods","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.559557Z"},"links":{"cited_paper":"/paper/2404.02062","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:5985ee67bb7ccfc46790d4b80f10fe7d39144f3fea91b472c543ba921d351566","observation_id":"cdba72d5-d301-4526-b4a5-e474eb42899b","resolution":{"observed_at":"2026-08-12T05:31:00.559557Z","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-12T05:31:00.564974Z","title":"Choquette - Choo, Hengrui Jia, Adelin Travers, Baiwu Zhang, David Lie, and Nicolas Papernot","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.564974Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:957e4e01562164ded86eadaa4083f569b74875b23052fffcb7155d1698eabb5a","observation_id":"2e50319d-d09d-407e-bfe7-48055e80cebd","resolution":{"observed_at":"2026-08-12T05:31:00.564974Z","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-12T05:31:00.570717Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.570717Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:36a6a98a3d92b1e84b269f219d51b7b6cf22929b9a6787c197902a01d15b8e7d","observation_id":"92272415-2c71-4b39-ac45-bb8944bdb9de","resolution":{"observed_at":"2026-08-12T05:31:00.570717Z","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-12T05:31:00.576489Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.576489Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:6ba3779649b422225357321b540bd505479700d97f0f2a7eb2d2bd608a6ae041","observation_id":"b45a1d76-b44d-41d3-9b14-cbd046aea339","resolution":{"observed_at":"2026-08-12T05:31:00.576489Z","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-12T05:31:00.581737Z","title":"Prompting change: exploring prompt engineering in large language model ai and its potential to transform education","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.581737Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:318ccee97fd21655e18292c8cbd5c24ce50f5bf928ba9a7f2f043e30764ef077","observation_id":"2ee5cf91-3f2a-4ea7-9a84-4c5f776b6679","resolution":{"observed_at":"2026-08-12T05:31:00.581737Z","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-12T05:31:00.586641Z","title":"Proceedings of the 2nd International Workshop on Information Heterogeneity and Fusion in Recommender Systems, HetRec '11, Chicago, Illinois, USA, October 27, 2011, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.586641Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:8ec69f1ed6f14b160d567bc5bb4b85487155003c229dafaa5f5629a02fe52b8f","observation_id":"473097d0-7c4e-4e36-98f6-f7e40d4e0439","resolution":{"observed_at":"2026-08-12T05:31:00.586641Z","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-12T05:31:00.591464Z","title":"Learning to unlearn: Instance-wise unlearning for pre-trained classifiers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.591464Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:1aad59cd0085487cce988ae7ffdf77dc3ca7c18566b217bba2ce96cf8ce15e4e","observation_id":"5180e43d-82b6-4a79-9bf5-46fdd3d6869a","resolution":{"observed_at":"2026-08-12T05:31:00.591464Z","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-12T05:31:00.596262Z","title":"Recommendation unlearning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.596262Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b6417230f3e6cc928fc59f1d7ff204d9666d47be2a747940c4ad0c189db25ed7","observation_id":"c3fafa25-8237-4dd8-900b-bddc1faa5863","resolution":{"observed_at":"2026-08-12T05:31:00.596262Z","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-12T05:31:00.601063Z","title":"Unlearn what you want to forget: Efficient unlearning for llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.601063Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:ec42997f1d435a1da8ab24f5341764dfe1bbc336d4cb2b84bc602da8da985552","observation_id":"2e9faee9-0cb3-49f4-8f6a-cdc9a12e7af8","resolution":{"observed_at":"2026-08-12T05:31:00.601063Z","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-12T05:31:00.605788Z","title":"On softmax direct preference optimization for recommendation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.605788Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:fd26c4691e8c2abeefa0feea195678f4b67df96c5852d5a1d7258bc33fe11518","observation_id":"293423e4-795f-4ab7-b33b-3bf81cdaf23e","resolution":{"observed_at":"2026-08-12T05:31:00.605788Z","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-12T05:31:00.610866Z","title":"Exploring the potential of large language models (llms)in learning on graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.610866Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:e7633dacffc7d5d0653690e76b1c14fa729e8d3b86ab4b56d416565ebeeeaf49","observation_id":"42596e1e-7f21-44cf-a72e-9b004e08699d","resolution":{"observed_at":"2026-08-12T05:31:00.610866Z","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-12T05:31:00.615474Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.615474Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:d9fdd0ecb51d7c30f0eb437cd3d0f8f04fb190842795d0a7d53efedc3aea338f","observation_id":"242cebc4-71b6-44f2-9af2-4cd3d474b9d8","resolution":{"observed_at":"2026-08-12T05:31:00.615474Z","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-12T05:31:00.620244Z","title":"Personalized pedagogy through a llm-based recommender system","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.620244Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:77b1c9473c3aa8fbce05a856b40ed0fcad188899e64b8bef3f47e417ad12ffba","observation_id":"54a6b158-4594-408e-b2ff-a04530288236","resolution":{"observed_at":"2026-08-12T05:31:00.620244Z","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-12T05:31:00.625036Z","title":"Qlora: Efficient finetuning of quantized llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.625036Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9e964e965a78d312c85e7b2cc14f7556da93d4ea45de7241c241b4c103a29331","observation_id":"c9371465-255f-4dd1-a6bf-c36026de8355","resolution":{"observed_at":"2026-08-12T05:31:00.625036Z","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-12T05:31:00.629624Z","title":"BERT: pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.629624Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:3cb5e15c042a5323e7b6c94d1f2074613f9b3aa6c5c0d37b3bd18cf30968600c","observation_id":"4adeb7df-206f-4117-a5ab-043308026aef","resolution":{"observed_at":"2026-08-12T05:31:00.629624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01669","last_updated":"2025-08-14T12:15:41Z","snapshot_observed_at":"2026-08-09T18:45:57.202339Z","submitted_at":"2025-02-01T16:23:13Z","title":"Delayed Feedback Modeling with Influence Functions","version":2},"cited_work":{"arxiv_id":"2502.01669","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.01669","snapshot_observed_at":"2026-08-12T05:31:01.677969Z","title":"Delayed Feedback Modeling with Influence Functions","venue":"cs.LG","work_id":"c75018f5-9ed6-4d63-bc7e-bc82b2134bf7","year":2025},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.634357Z"},"links":{"cited_paper":"/paper/2502.01669","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:3a092826161af3eb3f52a58fd8128eb1ef5761f01f00fd80131e265caf9387a9","observation_id":"1f89fb10-6204-4b74-b4d9-d3f0173a4fbd","resolution":{"observed_at":"2026-08-12T05:31:01.682761Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.06305","last_updated":"2020-02-15T02:40:10Z","snapshot_observed_at":"2026-08-12T00:45:25.809655Z","submitted_at":"2020-02-15T02:40:10Z","title":"Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stopping","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.06305","snapshot_observed_at":"2026-08-12T05:31:00.639379Z","title":"Fine-tuning pretrained language models: Weight initializations, data orders, and early stopping","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.639379Z"},"links":{"cited_paper":"/paper/2002.06305","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:ecb637216941fb1de45588049f3cb1cba074bd93a443e82589af598edad7d5a3","observation_id":"831c41ef-e60e-40e5-828a-c8440d25e3b0","resolution":{"observed_at":"2026-08-12T05:31:00.639379Z","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-10T22:15:10.032494Z","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-12T05:31:00.645733Z","title":"Who's harry potter? approximate unlearning in llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.645733Z"},"links":{"cited_paper":"/paper/2310.02238","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:918677bb04a3a4c2fa6394bd5e3d719eeac43ffcffb4bc944f25740d14313024","observation_id":"bc54fad1-8982-49fb-b227-6644077294d4","resolution":{"observed_at":"2026-08-12T05:31:00.645733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02355","last_updated":"2025-04-22T16:15:47Z","snapshot_observed_at":"2026-08-08T23:26:11.950951Z","submitted_at":"2024-10-03T10:06:27Z","title":"AlphaEdit: Null-Space Constrained Knowledge Editing for Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02355","snapshot_observed_at":"2026-08-12T05:31:00.651754Z","title":"Alphaedit: Null-space constrained knowledge editing for language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.651754Z"},"links":{"cited_paper":"/paper/2410.02355","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:46b35725a9cb79f1ee187cf055c6f01982887114364eae5ce73b8ac63fe30ac3","observation_id":"1e785353-e268-4426-be9d-e6878418b5c5","resolution":{"observed_at":"2026-08-12T05:31:00.651754Z","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-12T05:31:00.657095Z","title":"Moltc: Towards molecular relational modeling in language models","venue":null,"work_id":null,"year":1943},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.657095Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:6e44ba53f749cf35d4196f2951589df9daf8bc3863eff59300d71b125d789a9a","observation_id":"0c112a92-49f5-42b9-bd86-188f54744172","resolution":{"observed_at":"2026-08-12T05:31:00.657095Z","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-12T05:31:00.662126Z","title":"Practical methods of optimization","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.662126Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:63a82bf07c5f4b1eb586d41f15119cecffb80d22fc97820760722fb9184667d5","observation_id":"aa151ae4-7635-4da6-81b3-dcd994fde19f","resolution":{"observed_at":"2026-08-12T05:31:00.662126Z","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-12T05:31:00.667041Z","title":"Maxwell Harper and Joseph A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.667041Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:24007b0b56966005a983c9eea392743be1d294317b1a5a89922b7fa80b377850","observation_id":"446c476f-a2c8-4e8b-ada4-1f222df13c54","resolution":{"observed_at":"2026-08-12T05:31:00.667041Z","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-12T05:31:00.672049Z","title":"Methods of conjugate gradients for solving linear systems, volume 49","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.672049Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:6e07b0e9f8d3bb7acd29bb6743b4ad6da265dd18496dfa1c26e72471290e9d51","observation_id":"f5e1efb4-80fe-4413-bf75-53d9ddadb514","resolution":{"observed_at":"2026-08-12T05:31:00.672049Z","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-12T05:31:00.677003Z","title":"Parameter-efficient transfer learning for NLP","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.677003Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:db32b170884eca83dc08cb025d274d6509b317c7e62a7fa257bf2f25e3eb6984","observation_id":"1205adb6-52e5-4547-bff4-93cf8dd2a7ee","resolution":{"observed_at":"2026-08-12T05:31:00.677003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11181","last_updated":"2024-01-20T09:43:36Z","snapshot_observed_at":"2026-08-12T13:31:20.808991Z","submitted_at":"2024-01-20T09:43:36Z","title":"Inference without Interference: Disaggregate LLM Inference for Mixed Downstream Workloads","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11181","snapshot_observed_at":"2026-08-12T05:31:00.681928Z","title":"Inference without interference: Disaggregate LLM inference for mixed downstream workloads","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.681928Z"},"links":{"cited_paper":"/paper/2401.11181","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b1015121f9db5bd6a10b371d2696b242bc330e22bb3c00c2984a5e5f0fde7560","observation_id":"e9bfd67b-8615-4c24-abde-68b4eab96343","resolution":{"observed_at":"2026-08-12T05:31:00.681928Z","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-12T05:31:00.687388Z","title":"Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen - Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.687388Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9ac14fb072651f2706423d7fd512dbe90861b95f3cb411d5157afa84de9328e4","observation_id":"3a6b0902-d822-4cc5-b28c-066d43f58be4","resolution":{"observed_at":"2026-08-12T05:31:00.687388Z","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-12T05:31:02.551514Z","title":"Enhancing sequential recommendation via llm-based semantic embedding learning","venue":null,"work_id":"6842cbb1-0463-40c9-8116-6c232816d2a5","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.692616Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:305953a989a5772e6109cc0962918437d62aa263befd65a17185f0586d09865d","observation_id":"83de7dbf-f994-41cb-8888-079da1f1496a","resolution":{"observed_at":"2026-08-12T05:31:02.556981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.10327","last_updated":"2024-04-16T07:11:48Z","snapshot_observed_at":"2026-07-06T18:00:48.577289Z","submitted_at":"2024-04-16T07:11:48Z","title":"Exact and Efficient Unlearning for Large Language Model-based Recommendation","version":1},"cited_work":{"arxiv_id":"2404.10327","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.10327","snapshot_observed_at":"2026-08-12T05:31:01.583350Z","title":"Exact and Efficient Unlearning for Large Language Model-based Recommendation","venue":"cs.IR","work_id":"aa891731-b302-4ebd-995a-a3e07f3cbfa7","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.697754Z"},"links":{"cited_paper":"/paper/2404.10327","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b947ed78c9e1e1f6ccda8f1cb7032009b40ac897a8c3d2c8b70d327197ed35f7","observation_id":"ce099af9-b965-485d-a3f7-8dd2c093b548","resolution":{"observed_at":"2026-08-12T05:31:01.590534Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.533777Z","title":"Knowledge unlearning for mitigating privacy risks in language models","venue":null,"work_id":"359fc431-6822-494e-a708-c950057b22e7","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.703600Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:1017c0397631a80b5abc2efbb1f8caf1fc102e7ac244a3719db490a7faaf4a0a","observation_id":"d6bdd975-a3cc-40ff-84f6-bdd8408af7f4","resolution":{"observed_at":"2026-08-12T05:31:02.538958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01325","last_updated":"2024-07-11T06:11:46Z","snapshot_observed_at":"2026-08-03T00:46:19.287073Z","submitted_at":"2024-01-02T18:30:51Z","title":"LLM Maybe LongLM: Self-Extend LLM Context Window Without Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01325","snapshot_observed_at":"2026-08-12T05:31:00.708689Z","title":"LLM maybe longlm: Self-extend LLM context window without tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.708689Z"},"links":{"cited_paper":"/paper/2401.01325","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:d1944bde513a2d14db3e15ec67c937814dd19fa2aaf12980851e18e749a454e1","observation_id":"a143afd2-946b-4c05-9ea9-5e5a2bc6d72a","resolution":{"observed_at":"2026-08-12T05:31:00.708689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07420","last_updated":"2023-12-12T16:44:47Z","snapshot_observed_at":"2026-08-07T19:13:25.649695Z","submitted_at":"2023-12-12T16:44:47Z","title":"FairSISA: Ensemble Post-Processing to Improve Fairness of Unlearning in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.07420","snapshot_observed_at":"2026-08-12T05:31:00.715607Z","title":"Fairsisa: Ensemble post-processing to improve fairness of unlearning in llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.715607Z"},"links":{"cited_paper":"/paper/2312.07420","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:01015b67132b058628574b9d67e84873854900b09c5a30e3ebd1986aa2fa3d1a","observation_id":"82f70db3-acfc-411a-8189-409761f69c56","resolution":{"observed_at":"2026-08-12T05:31:00.715607Z","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-12T05:31:02.517128Z","title":"Kassem, Omar Mahmoud, and Sherif Saad","venue":null,"work_id":"46ec9a27-9d83-4a18-bf68-e594e275910a","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.721709Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:6410a4dcbe909c0e86f542141e3b414033c207cbce16ec3a2f79304b49f10674","observation_id":"4b86e939-df7b-4024-8dd6-95bbd17f7c51","resolution":{"observed_at":"2026-08-12T05:31:02.522998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.501602Z","title":"Understanding black-box predictions via influence functions","venue":null,"work_id":"ae9244d6-6534-47f9-a4e0-f2d6ec2df73c","year":2017},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.726847Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:f2fef25286b17a164077aaa9a580c137cb747ce178a447c46aa236760fd92218","observation_id":"0beccad3-4e4f-4eb6-b462-342a83efdec2","resolution":{"observed_at":"2026-08-12T05:31:02.506625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.486554Z","title":"Customizing language models with instance-wise lora for sequential recommendation","venue":null,"work_id":"a80442bf-31ac-4ed0-b000-8e0151f55c29","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.732114Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:7f57ced4b2516a8c343d945e538224bc763de59b810b561cbb11d2ec3557b0ed","observation_id":"753e5bde-f1ea-4dd2-8f68-b8494d319564","resolution":{"observed_at":"2026-08-12T05:31:02.491578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.470439Z","title":"Privacy adhering machine un-learning in NLP","venue":null,"work_id":"bc839eec-01bb-4bac-bde0-5453245e0655","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.737325Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:ebbcb70863622524e9d6fd364ae30a9e56cc670a62e7d61c844fe026cb7c78b7","observation_id":"41e9366f-5119-4e0f-b690-361d38b2270d","resolution":{"observed_at":"2026-08-12T05:31:02.475476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.454072Z","title":"Towards unbounded machine unlearning","venue":null,"work_id":"183e0282-48dc-4364-a84d-474972e9a680","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.742873Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:ddb10aa3290a02ebf79922e82138672ce5442a60f3a395d0d5002dc7f3469a31","observation_id":"dbb6d7c4-675f-49f1-af18-a231e7feae22","resolution":{"observed_at":"2026-08-12T05:31:02.459020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.436171Z","title":"Let machines unlearn - machine unlearning and the right to be forgotten","venue":null,"work_id":"859ecc2c-a973-4982-ad11-b8ba77710135","year":2017},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.747852Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:51aba1da299353e56353295346ffbd8efd135f74134793fd05d6ebc486165d4b","observation_id":"75df2c7c-9631-46a7-990c-6516f831f4b7","resolution":{"observed_at":"2026-08-12T05:31:02.442980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.417053Z","title":"Collavo: Crayon large language and vision model","venue":null,"work_id":"8c02ce91-4614-4a75-aed7-353df631c01a","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.753052Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:69bd8e5517e7e0d95534c948b3434beab074ad95f44bf5bd5dfe3f8ad3260519","observation_id":"35667758-b425-42c2-9cfb-89d04108b809","resolution":{"observed_at":"2026-08-12T05:31:02.423009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07500","last_updated":"2024-03-12T10:38:03Z","snapshot_observed_at":"2026-07-06T17:43:10.476384Z","submitted_at":"2024-03-12T10:38:03Z","title":"Block-wise LoRA: Revisiting Fine-grained LoRA for Effective Personalization and Stylization in Text-to-Image Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07500","snapshot_observed_at":"2026-08-12T05:31:00.757959Z","title":"Block-wise lora: Revisiting fine-grained lora for effective personalization and stylization in text-to-image generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.757959Z"},"links":{"cited_paper":"/paper/2403.07500","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:46354b6fc864eb611b9587ba39470b755b37fdf98952897b4e7ff33388c46827","observation_id":"14b33c2a-b4f9-462d-b4a7-3f8ee1e45eaf","resolution":{"observed_at":"2026-08-12T05:31:00.757959Z","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-12T05:31:00.763224Z","title":"Diffstyler: Diffusion-based localized image style transfer","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.763224Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:2f08b1a5d9ab8c8fdcd377ddb9595767245a474a43b2b3c64fccf6b7c07a663c","observation_id":"38b68d65-f967-4c49-ad2e-0dc6fee03132","resolution":{"observed_at":"2026-08-12T05:31:00.763224Z","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-12T05:31:02.400521Z","title":"Prefix-tuning: Optimizing continuous prompts for generation","venue":null,"work_id":"9053c1c0-e46d-4d2c-a463-4763accfb9bf","year":2021},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.768265Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:ec033edf2a1af6d4488d70fc81f3f3068d249d9b3a82195f2c525364d7cc3e4a","observation_id":"9e68a5e0-866d-49df-9a52-bb5b8c7ca746","resolution":{"observed_at":"2026-08-12T05:31:02.406158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01208","last_updated":"2023-10-02T13:53:03Z","snapshot_observed_at":"2026-08-12T04:53:16.218683Z","submitted_at":"2023-10-02T13:53:03Z","title":"Label Supervised LLaMA Finetuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01208","snapshot_observed_at":"2026-08-12T05:31:00.773811Z","title":"Label supervised llama finetuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.773811Z"},"links":{"cited_paper":"/paper/2310.01208","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:d2711ba7bae8f048fcdd16473c3589c7af946fb5bfde0a6b2cc56df961679819","observation_id":"3f32a3b3-85c5-4306-a522-d55de371567c","resolution":{"observed_at":"2026-08-12T05:31:00.773811Z","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-12T05:31:02.383840Z","title":"Llara: Large language-recommendation assistant","venue":null,"work_id":"de167760-f7e3-4f47-958f-68064a3ec4da","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.779597Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:ea0b81711ba608cccf85c8e664185e29053b819fe7db34e111d7feee9dbeef73","observation_id":"a6a30c62-b419-4faa-ae66-701203dcad0d","resolution":{"observed_at":"2026-08-12T05:31:02.388888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03744","last_updated":"2024-05-15T19:22:44Z","snapshot_observed_at":"2026-07-06T16:28:22.350574Z","submitted_at":"2023-10-05T17:59:56Z","title":"Improved Baselines with Visual Instruction Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03744","snapshot_observed_at":"2026-08-12T05:31:00.784314Z","title":"Improved baselines with visual instruction tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.784314Z"},"links":{"cited_paper":"/paper/2310.03744","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b63e04482a6cd21da2a51a2508e856e1ff88279b147fb1a58bda8a086ada6933","observation_id":"641aac0b-8321-450f-82b7-997b2aaefe98","resolution":{"observed_at":"2026-08-12T05:31:00.784314Z","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-12T05:31:02.366629Z","title":"Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing","venue":null,"work_id":"85d100c7-d389-41e7-b443-b8e0b2def0ab","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.789936Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:0c6971671c0a122442fb4caea91d0ea0dd590637ce64e20d71e0c3dcd0f9cc1b","observation_id":"123d1bc3-b5f0-4f74-acac-8b1cd252389a","resolution":{"observed_at":"2026-08-12T05:31:02.372218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08787","last_updated":"2024-12-06T21:39:49Z","snapshot_observed_at":"2026-08-09T11:53:57.275236Z","submitted_at":"2024-02-13T20:51:58Z","title":"Rethinking Machine Unlearning for Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08787","snapshot_observed_at":"2026-08-12T05:31:00.794735Z","title":"Varshney, Mohit Bansal, Sanmi Koyejo, and Yang Liu","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.794735Z"},"links":{"cited_paper":"/paper/2402.08787","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:06eea8f3bf90b4629d5fe83d9ab92c3fc943d067f66de995df236c233c0876a5","observation_id":"754b813c-a367-4d43-ab82-cee2e48374bd","resolution":{"observed_at":"2026-08-12T05:31:00.794735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07602","last_updated":"2022-03-20T15:13:08Z","snapshot_observed_at":"2026-08-10T14:24:20.137867Z","submitted_at":"2021-10-14T17:58:47Z","title":"P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Tasks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07602","snapshot_observed_at":"2026-08-12T05:31:00.799633Z","title":"P-tuning v2: Prompt tuning can be comparable to fine-tuning universally across scales and tasks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.799633Z"},"links":{"cited_paper":"/paper/2110.07602","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:e253a4e99c90bc9a6f8954de200e9d137ef366e2f0f8c90d73df0090bd27e1d6","observation_id":"26df6d92-1de6-4b82-85ae-5d5980b361d3","resolution":{"observed_at":"2026-08-12T05:31:00.799633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02038","last_updated":"2024-01-06T03:32:08Z","snapshot_observed_at":"2026-08-04T23:46:20.566170Z","submitted_at":"2024-01-04T02:43:57Z","title":"Understanding LLMs: A Comprehensive Overview from Training to Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02038","snapshot_observed_at":"2026-08-12T05:31:00.804844Z","title":"Understanding llms: A comprehensive overview from training to inference","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.804844Z"},"links":{"cited_paper":"/paper/2401.02038","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9dc51052c58c7ba99ede112c89f05ac9e82a1d23113b5bdfbc56ce6969bf49e6","observation_id":"be4f4177-0a2b-42bf-81c9-12d957c28fb2","resolution":{"observed_at":"2026-08-12T05:31:00.804844Z","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-12T05:31:02.349816Z","title":"Towards safer large language models through machine unlearning","venue":null,"work_id":"ff24326d-c0fb-4871-b2fd-9908e4342e3b","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.809813Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:3df61a4552e8f02cb24e88333accb7971d0efe22c655d2e0b19782340e6dcb35","observation_id":"2c1f7739-53e8-4ed5-a2ce-e1541bbf037b","resolution":{"observed_at":"2026-08-12T05:31:02.355041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05880","last_updated":"2024-07-03T17:52:00Z","snapshot_observed_at":"2026-08-10T02:57:14.558982Z","submitted_at":"2024-04-08T21:26:22Z","title":"Eraser: Jailbreaking Defense in Large Language Models via Unlearning Harmful Knowledge","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05880","snapshot_observed_at":"2026-08-12T05:31:00.814639Z","title":"Eraser: Jailbreaking defense in large language models via unlearning harmful knowledge","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.814639Z"},"links":{"cited_paper":"/paper/2404.05880","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:188e7c8949fd9a7a6c1ed644e11c7d84b49c6651cae1a589d2743820c5d4b6e4","observation_id":"565d8b2b-5470-4350-bde8-88d836e3473f","resolution":{"observed_at":"2026-08-12T05:31:00.814639Z","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-12T05:31:02.333230Z","title":"QUARK: controllable text generation with reinforced unlearning","venue":null,"work_id":"b261223a-aa46-4401-b6fd-c1f8a82667be","year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.820221Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9cbd83216105a343d6888beba329d3d7d03f58d25dc7d13f839b9bf29a42a173","observation_id":"fff7ff87-bee1-4437-b3fe-eccd2ee60e55","resolution":{"observed_at":"2026-08-12T05:31:02.338876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.314640Z","title":"Linear and nonlinear programming, volume 2","venue":null,"work_id":"85ceab26-ada2-4951-91b6-fefca67ea687","year":1984},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.824997Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:bab31d6eba8294317f596b98a7e44fa39bad82e278eb5c2c656e1c7dd87df4ad","observation_id":"3a3b585b-6b8c-4953-85f4-eeca28ba1083","resolution":{"observed_at":"2026-08-12T05:31:02.320839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.294699Z","title":"Llm-rec: Personalized recommendation via prompting large language models","venue":null,"work_id":"fe6a1a6e-952c-488d-93ca-b43fe75af795","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.829767Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:f29162c0295e6c93ccbf3e4bb14befc5d3a5e0a9556288a3eeca174e64dad97a","observation_id":"2af41ddf-03aa-4b97-90dd-1afc55d75ebd","resolution":{"observed_at":"2026-08-12T05:31:02.300431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17115","last_updated":"2025-02-03T15:18:05Z","snapshot_observed_at":"2026-08-10T14:41:59.124056Z","submitted_at":"2024-07-24T09:24:49Z","title":"Reinforced Prompt Personalization for Recommendation with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17115","snapshot_observed_at":"2026-08-12T05:31:00.834756Z","title":"Reinforced prompt personalization for recommendation with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.834756Z"},"links":{"cited_paper":"/paper/2407.17115","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:19410efb32f409bfae4d6eec67175cfb024f5f138e0843d29ae09ea35e38340a","observation_id":"e3ce1277-e503-4e68-ba34-7b2c4d1bbe76","resolution":{"observed_at":"2026-08-12T05:31:00.834756Z","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-12T05:31:02.276407Z","title":"Getting to know your neighbors (KYN)","venue":null,"work_id":"3d477149-a68e-4ce5-a842-b925ea9ea7e2","year":2020},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.840010Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b1481adab3168193297b8619271abcddd2d808d4dfcb2abc0d5490b206930e97","observation_id":"7fd1ec6a-8277-42dd-8215-e19734b01b2b","resolution":{"observed_at":"2026-08-12T05:31:02.282727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.258972Z","title":"Feature unlearning for pre-trained gans and vaes","venue":null,"work_id":"5e9c5bdc-2fca-4719-b0c1-c873d3d3b2ed","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.844632Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:3f5e9a253e6d3d1fa57e4bac4760bc838b49ad876923da6d13580b33ae0f3774","observation_id":"cc9f8369-965f-45b1-a65f-3a45910eea95","resolution":{"observed_at":"2026-08-12T05:31:02.264634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.241625Z","title":"Hellendoorn, Bogdan Vasilescu, and Brad A","venue":null,"work_id":"0b534983-cdd9-4f86-b61d-4dcfeb44c699","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.849495Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9bfc3ec67f154d869dc1183f4bfdfe044a926a6bb726b117af446235cd7ac55b","observation_id":"b70f1138-bf58-4d61-b275-9cb707803da8","resolution":{"observed_at":"2026-08-12T05:31:02.246736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.225228Z","title":"Nesterov","venue":null,"work_id":"2c0d3654-b6d3-453d-b7d5-f07629056c6e","year":2013},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.854086Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:f007d64eb8fa9307c7b733cc8a06e160820149648dbf258ea1f150808b5a849f","observation_id":"66c30060-502c-422b-9ad4-d23e5270527a","resolution":{"observed_at":"2026-08-12T05:31:02.230471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:00.859404Z","title":"Numerical optimization","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.859404Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:10ef876cdb9b272f9a8f18aba5f725873fb0c99bef66ec348c2f42f21c6c4282","observation_id":"20a78351-236d-4d89-b181-18aefe03e9c0","resolution":{"observed_at":"2026-08-12T05:31:00.859404Z","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-12T05:31:00.863974Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.863974Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:d7cf4abc0b5e2d6b3202fed7896861f17350b8c078407ee0d04b41f29706b76d","observation_id":"3490aa15-d015-4f0e-8982-f19407fcd9bd","resolution":{"observed_at":"2026-08-12T05:31:00.863974Z","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-07-06T16:31:16.784700Z","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-12T05:31:00.868846Z","title":"In-context unlearning: Language models as few shot unlearners","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.868846Z"},"links":{"cited_paper":"/paper/2310.07579","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:a318608a7011676df2fba154fc4a18ebf53bea705234415fa414586c79e90aed","observation_id":"2baea320-ed96-4927-a538-74fe8b0d3092","resolution":{"observed_at":"2026-08-12T05:31:00.868846Z","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-12T05:31:02.185378Z","title":"Pazzani and Daniel Billsus","venue":null,"work_id":"78741b04-f1db-40aa-b2cd-6d2d88b8f30a","year":2007},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.874552Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:e4f5287fbb21e7a8c2b9e6c34009605d04f6e7c98da3557b568cad83111dea3f","observation_id":"6592d793-4fdb-436a-b9ae-7d013fd34abc","resolution":{"observed_at":"2026-08-12T05:31:02.191288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.167595Z","title":"Pearlmutter","venue":null,"work_id":"0eab2dae-c9cd-4d68-b6a8-6a338726ae6c","year":1994},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.880047Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:21fa9da02dd4a92782246c36523e5fddd42276b732867881b29bbffe3b397a65","observation_id":"e3f3d1cf-4f0c-4384-a9b6-994348e7879b","resolution":{"observed_at":"2026-08-12T05:31:02.173524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15779","last_updated":"2024-03-23T09:26:15Z","snapshot_observed_at":"2026-08-10T14:09:56.898119Z","submitted_at":"2024-03-23T09:26:15Z","title":"The Frontier of Data Erasure: Machine Unlearning for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15779","snapshot_observed_at":"2026-08-12T05:31:00.885017Z","title":"The frontier of data erasure: Machine unlearning for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.885017Z"},"links":{"cited_paper":"/paper/2403.15779","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:1b5adec56f4f54fe8ab9c190cab9ecfd2d12ab8177a0f9debe0d72dc8aea288f","observation_id":"a24ead87-95bb-4e8b-bfb5-eb5afcd067d2","resolution":{"observed_at":"2026-08-12T05:31:00.885017Z","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-12T05:31:00.890064Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.890064Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9775ad00de316fb6431e756e08b8ff109e1c14ad45529238bbc8d7c1240c5010","observation_id":"af6d0a38-dbe0-4632-af65-d466c7a91c20","resolution":{"observed_at":"2026-08-12T05:31:00.890064Z","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-12T05:31:02.140565Z","title":null,"venue":null,"work_id":"c8fcc6ce-2dab-46b1-9e3a-3fd8df64384f","year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.894587Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:684b7d56f457581f2503298848091030e3891c70a0720959a368ad374479ff8b","observation_id":"9d14afac-ae4b-459c-b99b-c1e3f1728e85","resolution":{"observed_at":"2026-08-12T05:31:02.146634Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.122260Z","title":"Remember what you want to forget: Algorithms for machine unlearning","venue":null,"work_id":"e13f89e7-3c88-4a6a-9aa6-1eb3c48aa5e9","year":2021},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.899745Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:f1663664c56bd097fc8d2bac67b6fb76ebdca83df84705b9402d2344d06cb8b9","observation_id":"5298a1b2-01ce-413d-a0f7-0be4efcea6b8","resolution":{"observed_at":"2026-08-12T05:31:02.128676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:00.904589Z","title":"Understanding Machine Learning - From Theory to Algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.904589Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:1d1d938f35cf84cc94f40f298ef6b33a26c32e422a3fdd403636c4fee7a13f57","observation_id":"985c31e5-1819-49d5-8f43-0c18da3b5e42","resolution":{"observed_at":"2026-08-12T05:31:00.904589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14809","last_updated":"2025-07-04T16:22:10Z","snapshot_observed_at":"2026-08-10T06:52:15.467669Z","submitted_at":"2024-04-23T07:39:24Z","title":"A Survey of Large Language Models on Generative Graph Analytics: Query, Learning, and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14809","snapshot_observed_at":"2026-08-12T05:31:00.909148Z","title":"A survey of large language models on generative graph analytics: Query, learning, and applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.909148Z"},"links":{"cited_paper":"/paper/2404.14809","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:91ed90b141fe94644a001e90b0b4c226bdaaea71c65054b81aa35805b37d4b1f","observation_id":"fe12166b-2bd2-478b-9dfe-d6184086360a","resolution":{"observed_at":"2026-08-12T05:31:00.909148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05441","last_updated":"2025-04-21T03:45:36Z","snapshot_observed_at":"2026-08-06T15:04:44.389327Z","submitted_at":"2024-07-07T17:05:24Z","title":"Language Representations Can be What Recommenders Need: Findings and Potentials","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05441","snapshot_observed_at":"2026-08-12T05:31:00.914907Z","title":"Language models encode collaborative signals in recommendation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.914907Z"},"links":{"cited_paper":"/paper/2407.05441","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b936bd2a1a13e86bb0c8965f4b9acc46c7a4b4b7b3b25a75b9d11ba1430f7aaa","observation_id":"77f43dc2-1d4d-433c-b312-39fab015ace9","resolution":{"observed_at":"2026-08-12T05:31:00.914907Z","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-12T05:31:00.920452Z","title":"An introduction to the conjugate gradient method without the agonizing pain","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.920452Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b2f8f715e15ff25b63e6149ebb1d5356426e1e95b33262240f903b0b10863551","observation_id":"8f7b13f1-b77d-40d7-8823-e54a4e6abdc5","resolution":{"observed_at":"2026-08-12T05:31:00.920452Z","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-12T05:31:02.073977Z","title":"Graphgpt: Graph instruction tuning for large language models","venue":null,"work_id":"b5458da8-48e5-4916-9d05-1555d3de9e1b","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.924987Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:2cd8c02a7d7bc0ceabe26f6eaa3fe334615063b8e1bcd13ec5d2b6f1931ef188","observation_id":"024d3d18-87ae-4e48-8e0b-9bc96d6814ea","resolution":{"observed_at":"2026-08-12T05:31:02.079625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-12T05:31:00.929933Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.929933Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:caf43862d8f43af9dde261053917751585a7ab0445ba69e52762c40defa81d62","observation_id":"9a648bc1-d3c1-4816-a4a7-25b3f608b693","resolution":{"observed_at":"2026-08-12T05:31:00.929933Z","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-12T05:31:00.935823Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.935823Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b53266b685b320e89f2f51632da8a89c9f54616128064ab200767b9655140fbc","observation_id":"1a73a2eb-3c53-4856-886d-7e050efcad8b","resolution":{"observed_at":"2026-08-12T05:31:00.935823Z","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-12T05:31:02.055434Z","title":"Statistical learning theory","venue":null,"work_id":"4e39560d-6a11-4c27-af18-9c98ec39399a","year":1998},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.941112Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:1ea2338ea55b9d9577cf334dced38c00764ae094f962f16442a32fb213002c90","observation_id":"7937c7ed-34bb-42e6-876b-e9de1ff61095","resolution":{"observed_at":"2026-08-12T05:31:02.061584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03536","last_updated":"2024-06-30T04:00:06Z","snapshot_observed_at":"2026-08-06T13:29:53.985027Z","submitted_at":"2024-03-06T08:31:35Z","title":"Towards Efficient and Effective Unlearning of Large Language Models for Recommendation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03536","snapshot_observed_at":"2026-08-12T05:31:00.945729Z","title":"Towards efficient and effective unlearning of large language models for recommendation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.945729Z"},"links":{"cited_paper":"/paper/2403.03536","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:71e2aac7115da7f2790dad912b85494a979c94af64ab9d62331a36fcc0089ab2","observation_id":"8699662c-7eb8-45e0-a8f0-6b472f5958e6","resolution":{"observed_at":"2026-08-12T05:31:00.945729Z","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-12T05:31:00.950656Z","title":"Zhao, Kelvin Guu, Adams Wei Yu, Brian Lester, Nan Du, Andrew M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.950656Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:8ce6cf938a8c9fd41deb2485134ae63d09ace49a5619c22bd3533b05bc087454","observation_id":"a16e6e49-7ff0-46a1-b299-3f883bc2b9e2","resolution":{"observed_at":"2026-08-12T05:31:00.950656Z","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-12T05:31:02.020812Z","title":"Graph convolution machine for context-aware recommender system","venue":null,"work_id":"c55896d0-4190-4381-a310-73ddce91c8c5","year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.955379Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:211faf88df3216a84f3631bdcc94da33352ed4a5edb228f584ff00a7547c6312","observation_id":"94f07666-bac9-4142-90f8-23201fb48fdb","resolution":{"observed_at":"2026-08-12T05:31:02.027373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:02.000255Z","title":"GIF: A general graph unlearning strategy via influence function","venue":null,"work_id":"a89c9a80-9fb4-4e92-8bf0-88066aa7d7de","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.960120Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:0e837ec53b55f801741efdd5568ef8894ba317b583f5fe8ce2c8c02876fec7fc","observation_id":"64701d24-7b7d-4823-9e31-5989681c066f","resolution":{"observed_at":"2026-08-12T05:31:02.007376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.984027Z","title":"On the effectiveness of sampled softmax loss for item recommendation","venue":null,"work_id":"7206b21b-43de-479e-bf26-676087f8c533","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.965016Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:d60a369e99dab95a6fc7647fb9f20c1d5e4a6afcbd8af108f609c0477dce4364","observation_id":"cb9b9798-e988-4c8f-b6e3-48fdb217e4d5","resolution":{"observed_at":"2026-08-12T05:31:01.988854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.967933Z","title":"\\( \\) -dpo: Direct preference optimization with dynamic \\( \\)","venue":null,"work_id":"89cf73d8-f803-4c4e-910a-549147120d65","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.970025Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:3c987759390f5d0e59ceac94841432ba073787d43d1e6b129e6bc08940853c3b","observation_id":"462a71dc-c8c3-4865-bef3-70f47339fcf6","resolution":{"observed_at":"2026-08-12T05:31:01.973391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.950744Z","title":"Evaluating and analyzing relationship hallucinations in large vision-language models","venue":null,"work_id":"461fc159-cc5f-4351-a86d-65027e31ee6c","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.975452Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:b4b1294a649e4c3947000f43933d9787a37fffeabc5577197b0357d92f73b265","observation_id":"f240397b-aa13-4d13-bf65-065b0bd29ac3","resolution":{"observed_at":"2026-08-12T05:31:01.956580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.933992Z","title":"Rethinking reinforcement learning for recommendation: A prompt perspective","venue":null,"work_id":"9c09aeda-5c6e-4e1f-bad5-ff13a0cb3c07","year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.980657Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:9fb76995446092155bec25cff49a30489206afc67397870ebcebe6a7f22e1f93","observation_id":"206ef86b-9e74-40b4-87c2-b1afcac4e381","resolution":{"observed_at":"2026-08-12T05:31:01.939336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01032","last_updated":"2024-06-03T06:33:51Z","snapshot_observed_at":"2026-08-04T12:12:08.959274Z","submitted_at":"2024-06-03T06:33:51Z","title":"LLM and GNN are Complementary: Distilling LLM for Multimodal Graph Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01032","snapshot_observed_at":"2026-08-12T05:31:00.985266Z","title":"LLM and GNN are complementary: Distilling LLM for multimodal graph learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.985266Z"},"links":{"cited_paper":"/paper/2406.01032","citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:621e0931f1db39f1ee9ff02567c7323c981bea540c100daf73f4fb931be0ed28","observation_id":"ca850fac-95e4-4d72-87f1-0a05833f1ce9","resolution":{"observed_at":"2026-08-12T05:31:00.985266Z","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-12T05:31:01.915098Z","title":"Hendler, Marzyeh Ghassemi, Anind K","venue":null,"work_id":"75c42e15-b71d-401d-b6d7-b3100069b858","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.990040Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:20dbb6a912575da31e3f79bda8eb0eac2cea82e6a77764d197565c87f501e785","observation_id":"925a1598-ee18-4e47-9e4f-f505f632f187","resolution":{"observed_at":"2026-08-12T05:31:01.921567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:00.995189Z","title":"Rehg, and Aidong Zhang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:00.995189Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:56b38ebf9f76a5aeac6bad65fb7fbacd4e4d65b78fc477367a095ff1f3066988","observation_id":"82093e8b-6ec7-4572-93de-3c2ea04619e3","resolution":{"observed_at":"2026-08-12T05:31:00.995189Z","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-12T05:31:01.896722Z","title":"Unlearning bias in language models by partitioning gradients","venue":null,"work_id":"7fa261c3-897c-4189-b8b8-7ee9f06f4bdd","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:01.000300Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:c7a1ad1ec547c1cb011b82b07d59fb869a3a8059042f96d9662a28e48b51a4e0","observation_id":"1a4eee4f-61d2-4a73-a76e-002696f9e8f3","resolution":{"observed_at":"2026-08-12T05:31:01.903000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.880252Z","title":"Bitfit: Simple parameter-efficient fine-tuning for transformer-based masked language-models","venue":null,"work_id":"80f5a75d-6534-4978-bbf6-18875438a77f","year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:01.005072Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:744326b2d50bc2b180ef462f4aec8db18499c5dcfa0b27515c383b2959fe9c80","observation_id":"8f239d14-e356-4663-8baf-53e4c5939bd1","resolution":{"observed_at":"2026-08-12T05:31:01.885631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.862565Z","title":"When scaling meets LLM finetuning: The effect of data, model and finetuning method","venue":null,"work_id":"ee7849d4-4b9e-4d74-9c25-c4e333ba6305","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:01.010116Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:4900b85f44b2d1ce6cecfa86744a43c86dcb3ec7ebeb2a7f66566d620ed9a843","observation_id":"306d8573-ba04-4ddf-ad07-94774b444aa8","resolution":{"observed_at":"2026-08-12T05:31:01.868292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.844939Z","title":"Adaptive budget allocation for parameter-efficient fine-tuning","venue":null,"work_id":"771b510c-0bae-4687-81f7-61af8c45d149","year":2023},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:01.014789Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:c0600d9c42845699b7cfa580662c5bce01936cf16d3af5f3fb30cfabf117399f","observation_id":"ceac35d2-4486-4748-b529-dcbab68f3ede","resolution":{"observed_at":"2026-08-12T05:31:01.850177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.828377Z","title":"Personalized lora for human-centered text understanding","venue":null,"work_id":"01f6feca-4528-4bea-9a30-4a5b3849e367","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:01.020629Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:f89e61737a81539653bd122e2477506135b11fcfd0fab31472e574f6480ae101","observation_id":"e010cdec-a85e-42d2-9b65-6a771edf5d56","resolution":{"observed_at":"2026-08-12T05:31:01.833340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.811021Z","title":"Adam can converge without any modification on update rules","venue":null,"work_id":"2308bee0-1906-46a3-97e6-dd65ff25fbbd","year":2022},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:01.025741Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:f5b001076a3cd84afc006988d34c42f25f0f31527382ec7c7bdfe6408821f9a7","observation_id":"ce5d0597-6ed1-455f-8b4c-90b0aa5a22e2","resolution":{"observed_at":"2026-08-12T05:31:01.816504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:31:01.792829Z","title":"Let me do it for you: Towards LLM empowered recommendation via tool learning","venue":null,"work_id":"5615d7e8-9be2-4c66-8796-47fd7097d9c2","year":2024},"citing_paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-12T05:31:01.030883Z"},"links":{"citing_paper":"/paper/2412.00383"},"observation_digest":"sha256:a9d7396bcc576cc012e4db2f556ce47f3c2663642c7577cef1c2f0857c5c4fad","observation_id":"662adcaa-5dbb-4aa4-86f8-d3e255870982","resolution":{"observed_at":"2026-08-12T05:31:01.798057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.00383","last_updated":"2025-04-18T06:58:12Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T05:24:08.670889Z","submitted_at":"2024-11-30T07:21:02Z","title":"Unified Parameter-Efficient Unlearning for LLMs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":59,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":105},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 105 outbound references and 2 inbound Pith citation observations for arXiv:2412.00383."}