{"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/alias-setup","entry":"alias_setup","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":6,"n_papers_ran":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":3,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2311.11114","paper":"/paper/environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FeiGSSS/DySAT_pytorch","path":"utils/random_walk.py","file_url":"https://github.com/FeiGSSS/DySAT_pytorch/blob/HEAD/utils/random_walk.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0f462717a557f615","mcp_get_code":{"code_sha256":"0f462717a557f615"}},{"arxiv_id":"2002.05257","paper":"/paper/shortest-path-distance-approximation-using","title":"Shortest path distance approximation using deep learning techniques","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nayash/shortest-distance-approx-deep-learning","path":"src/node2vec/node2vec3.py","file_url":"https://github.com/nayash/shortest-distance-approx-deep-learning/blob/HEAD/src/node2vec/node2vec3.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":"0ddb0dd1cf3b67dd","mcp_get_code":{"code_sha256":"0ddb0dd1cf3b67dd"}},{"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":"node2vec/graph.py","file_url":"https://github.com/chisam0217/Graph-Universal-Attack/blob/HEAD/node2vec/graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b097b719cf49daca","mcp_get_code":{"code_sha256":"b097b719cf49daca"}},{"arxiv_id":"1911.08415","paper":"/paper/gman-a-graph-multi-attention-network-for","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengchuanpan/GMAN","path":"METR/node2vec/node2vec.py","file_url":"https://github.com/zhengchuanpan/GMAN/blob/HEAD/METR/node2vec/node2vec.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":"0ddb0dd1cf3b67dd","mcp_get_code":{"code_sha256":"0ddb0dd1cf3b67dd"}},{"arxiv_id":"1911.02613","paper":"/paper/hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ma-compbio/Hyper-SAGNN","path":"Code/random_walk_hyper.py","file_url":"https://github.com/ma-compbio/Hyper-SAGNN/blob/HEAD/Code/random_walk_hyper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f462717a557f615","mcp_get_code":{"code_sha256":"0f462717a557f615"}},{"arxiv_id":"1607.00653","paper":"/paper/node2vec-scalable-feature-learning-for","title":"node2vec: Scalable Feature Learning for Networks","date":"2016-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WiktorJ/msnode2vec","path":"src3/node2vec.py","file_url":"https://github.com/WiktorJ/msnode2vec/blob/HEAD/src3/node2vec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f462717a557f615","mcp_get_code":{"code_sha256":"0f462717a557f615"}}]}