Paper Citation Record · LEDGER

Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2309.16173 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T17:46:03.248707Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-07T15:33:57.873481Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation aac8da67-9ee2-4311-b72e-702be96e6a64 · inbound

OpenGU: A Comprehensive Benchmark for Graph Unlearning cites this paper.

OpenGU: A Comprehensive Benchmark for Graph Unlearning Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-10T22:10:05.452249Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edcf94d3-185b-4742-b07a-e4cc5384ab89 · inbound

Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach cites this paper.

Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-10T17:55:15.764488Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f05ad0e-8bd9-4748-bf6a-fb9ed0133a31 · inbound

Unlearning Algorithmic Biases over Graphs cites this paper.

Unlearning Algorithmic Biases over Graphs Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation

Reference 29

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:33:58.008761Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ffdfeb4a-984c-4582-b499-6be11c03bd53 · inbound

Unlearning of Knowledge Graph Embedding via Preference Optimization cites this paper.

Unlearning of Knowledge Graph Embedding via Preference Optimization Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-15T17:46:03.248707Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.