{"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":"/code/load-fb100","entry":"load_fb100","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":12,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":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":7,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":8,"n_places_pointer_only_link_open":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":6},"key_notes":{"n_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'","n_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)"},"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","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CUAI/Non-Homophily-Large-Scale when it was checked","code_sha256":"0765a875204d931d","code_sha256_prefix":"0765a875204d931d","mcp_get_code":{"code_sha256":"0765a875204d931d"}},{"arxiv_id":"2502.19670","arxiv_id_is_arxiv":true,"paper":"/paper/training-robust-graph-neural-networks-by","title":"Training Robust Graph Neural Networks by Modeling Noise Dependencies","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WtaoZhao/GraphGLOW","path":"src/core/model_handler.py","file_url":"https://github.com/WtaoZhao/GraphGLOW/blob/HEAD/src/core/model_handler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, WtaoZhao/GraphGLOW when it was checked","code_sha256":"fdfd9288adf2c45d","code_sha256_prefix":"fdfd9288adf2c45d","mcp_get_code":{"code_sha256":"fdfd9288adf2c45d"}},{"arxiv_id":"2412.09902","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiexuanting/fpgc when it was checked","code_sha256":"0765a875204d931d","code_sha256_prefix":"0765a875204d931d","mcp_get_code":{"code_sha256":"0765a875204d931d"}},{"arxiv_id":"2407.01290","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"67fc014db49b3eba","code_sha256_prefix":"67fc014db49b3eba","mcp_get_code":{"code_sha256":"67fc014db49b3eba"}},{"arxiv_id":"2402.11494","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fannie1208/canet when it was checked","code_sha256":"67fc014db49b3eba","code_sha256_prefix":"67fc014db49b3eba","mcp_get_code":{"code_sha256":"67fc014db49b3eba"}},{"arxiv_id":"2312.14438","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, uestclbh/pc-conv when it was checked","code_sha256":"0765a875204d931d","code_sha256_prefix":"0765a875204d931d","mcp_get_code":{"code_sha256":"0765a875204d931d"}},{"arxiv_id":"2310.00800","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qitianwu/GraphOOD-EERM when it was checked","code_sha256":"6104f3da76fc0a87","code_sha256_prefix":"6104f3da76fc0a87","mcp_get_code":{"code_sha256":"6104f3da76fc0a87"}},{"arxiv_id":"2306.11264","arxiv_id_is_arxiv":true,"paper":"/paper/graphglow-universal-and-generalizable","title":"GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural Networks","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wtaozhao/graphglow","path":"data/prep_fb100.py","file_url":"https://github.com/wtaozhao/graphglow/blob/HEAD/data/prep_fb100.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wtaozhao/graphglow when it was checked","code_sha256":"6ae1278a387297ed","code_sha256_prefix":"6ae1278a387297ed","mcp_get_code":{"code_sha256":"6ae1278a387297ed"}},{"arxiv_id":"2306.10759","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"67fc014db49b3eba","code_sha256_prefix":"67fc014db49b3eba","mcp_get_code":{"code_sha256":"67fc014db49b3eba"}},{"arxiv_id":"2302.01524","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked","code_sha256":"0765a875204d931d","code_sha256_prefix":"0765a875204d931d","mcp_get_code":{"code_sha256":"0765a875204d931d"}},{"arxiv_id":"2210.07606","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a94acffdc2999ab9","code_sha256_prefix":"a94acffdc2999ab9","mcp_get_code":{"code_sha256":"a94acffdc2999ab9"}},{"arxiv_id":"2110.14446","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab0d9da60756efc3","code_sha256_prefix":"ab0d9da60756efc3","mcp_get_code":{"code_sha256":"ab0d9da60756efc3"}}],"record_sha256":"b970241a51302d683d59489baaf8f2e5f78e4e11a5def49fd91ca36baf5e70fa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}