{"total":82,"rows":[{"id":"2502.00234","title":"Fast Solvers for Discrete Diffusion Models: Theory and Applications of High-Order Algorithms","created":"2025-02-01","cited_by_count":47,"area":"diffusion"},{"id":"2602.12233","title":"Categorical Flow Maps","created":"2026-02-12","cited_by_count":44,"area":"diffusion"},{"id":"2507.17731","title":"Flow Matching Meets Biology and Life Science: A Survey","created":"2025-07-23","cited_by_count":14,"area":"diffusion"},{"id":"2509.22623","title":"A Theoretical Analysis of Discrete Flow Matching Generative Models","created":"2025-09-26","cited_by_count":14,"area":"diffusion"},{"id":"2506.14020","title":"Bures-Wasserstein Flow Matching for Graph Generation","created":"2025-06-16","cited_by_count":9,"area":"diffusion"},{"id":"2509.21906","title":"Error Analysis of Discrete Flow with Generator Matching","created":"2025-09-26","cited_by_count":9,"area":"diffusion"},{"id":"2502.04308","title":"HOG-Diff: Higher-Order Guided Diffusion for Graph Generation","created":"2025-02-06","cited_by_count":8,"area":"diffusion"},{"id":"2502.15805","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","created":"2025-02-19","cited_by_count":7,"area":"diffusion"},{"id":"2505.16790","title":"Learning Flexible Forward Trajectories for Masked Molecular Diffusion","created":"2025-05-22","cited_by_count":7,"area":"diffusion"},{"id":"2602.15022","title":"Rethinking Diffusion Models with Symmetries through Canonicalization with Applications to Molecular Graph Generation","created":"2026-02-16","cited_by_count":7,"area":"diffusion"},{"id":"2509.21912","title":"Discrete Guidance Matching: Exact Guidance for Discrete Flow Matching","created":"2025-09-26","cited_by_count":6,"area":"diffusion"},{"id":"2602.06138","title":"Flow Matching for Offline Reinforcement Learning with Discrete Actions","created":"2026-02-05","cited_by_count":6,"area":"diffusion"},{"id":"2502.01416","title":"Categorical Schr\\\"odinger Bridge Matching","created":"2025-02-03","cited_by_count":5,"area":null},{"id":"2603.10395","title":"Graph-GRPO: Training Graph Flow Models with Reinforcement Learning","created":"2026-03-11","cited_by_count":5,"area":"lr"},{"id":"2601.13780","title":"Principled Latent Diffusion for Graphs via Laplacian Autoencoders","created":"2026-01-20","cited_by_count":4,"area":"diffusion"},{"id":"2601.22107","title":"Prior-Informed Flow Matching for Graph Reconstruction","created":"2026-01-29","cited_by_count":4,"area":"diffusion"},{"id":"2506.07198","title":"GGBall: Graph Generative Model on Poincar\\'e Ball","created":"2025-06-08","cited_by_count":3,"area":null},{"id":"2506.16404","title":"Generating Directed Graphs with Dual Attention and Asymmetric Encoding","created":"2025-06-19","cited_by_count":3,"area":null},{"id":"2601.22519","title":"Corrected Samplers for Discrete Flow Models","created":"2026-01-30","cited_by_count":3,"area":"diffusion"},{"id":"2602.13136","title":"Order Matters in Retrosynthesis: Structure-aware Generation via Reaction-Center-Guided Discrete Flow Matching","created":"2026-02-13","cited_by_count":3,"area":"diffusion"},{"id":"2602.23566","title":"Flowette: Flow Matching with Graphette Priors for Graph Generation","created":"2026-02-27","cited_by_count":3,"area":"diffusion"},{"id":"2604.06491","title":"Discrete Flow Matching Policy Optimization","created":"2026-04-07","cited_by_count":3,"area":"diffusion"},{"id":"2605.08424","title":"Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once","created":"2026-05-08","cited_by_count":3,"area":"diffusion"},{"id":"2501.06485","title":"A Diffusive Data Augmentation Framework for Reconstruction of Complex Network Evolutionary History","created":"2025-01-11","cited_by_count":2,"area":null},{"id":"2502.02415","title":"Fast Graph Generation via Autoregressive Noisy Filtration Modeling","created":"2025-02-04","cited_by_count":2,"area":null},{"id":"2509.09451","title":"Composable Score-based Graph Diffusion Model for Multi-Conditional Molecular Generation","created":"2025-09-11","cited_by_count":2,"area":"diffusion"},{"id":"2510.04522","title":"Toward a Unified Geometry Understanding: Riemannian Diffusion Framework for Graph Generation and Prediction","created":"2025-10-06","cited_by_count":2,"area":"diffusion"},{"id":"2512.01190","title":"LGDC: Latent Graph Diffusion via Spectrum-Preserving Coarsening","created":"2025-12-01","cited_by_count":2,"area":null},{"id":"2603.18397","title":"FlowMS: Flow Matching for De Novo Structure Elucidation from Mass Spectra","created":"2026-03-19","cited_by_count":2,"area":"diffusion"},{"id":"2603.28572","title":"Unrestrained Simplex Denoising for Discrete Data. A Non-Markovian Approach Applied to Graph Generation","created":"2026-03-30","cited_by_count":2,"area":"diffusion"},{"id":"2604.00236","title":"Hierarchical Discrete Flow Matching for Graph Generation","created":"2026-03-31","cited_by_count":2,"area":"diffusion"},{"id":"2606.02133","title":"Variational Learning for Insertion-based Generation","created":"2026-06-01","cited_by_count":2,"area":"diffusion"},{"id":"2504.06312","title":"DMol: A Highly Efficient and Chemical Motif-Preserving Molecule Generation Platform","created":"2025-04-08","cited_by_count":1,"area":"diffusion"},{"id":"2505.24434","title":"Graph Flow Matching: Enhancing Image Generation with Neighbor-Aware Flow Fields","created":"2025-05-30","cited_by_count":1,"area":"diffusion"},{"id":"2510.10211","title":"Transport-Coupled Bayesian Flows for Molecular Graph Generation","created":"2025-10-11","cited_by_count":1,"area":null},{"id":"2601.22524","title":"Variational Bayesian Flow Network for Graph Generation","created":"2026-01-30","cited_by_count":1,"area":"diffusion"},{"id":"2602.03612","title":"Generator-based Graph Generation via Heat Diffusion","created":"2026-02-03","cited_by_count":1,"area":null},{"id":"2603.23398","title":"Graph Energy Matching: Transport-Aligned Energy-Based Modeling for Graph Generation","created":"2026-03-24","cited_by_count":1,"area":"diffusion"},{"id":"2605.07020","title":"FlashMol: High-Quality Molecule Generation in as Few as Four Steps","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2605.15354","title":"Controllable Molecular Generative Foundation Models","created":"2026-05-14","cited_by_count":1,"area":null},{"id":"2605.18472","title":"Flowing with Confidence","created":"2026-05-18","cited_by_count":1,"area":null},{"id":"2607.07232","title":"DiPhon: Diffusion on Graphons for Scalable Graph Generation","created":"2026-07-08","cited_by_count":1,"area":"diffusion"},{"id":"2607.21585","title":"Expanding Flow Maps","created":"2026-07-23","cited_by_count":1,"area":null},{"id":"2608.27429","title":"Mechanistic Reaction Prediction via Discrete Flow Matching on Graph-Structured Electron Occupation","created":"2026-08-27","cited_by_count":1,"area":null},{"id":"2505.16365","title":"A collaborative constrained graph diffusion model for the generation of realistic synthetic molecules","created":"2025-05-22","cited_by_count":0,"area":"diffusion"},{"id":"2506.01467","title":"Feature-Aware (Hyper)graph Generation via Next-Scale Prediction","created":"2025-06-02","cited_by_count":0,"area":null},{"id":"2509.09631","title":"DiFlow-TTS: Compact and Low-Latency Zero-Shot Text-to-Speech with Discrete Flow Matching","created":"2025-09-11","cited_by_count":0,"area":"diffusion"},{"id":"2509.23348","title":"Entering the Era of Discrete Diffusion Models: A Benchmark for Schr\\\"odinger Bridges and Entropic Optimal Transport","created":"2025-09-27","cited_by_count":0,"area":"diffusion"},{"id":"2511.03015","title":"Discrete Bayesian Sample Inference for Graph Generation","created":"2025-11-04","cited_by_count":0,"area":"diffusion"},{"id":"2512.05080","title":"OMTRA: A Multi-Task Generative Model for Structure-Based Drug Design","created":"2025-12-04","cited_by_count":0,"area":null},{"id":"2601.03184","title":"Decentralized Autoregressive Generation","created":"2026-01-06","cited_by_count":0,"area":null},{"id":"2602.02320","title":"MolLangData: A Large-Scale Dataset for Molecular Structure-Language Description via a Rule-Regularized Method","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2602.03257","title":"GraDE: A Graph Diffusion Estimator for Frequent Subgraph Discovery in Neural Architectures","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2602.13249","title":"A Systematic Evaluation of Co-folding Model Representations for Small-Molecule Learning","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2602.17602","title":"MolHIT: Advancing Molecular-Graph Generation with Hierarchical Discrete Diffusion Models","created":"2026-02-19","cited_by_count":0,"area":"diffusion"},{"id":"2602.18084","title":"Balancing Symmetry and Efficiency in Graph Flow Matching","created":"2026-02-20","cited_by_count":0,"area":"diffusion"},{"id":"2603.08825","title":"Local Message-Passing for Discrete Graph Generation","created":"2026-03-09","cited_by_count":0,"area":null},{"id":"2604.17310","title":"Interpolating Discrete Diffusion Models with Controllable Resampling","created":"2026-04-19","cited_by_count":0,"area":"diffusion"},{"id":"2604.18623","title":"Can We Build Scene Graphs, Not Classify Them? FlowSG: Progressive Image-Conditioned Scene Graph Generation with Flow Matching","created":"2026-04-18","cited_by_count":0,"area":"diffusion"},{"id":"2605.00250","title":"Information-geometric adaptive sampling for graph diffusion","created":"2026-04-30","cited_by_count":0,"area":"diffusion"},{"id":"2605.05024","title":"Hypergraph Generation via Structured Stochastic Diffusion","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2605.12805","title":"Discrete MeanFlow: One-Step Generation via Conditional Transition Kernels","created":"2026-05-12","cited_by_count":0,"area":"diffusion"},{"id":"2606.04287","title":"Scaling Novel Graph Generation via Lightweight Structure-Guided Autoregressive Models","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2606.15327","title":"Semantic DLM+: Improving Diffusion Language Models through Bias-variance Trade-off in Transition Kernel Design","created":"2026-06-13","cited_by_count":0,"area":"diffusion"},{"id":"2607.01105","title":"SynLaD: Latent Diffusion for Generating Synthesizable Molecules Conditioned on 3D Pharmacophore Profiles","created":"2026-07-01","cited_by_count":0,"area":"diffusion"},{"id":"2607.06546","title":"Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion","created":"2026-07-07","cited_by_count":0,"area":"diffusion"},{"id":"2607.19237","title":"DBMol: Design of High-Affinity, Target-Specific Small Molecules through Structure Prediction Models","created":"2026-07-21","cited_by_count":0,"area":null},{"id":"2607.24662","title":"When Can You Correct Distribution Drift in Temporal Graph Generation? A Sharpening--Drift Tension and an Impossibility for Observation-Based Correction","created":"2026-07-27","cited_by_count":0,"area":null},{"id":"2608.26961","title":"Gromov-Monge Flow Matching for Equivariant Graph Generation","created":"2026-08-27","cited_by_count":0,"area":"diffusion"},{"id":"2609.02286","title":"From topology learning to graph generation: A unifying perspective","created":"2026-09-02","cited_by_count":0,"area":null},{"id":"2609.05328","title":"Embedded Graph Flows for Categorical Graph Generation","created":"2026-09-04","cited_by_count":0,"area":null},{"id":"2609.32056","title":"Graph Forward Distribution Matching for Molecular Inverse Design","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.38484","title":"RetroGEF: Dynamic Graph Edit Flow for Single-Step Retrosynthesis","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.39739","title":"Stable Transformers for Graph Generation","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.01937","title":"Graph Representation via Elements of Discrete Morse and Cobordism Theories","created":"2026-10-01","cited_by_count":0,"area":"diffusion"},{"id":"2610.02186","title":"Higher-Order Molecular Grammars for Generative and Foundation Models in Chemistry","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.04953","title":"EDISCO: Equivariant DIScrete Diffusion for Euclidean Combinatorial Optimization","created":"2026-10-04","cited_by_count":0,"area":"diffusion"},{"id":"2610.05397","title":"Efficient Graph Generation via Direct Prediction and Flow Matching","created":"2026-10-04","cited_by_count":0,"area":"diffusion"},{"id":"2610.13765","title":"When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors","created":"2026-10-09","cited_by_count":0,"area":"diffusion"},{"id":"2610.13786","title":"Your Discrete Graph Diffusion Model is Secretly Memorizing","created":"2026-10-09","cited_by_count":0,"area":"diffusion"},{"id":"2610.17244","title":"MIRRA: Fast, High-Fidelity Molecular Generation with Chemistry-Informed Discrete Flow Matching","created":"2026-10-12","cited_by_count":0,"area":"diffusion"},{"id":"2610.19946","title":"Learning Graph Energies for Finite-Time Generation","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}