Papers › FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level...

FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching

19 Feb 2025arXiv:2502.15805archive 2025-07-28

Joongwon Lee, SeongHwan Kim, Seokhyun Moon, Hyunwoo Kim, Woo Youn Kim

We introduce FragFM, a novel hierarchical framework via fragment-level discrete flow matching for efficient molecular graph generation. FragFM generates molecules at the fragment level, leveraging a coarse-to-fine autoencoder to reconstruct details at the atom level. Together with a stochastic fragment bag strategy to effectively handle an extensive fragment space, our framework enables more efficient and scalable molecular generation. We demonstrate that our fragment-based approach achieves better property control than the atom-based method and additional flexibility through conditioning the fragment bag. We also propose a Natural Product Generation benchmark (NPGen) to evaluate modern molecular graph generative models' ability to generate natural product-like molecules. Since natural products are biologically prevalidated and differ from typical drug-like molecules, our benchmark provides a more challenging yet meaningful evaluation relevant to drug discovery. We conduct a FragFM comparative study against various models on diverse molecular generation benchmarks, including NPGen, demonstrating superior performance. The results highlight the potential of fragment-based generative modeling for large-scale, property-aware molecular design, paving the way for more efficient exploration of chemical space.

PaperPDFCode Syntology ran

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.

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

Code

Syntology 14 code samples harvested from 3 repositories linked to this paper: 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) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: found in paper text by Syntology: 14 samples from 3 repositories, 8 ran (8 with no instrument failure; 0 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.

No sample is linked to this paper from 2 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-24 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

wengong-jin/icml18-jtnn found in paper text by SyntologyMITSyntology: 6 samples, 4 ran (0 instrument-failed) · 2 unverified report
wengong-jin/hgraph2graph found in paper text by SyntologyMITSyntology: 3 samples, 1 ran (0 instrument-failed) · 2 unverified report
datamol-io/safe found in paper text by SyntologyApache-2.0Syntology: 5 samples, 3 ran (0 instrument-failed) · 2 unverified report
violet-sto/MolHF found in paper text by SyntologyMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to MolHF: A Hierarchical Normalizing Flow for Molecular Graph Generation (arXiv:2305.08457; that paper's own run record: 14 ran (of which 7 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 1 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified); nothing checks that they implement this paper's method. report
cvignac/DiGress found in paper text by SyntologySyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to DiGress: Discrete Denoising diffusion for graph generation (arXiv:2209.14734; that paper's own run record: 15 ran (of which 10 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified) and Unrestrained Simplex Denoising for Discrete Data. A Non-Markovian Approach Applied to... (arXiv:2603.28572; that paper's own run record: 9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 3 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

14 samples harvested: 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) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

8ran
6unverified

Licence: 2 of the 14 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 3 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

wengong-jin/icml18-jtnn found in paper text by Syntology 6 samples, 4 ran (0 instrument-failed) · 2 unverified
avg_pool in 8 papers fast_jtnn/nnutils.py ran MIT (permissive) · ae8276a108a62271 · report fixture: signature all_vecs:Tensor/3/float, scope:list/1/tuple, dim:int/0/int · returned Tensor · level recorded 2026-09-24
create_var fast_jtnn/nnutils.py ran fingerprinted MIT (permissive) · e09eb05126a7c40e · report fixture: signature tensor:Tensor/2/float, requires_grad:NoneType/0/? · returned Tensor · level recorded 2026-09-25
index_select_ND fast_jtnn/nnutils.py ran MIT (permissive) · 6cfa3e07a37cd10c · report fixture: signature source:Tensor/3/float, dim:int/0/int, index:Tensor/2/int · returned Tensor · level recorded 2026-09-25
onek_encoding_unk in 11 papers fast_jtnn/jtmpn.py ran MIT (permissive) · c0968545f446bb6a · report fixture: signature x:str/0/str, allowable_set:list/1/str · returned map · level recorded 2026-09-25
atom_features in 6 papers fast_jtnn/jtmpn.py unverified MIT (permissive) · ce9a23f3afe1e874 · report
atom_features in 6 papers fast_jtnn/mpn.py unverified MIT (permissive) · dd7d3d25a676ebb4 · report
wengong-jin/hgraph2graph found in paper text by Syntology 3 samples, 1 ran (0 instrument-failed) · 2 unverified
to_numpy in 103 papers
census: 24 implementations from 29 papers, 2 distinct outputs across 2 buckets, one shared input per bucket
preprocess.py ran MIT (permissive) · 1c18207a5e5c2fac · report fixture: signature tensors:tuple/1/str · returned tuple · level recorded 2026-09-24
process in 60 papers get_vocab.py unverified MIT (permissive) here; the stored copy is pointer only · d33c6045784db272 · report
set_atommap hgraph/chemutils.py unverified MIT (permissive) here; the stored copy is pointer only · 64031117dac3cd1d · report
datamol-io/safe found in paper text by Syntology 5 samples, 3 ran (0 instrument-failed) · 2 unverified
find_partition_edges safe/utils.py ran Apache-2.0 (permissive) · 1b9306ad1c77d4dd · report fixture: signature G:Graph/0/?, partition:list/1/list · returned list · level recorded 2026-09-24
ring_label safe/_connect.py ran fingerprinted Apache-2.0 (permissive) · a56074a6bdbb7678 · report fixture: signature token:str/0/str · returned int · level recorded 2026-09-24
split in 67 papers safe/_tokenizer_utils.py ran fingerprinted Apache-2.0 (permissive) · 3f2fce2269e966e4 · report fixture: signature safe_str:str/0/str · returned list · level recorded 2026-09-24
analyze in 11 papers safe/_connect.py unverified Apache-2.0 (permissive) · 520a0786e56b4db4 · report
split in 67 papers safe/tokenizer.py unverified Apache-2.0 (permissive) · 1d75b0fe2361c83d · report

Tasks

DiversityDrug DiscoveryEfficient ExplorationGraph GenerationMolecular Graph Generation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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