{"as_of":"2026-08-09T15:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d86ecd70f6355c9627d16356d890e8f2b9cb435e65db52318b8b1faf1e2fcebf","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:00:38.984627Z","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-24T01:13:42.687417Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.09140","last_updated":"2022-10-28T20:02:59Z","snapshot_observed_at":"2026-07-06T13:22:16.721387Z","submitted_at":"2022-06-18T07:41:10Z","title":"Certified Graph Unlearning","version":2},"cited_work":{"arxiv_id":"2206.09140","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.09140","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Certified graph unlearning","venue":null,"work_id":"d5614521-5d90-425b-829a-3969d3bd8284","year":2022},"citing_paper":{"arxiv_id":"2310.12508","last_updated":"2024-04-04T07:45:38Z","snapshot_observed_at":"2026-08-03T17:30:25.153454Z","submitted_at":"2023-10-19T06:17:17Z","title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","version":5},"reference_index":221,"source":"arxiv_source","source_observed_at":"2026-05-16T17:56:23.281678Z"},"links":{"cited_paper":"/paper/2206.09140","citing_paper":"/paper/2310.12508"},"observation_digest":"sha256:f793cb7dfd635d3f711ad13a41c706c46fc5c9a7b9b492dd4787a6099f39cf78","observation_id":"38a1562e-494b-40bd-add2-a1dc73602e44","resolution":{"observed_at":"2026-05-16T17:56:23.577481Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2206.09140","last_updated":"2022-10-28T20:02:59Z","snapshot_observed_at":"2026-07-06T13:22:16.721387Z","submitted_at":"2022-06-18T07:41:10Z","title":"Certified Graph Unlearning","version":2},"cited_work":{"arxiv_id":"2206.09140","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.09140","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Certified graph unlearning","venue":null,"work_id":"d5614521-5d90-425b-829a-3969d3bd8284","year":2022},"citing_paper":{"arxiv_id":"2405.07406","last_updated":"2026-04-20T05:27:15Z","snapshot_observed_at":"2026-07-06T18:13:16.171803Z","submitted_at":"2024-05-13T00:58:34Z","title":"Machine Unlearning: A Comprehensive Survey","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-24T01:13:26.620111Z"},"links":{"cited_paper":"/paper/2206.09140","citing_paper":"/paper/2405.07406"},"observation_digest":"sha256:772a9f5eaf06adf3cef3294ab6c0d88809ae96ac9587d756e5fa4c53da9a1abd","observation_id":"4df1e20e-0dcd-4dd9-ac98-f4602f78ce77","resolution":{"observed_at":"2026-05-24T01:13:42.689763Z","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":"2206.09140","last_updated":"2022-10-28T20:02:59Z","snapshot_observed_at":"2026-07-06T13:22:16.721387Z","submitted_at":"2022-06-18T07:41:10Z","title":"Certified Graph Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09140","snapshot_observed_at":"2026-08-07T06:00:38.984627Z","title":"Certified graph unlearning, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.06985","last_updated":"2025-06-10T19:29:50Z","snapshot_observed_at":"2026-08-07T05:42:14.933753Z","submitted_at":"2025-06-08T03:55:28Z","title":"Certified Unlearning for Neural Networks","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T06:00:38.984627Z"},"links":{"cited_paper":"/paper/2206.09140","citing_paper":"/paper/2506.06985"},"observation_digest":"sha256:5f1916012ed00cd1d47a333d60f6e044c70bd81c8dc43cb6576ce43c44167e12","observation_id":"d98ea6c2-7041-4650-b20d-df9589d26a90","resolution":{"observed_at":"2026-08-07T06:00:38.984627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.09140","last_updated":"2022-10-28T20:02:59Z","snapshot_observed_at":"2026-07-06T13:22:16.721387Z","submitted_at":"2022-06-18T07:41:10Z","title":"Certified Graph Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09140","snapshot_observed_at":"2026-08-06T19:59:50.474309Z","title":"Certified graph unlearning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04219","last_updated":"2026-06-17T16:48:46Z","snapshot_observed_at":"2026-08-08T00:46:23.876584Z","submitted_at":"2025-07-06T03:08:49Z","title":"Model Collapse Is Not a Bug but a Feature in Machine Unlearning for LLMs","version":5},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-06T19:59:50.474309Z"},"links":{"cited_paper":"/paper/2206.09140","citing_paper":"/paper/2507.04219"},"observation_digest":"sha256:baa07239d909fe9e47f7140aa9abd886fe79c7703e94fc7750248119cc362850","observation_id":"78e72d34-2aec-43eb-8a6d-4c4359448a4d","resolution":{"observed_at":"2026-08-06T19:59:50.474309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.09140","last_updated":"2022-10-28T20:02:59Z","snapshot_observed_at":"2026-07-06T13:22:16.721387Z","submitted_at":"2022-06-18T07:41:10Z","title":"Certified Graph Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.09140","snapshot_observed_at":"2026-08-06T15:11:16.170460Z","title":"Available: https://arxiv.org/abs/2206.09140","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.16541","last_updated":"2025-07-22T12:49:24Z","snapshot_observed_at":"2026-08-07T22:03:21.200055Z","submitted_at":"2025-07-22T12:49:24Z","title":"A Comprehensive Data-centric Overview of Federated Graph Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T15:11:16.170460Z"},"links":{"cited_paper":"/paper/2206.09140","citing_paper":"/paper/2507.16541"},"observation_digest":"sha256:97052dcb06a11596584af086104853ff57880c7c088e5aa16421c64bd5db358b","observation_id":"56f81340-2526-4e8e-ac38-4f84c43f8ec9","resolution":{"observed_at":"2026-08-06T15:11:16.170460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.09140","last_updated":"2022-10-28T20:02:59Z","snapshot_observed_at":"2026-07-06T13:22:16.721387Z","submitted_at":"2022-06-18T07:41:10Z","title":"Certified Graph Unlearning","version":2},"cited_work":{"arxiv_id":"2206.09140","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.09140","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Certified graph unlearning","venue":null,"work_id":"d5614521-5d90-425b-829a-3969d3bd8284","year":2022},"citing_paper":{"arxiv_id":"2604.17396","last_updated":"2026-04-19T11:59:58Z","snapshot_observed_at":"2026-08-01T18:23:32.699442Z","submitted_at":"2026-04-19T11:59:58Z","title":"Representation-Guided Parameter-Efficient LLM Unlearning","version":1},"reference_index":144,"source":"arxiv_source","source_observed_at":"2026-05-10T06:01:46.885030Z"},"links":{"cited_paper":"/paper/2206.09140","citing_paper":"/paper/2604.17396"},"observation_digest":"sha256:52b5f73b199bd48b30da45ced6147ed6373442a7d544f7192361085d4ab93cd4","observation_id":"10011597-bb01-479a-bbfa-1545db87df82","resolution":{"observed_at":"2026-05-10T06:06:19.211339Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2206.09140/citation-record","integrity":"/paper/2206.09140/integrity","json":"/paper/2206.09140/citation-record.json","paper":"/paper/2206.09140"},"outbound":[],"paper":{"arxiv_id":"2206.09140","last_updated":"2022-10-28T20:02:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:22:16.721387Z","submitted_at":"2022-06-18T07:41:10Z","title":"Certified Graph 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 6 inbound Pith citation observations for arXiv:2206.09140."}