{"as_of":"2026-08-18T18:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00c6fe4710c4e85aab2acd2f678ce71e257d77cf0b21c848708440c17ccb9534","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-18T06:34:40.430872+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-05T17:56:10.318406Z","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-18T10:46:17.106028Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.14091","last_updated":"2024-06-20T08:12:49Z","snapshot_observed_at":"2026-08-18T15:49:37.685631Z","submitted_at":"2024-06-20T08:12:49Z","title":"Protecting Privacy Through Approximating Optimal Parameters for Sequence Unlearning in Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14091","snapshot_observed_at":"2026-08-05T17:56:10.318406Z","title":"Protecting privacy through approximating optimal parameters for sequence unlearning in language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.15449","last_updated":"2025-08-21T11:12:09Z","snapshot_observed_at":"2026-08-18T14:56:57.391211Z","submitted_at":"2025-08-21T11:12:09Z","title":"Reliable Unlearning Harmful Information in LLMs with Metamorphosis Representation Projection","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T17:56:10.318406Z"},"links":{"cited_paper":"/paper/2406.14091","citing_paper":"/paper/2508.15449"},"observation_digest":"sha256:d5832586b66b65cbb67672f6a23368ba1f36ae37123275bffb3f775a25e75b11","observation_id":"9c0885d9-27d2-46a7-88f0-6dbac6152efc","resolution":{"observed_at":"2026-08-05T17:56:10.318406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14091","last_updated":"2024-06-20T08:12:49Z","snapshot_observed_at":"2026-08-18T15:49:37.685631Z","submitted_at":"2024-06-20T08:12:49Z","title":"Protecting Privacy Through Approximating Optimal Parameters for Sequence Unlearning in Language Models","version":1},"cited_work":{"arxiv_id":"2406.14091","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14091","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"DEPN: Detecting and editing privacy neurons in pretrained language models","venue":null,"work_id":"66ccac30-3bfb-4090-bf9f-c9fcb3a39138","year":2023},"citing_paper":{"arxiv_id":"2510.00761","last_updated":"2026-04-18T07:30:06Z","snapshot_observed_at":"2026-08-16T07:19:23.004984Z","submitted_at":"2025-10-01T10:50:14Z","title":"Downgrade to Upgrade: Optimizer Simplification Enhances Robustness in LLM Unlearning","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-18T10:44:53.516653Z"},"links":{"cited_paper":"/paper/2406.14091","citing_paper":"/paper/2510.00761"},"observation_digest":"sha256:17bc90dd31c9da78a117a89b286843c58173e7ccada6d2289f43782e3b635009","observation_id":"65264ae3-597f-463c-b45f-cd3669042ec7","resolution":{"observed_at":"2026-05-18T10:46:17.108617Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.14091/citation-record","integrity":"/paper/2406.14091/integrity","json":"/paper/2406.14091/citation-record.json","paper":"/paper/2406.14091"},"outbound":[],"paper":{"arxiv_id":"2406.14091","last_updated":"2024-06-20T08:12:49Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T15:49:37.685631Z","submitted_at":"2024-06-20T08:12:49Z","title":"Protecting Privacy Through Approximating Optimal Parameters for Sequence Unlearning in Language Models"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.14091."}