{"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/graph-data-obj-to-nx-simple","entry":"graph_data_obj_to_nx_simple","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":11,"n_papers_ran_no_instrument_failure":11,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":0},"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":"2408.03195","arxiv_id_is_arxiv":true,"paper":"/paper/2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JasonZhujp/RELIEF","path":"graph_level/loader.py","file_url":"https://github.com/JasonZhujp/RELIEF/blob/HEAD/graph_level/loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, JasonZhujp/RELIEF when it was checked","code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}},{"arxiv_id":"2407.00891","arxiv_id_is_arxiv":true,"paper":"/paper/zeroddi-a-zero-shot-drug-drug-interaction","title":"ZeroDDI: A Zero-Shot Drug-Drug Interaction Event Prediction Method with Semantic Enhanced Learning and Dual-Modal Uniform Alignment","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzy-Sarah/ZeroDDI","path":"models/left/graph/graph_init.py","file_url":"https://github.com/wzy-Sarah/ZeroDDI/blob/HEAD/models/left/graph/graph_init.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, wzy-Sarah/ZeroDDI when it was checked","code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}},{"arxiv_id":"2404.15806","arxiv_id_is_arxiv":true,"paper":"/paper/where-to-mask-structure-guided-masking-for","title":"Where to Mask: Structure-Guided Masking for Graph Masked Autoencoders","date":"2024-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiuChuang0059/StructMAE","path":"StructMAE-L/chem/loader.py","file_url":"https://github.com/LiuChuang0059/StructMAE/blob/HEAD/StructMAE-L/chem/loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, LiuChuang0059/StructMAE when it was checked","code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}},{"arxiv_id":"2310.14753","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-tokenizer-and-decoder-in-masked-1","title":"Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syr-cn/simsgt","path":"chem/loader.py","file_url":"https://github.com/syr-cn/simsgt/blob/HEAD/chem/loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, syr-cn/simsgt when it was checked","code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}},{"arxiv_id":"2310.03274","arxiv_id_is_arxiv":true,"paper":"/paper/fragment-based-pretraining-and-finetuning-on-1","title":"Fragment-based Pretraining and Finetuning on Molecular Graphs","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvkd84/graphfp","path":"long-range/loader.py","file_url":"https://github.com/lvkd84/graphfp/blob/HEAD/long-range/loader.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, lvkd84/graphfp when it was checked","code_sha256":"0b56b7fab3aefc9e","code_sha256_prefix":"0b56b7fab3aefc9e","mcp_get_code":{"code_sha256":"0b56b7fab3aefc9e"}},{"arxiv_id":"2309.15123","arxiv_id_is_arxiv":true,"paper":"/paper/uncovering-neural-scaling-laws-in-molecular-1","title":"Uncovering Neural Scaling Laws in Molecular Representation Learning","date":"2023-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"data-reindeer/nsl_mrl","path":"datasets/molnet.py","file_url":"https://github.com/data-reindeer/nsl_mrl/blob/HEAD/datasets/molnet.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":"2c709535eb367b46","code_sha256_prefix":"2c709535eb367b46","mcp_get_code":{"code_sha256":"2c709535eb367b46"}},{"arxiv_id":"2309.04589","arxiv_id_is_arxiv":true,"paper":"/paper/motif-aware-attribute-masking-for-molecular","title":"Motif-aware Attribute Masking for Molecular Graph Pre-training","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"einae-nd/moama-dev","path":"loader.py","file_url":"https://github.com/einae-nd/moama-dev/blob/HEAD/loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, einae-nd/moama-dev when it was checked","code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}},{"arxiv_id":"2309.01788","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-grammar-induced-geometry-for","title":"Hierarchical Grammar-Induced Geometry for Data-Efficient Molecular Property Prediction","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmh14/Geo-DEG","path":"GCN/loader.py","file_url":"https://github.com/gmh14/Geo-DEG/blob/HEAD/GCN/loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}},{"arxiv_id":"2306.07812","arxiv_id_is_arxiv":true,"paper":"/paper/automated-3d-pre-training-for-molecular","title":"Automated 3D Pre-Training for Molecular Property Prediction","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lars-research/3d-pgt","path":"datasets/molecule_datasets.py","file_url":"https://github.com/lars-research/3d-pgt/blob/HEAD/datasets/molecule_datasets.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":"4a563e1e2a6aa4b8","code_sha256_prefix":"4a563e1e2a6aa4b8","mcp_get_code":{"code_sha256":"4a563e1e2a6aa4b8"}},{"arxiv_id":"2302.04451","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-in-graph-neural-networks","title":"Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion","date":"2023-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neu-statsml-research/generalization-in-graph-neural-networks","path":"src/loader.py","file_url":"https://github.com/neu-statsml-research/generalization-in-graph-neural-networks/blob/HEAD/src/loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}},{"arxiv_id":"1905.12265","arxiv_id_is_arxiv":true,"paper":"/paper/pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leffff/any-domain-pretrain-gnns","path":"modules/util.py","file_url":"https://github.com/leffff/any-domain-pretrain-gnns/blob/HEAD/modules/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"287484b87212f47d","code_sha256_prefix":"287484b87212f47d","mcp_get_code":{"code_sha256":"287484b87212f47d"}}],"record_sha256":"00fa5e33b6d1797482ba0352aca2688c2380f172d20a674c39bdccf8cb14b61b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}