{"as_of":"2026-08-20T19:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0dbedfffa2f5b54a330bb180e83bd08f8b55e07e17075fec45722547dbbb756c","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-20T06:33:59.587034+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-10T22:10:05.502527Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T17:55:16.011003Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.03093","last_updated":"2023-04-07T05:59:48Z","snapshot_observed_at":"2026-08-18T10:47:20.480694Z","submitted_at":"2023-04-06T14:21:48Z","title":"Inductive Graph Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.03093","snapshot_observed_at":"2026-08-10T22:10:05.502527Z","title":null,"venue":null,"work_id":null,"year":2023},"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":70,"source":"pdf_text","source_observed_at":"2026-08-10T22:10:05.502527Z"},"links":{"cited_paper":"/paper/2304.03093","citing_paper":"/paper/2501.02728"},"observation_digest":"sha256:270046f43f8bee16835e03021b0c84da704f90628628354ff99f2bcb535b1ce3","observation_id":"a6374e9d-50de-452d-822f-39f07e03b344","resolution":{"observed_at":"2026-08-10T22:10:05.502527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.03093","last_updated":"2023-04-07T05:59:48Z","snapshot_observed_at":"2026-08-18T10:47:20.480694Z","submitted_at":"2023-04-06T14:21:48Z","title":"Inductive Graph Unlearning","version":2},"cited_work":{"arxiv_id":"2304.03093","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.03093","snapshot_observed_at":"2026-08-10T17:55:16.011003Z","title":"Inductive Graph Unlearning","venue":"cs.LG","work_id":"c1b36b76-708c-41d3-afde-5f77fd7234f8","year":2023},"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":46,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.787451Z"},"links":{"cited_paper":"/paper/2304.03093","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:c88ea97480d3691eeed45a8fd143cbff876a041a0c6156b1e243035bf5459f8f","observation_id":"bb7fae58-e21f-4644-944a-3214048bc546","resolution":{"observed_at":"2026-08-10T17:55:16.017299Z","resolver_source":"local_arxiv","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/2304.03093/citation-record","integrity":"/paper/2304.03093/integrity","json":"/paper/2304.03093/citation-record.json","paper":"/paper/2304.03093"},"outbound":[],"paper":{"arxiv_id":"2304.03093","last_updated":"2023-04-07T05:59:48Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T10:47:20.480694Z","submitted_at":"2023-04-06T14:21:48Z","title":"Inductive 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-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 2 inbound Pith citation observations for arXiv:2304.03093."}