{"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/get-graph-drop-transform","entry":"get_graph_drop_transform","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":4,"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":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2606.10284","paper":"/paper/arxiv-2606-10284","title":"Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"nerdslab/bgrl","path":"bgrl/transforms.py","file_url":"https://github.com/nerdslab/bgrl/blob/HEAD/bgrl/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"524d998681e42414","mcp_get_code":{"code_sha256":"524d998681e42414"}},{"arxiv_id":"2506.15698","paper":null,"title":"arXiv:2506.15698","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"yunhak0/Spotscape","path":"utils/transform.py","file_url":"https://github.com/yunhak0/Spotscape/blob/HEAD/utils/transform.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0350077c97b9bf3","mcp_get_code":{"code_sha256":"e0350077c97b9bf3"}},{"arxiv_id":"2408.05087","paper":"/paper/bootstrap-latents-of-nodes-and-neighbors-for","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","date":"2024-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cloudy1225/blnn","path":"bgrl/transforms.py","file_url":"https://github.com/cloudy1225/blnn/blob/HEAD/bgrl/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6eb314269b842f3d","mcp_get_code":{"code_sha256":"6eb314269b842f3d"}},{"arxiv_id":"2312.02619","paper":"/paper/rethinking-and-simplifying-bootstrapped-graph","title":"Rethinking and Simplifying Bootstrapped Graph Latents","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zszszs25/sgcl","path":"bgrl/transforms.py","file_url":"https://github.com/zszszs25/sgcl/blob/HEAD/bgrl/transforms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"524d998681e42414","mcp_get_code":{"code_sha256":"524d998681e42414"}},{"arxiv_id":"2310.18765","paper":"/paper/rethinking-semi-supervised-imbalanced-node-1","title":"Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanliang3612/revar","path":"src/transform.py","file_url":"https://github.com/yanliang3612/revar/blob/HEAD/src/transform.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ea120e13a23eaa4c","mcp_get_code":{"code_sha256":"ea120e13a23eaa4c"}}]}