{"url":"/sota/unconditional-crystal-generation-on-mp20","task":{"name":"Unconditional Crystal Generation","url":"/task/unconditional-crystal-generation","note":null},"dataset":{"name":"MP20","url":"/dataset/mp20"},"category":"Miscellaneous","categories":["Miscellaneous"],"category_note":null,"description":"This task evaluates the ability of generative models to sample valid and realistic crystal structures.\r\n\r\nThe training dataset, MP20 (Xie et al., 2022), contains 45,231 metastable crystal structures from the Materials Project (Jain et al., 2013), each with up to 20 atoms and spanning 89 different element types.\r\n\r\nFollowing prior work (Xie et al., 2022), we sample 10,000 crystals and compute validity, stability, uniqueness and novelty rates using density functional theory (DFT). Data is generally split following prior work (Xie et al., 2022) to ensure fair comparisons.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["DFT Stable, Unique, Novel Rate","Validity"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"DFT Stable, Unique, Novel Rate":null,"Validity":null}},"counts":{"rows":3,"rows_with_code":3,"rows_with_paper_page":3,"rows_dated":3,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"ADiT","metrics":{"DFT Stable, Unique, Novel Rate":"6.0","Validity":"91.92"},"uses_additional_data":false,"paper_date":"2025-03-05","paper":"/paper/all-atom-diffusion-transformers-unified","paper_url":"https://arxiv.org/abs/2503.03965v1","paper_title":"All-atom Diffusion Transformers: Unified generative modelling of molecules and materials","code":"https://github.com/facebookresearch/all-atom-diffusion-transformer","n_code_links":1,"syntology":{"n_ran":6,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":7}},{"rank_in_archive_order":2,"model":"FlowLLM","metrics":{"DFT Stable, Unique, Novel Rate":"4.7","Validity":"90.81"},"uses_additional_data":false,"paper_date":"2024-10-30","paper":"/paper/flowllm-flow-matching-for-material-generation","paper_url":"https://arxiv.org/abs/2410.23405v1","paper_title":"FlowLLM: Flow Matching for Material Generation with Large Language Models as Base Distributions","code":"https://github.com/facebookresearch/flowmm","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":3,"model":"FlowMM","metrics":{"DFT Stable, Unique, Novel Rate":"2.8","Validity":"80.30"},"uses_additional_data":false,"paper_date":"2024-06-07","paper":"/paper/flowmm-generating-materials-with-riemannian","paper_url":"https://arxiv.org/abs/2406.04713v1","paper_title":"FlowMM: Generating Materials with Riemannian Flow Matching","code":"https://github.com/facebookresearch/flowmm","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,795 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6795,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2785},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":3,"rows_with_any_sample_ran":3,"distinct_papers_with_graph_line":3,"distinct_papers_with_any_sample_ran":3,"samples_over_distinct_papers":{"n_ran":8,"n_unverified":1,"n_samples":9,"n_pointer_only_licence":9,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":8,"n_unverified":1,"n_samples":9,"n_pointer_only_licence":9,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}