{"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/encode-onehot","entry":"encode_onehot","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":24,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":13,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":27,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":6,"unverified":0},"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":"2410.16432","arxiv_id_is_arxiv":true,"paper":"/paper/fair-bilevel-neural-network-fairbinn-on","title":"Fair Bilevel Neural Network (FairBiNN): On Balancing fairness and accuracy via Stackelberg Equilibrium","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yazdanimehdi/FairBiNN","path":"utils.py","file_url":"https://github.com/yazdanimehdi/FairBiNN/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19be62d06f0eec5f","code_sha256_prefix":"19be62d06f0eec5f","mcp_get_code":{"code_sha256":"19be62d06f0eec5f"}},{"arxiv_id":"2409.17386","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-redundancy-information-aware","title":"Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxlearningdeep/InfoMGF","path":"InfoMGF/data_process.py","file_url":"https://github.com/zxlearningdeep/InfoMGF/blob/HEAD/InfoMGF/data_process.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zxlearningdeep/InfoMGF when it was checked","code_sha256":"6c897974e5ceb4aa","code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"2407.16863","arxiv_id_is_arxiv":true,"paper":"/paper/balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxlearningdeep/bmgc","path":"BMGC/utils/load_data.py","file_url":"https://github.com/zxlearningdeep/bmgc/blob/HEAD/BMGC/utils/load_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zxlearningdeep/bmgc when it was checked","code_sha256":"6c897974e5ceb4aa","code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"2403.15520","arxiv_id_is_arxiv":true,"paper":"/paper/gtc-gnn-transformer-co-contrastive-learning","title":"GTC: GNN-Transformer Co-contrastive Learning for Self-supervised Heterogeneous Graph Representation","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phd-lanyu/gtc","path":"code/self_tools/data_tools.py","file_url":"https://github.com/phd-lanyu/gtc/blob/HEAD/code/self_tools/data_tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, phd-lanyu/gtc when it was checked","code_sha256":"6c897974e5ceb4aa","code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"2401.14876","arxiv_id_is_arxiv":true,"paper":"/paper/cross-space-adaptive-filter-integrating-graph","title":"Cross-Space Adaptive Filter: Integrating Graph Topology and Node Attributes for Alleviating the Over-smoothing Problem","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangzichun/cross-space-adaptive-filter","path":"pygcn/utils.py","file_url":"https://github.com/huangzichun/cross-space-adaptive-filter/blob/HEAD/pygcn/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, huangzichun/cross-space-adaptive-filter when it was checked","code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2311.17373","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-is-in-the-data-learning-fair-graph","title":"The Devil is in the Data: Learning Fair Graph Neural Networks via Partial Knowledge Distillation","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzoomd/fairgkd","path":"utils.py","file_url":"https://github.com/zzoomd/fairgkd/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zzoomd/fairgkd when it was checked","code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2310.15653","arxiv_id_is_arxiv":true,"paper":"/paper/deceptive-fairness-attacks-on-graphs-via-meta","title":"Deceptive Fairness Attacks on Graphs via Meta Learning","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiank2/fate","path":"src/fagnn/utils.py","file_url":"https://github.com/jiank2/fate/blob/HEAD/src/fagnn/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jiank2/fate when it was checked","code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2306.08274","arxiv_id_is_arxiv":true,"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/utils_general.py","file_url":"https://github.com/seijimaekawa/a2dug/blob/HEAD/src/utils_general.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":"8f0f3f9102b8868f","code_sha256_prefix":"8f0f3f9102b8868f","mcp_get_code":{"code_sha256":"8f0f3f9102b8868f"}},{"arxiv_id":"2212.01574","arxiv_id_is_arxiv":true,"paper":"/paper/calibration-and-generalizability-of","title":"Calibration and generalizability of probabilistic models on low-data chemical datasets with DIONYSUS","date":"2022-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aspuru-guzik-group/dionysus","path":"dionysus/graphs.py","file_url":"https://github.com/aspuru-guzik-group/dionysus/blob/HEAD/dionysus/graphs.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":"7c188a8e77fa41df","code_sha256_prefix":"7c188a8e77fa41df","mcp_get_code":{"code_sha256":"7c188a8e77fa41df"}},{"arxiv_id":"2206.03014","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-is-in-the-labels-noisy-label-1","title":"The Devil is in the Labels: Noisy Label Correction for Robust Scene Graph Generation","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muktilin/nice","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/loss.py","file_url":"https://github.com/muktilin/nice/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, muktilin/nice (NOASSERTION)","code_sha256":"d4d71be64ca48d2a","code_sha256_prefix":"d4d71be64ca48d2a","mcp_get_code":{"code_sha256":"d4d71be64ca48d2a"}},{"arxiv_id":"2204.08770","arxiv_id_is_arxiv":true,"paper":"/paper/groupnet-multiscale-hypergraph-neural","title":"GroupNet: Multiscale Hypergraph Neural Networks for Trajectory Prediction with Relational Reasoning","date":"2022-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/groupnet","path":"model/GroupNet_nba.py","file_url":"https://github.com/mediabrain-sjtu/groupnet/blob/HEAD/model/GroupNet_nba.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2204.05351","arxiv_id_is_arxiv":true,"paper":"/paper/graph-ordering-attention-networks","title":"Graph Ordering Attention Networks","date":"2022-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michailchatzianastasis/goat","path":"utils.py","file_url":"https://github.com/michailchatzianastasis/goat/blob/HEAD/utils.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":"f9445ddf8653224c","code_sha256_prefix":"f9445ddf8653224c","mcp_get_code":{"code_sha256":"f9445ddf8653224c"}},{"arxiv_id":"2112.04575","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-kernel-graph-neural-network","title":"Adaptive Kernel Graph Neural Network","date":"2021-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jumxglhf/akgnn","path":"utils.py","file_url":"https://github.com/jumxglhf/akgnn/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2109.14285","arxiv_id_is_arxiv":true,"paper":"/paper/be-confident-towards-trustworthy-graph-neural","title":"Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibration","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/pygcn","path":"pygcn/utils.py","file_url":"https://github.com/tkipf/pygcn/blob/HEAD/pygcn/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2109.14285","arxiv_id_is_arxiv":true,"paper":"/paper/be-confident-towards-trustworthy-graph-neural","title":"Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibration","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Diego999/pyGAT","path":"utils.py","file_url":"https://github.com/Diego999/pyGAT/blob/HEAD/utils.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":"f9445ddf8653224c","code_sha256_prefix":"f9445ddf8653224c","mcp_get_code":{"code_sha256":"f9445ddf8653224c"}},{"arxiv_id":"2005.11079","arxiv_id_is_arxiv":true,"paper":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Grand20/grand","path":"pygcn/utils.py","file_url":"https://github.com/Grand20/grand/blob/HEAD/pygcn/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2005.06149","arxiv_id_is_arxiv":true,"paper":"/paper/deeprobust-a-pytorch-library-for-adversarial","title":"DeepRobust: A PyTorch Library for Adversarial Attacks and Defenses","date":"2020-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"I-am-Bot/DeepRobust","path":"deeprobust/graph/utils.py","file_url":"https://github.com/I-am-Bot/DeepRobust/blob/HEAD/deeprobust/graph/utils.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":"834ca5c476a3f197","code_sha256_prefix":"834ca5c476a3f197","mcp_get_code":{"code_sha256":"834ca5c476a3f197"}},{"arxiv_id":"2004.14949","arxiv_id_is_arxiv":true,"paper":"/paper/skipgnn-predicting-molecular-interactions","title":"SkipGNN: Predicting Molecular Interactions with Skip-Graph Networks","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kexinhuang12345/SkipGNN","path":"SkipGNN/utils.py","file_url":"https://github.com/kexinhuang12345/SkipGNN/blob/HEAD/SkipGNN/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2002.04784","arxiv_id_is_arxiv":true,"paper":"/paper/graph-universal-adversarial-attacks-a-few-bad","title":"Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chisam0217/Graph-Universal-Attack","path":"GUA/utils.py","file_url":"https://github.com/chisam0217/Graph-Universal-Attack/blob/HEAD/GUA/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1905.12921","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-the-alignment-of-graph-and","title":"Quantifying the Alignment of Graph and Features in Deep Learning","date":"2019-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haczqyf/gcn-data-alignment","path":"alignment/utils.py","file_url":"https://github.com/haczqyf/gcn-data-alignment/blob/HEAD/alignment/utils.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":"f9445ddf8653224c","code_sha256_prefix":"f9445ddf8653224c","mcp_get_code":{"code_sha256":"f9445ddf8653224c"}},{"arxiv_id":"1803.03735","arxiv_id_is_arxiv":true,"paper":"/paper/attention-based-graph-neural-network-for-semi","title":"Attention-based Graph Neural Network for Semi-supervised Learning","date":"2018-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dawnranger/pytorch-AGNN","path":"agnn/utils.py","file_url":"https://github.com/dawnranger/pytorch-AGNN/blob/HEAD/agnn/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Anak2016/GAT","path":"utils.py","file_url":"https://github.com/Anak2016/GAT/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1609.02907","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clin366/pygcn","path":"pygcn/utils.py","file_url":"https://github.com/clin366/pygcn/blob/HEAD/pygcn/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1609.02907","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"darnbi/pygcn","path":"pygcn/utils.py","file_url":"https://github.com/darnbi/pygcn/blob/HEAD/pygcn/utils.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":"880de3ec87607e47","code_sha256_prefix":"880de3ec87607e47","mcp_get_code":{"code_sha256":"880de3ec87607e47"}},{"arxiv_id":"aaai_29668","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29668","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yhzhu66/RNCGLN","path":"utils/process.py","file_url":"https://github.com/yhzhu66/RNCGLN/blob/HEAD/utils/process.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zxlearningdeep/InfoMGF, and GitHub detected no licence in that repository when it was checked","code_sha256":"6c897974e5ceb4aa","code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"aaai_29668","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29668","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yhzhu66/RNCGLN","path":"utils/utils.py","file_url":"https://github.com/yhzhu66/RNCGLN/blob/HEAD/utils/utils.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":"996030d9ac2a825d","code_sha256_prefix":"996030d9ac2a825d","mcp_get_code":{"code_sha256":"996030d9ac2a825d"}},{"arxiv_id":"aaai_20664","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20664","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jumxglhf/AKGNN","path":"utils.py","file_url":"https://github.com/jumxglhf/AKGNN/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ab88254add4c192","code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}}],"record_sha256":"e04a5c52529412491ecbc64c757013ae89b7f685368c0c1c9d82a79923d12651","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}