{"as_of":"2026-08-20T19:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2682bfa39e499447ba7c5cbd47d3b9cb5728c8131273a94c596b5e8f2972c45","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:10:05.578707Z","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-19T09:37:14.148922Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.09212","last_updated":"2025-02-18T01:24:24Z","snapshot_observed_at":"2026-08-16T13:25:50.641931Z","submitted_at":"2024-08-17T14:41:02Z","title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09212","snapshot_observed_at":"2026-08-10T22:10:05.578707Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.02728","last_updated":"2025-01-06T02:57:32Z","snapshot_observed_at":"2026-08-15T10:44:24.301125Z","submitted_at":"2025-01-06T02:57:32Z","title":"OpenGU: A Comprehensive Benchmark for Graph Unlearning","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-10T22:10:05.578707Z"},"links":{"cited_paper":"/paper/2408.09212","citing_paper":"/paper/2501.02728"},"observation_digest":"sha256:a57aa2f617c6b1235ce615ba792f55e1aaa0bce3cea337930ce9d7b68ccf1db0","observation_id":"806638fb-7005-4be2-ba9e-040c2a4927d3","resolution":{"observed_at":"2026-08-10T22:10:05.578707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09212","last_updated":"2025-02-18T01:24:24Z","snapshot_observed_at":"2026-08-16T13:25:50.641931Z","submitted_at":"2024-08-17T14:41:02Z","title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09212","snapshot_observed_at":"2026-08-10T17:55:15.849416Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.849416Z"},"links":{"cited_paper":"/paper/2408.09212","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:784bc7b44423e5d05ef3742f892227b69f7d55710370f4e804538e68d9e0ad70","observation_id":"03d2bec5-5d0e-45aa-b99c-8e572a8f6312","resolution":{"observed_at":"2026-08-10T17:55:15.849416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09212","last_updated":"2025-02-18T01:24:24Z","snapshot_observed_at":"2026-08-16T13:25:50.641931Z","submitted_at":"2024-08-17T14:41:02Z","title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier","version":3},"cited_work":{"arxiv_id":"2408.09212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09212","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8afd7ca9-b5c6-49f5-8b4d-72f34e127025","year":2024},"citing_paper":{"arxiv_id":"2506.15115","last_updated":"2026-04-07T04:34:06Z","snapshot_observed_at":"2026-08-12T16:15:21.165975Z","submitted_at":"2025-06-18T03:33:59Z","title":"Towards Reliable Forgetting: A Survey on Machine Unlearning Verification","version":3},"reference_index":120,"source":"pdf_text","source_observed_at":"2026-05-19T09:35:00.520860Z"},"links":{"cited_paper":"/paper/2408.09212","citing_paper":"/paper/2506.15115"},"observation_digest":"sha256:8374a78b9a03cfcfc5e42ca771ce5e0cfc285b553496fa2d6e9e23c184e79617","observation_id":"fc64c3ad-83f5-4330-bd7a-b1b636c78d93","resolution":{"observed_at":"2026-05-19T09:37:14.150440Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09212","last_updated":"2025-02-18T01:24:24Z","snapshot_observed_at":"2026-08-16T13:25:50.641931Z","submitted_at":"2024-08-17T14:41:02Z","title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier","version":3},"cited_work":{"arxiv_id":"2408.09212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09212","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8afd7ca9-b5c6-49f5-8b4d-72f34e127025","year":2024},"citing_paper":{"arxiv_id":"2604.02183","last_updated":"2026-08-06T04:54:16Z","snapshot_observed_at":"2026-08-11T12:55:18.996286Z","submitted_at":"2026-04-02T15:45:03Z","title":"TRU: Targeted Reverse Update for Efficient Multimodal Recommendation Unlearning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-13T21:08:04.309025Z"},"links":{"cited_paper":"/paper/2408.09212","citing_paper":"/paper/2604.02183"},"observation_digest":"sha256:16da006e7a81da2c5a429f4232e4e1b8e0337a6ce7d02d5aff654493e3b072d1","observation_id":"b2b0fa12-a215-4c94-a3f8-b3527c626d67","resolution":{"observed_at":"2026-05-13T21:08:17.005597Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.09212/citation-record","integrity":"/paper/2408.09212/integrity","json":"/paper/2408.09212/citation-record.json","paper":"/paper/2408.09212"},"outbound":[],"paper":{"arxiv_id":"2408.09212","last_updated":"2025-02-18T01:24:24Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:25:50.641931Z","submitted_at":"2024-08-17T14:41:02Z","title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2408.09212."}