{"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":"/task/property-prediction/papers/ran/2","list_of":"/task/property-prediction","task":"Property Prediction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,116],"of":116,"counts":{"archive_papers_tagged":691,"with_a_code_link":352,"where_syntology_ran_a_sample":116,"not_listed_spam_title":0,"listed":691,"listed_where_code_ran":116,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":96,"every_run_a_failure_of_syntologys_instrument":20,"listed_with_a_run_with_no_instrument_failure":96,"listed_every_run_a_failure_of_syntologys_instrument":20,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/property-prediction/papers/ran/1","prev":"/task/property-prediction/papers/ran/1","next":null,"papers":[{"url":"/paper/materials-representation-and-transfer","slug":"materials-representation-and-transfer","title":"Materials Representation and Transfer Learning for Multi-Property Prediction","date":"2021-06-04","arxiv_id":"2106.02225","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/materials-representation-and-transfer#ran","syntology_url":"https://syntology.ai/paper/2106.02225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02225"}},"official":{"repos":["gomes-lab/H-CLMP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/meta-learning-with-fewer-tasks-through-task","slug":"meta-learning-with-fewer-tasks-through-task","title":"Meta-Learning with Fewer Tasks through Task Interpolation","date":"2021-06-04","arxiv_id":"2106.02695","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/meta-learning-with-fewer-tasks-through-task#ran","syntology_url":"https://syntology.ai/paper/2106.02695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02695"}},"official":{"repos":["huaxiuyao/mlti"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meg-generating-molecular-counterfactual","slug":"meg-generating-molecular-counterfactual","title":"MEG: Generating Molecular Counterfactual Explanations for Deep Graph Networks","date":"2021-04-16","arxiv_id":"2104.08060","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meg-generating-molecular-counterfactual#ran","syntology_url":"https://syntology.ai/paper/2104.08060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08060"}},"official":null}},{"url":"/paper/controlled-molecule-generator-for-optimizing","slug":"controlled-molecule-generator-for-optimizing","title":"Controlled Molecule Generator for Optimizing Multiple Chemical Properties","date":"2020-10-26","arxiv_id":"2010.13908","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/controlled-molecule-generator-for-optimizing#ran","syntology_url":"https://syntology.ai/paper/2010.13908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13908"}},"official":{"repos":["deargen/cmg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/chemberta-large-scale-self-supervised","slug":"chemberta-large-scale-self-supervised","title":"ChemBERTa: Large-Scale Self-Supervised Pretraining for Molecular Property Prediction","date":"2020-10-19","arxiv_id":"2010.09885","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/chemberta-large-scale-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2010.09885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09885"}},"official":{"repos":["seyonechithrananda/bert-loves-chemistry"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/relevance-of-rotationally-equivariant","slug":"relevance-of-rotationally-equivariant","title":"Relevance of Rotationally Equivariant Convolutions for Predicting Molecular Properties","date":"2020-08-19","arxiv_id":"2008.08461","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/relevance-of-rotationally-equivariant#ran","syntology_url":"https://syntology.ai/paper/2008.08461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.08461"}},"official":{"repos":["bkmi/equivariant-benchmark"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/object-centric-learning-with-slot-attention","slug":"object-centric-learning-with-slot-attention","title":"Object-Centric Learning with Slot Attention","date":"2020-06-26","arxiv_id":"2006.15055","repositories_listed":8,"syntology":{"n":21,"n_ran":14,"n_constructed":7,"n_ran_checked":9,"n_instrument":5,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":7,"phrase":"14 ran (of which 7 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/object-centric-learning-with-slot-attention#ran","syntology_url":"https://syntology.ai/paper/2006.15055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15055"}},"official":{"repos":["google-research/google-research"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/optimal-transport-graph-neural-networks","slug":"optimal-transport-graph-neural-networks","title":"Optimal Transport Graph Neural Networks","date":"2020-06-08","arxiv_id":"2006.04804","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-transport-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.04804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04804"}},"official":{"repos":["benatorc/OTGNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-quantification-using-neural","slug":"uncertainty-quantification-using-neural","title":"Uncertainty Quantification Using Neural Networks for Molecular Property Prediction","date":"2020-05-20","arxiv_id":"2005.10036","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/uncertainty-quantification-using-neural#ran","syntology_url":"https://syntology.ai/paper/2005.10036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10036"}},"official":{"repos":["lhirschfeld/ChempropUncertaintyQuantification"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/molecule-attention-transformer","slug":"molecule-attention-transformer","title":"Molecule Attention Transformer","date":"2020-02-19","arxiv_id":"2002.08264","repositories_listed":7,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/molecule-attention-transformer#ran","syntology_url":"https://syntology.ai/paper/2002.08264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08264"}},"official":{"repos":["gmum/MAT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/molecule-property-prediction-and-1","slug":"molecule-property-prediction-and-1","title":"Molecule Property Prediction and Classification with Graph Hypernetworks","date":"2020-02-01","arxiv_id":"2002.00240","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/molecule-property-prediction-and-1#ran","syntology_url":"https://syntology.ai/paper/2002.00240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00240"}},"official":null}},{"url":"/paper/pre-training-graph-neural-networks","slug":"pre-training-graph-neural-networks","title":"Strategies for Pre-training Graph Neural Networks","date":"2019-05-29","arxiv_id":"1905.12265","repositories_listed":11,"syntology":{"n":14,"n_ran":13,"n_constructed":1,"n_ran_checked":9,"n_instrument":4,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"13 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pre-training-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1905.12265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12265"}},"official":{"repos":["snap-stanford/pretrain-gnns"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/path-augmented-graph-transformer-network","slug":"path-augmented-graph-transformer-network","title":"Path-Augmented Graph Transformer Network","date":"2019-05-29","arxiv_id":"1905.12712","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/path-augmented-graph-transformer-network#ran","syntology_url":"https://syntology.ai/paper/1905.12712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12712"}},"official":{"repos":["benatorc/PA-Graph-Transformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/are-learned-molecular-representations-ready","slug":"are-learned-molecular-representations-ready","title":"Analyzing Learned Molecular Representations for Property Prediction","date":"2019-04-02","arxiv_id":"1904.01561","repositories_listed":4,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":3,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/are-learned-molecular-representations-ready#ran","syntology_url":"https://syntology.ai/paper/1904.01561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01561"}},"official":{"repos":["swansonk14/chemprop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/bayesgrad-explaining-predictions-of-graph","slug":"bayesgrad-explaining-predictions-of-graph","title":"BayesGrad: Explaining Predictions of Graph Convolutional Networks","date":"2018-07-04","arxiv_id":"1807.01985","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayesgrad-explaining-predictions-of-graph#ran","syntology_url":"https://syntology.ai/paper/1807.01985","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.01985"}},"official":{"repos":["pfnet-research/bayesgrad"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-message-passing-for-quantum-chemistry","slug":"neural-message-passing-for-quantum-chemistry","title":"Neural Message Passing for Quantum Chemistry","date":"2017-04-04","arxiv_id":"1704.01212","repositories_listed":20,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-message-passing-for-quantum-chemistry#ran","syntology_url":"https://syntology.ai/paper/1704.01212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01212"}},"official":{"repos":["brain-research/mpnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"af37dfcccb4d2a73550e1e6f63f2f4e5618f2323bb08d0aed981fd0677bb469f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}