{"url":"/task/graph-domain-adaptation","name":"GRAPH DOMAIN ADAPTATION","slug":"graph-domain-adaptation","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":40,"papers_with_code":20,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-domain-adaptation-on-frankenstein","slug":"graph-domain-adaptation-on-frankenstein","dataset":"FRANKENSTEIN","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GALA","paper_title":"GALA: Graph Diffusion-based Alignment with Jigsaw for Source-free Domain Adaptation","paper_url":"/paper/gala-graph-diffusion-based-alignment-with","paper_date":"2024-10-22","arxiv_id":"2410.16606","code_links":[{"title":"luo-junyu/gala","url":"https://github.com/luo-junyu/gala"}],"syntology":null}}],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":20,"of":20,"tagged_in_all":40,"items":[{"url":"/paper/adversarial-deep-network-embedding-for-cross","title":"Adversarial Deep Network Embedding for Cross-network Node Classification","date":"2020-02-18","arxiv_id":"2002.07366","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_unverified":3,"n_pointer_only":11}},{"url":"/paper/190600684","title":"DANE: Domain Adaptive Network Embedding","date":"2019-06-03","arxiv_id":"1906.00684","repositories_listed":2,"syntology":null},{"url":"/paper/bottrans-a-multi-source-graph-domain","title":"BotTrans: A Multi-Source Graph Domain Adaptation Approach for Social Bot Detection","date":"2025-06-12","arxiv_id":"2506.13795","repositories_listed":1,"syntology":null},{"url":"/paper/gcal-adapting-graph-models-to-evolving-domain","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","date":"2025-05-22","arxiv_id":"2505.16860","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_unverified":3,"n_pointer_only":10}},{"url":"/paper/pygda-a-python-library-for-graph-domain","title":"PyGDA: A Python Library for Graph Domain Adaptation","date":"2025-03-13","arxiv_id":"2503.10284","repositories_listed":1,"syntology":null},{"url":"/paper/smoothness-really-matters-a-simple-yet","title":"Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptation","date":"2024-12-16","arxiv_id":"2412.11654","repositories_listed":1,"syntology":null},{"url":"/paper/gala-graph-diffusion-based-alignment-with","title":"GALA: Graph Diffusion-based Alignment with Jigsaw for Source-free Domain Adaptation","date":"2024-10-22","arxiv_id":"2410.16606","repositories_listed":1,"syntology":null},{"url":"/paper/delta-dual-consistency-delving-with","title":"DELTA: Dual Consistency Delving with Topological Uncertainty for Active Graph Domain Adaptation","date":"2024-09-13","arxiv_id":"2409.08946","repositories_listed":1,"syntology":null},{"url":"/paper/can-modifying-data-address-graph-domain","title":"Can Modifying Data Address Graph Domain Adaptation?","date":"2024-07-27","arxiv_id":"2407.19311","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","arxiv_id":"2407.11052","repositories_listed":1,"syntology":{"n":47,"n_ran":38,"n_unverified":9,"n_pointer_only":21}},{"url":"/paper/collaborate-to-adapt-source-free-graph-domain","title":"Collaborate to Adapt: Source-Free Graph Domain Adaptation via Bi-directional Adaptation","date":"2024-03-03","arxiv_id":"2403.01467","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/pairwise-alignment-improves-graph-domain","title":"Pairwise Alignment Improves Graph Domain Adaptation","date":"2024-03-02","arxiv_id":"2403.01092","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/rethinking-propagation-for-unsupervised-graph","title":"Rethinking Propagation for Unsupervised Graph Domain Adaptation","date":"2024-02-08","arxiv_id":"2402.05660","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/graph-domain-adaptation-challenges-progress","title":"Graph Domain Adaptation: Challenges, Progress and Prospects","date":"2024-02-01","arxiv_id":"2402.00904","repositories_listed":1,"syntology":null},{"url":"/paper/domain-adaptive-message-passing-graph-neural","title":"Domain-adaptive Message Passing Graph Neural Network","date":"2023-08-31","arxiv_id":"2308.16470","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}},{"url":"/paper/opengda-graph-domain-adaptation-benchmark-for","title":"OpenGDA: Graph Domain Adaptation Benchmark for Cross-network Learning","date":"2023-07-21","arxiv_id":"2307.11341","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/structural-re-weighting-improves-graph-domain","title":"Structural Re-weighting Improves Graph Domain Adaptation","date":"2023-06-05","arxiv_id":"2306.03221","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":7}},{"url":"/paper/non-iid-transfer-learning-on-graphs","title":"Non-IID Transfer Learning on Graphs","date":"2022-12-15","arxiv_id":"2212.08174","repositories_listed":1,"syntology":null},{"url":"/paper/source-free-unsupervised-graph-domain","title":"Source Free Unsupervised Graph Domain Adaptation","date":"2021-12-02","arxiv_id":"2112.00955","repositories_listed":1,"syntology":{"n":9,"n_ran":1,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/network-transfer-learning-via-adversarial","title":"Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolution","date":"2019-09-04","arxiv_id":"1909.01541","repositories_listed":1,"syntology":null}],"syntology_records":10,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}