{"as_of":"2026-08-16T19:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ae721617e580f2d802dace5221b3d48647b6121b9b60cb6197ad09a0f58000f5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-08-15T20:21:39.590621Z","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.071019Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.06621","last_updated":"2025-04-24T21:55:38Z","snapshot_observed_at":"2026-08-16T13:26:50.627099Z","submitted_at":"2024-08-13T04:18:32Z","title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06621","snapshot_observed_at":"2026-08-15T20:21:39.590621Z","title":"Towards robust and cost- efficient knowledge unlearning for large language models.arXiv preprint arXiv:2408.06621, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.13312","last_updated":"2025-05-19T16:26:58Z","snapshot_observed_at":"2026-08-16T02:44:31.161016Z","submitted_at":"2025-05-19T16:26:58Z","title":"GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:21:39.590621Z"},"links":{"cited_paper":"/paper/2408.06621","citing_paper":"/paper/2505.13312"},"observation_digest":"sha256:5f508f2a941d62a986ccc911b3da8160942111b09e89fd67ebfb58c9aa879201","observation_id":"63cac78f-caec-4c7c-b3ef-4849c6991a1a","resolution":{"observed_at":"2026-08-15T20:21:39.590621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06621","last_updated":"2025-04-24T21:55:38Z","snapshot_observed_at":"2026-08-16T13:26:50.627099Z","submitted_at":"2024-08-13T04:18:32Z","title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","version":5},"cited_work":{"arxiv_id":"2408.06621","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.06621","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"635ae5f5-bb4f-4e2d-a171-dc5141b3b5fb","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":6,"source":"pdf_text","source_observed_at":"2026-05-20T10:25:57.025905Z"},"links":{"cited_paper":"/paper/2408.06621","citing_paper":"/paper/2605.19042"},"observation_digest":"sha256:2263db91bfb9fd506994f01c9fa3aece384ccfbdd06089ebd4ac5ae7a3f1ef20","observation_id":"9beeed9c-a188-4c90-ba87-8201acad7de0","resolution":{"observed_at":"2026-05-20T10:28:12.072586Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.06621/citation-record","integrity":"/paper/2408.06621/integrity","json":"/paper/2408.06621/citation-record.json","paper":"/paper/2408.06621"},"outbound":[],"paper":{"arxiv_id":"2408.06621","last_updated":"2025-04-24T21:55:38Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:26:50.627099Z","submitted_at":"2024-08-13T04:18:32Z","title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.06621."}