{"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/load-cora","entry":"load_cora","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":5,"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":4,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":4},"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.14934","paper":"/paper/robust-graph-neural-networks-via-unbiased","title":"Robust Graph Neural Networks via Unbiased Aggregation","date":"2023-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chris-hzc/RUNG","path":"load_graph.py","file_url":"https://github.com/chris-hzc/RUNG/blob/HEAD/load_graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4e4cc9cc5f692636","mcp_get_code":{"code_sha256":"4e4cc9cc5f692636"}},{"arxiv_id":"2310.09872","paper":"/paper/empower-text-attributed-graphs-learning-with","title":"Leveraging Large Language Models for Node Generation in Few-Shot Learning on Text-Attributed Graphs","date":"2023-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianxiangyu/llm4ng","path":"load_cora.py","file_url":"https://github.com/jianxiangyu/llm4ng/blob/HEAD/load_cora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"29aa1f2c77d5d79d","mcp_get_code":{"code_sha256":"29aa1f2c77d5d79d"}},{"arxiv_id":"2310.06396","paper":"/paper/adversarial-robustness-in-graph-neural-1","title":"Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LFhase/GIA-HAO","path":"load_graph.py","file_url":"https://github.com/LFhase/GIA-HAO/blob/HEAD/load_graph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e4cc9cc5f692636","mcp_get_code":{"code_sha256":"4e4cc9cc5f692636"}},{"arxiv_id":"2006.03814","paper":"/paper/are-graph-convolutional-networks-fully","title":"The Impact of Global Structural Information in Graph Neural Networks Applications","date":"2020-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DavideBuffelli/RWRReg","path":"model.py","file_url":"https://github.com/DavideBuffelli/RWRReg/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5398072b4d5dd35d","mcp_get_code":{"code_sha256":"5398072b4d5dd35d"}},{"arxiv_id":"1811.01900","paper":"/paper/janossy-pooling-learning-deep-permutation","title":"Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs","date":"2018-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PurdueMINDS/JanossyPooling","path":"graphsage/janossy_gs/data_loaders.py","file_url":"https://github.com/PurdueMINDS/JanossyPooling/blob/HEAD/graphsage/janossy_gs/data_loaders.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":"ba1e89d4d70b19c6","mcp_get_code":{"code_sha256":"ba1e89d4d70b19c6"}}]}