{"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/encode-onehot","entry":"encode_onehot","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":24,"n_papers_ran":18,"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":3,"n_samples_fingerprinted":2,"n_places":27,"n_places_pointer_only":7,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":7},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19be62d06f0eec5f","mcp_get_code":{"code_sha256":"19be62d06f0eec5f"}},{"arxiv_id":"2409.17386","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,"code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"2407.16863","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,"code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"2403.15520","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,"code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"2401.14876","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2311.17373","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2310.15653","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"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/utils_general.py","file_url":"https://github.com/seijimaekawa/a2dug/blob/HEAD/src/utils_general.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f0f3f9102b8868f","mcp_get_code":{"code_sha256":"8f0f3f9102b8868f"}},{"arxiv_id":"2212.01574","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c188a8e77fa41df","mcp_get_code":{"code_sha256":"7c188a8e77fa41df"}},{"arxiv_id":"2206.03014","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,"code_sha256_prefix":"d4d71be64ca48d2a","mcp_get_code":{"code_sha256":"d4d71be64ca48d2a"}},{"arxiv_id":"2204.08770","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2204.05351","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9445ddf8653224c","mcp_get_code":{"code_sha256":"f9445ddf8653224c"}},{"arxiv_id":"2112.04575","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2109.14285","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2109.14285","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9445ddf8653224c","mcp_get_code":{"code_sha256":"f9445ddf8653224c"}},{"arxiv_id":"2005.11079","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2005.06149","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"834ca5c476a3f197","mcp_get_code":{"code_sha256":"834ca5c476a3f197"}},{"arxiv_id":"2004.14949","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"2002.04784","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1905.12921","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9445ddf8653224c","mcp_get_code":{"code_sha256":"f9445ddf8653224c"}},{"arxiv_id":"1803.03735","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1710.10903","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1609.02907","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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}},{"arxiv_id":"1609.02907","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"880de3ec87607e47","mcp_get_code":{"code_sha256":"880de3ec87607e47"}},{"arxiv_id":"aaai_29668","paper":null,"title":"arXiv: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":true,"code_sha256_prefix":"6c897974e5ceb4aa","mcp_get_code":{"code_sha256":"6c897974e5ceb4aa"}},{"arxiv_id":"aaai_29668","paper":null,"title":"arXiv: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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"996030d9ac2a825d","mcp_get_code":{"code_sha256":"996030d9ac2a825d"}},{"arxiv_id":"aaai_20664","paper":null,"title":"arXiv: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,"code_sha256_prefix":"3ab88254add4c192","mcp_get_code":{"code_sha256":"3ab88254add4c192"}}]}