{"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/gpu-setup","entry":"gpu_setup","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":10,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":11,"n_places_pointer_only_link_open":4,"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":3,"ran_fixture":0,"ran":3,"unverified":1},"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":"2405.18378","arxiv_id_is_arxiv":true,"paper":"/paper/a-canonization-perspective-on-invariant-and","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2405.08958","arxiv_id_is_arxiv":true,"paper":"/paper/learned-radio-interferometric-imaging-for","title":"Learned radio interferometric imaging for varying visibility coverage","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astro-informatics/leia","path":"src/util.py","file_url":"https://github.com/astro-informatics/leia/blob/HEAD/src/util.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, astro-informatics/leia when it was checked","code_sha256":"ef500ec948902288","code_sha256_prefix":"ef500ec948902288","mcp_get_code":{"code_sha256":"ef500ec948902288"}},{"arxiv_id":"2206.07869","arxiv_id_is_arxiv":true,"paper":"/paper/let-invariant-rationale-discovery-inspire","title":"Let Invariant Rationale Discovery Inspire Graph Contrastive Learning","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2110.08760","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-membership-inference-attacks-to-gnn","title":"Adapting Membership Inference Attacks to GNN for Graph Classification: Approaches and Implications","date":"2021-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustworthygnn/mia-gnn","path":"code/main_SPs_graph_classification.py","file_url":"https://github.com/trustworthygnn/mia-gnn/blob/HEAD/code/main_SPs_graph_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, trustworthygnn/mia-gnn when it was checked","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2110.07875","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vijaydwivedi75/gnn-lspe","path":"main_OGBMOL_graph_classification.py","file_url":"https://github.com/vijaydwivedi75/gnn-lspe/blob/HEAD/main_OGBMOL_graph_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 trustworthygnn/mia-gnn, and GitHub detected no licence in that repository when it was checked","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2110.01219","arxiv_id_is_arxiv":true,"paper":"/paper/hit-and-lead-discovery-with-explorative-rl","title":"Hit and Lead Discovery with Explorative RL and Fragment-based Molecule Generation","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AITRICS/FREED","path":"run_rl.py","file_url":"https://github.com/AITRICS/FREED/blob/HEAD/run_rl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20c913cffd65870b","code_sha256_prefix":"20c913cffd65870b","mcp_get_code":{"code_sha256":"20c913cffd65870b"}},{"arxiv_id":"2106.06707","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-with-local-graph","title":"Graph Neural Networks with Local Graph Parameters","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LGP-GNN-2021/LGP-GNN","path":"CLUSTER_Node_Classification.py","file_url":"https://github.com/LGP-GNN-2021/LGP-GNN/blob/HEAD/CLUSTER_Node_Classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 trustworthygnn/mia-gnn, and GitHub detected no licence in that repository when it was checked","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2106.06707","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-with-local-graph","title":"Graph Neural Networks with Local Graph Parameters","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LGP-GNN-2021/LGP-GNN","path":"COLLAB_Prediction.py","file_url":"https://github.com/LGP-GNN-2021/LGP-GNN/blob/HEAD/COLLAB_Prediction.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7017768b3c816295","code_sha256_prefix":"7017768b3c816295","mcp_get_code":{"code_sha256":"7017768b3c816295"}},{"arxiv_id":"2106.06707","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-with-local-graph","title":"Graph Neural Networks with Local Graph Parameters","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LGP-GNN-2021/LGP-GNN","path":"ZINC_Regression.py","file_url":"https://github.com/LGP-GNN-2021/LGP-GNN/blob/HEAD/ZINC_Regression.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c1a813c3ad86bd9","code_sha256_prefix":"0c1a813c3ad86bd9","mcp_get_code":{"code_sha256":"0c1a813c3ad86bd9"}},{"arxiv_id":"2012.10619","arxiv_id_is_arxiv":true,"paper":"/paper/a-pipeline-for-fair-comparison-of-graph","title":"A pipeline for fair comparison of graph neural networks in node classification tasks","date":"2020-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karl-zhao/benchmarking-gnns-pyg","path":"main_arxiv_node_classification.py","file_url":"https://github.com/karl-zhao/benchmarking-gnns-pyg/blob/HEAD/main_arxiv_node_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f127fb049f471ed","code_sha256_prefix":"5f127fb049f471ed","mcp_get_code":{"code_sha256":"5f127fb049f471ed"}},{"arxiv_id":"2012.10258","arxiv_id_is_arxiv":true,"paper":"/paper/an-experimental-study-of-the-transferability","title":"An Experimental Study of the Transferability of Spectral Graph Networks","date":"2020-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2010.02863","arxiv_id_is_arxiv":true,"paper":"/paper/directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbouritsas/gsn","path":"directional_gsn/main_HIV.py","file_url":"https://github.com/gbouritsas/gsn/blob/HEAD/directional_gsn/main_HIV.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 trustworthygnn/mia-gnn, and GitHub detected no licence in that repository when it was checked","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2009.11746","arxiv_id_is_arxiv":true,"paper":"/paper/learning-graph-normalization-for-graph-neural","title":"Learning Graph Normalization for Graph Neural Networks","date":"2020-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}},{"arxiv_id":"2006.07846","arxiv_id_is_arxiv":true,"paper":"/paper/from-graph-low-rank-global-attention-to-2-fwl","title":"Global Attention Improves Graph Networks Generalization","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omri1348/LRGA","path":"ogb/examples/linkproppred/collab/gnn.py","file_url":"https://github.com/omri1348/LRGA/blob/HEAD/ogb/examples/linkproppred/collab/gnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, omri1348/LRGA when it was checked","code_sha256":"01da28167d92f23a","code_sha256_prefix":"01da28167d92f23a","mcp_get_code":{"code_sha256":"01da28167d92f23a"}},{"arxiv_id":"2003.00982","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphdeeplearning/benchmarking-gnns","path":"main_COLLAB_edge_classification.py","file_url":"https://github.com/graphdeeplearning/benchmarking-gnns/blob/HEAD/main_COLLAB_edge_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 trustworthygnn/mia-gnn, and GitHub detected no licence in that repository when it was checked","code_sha256":"f72434c0dcd5d11b","code_sha256_prefix":"f72434c0dcd5d11b","mcp_get_code":{"code_sha256":"f72434c0dcd5d11b"}}],"record_sha256":"1cde9eda4aa9d7145c669e59665bc5b67cbabc34108aad0d5eec6572fc3130ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}