{"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/largest-connected-components","entry":"largest_connected_components","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":0,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":0,"ran":7,"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":"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/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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jiank2/fate when it was checked","code_sha256":"bd1ae6a71dec779d","code_sha256_prefix":"bd1ae6a71dec779d","mcp_get_code":{"code_sha256":"bd1ae6a71dec779d"}},{"arxiv_id":"2308.06801","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jie-re/sailor when it was checked","code_sha256":"fa55782ae86522c2","code_sha256_prefix":"fa55782ae86522c2","mcp_get_code":{"code_sha256":"fa55782ae86522c2"}},{"arxiv_id":"2007.08216","arxiv_id_is_arxiv":true,"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":"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":"a9c1bf34eaa3d811","code_sha256_prefix":"a9c1bf34eaa3d811","mcp_get_code":{"code_sha256":"a9c1bf34eaa3d811"}},{"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":"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":"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":"f18b6a502c85b70f","code_sha256_prefix":"f18b6a502c85b70f","mcp_get_code":{"code_sha256":"f18b6a502c85b70f"}},{"arxiv_id":"2004.13825","arxiv_id_is_arxiv":true,"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":"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":"11c8a4ad13f75fe4","code_sha256_prefix":"11c8a4ad13f75fe4","mcp_get_code":{"code_sha256":"11c8a4ad13f75fe4"}},{"arxiv_id":"2002.10306","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f696fb0f5b7895f8","code_sha256_prefix":"f696fb0f5b7895f8","mcp_get_code":{"code_sha256":"f696fb0f5b7895f8"}},{"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","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":"11c8a4ad13f75fe4","code_sha256_prefix":"11c8a4ad13f75fe4","mcp_get_code":{"code_sha256":"11c8a4ad13f75fe4"}},{"arxiv_id":"1903.04154","arxiv_id_is_arxiv":true,"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":"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":"88a77fd6e7ad9f83","code_sha256_prefix":"88a77fd6e7ad9f83","mcp_get_code":{"code_sha256":"88a77fd6e7ad9f83"}},{"arxiv_id":"1902.08412","arxiv_id_is_arxiv":true,"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":"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":"11c8a4ad13f75fe4","code_sha256_prefix":"11c8a4ad13f75fe4","mcp_get_code":{"code_sha256":"11c8a4ad13f75fe4"}},{"arxiv_id":"1805.07984","arxiv_id_is_arxiv":true,"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":"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":"f18b6a502c85b70f","code_sha256_prefix":"f18b6a502c85b70f","mcp_get_code":{"code_sha256":"f18b6a502c85b70f"}},{"arxiv_id":"1803.00816","arxiv_id_is_arxiv":true,"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":"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":"134a930a34a58173","code_sha256_prefix":"134a930a34a58173","mcp_get_code":{"code_sha256":"134a930a34a58173"}}],"record_sha256":"aeb52599bf54b0ce769f464f1d5172244e5a6a6eee222b421a6fa5519f6d8ef9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}