Papers › Periodic Materials Generation using Text-Guided Joint Diffusion Model

Periodic Materials Generation using Text-Guided Joint Diffusion Model

1 Mar 2025arXiv:2503.00522archive 2025-07-28

Kishalay Das, Subhojyoti Khastagir, Pawan Goyal, Seung-Cheol Lee, Satadeep Bhattacharjee, Niloy Ganguly

Equivariant diffusion models have emerged as the prevailing approach for generating novel crystal materials due to their ability to leverage the physical symmetries of periodic material structures. However, current models do not effectively learn the joint distribution of atom types, fractional coordinates, and lattice structure of the crystal material in a cohesive end-to-end diffusion framework. Also, none of these models work under realistic setups, where users specify the desired characteristics that the generated structures must match. In this work, we introduce TGDMat, a novel text-guided diffusion model designed for 3D periodic material generation. Our approach integrates global structural knowledge through textual descriptions at each denoising step while jointly generating atom coordinates, types, and lattice structure using a periodic-E(3)-equivariant graph neural network (GNN). Extensive experiments using popular datasets on benchmark tasks reveal that TGDMat outperforms existing baseline methods by a good margin. Notably, for the structure prediction task, with just one generated sample, TGDMat outperforms all baseline models, highlighting the importance of text-guided diffusion. Further, in the generation task, TGDMat surpasses all baselines and their text-fusion variants, showcasing the effectiveness of the joint diffusion paradigm. Additionally, incorporating textual knowledge reduces overall training and sampling computational overhead while enhancing generative performance when utilizing real-world textual prompts from experts.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2503.00522")

Code

Syntology Ran 2 of 13 code samples harvested from 1 repository linked to this paper; 11 have no recorded run. Of those that ran: 2 ran · our draft was wrong.

By repository: official repository: 13 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kdmsit/TGDMat officialmentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 2 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · our draft was wrong
11unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from kdmsit/TGDMat. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_file_paths kdmsit/TGDMat/csp_task/compute_metrics.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 8d63ea1111adc6f6 · report
unsorted_segment_sum kdmsit/TGDMat/csp_task/model/utils.py official repository ran · our draft was wrong MIT (permissive) · d96ea1a7adc8e5bb · report
coord2diff kdmsit/TGDMat/csp_task/model/utils.py official repository unverified MIT (permissive) · 767f69d375a6d9e3 · report
cosine_beta_schedule kdmsit/TGDMat/csp_task/model/diff_utils.py official repository unverified MIT (permissive) · cda1449e300d44f3 · report
generation kdmsit/TGDMat/csp_task/evaluate.py official repository unverified MIT (permissive) · 5d418b6dcded34ba · report
get_model_path kdmsit/TGDMat/csp_task/eval_utils.py official repository unverified MIT (permissive) · a9a11e4f977a3fc2 · report
lattices_to_params_shape kdmsit/TGDMat/csp_task/evaluate.py official repository unverified MIT (permissive) · f4df852f3a0bac35 · report
linear_beta_schedule kdmsit/TGDMat/csp_task/model/diff_utils.py official repository unverified MIT (permissive) · 84a1879c66fb8e8b · report
load_data kdmsit/TGDMat/csp_task/eval_utils.py official repository unverified MIT (permissive) · 255352a46c0e6633 · report
load_model kdmsit/TGDMat/csp_task/eval_utils.py official repository unverified MIT (permissive) · 415e6a383e6ff70c · report
quadratic_beta_schedule kdmsit/TGDMat/csp_task/model/diff_utils.py official repository unverified MIT (permissive) · f9097d641770f184 · report
reconstructon kdmsit/TGDMat/csp_task/evaluate.py official repository unverified MIT (permissive) · 5691f086c26974f7 · report
sample_centered_gaussian kdmsit/TGDMat/csp_task/model/utils.py official repository unverified MIT (permissive) · 1ab907ce7ea53c6d · report

Tasks

DenoisingGraph Neural Network

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

DiffusionGraph Neural Network

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections