{"as_of":"2026-08-09T22:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:735b64ad64c706fd6a400bf420398e4c102c06405897c8fb44c600f7fc741bb2","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:50:58.731524Z","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-13T08:09:13.195946Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.08947","last_updated":"2023-05-31T17:42:15Z","snapshot_observed_at":"2026-07-06T12:09:23.278166Z","submitted_at":"2021-11-17T07:29:24Z","title":"Fast Yet Effective Machine Unlearning","version":5},"cited_work":{"arxiv_id":"2111.08947","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.08947","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast yet effective machine unlearning","venue":null,"work_id":"97469336-fdf6-428e-9ca1-df0dae53691a","year":2021},"citing_paper":{"arxiv_id":"2212.04089","last_updated":"2023-03-31T15:27:01Z","snapshot_observed_at":"2026-08-03T22:12:27.993418Z","submitted_at":"2022-12-08T05:50:53Z","title":"Editing Models with Task Arithmetic","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-05-13T08:09:12.716163Z"},"links":{"cited_paper":"/paper/2111.08947","citing_paper":"/paper/2212.04089"},"observation_digest":"sha256:2052a586b82878b1576fea1f588a4506be4db4192cdc6473b05894ca5872f4ed","observation_id":"7ac54cd7-d0fd-4fd9-8390-f608e27ddf1a","resolution":{"observed_at":"2026-05-13T08:09:13.200145Z","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":"2111.08947","last_updated":"2023-05-31T17:42:15Z","snapshot_observed_at":"2026-07-06T12:09:23.278166Z","submitted_at":"2021-11-17T07:29:24Z","title":"Fast Yet Effective Machine Unlearning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.08947","snapshot_observed_at":"2026-08-09T14:50:58.731524Z","title":"K., Chundawat, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01634","last_updated":"2025-02-03T18:59:04Z","snapshot_observed_at":"2026-08-09T14:42:18.267699Z","submitted_at":"2025-02-03T18:59:04Z","title":"Online Gradient Boosting Decision Tree: In-Place Updates for Efficient Adding/Deleting Data","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T14:50:58.731524Z"},"links":{"cited_paper":"/paper/2111.08947","citing_paper":"/paper/2502.01634"},"observation_digest":"sha256:aff3aa0c292db15144775afab345df2ffc3a17c824f7d6773fed959004097ac0","observation_id":"43cef25a-1741-4b12-bedb-f4ea2b39657c","resolution":{"observed_at":"2026-08-09T14:50:58.731524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.08947","last_updated":"2023-05-31T17:42:15Z","snapshot_observed_at":"2026-07-06T12:09:23.278166Z","submitted_at":"2021-11-17T07:29:24Z","title":"Fast Yet Effective Machine Unlearning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.08947","snapshot_observed_at":"2026-08-07T06:04:52.961021Z","title":"Tarun, Vikram S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.06112","last_updated":"2025-06-06T14:22:18Z","snapshot_observed_at":"2026-08-09T13:44:33.556430Z","submitted_at":"2025-06-06T14:22:18Z","title":"Towards Lifecycle Unlearning Commitment Management: Measuring Sample-level Unlearning Completeness","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:52.961021Z"},"links":{"cited_paper":"/paper/2111.08947","citing_paper":"/paper/2506.06112"},"observation_digest":"sha256:6ecfdff4a02c8425b9adc4e5090bc875c9a35349d73f1f46af23f30a668f0db1","observation_id":"62faa285-5b79-423b-a624-6c54e55d7cf0","resolution":{"observed_at":"2026-08-07T06:04:52.961021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2111.08947/citation-record","integrity":"/paper/2111.08947/integrity","json":"/paper/2111.08947/citation-record.json","paper":"/paper/2111.08947"},"outbound":[],"paper":{"arxiv_id":"2111.08947","last_updated":"2023-05-31T17:42:15Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:09:23.278166Z","submitted_at":"2021-11-17T07:29:24Z","title":"Fast Yet Effective Machine Unlearning"},"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 3 inbound Pith citation observations for arXiv:2111.08947."}