{"as_of":"2026-08-22T22:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cfe11f277973783cf8cd4b4855125972ef67f4390ed29718117abb7de41a301e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:16:50.460021Z","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-18T13:06:23.502715Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22086","snapshot_observed_at":"2026-08-16T12:16:50.460021Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13388","last_updated":"2025-04-18T00:34:19Z","snapshot_observed_at":"2026-08-17T20:03:52.020509Z","submitted_at":"2025-04-18T00:34:19Z","title":"A mean teacher algorithm for unlearning of language models","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T12:16:50.460021Z"},"links":{"cited_paper":"/paper/2410.22086","citing_paper":"/paper/2504.13388"},"observation_digest":"sha256:31e3ccc537ce2b4a125974c6d1bde3fa1f669fc03d3b1dc5c4d313a1b8bd2a22","observation_id":"2c0264e7-727a-4c98-84e3-6ef488dcb208","resolution":{"observed_at":"2026-08-16T12:16:50.460021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22086","snapshot_observed_at":"2026-08-07T12:03:32.972167Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00876","last_updated":"2025-06-01T07:36:45Z","snapshot_observed_at":"2026-08-19T19:58:16.135294Z","submitted_at":"2025-06-01T07:36:45Z","title":"Not Every Token Needs Forgetting: Selective Unlearning to Limit Change in Utility in Large Language Model Unlearning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:03:32.972167Z"},"links":{"cited_paper":"/paper/2410.22086","citing_paper":"/paper/2506.00876"},"observation_digest":"sha256:89b0462d074d2a6284faf996968b1d8fe1de12d6ddc793c77c95022bb708242c","observation_id":"2e051496-4f74-47e7-b95d-80b90dcd5000","resolution":{"observed_at":"2026-08-07T12:03:32.972167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22086","snapshot_observed_at":"2026-08-07T04:58:48.482633Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.09227","last_updated":"2025-06-10T20:30:39Z","snapshot_observed_at":"2026-08-14T07:33:23.070386Z","submitted_at":"2025-06-10T20:30:39Z","title":"SoK: Machine Unlearning for Large Language Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:58:48.482633Z"},"links":{"cited_paper":"/paper/2410.22086","citing_paper":"/paper/2506.09227"},"observation_digest":"sha256:7ab9b48fadefacae363ccb9c2aed5ceb77172fba51179e4d35e705a8f77811d4","observation_id":"98a8f17d-f918-48f3-8596-d8cc038a5684","resolution":{"observed_at":"2026-08-07T04:58:48.482633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","version":3},"cited_work":{"arxiv_id":"2410.22086","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22086","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Unlearning as multi-task optimization: A normalized gradient dif- ference approach with an adaptive learning rate.arXiv preprint arXiv:2410.22086","venue":null,"work_id":"43e7a894-da02-4a42-b6c2-89357b886c51","year":null},"citing_paper":{"arxiv_id":"2509.22483","last_updated":"2026-06-21T22:45:05Z","snapshot_observed_at":"2026-08-15T15:41:43.011812Z","submitted_at":"2025-09-26T15:31:32Z","title":"OFMU: Optimization-Driven Framework for Machine Unlearning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T13:05:50.233483Z"},"links":{"cited_paper":"/paper/2410.22086","citing_paper":"/paper/2509.22483"},"observation_digest":"sha256:cfed71fcefa5b7087fcecaf07477ed72bbb757d2b5454f3e4ae68bd1fb1e9893","observation_id":"26f2529c-d1eb-4529-8a7c-589116b905a9","resolution":{"observed_at":"2026-05-18T13:06:23.506306Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22086","snapshot_observed_at":"2026-08-15T15:49:41.220056Z","title":"Unlearning as multi-task optimization: A normalized gradient dif- ference approach with an adaptive learning rate.arXiv preprint arXiv:2410.22086,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.22483","last_updated":"2026-06-21T22:45:05Z","snapshot_observed_at":"2026-08-15T15:41:43.011812Z","submitted_at":"2025-09-26T15:31:32Z","title":"OFMU: Optimization-Driven Framework for Machine Unlearning","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:41.220056Z"},"links":{"cited_paper":"/paper/2410.22086","citing_paper":"/paper/2509.22483"},"observation_digest":"sha256:61fa60abae3d5d5548072d6bf71de0eb25e9d563e794c321450d2f01db9cf1da","observation_id":"3cfae992-8233-4610-bfbd-4beb9d159b33","resolution":{"observed_at":"2026-08-15T15:49:41.220056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22086","snapshot_observed_at":"2026-08-03T23:39:04.249213Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate.arXiv preprint arXiv:2410.22086, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.04934","last_updated":"2026-05-27T18:09:51Z","snapshot_observed_at":"2026-08-15T06:19:16.949294Z","submitted_at":"2025-11-07T02:30:05Z","title":"Leak@$k$: Unlearning Does Not Make LLMs Forget Under Probabilistic Decoding","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T23:39:04.249213Z"},"links":{"cited_paper":"/paper/2410.22086","citing_paper":"/paper/2511.04934"},"observation_digest":"sha256:3dd78ce816dba31c2f4b3a9acf05dcc43ce09e4ef116d4d0250f67e012ea5ac5","observation_id":"acbd3bd6-e3de-495f-92b0-cf8921f5a2e2","resolution":{"observed_at":"2026-08-03T23:39:04.249213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22086","snapshot_observed_at":"2026-08-02T10:25:19.787330Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate.arXiv preprint arXiv:2410.22086, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16227","last_updated":"2026-06-23T00:17:34Z","snapshot_observed_at":"2026-08-21T12:19:49.656553Z","submitted_at":"2026-06-23T00:17:34Z","title":"LLM Unlearning for Cyber Defense: A Survey on Methods, Challenges, and Emerging Threats","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-02T10:25:19.787330Z"},"links":{"cited_paper":"/paper/2410.22086","citing_paper":"/paper/2607.16227"},"observation_digest":"sha256:0821070c9c0c337fe4b14d923c5c28e04a28778376ccaaa9c640e2924ab43f99","observation_id":"aba463ea-85de-4889-80c2-77b9307c5b78","resolution":{"observed_at":"2026-08-02T10:25:19.787330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.22086/citation-record","integrity":"/paper/2410.22086/integrity","json":"/paper/2410.22086/citation-record.json","paper":"/paper/2410.22086"},"outbound":[],"paper":{"arxiv_id":"2410.22086","last_updated":"2025-05-06T00:58:15Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T06:04:57.506197Z","submitted_at":"2024-10-29T14:41:44Z","title":"Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2410.22086."}