{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/node-class-split","entry":"node_class_split","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","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)"},"n_papers":5,"n_papers_ran":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":3,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2606.07475","paper":"/paper/arxiv-2606-07475","title":"Graph Neural Network leveraging Higher-order Class Label Connectivity for Heterophilous Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"TakahashiTakutooo/GNN_LCC","path":"datasets/telegram.py","file_url":"https://github.com/TakahashiTakutooo/GNN_LCC/blob/HEAD/datasets/telegram.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1b4e100d3857a49a","mcp_get_code":{"code_sha256":"1b4e100d3857a49a"}},{"arxiv_id":"2402.06128","paper":"/paper/rethinking-node-wise-propagation-for-large","title":"Rethinking Node-wise Propagation for Large-scale Graph Learning","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xkli-allen/atp","path":"dataset/node_split.py","file_url":"https://github.com/xkli-allen/atp/blob/HEAD/dataset/node_split.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b13b0b6dc73701ca","mcp_get_code":{"code_sha256":"b13b0b6dc73701ca"}},{"arxiv_id":"2401.11772","paper":"/paper/lightdic-a-simple-yet-effective-approach-for","title":"LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xkli-allen/lightdic","path":"datasets/node_split.py","file_url":"https://github.com/xkli-allen/lightdic/blob/HEAD/datasets/node_split.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f1ed5651447c0e00","mcp_get_code":{"code_sha256":"f1ed5651447c0e00"}},{"arxiv_id":"2310.02232","paper":"/paper/holonets-spectral-convolutions-do-extend-to","title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChristianKoke/HoloNets","path":"src/datasets/telegram.py","file_url":"https://github.com/ChristianKoke/HoloNets/blob/HEAD/src/datasets/telegram.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b4e100d3857a49a","mcp_get_code":{"code_sha256":"1b4e100d3857a49a"}},{"arxiv_id":"2305.10498","paper":"/paper/edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emalgorithm/directed-graph-neural-network","path":"src/datasets/telegram.py","file_url":"https://github.com/emalgorithm/directed-graph-neural-network/blob/HEAD/src/datasets/telegram.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b4e100d3857a49a","mcp_get_code":{"code_sha256":"1b4e100d3857a49a"}}]}