{"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/heterogeneous-node-classification","name":"Heterogeneous Node Classification","slug":"heterogeneous-node-classification","description_markdown":"Node classification in heterogeneous graphs, where nodes and/or edges have multiple types.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":16,"papers_with_code":14,"benchmarks":7,"benchmark_tables_in_archive":7,"benchmark_tables_shown":7,"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":8,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/heterogeneous-node-classification-on-dblp-1","slug":"heterogeneous-node-classification-on-dblp-1","dataset":"DBLP (PACT) 14k","dataset_url":"/dataset/dblp","rows_in_archive":14,"metrics":["Micro-F1 (20% training data)","Macro-F1 (20% training data)","Macro-F1 (60% training data)","Micro-F1 (80% training data)","Macro-F1 (80% training data)"],"first_row_in_archive_order":{"model":"HAN","paper_title":"Heterogeneous Graph Attention Network","paper_url":"/paper/heterogeneous-graph-attention-network","paper_date":"2019-03-18","arxiv_id":"1903.07293","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/han"},{"title":"Jhy1993/HAN","url":"https://github.com/Jhy1993/HAN"},{"title":"JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch","url":"https://github.com/JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch"},{"title":"calderkatyal/CPSC483FinalProject","url":"https://github.com/calderkatyal/CPSC483FinalProject"}],"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/heterogeneous-graph-attention-network#ran","syntology_url":"https://syntology.ai/paper/1903.07293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07293"}},"official":{"repos":["Jhy1993/HAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-acm","slug":"heterogeneous-node-classification-on-acm","dataset":"ACM (Heterogeneous Node Classification)","dataset_url":"/dataset/acm-heterogeneous-node-classification","rows_in_archive":11,"metrics":[" Macro-F1","Micro-F1","Claim Classification Macro-F1","Macro-F1"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-dblp-2","slug":"heterogeneous-node-classification-on-dblp-2","dataset":"DBLP (Heterogeneous Node Classification)","dataset_url":"/dataset/dblp-heterogeneous-node-classification","rows_in_archive":11,"metrics":[" Macro-F1","Micro-F1","Macro-F1"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-imdb","slug":"heterogeneous-node-classification-on-imdb","dataset":"IMDB (Heterogeneous Node Classification)","dataset_url":"/dataset/imdb-heterogeneous-node-classification","rows_in_archive":11,"metrics":[" Macro-F1","Micro-F1","Macro-F1"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-freebase","slug":"heterogeneous-node-classification-on-freebase","dataset":"Freebase (Heterogeneous Node Classification)","dataset_url":"/dataset/freebase-heterogeneous-node-classification","rows_in_archive":9,"metrics":[" Macro-F1","Micro-F1","Macro-F1","Accuracy"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-oag","slug":"heterogeneous-node-classification-on-oag","dataset":"OAG-Venue","dataset_url":"/dataset/oag-venue","rows_in_archive":5,"metrics":["NDCG","MRR"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/heterogeneous-node-classification-on-oag-l1","slug":"heterogeneous-node-classification-on-oag-l1","dataset":"OAG-L1-Field","dataset_url":"/dataset/oag-l1-field","rows_in_archive":5,"metrics":["NDCG","MRR"],"first_row_in_archive_order":{"model":"RpHGNN","paper_title":"Efficient Heterogeneous Graph Learning via Random Projection","paper_url":"/paper/efficient-heterogeneous-graph-learning-via","paper_date":"2023-10-23","arxiv_id":"2310.14481","code_links":[{"title":"CrawlScript/RpHGNN","url":"https://github.com/CrawlScript/RpHGNN"}],"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/acm-heterogeneous-node-classification","name":"ACM (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":12},{"url":"/dataset/dblp-heterogeneous-node-classification","name":"DBLP (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":12},{"url":"/dataset/imdb-heterogeneous-node-classification","name":"IMDB (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":11},{"url":"/dataset/freebase-heterogeneous-node-classification","name":"Freebase (Heterogeneous Node Classification)","full_name":"","num_papers_in_archive":9},{"url":"/dataset/oag-venue","name":"OAG-Venue","full_name":"","num_papers_in_archive":9},{"url":"/dataset/oag-l1-field","name":"OAG-L1-Field","full_name":"","num_papers_in_archive":5},{"url":"/dataset/supplygraph","name":"SupplyGraph","full_name":"SupplyGraph: A Benchmark Dataset for Supply Chain Planning using Graph Neural Networks","num_papers_in_archive":3}],"subtasks":[],"parent_tasks":[{"url":"/task/node-classification","name":"Node Classification"}],"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":16,"of":16,"of_with_code":14,"tagged_in_all":16,"counts":{"archive_papers_tagged":16,"with_a_code_link":14,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","repositories_listed":27,"syntology":{"n":32,"n_ran":18,"n_constructed":3,"n_ran_checked":13,"n_instrument":5,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/modeling-relational-data-with-graph#ran","syntology_url":"https://syntology.ai/paper/1703.06103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06103"}},"official":{"repos":["tkipf/relational-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/heterogeneous-graph-transformer","slug":"heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","arxiv_id":"2003.01332","repositories_listed":4,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/heterogeneous-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.01332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01332"}},"official":{"repos":["acbull/pyHGT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-and-efficient-heterogeneous-graph","slug":"simple-and-efficient-heterogeneous-graph","title":"Simple and Efficient Heterogeneous Graph Neural Network","date":"2022-07-06","arxiv_id":"2207.02547","repositories_listed":2,"syntology":null},{"url":"/paper/are-we-really-making-much-progress-revisiting","slug":"are-we-really-making-much-progress-revisiting","title":"Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networks","date":"2021-12-30","arxiv_id":"2112.14936","repositories_listed":2,"syntology":null},{"url":"/paper/from-primes-to-paths-enabling-fast-multi","slug":"from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","date":"2024-11-17","arxiv_id":"2411.11149","repositories_listed":1,"syntology":null},{"url":"/paper/slotgat-slot-based-message-passing-for","slug":"slotgat-slot-based-message-passing-for","title":"SlotGAT: Slot-based Message Passing for Heterogeneous Graph Neural Network","date":"2024-05-03","arxiv_id":"2405.01927","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/slotgat-slot-based-message-passing-for#ran","syntology_url":"https://syntology.ai/paper/2405.01927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01927"}},"official":{"repos":["scottjiao/slotgat_icml23"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-heterogeneous-graph-learning-via","slug":"efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","arxiv_id":"2310.14481","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-graph-neural-networks-for-1","slug":"scalable-graph-neural-networks-for-1","title":"Scalable Graph Neural Networks for Heterogeneous Graphs","date":"2020-11-19","arxiv_id":"2011.09679","repositories_listed":1,"syntology":null},{"url":"/paper/an-attention-based-graph-neural-network-for","slug":"an-attention-based-graph-neural-network-for","title":"An Attention-based Graph Neural Network for Heterogeneous Structural Learning","date":"2019-12-19","arxiv_id":"1912.10832","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/an-attention-based-graph-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/1912.10832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10832"}},"official":{"repos":["didi/hetsann"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/non-local-attention-learning-on-large","slug":"non-local-attention-learning-on-large","title":"Non-local Attention Learning on Large Heterogeneous Information Networks","date":"2019-12-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","repositories_listed":1,"syntology":null},{"url":"/paper/graph-transformer-networks-1","slug":"graph-transformer-networks-1","title":"Graph Transformer Networks","date":"2019-11-06","arxiv_id":"1911.06455","repositories_listed":1,"syntology":null},{"url":null,"slug":"heterogeneous-graph-attention-networks-for","title":"Heterogeneous Graph Attention Networks for Semi-supervised Short Text Classification","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-relational-classification-via-bayesian","title":"Multi-Relational Classification via Bayesian Ranked Non-Linear Embeddings","date":"2019-08-06","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":7,"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":6,"papers_where_code_ran_first_page":"/task/heterogeneous-node-classification/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/heterogeneous-node-classification/papers/ran/1","json":"/task/heterogeneous-node-classification/papers/ran/1.json","rows":6}],"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":"951104f9c19de57e8651056bbc5d371993590a740e0e81bfb4d73b4b9904441b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}