{"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/load-twitch","entry":"load_twitch","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":11,"n_papers_ran":1,"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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"load_data.py","file_url":"https://github.com/CUAI/Non-Homophily-Large-Scale/blob/HEAD/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"563a5ce4dce55a17","mcp_get_code":{"code_sha256":"563a5ce4dce55a17"}},{"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/load_data.py","file_url":"https://github.com/xiexuanting/fpgc/blob/HEAD/FPGC-main/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"563a5ce4dce55a17","mcp_get_code":{"code_sha256":"563a5ce4dce55a17"}},{"arxiv_id":"2407.14459","paper":"/paper/polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"air029/polyformer","path":"node_classification_large_graph/dataloader/LINKX_dataset.py","file_url":"https://github.com/air029/polyformer/blob/HEAD/node_classification_large_graph/dataloader/LINKX_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e507f8a537044ad","mcp_get_code":{"code_sha256":"8e507f8a537044ad"}},{"arxiv_id":"2407.01290","paper":"/paper/hypformer-exploring-efficient-hyperbolic","title":"Hypformer: Exploring Efficient Hyperbolic Transformer Fully in Hyperbolic Space","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-and-Geometric-Learning/hyperbolic-transformer","path":"large/load_data.py","file_url":"https://github.com/Graph-and-Geometric-Learning/hyperbolic-transformer/blob/HEAD/large/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"985aeae95edfd025","mcp_get_code":{"code_sha256":"985aeae95edfd025"}},{"arxiv_id":"2402.11494","paper":"/paper/graph-out-of-distribution-generalization-via","title":"Graph Out-of-Distribution Generalization via Causal Intervention","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fannie1208/canet","path":"load_data.py","file_url":"https://github.com/fannie1208/canet/blob/HEAD/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"985aeae95edfd025","mcp_get_code":{"code_sha256":"985aeae95edfd025"}},{"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":"load_data.py","file_url":"https://github.com/uestclbh/pc-conv/blob/HEAD/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"563a5ce4dce55a17","mcp_get_code":{"code_sha256":"563a5ce4dce55a17"}},{"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/load_data.py","file_url":"https://github.com/qitianwu/GraphOOD-EERM/blob/HEAD/multigraph/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a7d643acf04a759b","mcp_get_code":{"code_sha256":"a7d643acf04a759b"}},{"arxiv_id":"2306.10759","paper":"/paper/simplifying-and-empowering-transformers-for-1","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qitianwu/SGFormer","path":"100M/load_data.py","file_url":"https://github.com/qitianwu/SGFormer/blob/HEAD/100M/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"985aeae95edfd025","mcp_get_code":{"code_sha256":"985aeae95edfd025"}},{"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/load_data.py","file_url":"https://github.com/lumia-group/orderedgnn/blob/HEAD/datasets/datasets_linkx/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"563a5ce4dce55a17","mcp_get_code":{"code_sha256":"563a5ce4dce55a17"}},{"arxiv_id":"2210.07606","paper":"/paper/revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SitaoLuan/ACM-GNN","path":"ACM-Geometric/load_data.py","file_url":"https://github.com/SitaoLuan/ACM-GNN/blob/HEAD/ACM-Geometric/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"166a96050e3dbbad","mcp_get_code":{"code_sha256":"166a96050e3dbbad"}},{"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":"load_data.py","file_url":"https://github.com/CUAI/Non-Homophily-Benchmarks/blob/HEAD/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"563a5ce4dce55a17","mcp_get_code":{"code_sha256":"563a5ce4dce55a17"}}]}