Paper Citation Record · LEDGER

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning

As of 13 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2509.00735.

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

pith.paper-citation-record.v1
2509.00735 v1

Coverage vector

measured 15 of 15 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T13:23:08.574382Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

15 of 15 outbound references displayed

verified exact0
verified fuzzy3
unresolved7
parse uncertain0
malformed identifier1
metadata mismatch4

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 14105287-48af-4a73-be7c-6dbbf3adf43c · outbound

This paper cites Inductive Representation Learning on Large Graphs.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Inductive Representation Learning on Large Graphs

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-05T13:23:08.525457Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cffa4b54-8fde-4dc0-9607-c0785445e918 · outbound

This paper cites Towards Robust Graph Incremental Learning on Evolving Graphs.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Towards Robust Graph Incremental Learning on Evolving Graphs

Reference 9

Resolution: metadata mismatch; local_arxiv, observed 2026-08-05T13:23:08.638734Z

Source-reported events for the cited work

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

Observation 4a29ea96-ff1f-4b38-9b2b-603e1464e2b5 · outbound

This paper cites Continual Learning on Graphs: A Survey.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Continual Learning on Graphs: A Survey

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-05T13:23:08.555719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c14cbb49-3164-4966-b8b6-140a40d15e8f · outbound

This paper cites 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 13709–13718.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 13709–13718

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:23:08.785291Z

Source-reported events for the cited work

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

Observation 19e002cf-30e8-493b-965d-f4d5e7909f79 · outbound

This paper cites IEEE Transactions on Pattern Analysis and Machine Intelligence, 45: 4622–4636.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning IEEE Transactions on Pattern Analysis and Machine Intelligence, 45: 4622–4636

Reference 13

Resolution: malformed identifier; raw_fallback, observed 2026-08-05T13:23:08.772657Z

Source-reported events for the cited work

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

Observation 868b84a0-1f09-43d6-8df0-1dd607a79e47 · outbound

This paper cites • ER-GNN (Zhou and Cao 2021b) is a replay-based method that constructs a memory buffer by storing rep- resentative nodes selected from previous tasks.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning • ER-GNN (Zhou and Cao 2021b) is a replay-based method that constructs a memory buffer by storing rep- resentative nodes selected from previous tasks

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:23:08.747624Z

Source-reported events for the cited work

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

Observation 2e138afb-3043-4e65-a595-5d285f297c79 · outbound

This paper cites The objective is to classify posts into their corresponding communities (subreddits).

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning The objective is to classify posts into their corresponding communities (subreddits)

Reference 2014

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:23:08.759702Z

Source-reported events for the cited work

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

Observation 19d11f57-e9ca-4cf0-a6a6-68ce8e09c661 · outbound

This paper cites Semi-Supervised Classification with Graph Convolutional Networks.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Semi-Supervised Classification with Graph Convolutional Networks

Reference 2016

Resolution: unresolved; no resolver link, observed 2026-08-05T13:23:08.536984Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 26b537d7-7c47-40fb-a16b-d0c7e534f954 · outbound

This paper cites Memory Aware Synapses: Learning what (not) to forget.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Memory Aware Synapses: Learning what (not) to forget

Reference 2017

Resolution: unresolved; no resolver link, observed 2026-08-05T13:23:08.521206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cc54d3c-7af1-44bb-a669-ab63948a46bc · outbound

This paper cites Parameter-Efficient Transfer Learning for NLP.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Parameter-Efficient Transfer Learning for NLP

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-05T13:23:08.529256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d0a692f-520b-41d9-8258-dd55b59d57a0 · outbound

This paper cites Open Graph Benchmark: Datasets for Machine Learning on Graphs.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Open Graph Benchmark: Datasets for Machine Learning on Graphs

Reference 2020

Resolution: unresolved; no resolver link, observed 2026-08-05T13:23:08.533196Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c34310d-d4a4-44d9-a614-a0b39475f715 · outbound

This paper cites Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-05T13:23:08.541155Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca9c461b-bb16-401c-82bd-730c5e2ed86d · outbound

This paper cites CaT: Balanced Continual Graph Learning with Graph Condensation.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning CaT: Balanced Continual Graph Learning with Graph Condensation

Reference 2023

Resolution: metadata mismatch; local_arxiv, observed 2026-08-05T13:23:08.668803Z

Source-reported events for the cited work

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

Observation 1e61f760-d208-48f3-93c1-5cb3088daa10 · outbound

This paper cites PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation

Reference 2024

Resolution: metadata mismatch; local_arxiv, observed 2026-08-05T13:23:08.653742Z

Source-reported events for the cited work

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

Observation 2bacf7a9-0ed3-4b00-8881-24fbaa96a611 · outbound

This paper cites Prompt-Driven Continual Graph Learning.

Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning Prompt-Driven Continual Graph Learning

Reference 2025

Resolution: metadata mismatch; local_arxiv, observed 2026-08-05T13:23:08.610267Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.