{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-domain-adaptation/papers/ran/1","list_of":"/task/graph-domain-adaptation","task":"GRAPH DOMAIN ADAPTATION","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,8],"of":8,"counts":{"archive_papers_tagged":40,"with_a_code_link":20,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":40,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-domain-adaptation/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/gcal-adapting-graph-models-to-evolving-domain","slug":"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_constructed":1,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gcal-adapting-graph-models-to-evolving-domain#ran","syntology_url":"https://syntology.ai/paper/2505.16860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16860"}},"official":{"repos":["joe817/gcal"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-benchmarking-and-understanding-1","slug":"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_constructed":0,"n_ran_checked":32,"n_instrument":6,"n_unverified":9,"n_honours":1,"n_violates":0,"n_no_contract":31,"n_pointer_only":21,"phrase":"38 ran (of which 0 constructed an object rather than computing a result; 32 with no instrument failure: 1 honoured, 0 violated, 31 with no contract checked; 6 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/revisiting-benchmarking-and-understanding-1#ran","syntology_url":"https://syntology.ai/paper/2407.11052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11052"}},"official":{"repos":["pygda-team/pygda"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/pairwise-alignment-improves-graph-domain","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pairwise-alignment-improves-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2403.01092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01092"}},"official":{"repos":["graph-com/pair-align"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-propagation-for-unsupervised-graph","slug":"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_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-propagation-for-unsupervised-graph#ran","syntology_url":"https://syntology.ai/paper/2402.05660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05660"}},"official":{"repos":["meihan-liu/24aaai-a2gnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/domain-adaptive-message-passing-graph-neural","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/domain-adaptive-message-passing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2308.16470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16470"}},"official":{"repos":["shenxiaocam/dm_gnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-re-weighting-improves-graph-domain","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/structural-re-weighting-improves-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2306.03221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03221"}},"official":{"repos":["graph-com/strurw"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/source-free-unsupervised-graph-domain","slug":"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":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/source-free-unsupervised-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2112.00955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.00955"}},"official":{"repos":["haitaomao/soga"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-deep-network-embedding-for-cross","slug":"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_constructed":7,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-deep-network-embedding-for-cross#ran","syntology_url":"https://syntology.ai/paper/2002.07366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07366"}},"official":{"repos":["shenxiaocam/ACDNE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}}],"record_sha256":"b4cb75f82b1825eef1ee94b123e5b6b7fcc332fd9e6943330ca1872ba784b1c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}