STAMP: Symmetric Temporal Averaging Message Passing for Domain Adaptation in Chronologically Split Graphs

The paper introduces STAMP, a timestamp‑balanced message‑passing operator designed for domain adaptation in chronologically split graph data. STAMP replaces standard neighborhood aggregation with temporally aligned propagation, enforcing first‑moment invariance across time while remaining scalable and easy to implement. Experiments on several temporal graph benchmarks, including ogbn‑arxiv, ogbn‑mag, and a temporal‑split Pokec dataset, show that STAMP and its variant STAMP‑mag consistently improve node classification accuracy and achieve state‑of‑the‑art performance.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

• fine-tuning
• benchmarks