{"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/to-planetoid","entry":"to_planetoid","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":9,"n_papers_ran":3,"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":1,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"2510.10849","paper":"/paper/arxiv-2510-10849","title":"Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"CUAI/Non-Homophily-Large-Scale","path":"data_utils.py","file_url":"https://github.com/CUAI/Non-Homophily-Large-Scale/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"01e5c1887f86d840","mcp_get_code":{"code_sha256":"01e5c1887f86d840"}},{"arxiv_id":"2412.09902","paper":"/paper/one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiexuanting/fpgc","path":"FPGC-main/data_utils.py","file_url":"https://github.com/xiexuanting/fpgc/blob/HEAD/FPGC-main/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f7843797de50ce62","mcp_get_code":{"code_sha256":"f7843797de50ce62"}},{"arxiv_id":"2403.07954","paper":"/paper/optimizing-polynomial-graph-filters-a-novel","title":"Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkhuang81/AdaptKry","path":"non-homo/data_utils.py","file_url":"https://github.com/kkhuang81/AdaptKry/blob/HEAD/non-homo/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01e5c1887f86d840","mcp_get_code":{"code_sha256":"01e5c1887f86d840"}},{"arxiv_id":"2402.08907","paper":"/paper/tackling-negative-transfer-on-graphs","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/subgraph-pooling","path":"data_utils.py","file_url":"https://github.com/zehong-wang/subgraph-pooling/blob/HEAD/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e85cbb79f6726cb","mcp_get_code":{"code_sha256":"7e85cbb79f6726cb"}},{"arxiv_id":"2312.14438","paper":"/paper/pc-conv-unifying-homophily-and-heterophily","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uestclbh/pc-conv","path":"data_utils.py","file_url":"https://github.com/uestclbh/pc-conv/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f7843797de50ce62","mcp_get_code":{"code_sha256":"f7843797de50ce62"}},{"arxiv_id":"2310.00800","paper":null,"title":"arXiv:2310.00800","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"qitianwu/GraphOOD-EERM","path":"multigraph/data_utils.py","file_url":"https://github.com/qitianwu/GraphOOD-EERM/blob/HEAD/multigraph/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e85cbb79f6726cb","mcp_get_code":{"code_sha256":"7e85cbb79f6726cb"}},{"arxiv_id":"2306.08274","paper":"/paper/why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seijimaekawa/a2dug","path":"src/data_utils.py","file_url":"https://github.com/seijimaekawa/a2dug/blob/HEAD/src/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01e5c1887f86d840","mcp_get_code":{"code_sha256":"01e5c1887f86d840"}},{"arxiv_id":"2302.01524","paper":"/paper/ordered-gnn-ordering-message-passing-to-deal","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lumia-group/orderedgnn","path":"datasets/datasets_linkx/data_utils.py","file_url":"https://github.com/lumia-group/orderedgnn/blob/HEAD/datasets/datasets_linkx/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01e5c1887f86d840","mcp_get_code":{"code_sha256":"01e5c1887f86d840"}},{"arxiv_id":"2110.14446","paper":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/Non-Homophily-Benchmarks","path":"data_utils.py","file_url":"https://github.com/CUAI/Non-Homophily-Benchmarks/blob/HEAD/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e85cbb79f6726cb","mcp_get_code":{"code_sha256":"7e85cbb79f6726cb"}}]}