{"as_of":"2026-08-19T17:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eca4461fe9e2da2d1278a2d0e6fed4365e72262cf1bffd82ed75095467e82744","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-19T06:32:44.657259+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-15T17:46:03.248707Z","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-07T15:33:57.873481Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.16173","last_updated":"2024-06-08T06:50:47Z","snapshot_observed_at":"2026-08-18T18:34:20.862529Z","submitted_at":"2023-09-28T05:09:14Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16173","snapshot_observed_at":"2026-08-10T22:10:05.452249Z","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":61,"source":"pdf_text","source_observed_at":"2026-08-10T22:10:05.452249Z"},"links":{"cited_paper":"/paper/2309.16173","citing_paper":"/paper/2501.02728"},"observation_digest":"sha256:0640e4085f340215ec597e128fb43e50c00774c16f95c8afae10874a0c13a637","observation_id":"aac8da67-9ee2-4311-b72e-702be96e6a64","resolution":{"observed_at":"2026-08-10T22:10:05.452249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16173","last_updated":"2024-06-08T06:50:47Z","snapshot_observed_at":"2026-08-18T18:34:20.862529Z","submitted_at":"2023-09-28T05:09:14Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16173","snapshot_observed_at":"2026-08-10T17:55:15.764488Z","title":null,"venue":null,"work_id":null,"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":41,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.764488Z"},"links":{"cited_paper":"/paper/2309.16173","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:a45474edc750c2b95152d8cfb4274c96b07f2719dd0dfe7aeb7db7ebb06dd383","observation_id":"edcf94d3-185b-4742-b07a-e4cc5384ab89","resolution":{"observed_at":"2026-08-10T17:55:15.764488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16173","last_updated":"2024-06-08T06:50:47Z","snapshot_observed_at":"2026-08-18T18:34:20.862529Z","submitted_at":"2023-09-28T05:09:14Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","version":2},"cited_work":{"arxiv_id":"2309.16173","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.16173","snapshot_observed_at":"2026-08-07T15:33:57.873481Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","venue":"cs.LG","work_id":"2a3cae74-a06d-457a-8860-4b58b6597343","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-18T01:02:34.213431Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.970424Z"},"links":{"cited_paper":"/paper/2309.16173","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:ed57c59ce2e63beedaaa0b68e4c31abc3b0454c1d277d158f4a870d9993b8df9","observation_id":"9f05ad0e-8bd9-4748-bf6a-fb9ed0133a31","resolution":{"observed_at":"2026-08-07T15:33:58.008761Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16173","last_updated":"2024-06-08T06:50:47Z","snapshot_observed_at":"2026-08-18T18:34:20.862529Z","submitted_at":"2023-09-28T05:09:14Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16173","snapshot_observed_at":"2026-08-15T17:46:03.248707Z","title":"Distill to delete: unlearning in graph networks with knowledge distillation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20566","last_updated":"2025-07-28T07:03:04Z","snapshot_observed_at":"2026-08-17T20:50:06.404331Z","submitted_at":"2025-07-28T07:03:04Z","title":"Unlearning of Knowledge Graph Embedding via Preference Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T17:46:03.248707Z"},"links":{"cited_paper":"/paper/2309.16173","citing_paper":"/paper/2507.20566"},"observation_digest":"sha256:dab47a38c1e767dc610c07e10cd71bf645b65b1191ba2d865543c77fea630a03","observation_id":"ffdfeb4a-984c-4582-b499-6be11c03bd53","resolution":{"observed_at":"2026-08-15T17:46:03.248707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.16173/citation-record","integrity":"/paper/2309.16173/integrity","json":"/paper/2309.16173/citation-record.json","paper":"/paper/2309.16173"},"outbound":[],"paper":{"arxiv_id":"2309.16173","last_updated":"2024-06-08T06:50:47Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T18:34:20.862529Z","submitted_at":"2023-09-28T05:09:14Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2309.16173."}