{"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/mask-nodes","entry":"mask_nodes","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":5,"n_samples_ran":4,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":1,"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":"2506.04542","paper":"/paper/neural-mjd-neural-non-stationary-merton-jump","title":"Neural MJD: Neural Non-Stationary Merton Jump Diffusion for Time Series Prediction","date":"2025-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DSL-Lab/neural-MJD","path":"model/mjd/neural_mjd.py","file_url":"https://github.com/DSL-Lab/neural-MJD/blob/HEAD/model/mjd/neural_mjd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"47a5972978dceccf","mcp_get_code":{"code_sha256":"47a5972978dceccf"}},{"arxiv_id":"2411.15206","paper":"/paper/self-supervised-conditional-distribution","title":"Conditional Distribution Learning on Graphs","date":"2024-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenjie20/SSCDL","path":"augument.py","file_url":"https://github.com/chenjie20/SSCDL/blob/HEAD/augument.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f73c826daedeb57d","mcp_get_code":{"code_sha256":"f73c826daedeb57d"}},{"arxiv_id":"2402.09834","paper":"/paper/all-in-one-and-one-for-all-a-simple-yet","title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cshhzhao/gcope","path":"src/algorithm/graph_augment.py","file_url":"https://github.com/cshhzhao/gcope/blob/HEAD/src/algorithm/graph_augment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a59f07da1dc11d7","mcp_get_code":{"code_sha256":"8a59f07da1dc11d7"}},{"arxiv_id":"2106.04113","paper":"/paper/self-supervised-graph-level-representation-1","title":"Self-supervised Graph-level Representation Learning with Local and Global Structure","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepGraphLearning/GraphLoG","path":"pretrain_graphlog.py","file_url":"https://github.com/DeepGraphLearning/GraphLoG/blob/HEAD/pretrain_graphlog.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"22c33ba989bdf71c","mcp_get_code":{"code_sha256":"22c33ba989bdf71c"}},{"arxiv_id":"2010.13902","paper":"/paper/graph-contrastive-learning-with-augmentations","title":"Graph Contrastive Learning with Augmentations","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shen-Lab/GraphCL_Automated","path":"unsupervised_TU/aug.py","file_url":"https://github.com/Shen-Lab/GraphCL_Automated/blob/HEAD/unsupervised_TU/aug.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"122a8f8967440f5a","mcp_get_code":{"code_sha256":"122a8f8967440f5a"}}]}