{"as_of":"2026-08-09T20:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bff7359019edd2bc3faf44b765560f1aab0dfe05ab0f07e9e8c576928d19925d","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-09T06:31:02.800959+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-07T13:01:33.203487Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T00:19:13.812709Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16257","snapshot_observed_at":"2026-08-07T06:14:42.256207Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06073","last_updated":"2025-06-06T13:30:40Z","snapshot_observed_at":"2026-08-09T06:48:32.366807Z","submitted_at":"2025-06-06T13:30:40Z","title":"System-Aware Unlearning Algorithms: Use Lesser, Forget Faster","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T06:14:42.256207Z"},"links":{"cited_paper":"/paper/2406.16257","citing_paper":"/paper/2506.06073"},"observation_digest":"sha256:a0b0621a18f5e2104bca3c44e4a5b7977f376b162dd692b4f1ba2b2dfaa9433c","observation_id":"b7a8716a-f427-4034-83d1-ab562330eafa","resolution":{"observed_at":"2026-08-07T06:14:42.256207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16257","snapshot_observed_at":"2026-08-07T04:22:59.819768Z","title":"Towards scalable exact machine unlearning using parameter- efficient fine-tuning.arXiv preprint arXiv:2406.16257,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12097","last_updated":"2025-06-12T16:02:26Z","snapshot_observed_at":"2026-08-08T00:24:18.521628Z","submitted_at":"2025-06-12T16:02:26Z","title":"UCD: Unlearning in LLMs via Contrastive Decoding","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:59.819768Z"},"links":{"cited_paper":"/paper/2406.16257","citing_paper":"/paper/2506.12097"},"observation_digest":"sha256:23dc273b2f2de9bfba12992edb4b9e23f27e9ba907945ebbe6d998effb274711","observation_id":"103e6e45-fb35-4abe-a527-3646daba9f93","resolution":{"observed_at":"2026-08-07T04:22:59.819768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16257","snapshot_observed_at":"2026-08-07T13:01:33.203487Z","title":"Towards scalable exact machine unlearning using parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.15699","last_updated":"2025-05-28T22:09:04Z","snapshot_observed_at":"2026-08-08T00:44:36.684751Z","submitted_at":"2025-05-28T22:09:04Z","title":"BLUR: A Benchmark for LLM Unlearning Robust to Forget-Retain Overlap","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:01:33.203487Z"},"links":{"cited_paper":"/paper/2406.16257","citing_paper":"/paper/2506.15699"},"observation_digest":"sha256:be25c8353a3923a8b8e53ae9b90dc379b856bd3a2b726b52fb1b1f23ab26c9aa","observation_id":"a0f69f10-61a1-44ad-9f5c-9bbf55b8b101","resolution":{"observed_at":"2026-08-07T13:01:33.203487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":"2406.16257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16257","snapshot_observed_at":"2026-07-04T00:19:13.812709Z","title":"Towards scalable exact machine unlearning using parameter-efficient fine-tuning","venue":null,"work_id":"db095323-f51b-4c8f-a39e-114649a68e90","year":2025},"citing_paper":{"arxiv_id":"2506.20941","last_updated":"2026-04-27T18:06:07Z","snapshot_observed_at":"2026-08-02T21:32:45.612265Z","submitted_at":"2025-06-26T02:16:16Z","title":"Revisiting the Past: Data Unlearning with Model State History","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T08:12:19.391973Z"},"links":{"cited_paper":"/paper/2406.16257","citing_paper":"/paper/2506.20941"},"observation_digest":"sha256:d99e30990574ce77ae56ef063b0cdc1d3297eb89f87d689728bc54cabb0e8016","observation_id":"3a9b28ad-500f-447c-92b3-7401a64d5bac","resolution":{"observed_at":"2026-05-19T08:13:01.630624Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":"2406.16257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16257","snapshot_observed_at":"2026-07-04T00:19:13.812709Z","title":"Towards scalable exact machine unlearning using parameter-efficient fine-tuning","venue":null,"work_id":"db095323-f51b-4c8f-a39e-114649a68e90","year":2025},"citing_paper":{"arxiv_id":"2509.05865","last_updated":"2026-05-04T07:35:03Z","snapshot_observed_at":"2026-08-02T11:20:30.767747Z","submitted_at":"2025-09-06T23:44:05Z","title":"The Measure of Deception: An Analysis of Data Forging in Machine Unlearning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T17:40:20.637543Z"},"links":{"cited_paper":"/paper/2406.16257","citing_paper":"/paper/2509.05865"},"observation_digest":"sha256:4f25a0116274f10eeb4fa3d37628b22d8969c6f81921a8b20314a07410e637eb","observation_id":"47453586-a83c-4628-9fce-dab7447d229b","resolution":{"observed_at":"2026-05-18T17:42:47.372475Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":"2406.16257","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16257","snapshot_observed_at":"2026-07-04T00:19:13.812709Z","title":"Towards scalable exact machine unlearning using parameter-efficient fine-tuning","venue":null,"work_id":"db095323-f51b-4c8f-a39e-114649a68e90","year":2025},"citing_paper":{"arxiv_id":"2606.19220","last_updated":"2026-06-17T15:57:43Z","snapshot_observed_at":"2026-08-06T02:55:30.485540Z","submitted_at":"2026-06-17T15:57:43Z","title":"Machine Unlearning for the XGBoost Model with Network Intrusion Datasets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T21:16:18.607908Z"},"links":{"cited_paper":"/paper/2406.16257","citing_paper":"/paper/2606.19220"},"observation_digest":"sha256:8a08ae6f81e3d67cf86a5aaa10c2a28419293cab0a1a52c5bf456fe63d23dc01","observation_id":"b6b4ed1e-7d93-473d-b528-fea30e2e3e76","resolution":{"observed_at":"2026-07-04T00:19:13.814168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16257","snapshot_observed_at":"2026-07-31T23:34:00.184735Z","title":"arXiv preprint arXiv:2406.16257 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23934","last_updated":"2026-07-27T02:11:58Z","snapshot_observed_at":"2026-08-07T14:21:47.373100Z","submitted_at":"2026-07-27T02:11:58Z","title":"DECAF: De-Clustering for Adaptive Representational Unlearning","version":1},"reference_index":119,"source":"arxiv_source","source_observed_at":"2026-07-31T23:34:00.184735Z"},"links":{"cited_paper":"/paper/2406.16257","citing_paper":"/paper/2607.23934"},"observation_digest":"sha256:b013cceff51dd4b7984042430961e7c8d9b19e32f5469fa1ec4ec355b9ee1c30","observation_id":"58265f02-b8eb-4688-bc97-fc0d5241e4bd","resolution":{"observed_at":"2026-07-31T23:34:00.184735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.16257/citation-record","integrity":"/paper/2406.16257/integrity","json":"/paper/2406.16257/citation-record.json","paper":"/paper/2406.16257"},"outbound":[],"paper":{"arxiv_id":"2406.16257","last_updated":"2025-03-03T15:29:41Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:35:45.699877Z","submitted_at":"2024-06-24T01:45:13Z","title":"Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2406.16257."}