{"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/preprocess-graph","entry":"preprocess_graph","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":12,"n_papers_ran":5,"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":2,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":5},"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":"2308.05309","paper":"/paper/homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galogm/hole","path":"modules/encoder.py","file_url":"https://github.com/galogm/hole/blob/HEAD/modules/encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"baf6b2a764644e28","mcp_get_code":{"code_sha256":"baf6b2a764644e28"}},{"arxiv_id":"2104.14210","paper":"/paper/biased-edge-dropout-for-enhancing-fairness-in","title":"FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juellsprott/graphair-reproducibility","path":"models/fairgraph/method/fairadj/utils.py","file_url":"https://github.com/juellsprott/graphair-reproducibility/blob/HEAD/models/fairgraph/method/fairadj/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"13d9858ea957f943","mcp_get_code":{"code_sha256":"13d9858ea957f943"}},{"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":"junzhuang-code/lindt","path":"src/baselines/nettack/utils.py","file_url":"https://github.com/junzhuang-code/lindt/blob/HEAD/src/baselines/nettack/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fc3b508e487bb7c6","mcp_get_code":{"code_sha256":"fc3b508e487bb7c6"}},{"arxiv_id":"2004.13825","paper":"/paper/scalable-attack-on-graph-data-by-injecting","title":"Scalable Attack on Graph Data by Injecting Vicious Nodes","date":"2020-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjh-github/AFGSM","path":"utils.py","file_url":"https://github.com/wangjh-github/AFGSM/blob/HEAD/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":"1d93a3510e01307b","mcp_get_code":{"code_sha256":"1d93a3510e01307b"}},{"arxiv_id":"2002.03665","paper":"/paper/anomalydae-dual-autoencoder-for-anomaly","title":"AnomalyDAE: Dual autoencoder for anomaly detection on attributed networks","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoyfan/AnomalyDAE","path":"src/preprocessing.py","file_url":"https://github.com/haoyfan/AnomalyDAE/blob/HEAD/src/preprocessing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20362feefced8682","mcp_get_code":{"code_sha256":"20362feefced8682"}},{"arxiv_id":"1908.07078","paper":"/paper/semi-implicit-graph-variational-auto-encoders","title":"Semi-Implicit Graph Variational Auto-Encoders","date":"2019-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigvae/SIGraphVAE","path":"preprocessing.py","file_url":"https://github.com/sigvae/SIGraphVAE/blob/HEAD/preprocessing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"20362feefced8682","mcp_get_code":{"code_sha256":"20362feefced8682"}},{"arxiv_id":"1906.05017","paper":"/paper/graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangyue9607/BioNEV","path":"src/bionev/GAE/preprocessing.py","file_url":"https://github.com/xiangyue9607/BioNEV/blob/HEAD/src/bionev/GAE/preprocessing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20362feefced8682","mcp_get_code":{"code_sha256":"20362feefced8682"}},{"arxiv_id":"1902.08412","paper":"/paper/adversarial-attacks-on-graph-neural-networks","title":"Adversarial Attacks on Graph Neural Networks via Meta Learning","date":"2019-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/gnn-meta-attack","path":"metattack/utils.py","file_url":"https://github.com/danielzuegner/gnn-meta-attack/blob/HEAD/metattack/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d93a3510e01307b","mcp_get_code":{"code_sha256":"1d93a3510e01307b"}},{"arxiv_id":"1805.07984","paper":"/paper/adversarial-attacks-on-neural-networks-for","title":"Adversarial Attacks on Neural Networks for Graph Data","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/nettack","path":"nettack/utils.py","file_url":"https://github.com/danielzuegner/nettack/blob/HEAD/nettack/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fc3b508e487bb7c6","mcp_get_code":{"code_sha256":"fc3b508e487bb7c6"}},{"arxiv_id":"1611.07308","paper":"/paper/variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Omairss/RepresentationLearning","path":"src/preprocessing.py","file_url":"https://github.com/Omairss/RepresentationLearning/blob/HEAD/src/preprocessing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20362feefced8682","mcp_get_code":{"code_sha256":"20362feefced8682"}},{"arxiv_id":"ijcai2022_0498","paper":null,"title":"arXiv:ijcai2022_0498","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xinxingwu-uk/DGAE","path":"Python/Models/dgae_alpha/preprocessing.py","file_url":"https://github.com/xinxingwu-uk/DGAE/blob/HEAD/Python/Models/dgae_alpha/preprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f73ceb5cd877926","mcp_get_code":{"code_sha256":"6f73ceb5cd877926"}},{"arxiv_id":"aaai_20388","paper":null,"title":"arXiv:aaai_20388","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xuehansheng/RepBin","path":"utils.py","file_url":"https://github.com/xuehansheng/RepBin/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":"43e37d9c03b582a1","mcp_get_code":{"code_sha256":"43e37d9c03b582a1"}}]}