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 ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

Syntology holds a reference implementation of TGDMat, generated from the paper text (not the authors' code), at level 2 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='TGDMat') (how to connect); the free check have('2503.00522') needs no token.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 13 code samples harvested from 1 repository linked to this paper: 12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 13 samples from 1 repository, 12 ran (10 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 12 samples that ran has no recorded date.

kdmsit/TGDMat officialmentioned on GitHubpytorchMITSyntology: 13 samples, 12 ran (2 instrument-failed) · 1 unverified 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: 12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
9ran
1unverified

Licence: 2 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. For 2 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. 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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

kdmsit/TGDMat official repository 13 samples, 12 ran (2 instrument-failed) · 1 unverified
coord2diff in 7 papers csp_task/model/utils.py ran MIT (permissive) · 767f69d375a6d9e3 · report fixture: signature x:Tensor/2/float, edge_index:Tensor/2/int, norm_constant:int/0/int · returned tuple · level recorded 2026-09-24
cosine_beta_schedule in 76 papers csp_task/model/diff_utils.py ran · honoured contract fingerprinted MIT (permissive) · cda1449e300d44f3 · report fixture: signature timesteps:int/0/int, s:float/0/float · returned Tensor · level recorded 2026-09-26
generation in 9 papers csp_task/evaluate.py ran MIT (permissive) · 5d418b6dcded34ba · report fixture: signature loader:list/1/MockBatch, model:callable/0/?, step_lr:float/0/float · returned tuple · level recorded 2026-09-25
get_file_paths in 14 papers csp_task/compute_metrics.py ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only · 8d63ea1111adc6f6 · report fixture: signature root_path:str/0/str, task:str/0/str, label:str/0/str, suffix:str/0/str · returned str · level recorded, date not recorded
get_model_path in 22 papers csp_task/eval_utils.py ran MIT (permissive) · a9a11e4f977a3fc2 · report fixture: signature eval_model_name:str/0/str · returned PosixPath · level recorded 2026-09-24
lattices_to_params_shape csp_task/evaluate.py ran fingerprinted MIT (permissive) · f4df852f3a0bac35 · report fixture: signature lattices:Tensor/3/float · returned tuple · level recorded 2026-09-24
linear_beta_schedule in 42 papers csp_task/model/diff_utils.py ran fingerprinted MIT (permissive) · 84a1879c66fb8e8b · report fixture: signature timesteps:int/0/int, beta_start:float/0/float, beta_end:float/0/float · returned Tensor · level recorded 2026-09-26
load_data in 700 papers csp_task/eval_utils.py ran MIT (permissive) · 255352a46c0e6633 · report fixture: signature file_path:str/0/str · returned dict · level recorded 2026-09-24
quadratic_beta_schedule in 9 papers csp_task/model/diff_utils.py ran fingerprinted MIT (permissive) · f9097d641770f184 · report fixture: signature timesteps:int/0/int, beta_start:float/0/float, beta_end:float/0/float · returned Tensor · level recorded 2026-09-26
reconstructon csp_task/evaluate.py ran MIT (permissive) · 5691f086c26974f7 · report fixture: signature loader:list/1/callable, model:callable/0/?, num_evals:int/0/int, step_lr:float/0/float · returned tuple · level recorded 2026-09-24
sample_centered_gaussian csp_task/model/utils.py ran MIT (permissive) · 1ab907ce7ea53c6d · report fixture: signature size:tuple/1/int, n_mask:Tensor/2/float · returned Tensor · level recorded 2026-09-25
unsorted_segment_sum in 33 papers csp_task/model/utils.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · d96ea1a7adc8e5bb · report fixture: signature data:Tensor/2/float, segment_ids:Tensor/1/int, num_segments:int/0/int, normalization_factor:float/0/float, aggregation_method:str/0/str · returned Tensor · level recorded 2026-09-22
load_model in 479 papers csp_task/eval_utils.py unverified MIT (permissive) · 415e6a383e6ff70c · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

1 assembly on this paper: 0 harvested, 1 generated.

generated Assembly for TGDMat (graph method: TGDMat), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 2).

label matches by construction: the code was generated for this method (not judged by a model)

  1. tgdmat_combined_loss entry · level 2 · ran · 41319c8bb5b1eec6a710b98d0d89d67b0d5f1cb0a7facc70b910a3bff9ca0a3b

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2503.00522") returns these assemblies with each brick's role and wiring (how to connect).

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