{"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","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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":40,"of":40,"of_with_code":20,"tagged_in_all":40,"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"},"items":[{"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"]}}},{"url":"/paper/190600684","slug":"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","slug":"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","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/pygda-a-python-library-for-graph-domain","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","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":26,"n_instrument":12,"n_unverified":9,"n_honours":4,"n_violates":0,"n_no_contract":22,"n_pointer_only":21,"phrase":"38 ran (of which 0 constructed an object rather than computing a result; 26 with no instrument failure: 4 honoured, 0 violated, 22 with no contract checked; 12 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/collaborate-to-adapt-source-free-graph-domain","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/collaborate-to-adapt-source-free-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2403.01467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01467"}},"official":{"repos":["cszhangzhen/graphcta"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"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/graph-domain-adaptation-challenges-progress","slug":"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","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/opengda-graph-domain-adaptation-benchmark-for","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/opengda-graph-domain-adaptation-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2307.11341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.11341"}},"official":{"repos":["skyorca/opengda"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"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/non-iid-transfer-learning-on-graphs","slug":"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","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":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 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":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/network-transfer-learning-via-adversarial","slug":"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},{"url":null,"slug":"homophily-enhanced-graph-domain-adaptation","title":"Homophily Enhanced Graph Domain Adaptation","date":"2025-05-26","arxiv_id":"2505.20089","repositories_listed":0,"syntology":null},{"url":null,"slug":"pave-your-own-path-graph-gradual-domain","title":"Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics","date":"2025-05-19","arxiv_id":"2505.12709","repositories_listed":0,"syntology":null},{"url":null,"slug":"aggregate-to-adapt-node-centric-aggregation","title":"Aggregate to Adapt: Node-Centric Aggregation for Multi-Source-Free Graph Domain Adaptation","date":"2025-02-05","arxiv_id":"2502.03033","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-benefits-of-attribute-driven-graph","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","date":"2025-02-04","arxiv_id":"2502.06808","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradual-domain-adaptation-for-graph-learning","title":"Gradual Domain Adaptation for Graph Learning","date":"2025-01-29","arxiv_id":"2501.17443","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-domain-adaptation-with-dual-branch","title":"Graph Domain Adaptation with Dual-branch Encoder and Two-level Alignment for Whole Slide Image-based Survival Prediction","date":"2024-11-21","arxiv_id":"2411.14001","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-adaptive-unfolded-graph-neural","title":"Domain Adaptive Unfolded Graph Neural Networks","date":"2024-11-20","arxiv_id":"2411.13137","repositories_listed":0,"syntology":null},{"url":null,"slug":"degree-distribution-based-spiking-graph","title":"Degree-Conscious Spiking Graph for Cross-Domain Adaptation","date":"2024-10-09","arxiv_id":"2410.06883","repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-and-align-towards-effective-source-free","title":"Rank and Align: Towards Effective Source-free Graph Domain Adaptation","date":"2024-08-22","arxiv_id":"2408.12185","repositories_listed":0,"syntology":null},{"url":null,"slug":"sa-gda-spectral-augmentation-for-graph-domain","title":"SA-GDA: Spectral Augmentation for Graph Domain Adaptation","date":"2024-08-17","arxiv_id":"2408.09189","repositories_listed":0,"syntology":null},{"url":null,"slug":"core-knowledge-learning-framework-for-graph","title":"Core Knowledge Learning Framework for Graph Adaptation and Scalability Learning","date":"2024-07-02","arxiv_id":"2407.01886","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-under-distribution-shifts-a","title":"Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning","date":"2024-02-26","arxiv_id":"2402.16374","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-domain-adaptation-in-graph","title":"Semi-supervised Domain Adaptation in Graph Transfer Learning","date":"2023-09-19","arxiv_id":"2309.10773","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridged-gnn-knowledge-bridge-learning-for","title":"Bridged-GNN: Knowledge Bridge Learning for Effective Knowledge Transfer","date":"2023-08-18","arxiv_id":"2308.09499","repositories_listed":0,"syntology":null},{"url":null,"slug":"coarse-to-fine-knowledge-graph-domain","title":"Coarse-to-fine Knowledge Graph Domain Adaptation based on Distantly-supervised Iterative Training","date":"2022-11-05","arxiv_id":"2211.02849","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-domain-adaptation-a-generative-view","title":"Graph Domain Adaptation: A Generative View","date":"2021-06-14","arxiv_id":"2106.07482","repositories_listed":0,"syntology":null},{"url":null,"slug":"da-hgt-domain-adaptive-heterogeneous-graph","title":"GDA-HIN: A Generalized Domain Adaptive Model across Heterogeneous Information Networks","date":"2020-12-10","arxiv_id":"2012.05688","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-domain-adaptation-for-alignment","title":"Graph Domain Adaptation for Alignment-Invariant Brain Surface Segmentation","date":"2020-03-31","arxiv_id":"2004.00074","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-domain-adaptation-with-localized-graph","title":"Graph Domain Adaptation with Localized Graph Signal Representations","date":"2019-11-07","arxiv_id":"1911.02883","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-adaptation-on-graphs-by-learning-graph","title":"Domain Adaptation on Graphs by Learning Graph Topologies: Theoretical Analysis and an Algorithm","date":"2018-12-17","arxiv_id":"1812.06944","repositories_listed":0,"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"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/task/graph-domain-adaptation/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/graph-domain-adaptation/papers/ran/1","json":"/task/graph-domain-adaptation/papers/ran/1.json","rows":8}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"9a3547cadd5b0ee03a61bf29b9b79c9cf8e657e7f89df0a679086f81c643c448","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}