{"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":"/dataset/esol-scaffold","name":"ESOL (Estimated SOLubility)","full_name":null,"description_markdown":"ESOL is a water solubility prediction dataset consisting of 1128 samples.","description_withheld":null,"homepage":"https://moleculenet.org","introduced_date":"2022-06-23","introduced_date_note":null,"introduced_by":{"paper":"/paper/an-adaptive-graph-learning-method-for","title":"An adaptive graph learning method for automated molecular interactions and properties predictions","first_author":"Yuquan Li","url":null},"license":null,"modalities":[],"tasks":[{"name":"Drug Discovery","url":"/task/drug-discovery","datasets_with_task":"/datasets/task/drug-discovery"},{"name":"Graph Regression","url":"/task/graph-regression","datasets_with_task":"/datasets/task/graph-regression"},{"name":"Molecular Property Prediction","url":"/task/molecular-property-prediction","datasets_with_task":"/datasets/task/molecular-property-prediction"},{"name":"Log Solubility","url":"/task/log-solubility","datasets_with_task":"/datasets/task/log-solubility"}],"languages":[],"variants":["ESOL","ESOL (Estimated SOLubility)"],"data_loaders":[],"num_papers_in_archive":25,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/molecular-property-prediction-on-esol","task":"Molecular Property Prediction","dataset_variant":"ESOL","rows":20,"metrics":["RMSE","R2"],"first_row_in_archive_order":{"model":"ESA (Edge set attention, no positional encodings)","paper":"/paper/masked-attention-is-all-you-need-for-graphs","metrics":{"R2":"0.944±0.002","RMSE":"0.485±0.009"},"code_links":[{"title":"davidbuterez/edge-set-attention","url":"https://github.com/davidbuterez/edge-set-attention"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/drug-discovery-on-esol-scaffold","task":"Drug Discovery","dataset_variant":"ESOL (Estimated SOLubility)","rows":1,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"GLAM","paper":"/paper/an-adaptive-graph-learning-method-for","metrics":{"RMSE":"0.592"},"code_links":[{"title":"yvquanli/GLAM","url":"https://github.com/yvquanli/GLAM"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-regression-on-esol","task":"Graph Regression","dataset_variant":"ESOL","rows":1,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"ProtoW-dot","paper":"/paper/optimal-transport-graph-neural-networks","metrics":{"RMSE":".594"},"code_links":[{"title":"benatorc/OTGNN","url":"https://github.com/benatorc/OTGNN"},{"title":"jbr-ai-labs/lipophilicity-prediction","url":"https://github.com/jbr-ai-labs/lipophilicity-prediction"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/log-solubility-on-esol","task":"Log Solubility","dataset_variant":"ESOL","rows":1,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"GP","paper":"/paper/polyatomic-complexes-a-topologically-informed","metrics":{"RMSE":"8.0 ± 0.3"},"code_links":[{"title":"rahulkhorana/PolyatomicComplexes","url":"https://github.com/rahulkhorana/PolyatomicComplexes"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":22,"of":22,"counts":{"papers_with_a_benchmark_row":22,"with_a_code_link":21,"where_syntology_ran_a_sample":13,"not_listed_spam_title":0,"listed":22,"listed_where_code_ran":13,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":2,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/pre-training-graph-neural-networks-on","slug":"pre-training-graph-neural-networks-on","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2025-02-20","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/polyatomic-complexes-a-topologically-informed","slug":"polyatomic-complexes-a-topologically-informed","title":"Polyatomic Complexes: A topologically-informed learning representation for atomistic systems","date":"2024-09-23","arxiv_id":"2409.15600","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["rahulkhorana/PolyatomicComplexes"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/polyatomic-complexes-a-topologically-informed#ran","syntology_url":"https://syntology.ai/paper/2409.15600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.15600"}}}},{"paper":"/paper/a-bayesian-flow-network-framework-for","slug":"a-bayesian-flow-network-framework-for","title":"A Bayesian Flow Network Framework for Chemistry Tasks","date":"2024-07-28","arxiv_id":"2407.20294","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-guided-masked-autoencoders-for-domain","slug":"self-guided-masked-autoencoders-for-domain","title":"Self-Guided Masked Autoencoders for Domain-Agnostic Self-Supervised Learning","date":"2024-02-22","arxiv_id":"2402.14789","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":5,"samples_unverified":4,"pointer_only_for_licence":8,"official":{"repos":["johnathan-xie/sma"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/self-guided-masked-autoencoders-for-domain#ran","syntology_url":"https://syntology.ai/paper/2402.14789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14789"}}}},{"paper":"/paper/masked-attention-is-all-you-need-for-graphs","slug":"masked-attention-is-all-you-need-for-graphs","title":"An end-to-end attention-based approach for learning on graphs","date":"2024-02-16","arxiv_id":"2402.10793","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/molecular-structure-property-co-trained","slug":"molecular-structure-property-co-trained","title":"Bidirectional Generation of Structure and Properties Through a Single Molecular Foundation Model","date":"2022-11-19","arxiv_id":"2211.10590","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jinhojsk515/SPMM"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/molecular-structure-property-co-trained#ran","syntology_url":"https://syntology.ai/paper/2211.10590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.10590"}}}},{"paper":"/paper/uni-mol-a-universal-3d-molecular","slug":"uni-mol-a-universal-3d-molecular","title":"Uni-Mol: A Universal 3D Molecular Representation Learning Framework","date":"2022-09-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/chemberta-2-towards-chemical-foundation","slug":"chemberta-2-towards-chemical-foundation","title":"ChemBERTa-2: Towards Chemical Foundation Models","date":"2022-09-05","arxiv_id":"2209.01712","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/pure-transformers-are-powerful-graph-learners","slug":"pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","arxiv_id":"2207.02505","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["jw9730/tokengt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pure-transformers-are-powerful-graph-learners#ran","syntology_url":"https://syntology.ai/paper/2207.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02505"}}}},{"paper":"/paper/an-adaptive-graph-learning-method-for","slug":"an-adaptive-graph-learning-method-for","title":"An adaptive graph learning method for automated molecular interactions and properties predictions","date":"2022-06-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":18,"pointer_only_for_licence":0,"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}}}},{"paper":"/paper/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}}}},{"paper":"/paper/chemrl-gem-geometry-enhanced-molecular","slug":"chemrl-gem-geometry-enhanced-molecular","title":"ChemRL-GEM: Geometry Enhanced Molecular Representation Learning for Property Prediction","date":"2021-06-11","arxiv_id":"2106.06130","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":11,"samples_constructed":1,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":5,"pointer_only_for_licence":1,"official":{"repos":["tech-srl/how_attentive_are_gats"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/principal-neighbourhood-aggregation-for-graph","slug":"principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":55,"samples_ran":33,"samples_constructed":4,"samples_ran_checked":11,"samples_ran_instrument_failed":22,"samples_unverified":22,"pointer_only_for_licence":48,"official":{"repos":["lukecavabarrett/pna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":14,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":1,"code_links":93,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":106,"samples_ran":61,"samples_constructed":28,"samples_ran_checked":52,"samples_ran_instrument_failed":9,"samples_unverified":45,"pointer_only_for_licence":46,"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}}}},{"paper":"/paper/moleculenet-a-benchmark-for-molecular-machine","slug":"moleculenet-a-benchmark-for-molecular-machine","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","date":"2017-03-02","arxiv_id":"1703.00564","rows_on_this_dataset":2,"code_links":5,"syntology":null},{"paper":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":39,"samples_constructed":13,"samples_ran_checked":34,"samples_ran_instrument_failed":5,"samples_unverified":19,"pointer_only_for_licence":23,"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/pre-training-graph-neural-networks-on","slug":"pre-training-graph-neural-networks-on","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2025-02-20","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/polyatomic-complexes-a-topologically-informed","slug":"polyatomic-complexes-a-topologically-informed","title":"Polyatomic Complexes: A topologically-informed learning representation for atomistic systems","date":"2024-09-23","arxiv_id":"2409.15600","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["rahulkhorana/PolyatomicComplexes"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/polyatomic-complexes-a-topologically-informed#ran","syntology_url":"https://syntology.ai/paper/2409.15600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.15600"}}}},{"paper":"/paper/a-bayesian-flow-network-framework-for","slug":"a-bayesian-flow-network-framework-for","title":"A Bayesian Flow Network Framework for Chemistry Tasks","date":"2024-07-28","arxiv_id":"2407.20294","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-guided-masked-autoencoders-for-domain","slug":"self-guided-masked-autoencoders-for-domain","title":"Self-Guided Masked Autoencoders for Domain-Agnostic Self-Supervised Learning","date":"2024-02-22","arxiv_id":"2402.14789","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":5,"samples_unverified":4,"pointer_only_for_licence":8,"official":{"repos":["johnathan-xie/sma"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/self-guided-masked-autoencoders-for-domain#ran","syntology_url":"https://syntology.ai/paper/2402.14789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14789"}}}},{"paper":"/paper/masked-attention-is-all-you-need-for-graphs","slug":"masked-attention-is-all-you-need-for-graphs","title":"An end-to-end attention-based approach for learning on graphs","date":"2024-02-16","arxiv_id":"2402.10793","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/molecular-structure-property-co-trained","slug":"molecular-structure-property-co-trained","title":"Bidirectional Generation of Structure and Properties Through a Single Molecular Foundation Model","date":"2022-11-19","arxiv_id":"2211.10590","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jinhojsk515/SPMM"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/molecular-structure-property-co-trained#ran","syntology_url":"https://syntology.ai/paper/2211.10590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.10590"}}}},{"paper":"/paper/uni-mol-a-universal-3d-molecular","slug":"uni-mol-a-universal-3d-molecular","title":"Uni-Mol: A Universal 3D Molecular Representation Learning Framework","date":"2022-09-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/chemberta-2-towards-chemical-foundation","slug":"chemberta-2-towards-chemical-foundation","title":"ChemBERTa-2: Towards Chemical Foundation Models","date":"2022-09-05","arxiv_id":"2209.01712","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/pure-transformers-are-powerful-graph-learners","slug":"pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","arxiv_id":"2207.02505","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["jw9730/tokengt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pure-transformers-are-powerful-graph-learners#ran","syntology_url":"https://syntology.ai/paper/2207.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02505"}}}},{"paper":"/paper/an-adaptive-graph-learning-method-for","slug":"an-adaptive-graph-learning-method-for","title":"An adaptive graph learning method for automated molecular interactions and properties predictions","date":"2022-06-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":18,"pointer_only_for_licence":0,"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}}}},{"paper":"/paper/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}}}},{"paper":"/paper/chemrl-gem-geometry-enhanced-molecular","slug":"chemrl-gem-geometry-enhanced-molecular","title":"ChemRL-GEM: Geometry Enhanced Molecular Representation Learning for Property Prediction","date":"2021-06-11","arxiv_id":"2106.06130","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":11,"samples_constructed":1,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":5,"pointer_only_for_licence":1,"official":{"repos":["tech-srl/how_attentive_are_gats"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/principal-neighbourhood-aggregation-for-graph","slug":"principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":55,"samples_ran":33,"samples_constructed":4,"samples_ran_checked":11,"samples_ran_instrument_failed":22,"samples_unverified":22,"pointer_only_for_licence":48,"official":{"repos":["lukecavabarrett/pna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":14,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":1,"code_links":93,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":106,"samples_ran":61,"samples_constructed":28,"samples_ran_checked":52,"samples_ran_instrument_failed":9,"samples_unverified":45,"pointer_only_for_licence":46,"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}}}},{"paper":"/paper/moleculenet-a-benchmark-for-molecular-machine","slug":"moleculenet-a-benchmark-for-molecular-machine","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","date":"2017-03-02","arxiv_id":"1703.00564","rows_on_this_dataset":2,"code_links":5,"syntology":null},{"paper":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":39,"samples_constructed":13,"samples_ran_checked":34,"samples_ran_instrument_failed":5,"samples_unverified":19,"pointer_only_for_licence":23,"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}}}}],"papers_where_code_ran":13,"papers_where_code_ran_first_page":"/dataset/esol-scaffold/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/esol-scaffold/papers/ran/1","json":"/dataset/esol-scaffold/papers/ran/1.json","rows":13}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":13,"samples_harvested":312,"samples_ran":192,"samples_constructed":48,"samples_ran_checked":145,"samples_ran_instrument_failed":47,"samples_unverified":120,"pointer_only_for_licence":142,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":13,"papers_with_a_run_with_no_instrument_failure":11,"papers_where_every_run_was_an_instrument_failure":2,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"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'","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)"},"since_archive_judged":{"papers":4,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/molecular-property-prediction-on-esol","since_archive":"/sota/molecular-property-prediction-on-esol#since-judged","papers_judged":4,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"13bf4ecf023daea8f220b421627778a9d80d15b5a3638918b500c8f10dfcbcbb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}