{"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":"/dataset/dblp-heterogeneous-node-classification/papers/ran/1","list_of":"/dataset/dblp-heterogeneous-node-classification","dataset":"DBLP (Heterogeneous Node Classification)","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_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'","samples_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)"},"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 dataset or check it against this dataset'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.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,6],"of":6,"counts":{"papers_with_a_benchmark_row":11,"with_a_code_link":11,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":11,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/dblp-heterogeneous-node-classification/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["scottjiao/slotgat_icml23"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":8,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/heterogeneous-graph-transformer","slug":"heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","arxiv_id":"2003.01332","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":1,"code_links":93,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":106,"samples_ran":61,"samples_constructed":28,"samples_ran_checked":52,"samples_ran_instrument_failed":9,"samples_unverified":45,"pointer_only_for_licence":46,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":32,"samples_ran":18,"samples_constructed":3,"samples_ran_checked":13,"samples_ran_instrument_failed":5,"samples_unverified":14,"pointer_only_for_licence":15,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":58,"samples_ran":39,"samples_constructed":13,"samples_ran_checked":34,"samples_ran_instrument_failed":5,"samples_unverified":19,"pointer_only_for_licence":23,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}}],"record_sha256":"c3da910954c7d5e9953bf16d9c3b52a973d0e972453a16f01247c0fb1a22441b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}