{"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/largest-connected-components","entry":"largest_connected_components","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":11,"n_papers_ran":2,"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":8,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":6},"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":"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/baseline_attack.py","file_url":"https://github.com/jiank2/fate/blob/HEAD/src/baseline_attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bd1ae6a71dec779d","mcp_get_code":{"code_sha256":"bd1ae6a71dec779d"}},{"arxiv_id":"2308.06801","paper":"/paper/sailor-structural-augmentation-based-tail","title":"SAILOR: Structural Augmentation Based Tail Node Representation Learning","date":"2023-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jie-re/sailor","path":"dataset.py","file_url":"https://github.com/jie-re/sailor/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fa55782ae86522c2","mcp_get_code":{"code_sha256":"fa55782ae86522c2"}},{"arxiv_id":"2007.08216","paper":"/paper/graph-topology-inference-benchmarks-for","title":"Graph topology inference benchmarks for machine learning","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cadurosar/benchmark_graphinference","path":"generate_graph.py","file_url":"https://github.com/cadurosar/benchmark_graphinference/blob/HEAD/generate_graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9c1bf34eaa3d811","mcp_get_code":{"code_sha256":"a9c1bf34eaa3d811"}},{"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":"f18b6a502c85b70f","mcp_get_code":{"code_sha256":"f18b6a502c85b70f"}},{"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":"11c8a4ad13f75fe4","mcp_get_code":{"code_sha256":"11c8a4ad13f75fe4"}},{"arxiv_id":"2002.10306","paper":"/paper/adaptive-propagation-graph-convolutional","title":"Adaptive Propagation Graph Convolutional Network","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spindro/AP-GCN","path":"sparsegraph.py","file_url":"https://github.com/spindro/AP-GCN/blob/HEAD/sparsegraph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f696fb0f5b7895f8","mcp_get_code":{"code_sha256":"f696fb0f5b7895f8"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"11c8a4ad13f75fe4","mcp_get_code":{"code_sha256":"11c8a4ad13f75fe4"}},{"arxiv_id":"1903.04154","paper":"/paper/fisher-bures-adversary-graph-convolutional","title":"Fisher-Bures Adversary Graph Convolutional Networks","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stellargraph/FisherGCN","path":"gcn/data_io.py","file_url":"https://github.com/stellargraph/FisherGCN/blob/HEAD/gcn/data_io.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"88a77fd6e7ad9f83","mcp_get_code":{"code_sha256":"88a77fd6e7ad9f83"}},{"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":"11c8a4ad13f75fe4","mcp_get_code":{"code_sha256":"11c8a4ad13f75fe4"}},{"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":"f18b6a502c85b70f","mcp_get_code":{"code_sha256":"f18b6a502c85b70f"}},{"arxiv_id":"1803.00816","paper":"/paper/netgan-generating-graphs-via-random-walks","title":"NetGAN: Generating Graphs via Random Walks","date":"2018-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/netgan","path":"netgan/utils.py","file_url":"https://github.com/danielzuegner/netgan/blob/HEAD/netgan/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"134a930a34a58173","mcp_get_code":{"code_sha256":"134a930a34a58173"}}]}