{"total":76,"rows":[{"id":"2602.12233","title":"Categorical Flow Maps","created":"2026-02-12","cited_by_count":44,"area":"diffusion"},{"id":"2406.06647","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","created":"2024-06-10","cited_by_count":43,"area":null},{"id":"2406.06449","title":"Cometh: A continuous-time discrete-state graph diffusion model","created":"2024-06-10","cited_by_count":32,"area":"diffusion"},{"id":"2506.07903","title":"Diffuse Everything: Multimodal Diffusion Models on Arbitrary State Spaces","created":"2025-06-09","cited_by_count":21,"area":"diffusion"},{"id":"2508.10684","title":"MDNS: Masked Diffusion Neural Sampler via Stochastic Optimal Control","created":"2025-08-14","cited_by_count":21,"area":"diffusion"},{"id":"2502.08767","title":"SelfElicit: Your Language Model Secretly Knows Where is the Relevant Evidence","created":"2025-02-12","cited_by_count":18,"area":null},{"id":"2501.01073","title":"Graph Generative Pre-trained Transformer","created":"2025-01-02","cited_by_count":17,"area":null},{"id":"2505.12709","title":"Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics","created":"2025-05-19","cited_by_count":17,"area":null},{"id":"2412.08174","title":"Can Graph Neural Networks Learn Language with Extremely Weak Text Supervision?","created":"2024-12-11","cited_by_count":13,"area":null},{"id":"2502.02216","title":"Flatten Graphs as Sequences: Transformers are Scalable Graph Generators","created":"2025-02-04","cited_by_count":13,"area":null},{"id":"2405.16805","title":"Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization","created":"2024-05-27","cited_by_count":12,"area":null},{"id":"2505.18442","title":"Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting","created":"2025-05-24","cited_by_count":12,"area":null},{"id":"2510.07799","title":"Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models","created":"2025-10-09","cited_by_count":11,"area":"diffusion"},{"id":"2411.01992","title":"Ask, and it shall be given: On the Turing completeness of prompting","created":"2024-11-04","cited_by_count":10,"area":null},{"id":"2411.05676","title":"Improving Molecular Graph Generation with Flow Matching and Optimal Transport","created":"2024-11-08","cited_by_count":10,"area":"diffusion"},{"id":"2503.21592","title":"Simple and Critical Iterative Denoising: A Recasting of Discrete Diffusion in Graph Generation","created":"2025-03-27","cited_by_count":10,"area":"diffusion"},{"id":"2505.21366","title":"PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignment","created":"2025-05-27","cited_by_count":10,"area":null},{"id":"2510.10432","title":"Hierarchical LoRA MoE for Efficient CTR Model Scaling","created":"2025-10-12","cited_by_count":10,"area":"moe"},{"id":"2603.24840","title":"Prune as You Generate: Online Rollout Pruning for Faster and Better RLVR","created":"2026-03-25","cited_by_count":10,"area":"lr"},{"id":"2506.14020","title":"Bures-Wasserstein Flow Matching for Graph Generation","created":"2025-06-16","cited_by_count":9,"area":"diffusion"},{"id":"2411.09852","title":"InterFormer: Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction","created":"2024-11-15","cited_by_count":8,"area":null},{"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":"2505.17293","title":"Graph Data Selection for Domain Adaptation: A Model-Free Approach","created":"2025-05-22","cited_by_count":7,"area":null},{"id":"2509.12212","title":"PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis","created":"2025-08-29","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":"2503.06340","title":"Backdoor Attacks on Discrete Graph Diffusion Models","created":"2025-03-08","cited_by_count":3,"area":"diffusion"},{"id":"2506.01302","title":"Recent Developments in GNNs for Drug Discovery","created":"2025-06-02","cited_by_count":3,"area":null},{"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":"2511.12114","title":"Continuous-time Discrete-space Diffusion Model for Recommendation","created":"2025-11-15","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":"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.25093","title":"Continual Low-Rank Adapters for LLM-based Generative Recommender Systems","created":"2025-10-29","cited_by_count":2,"area":null},{"id":"2512.01190","title":"LGDC: Latent Graph Diffusion via Spectrum-Preserving Coarsening","created":"2025-12-01","cited_by_count":2,"area":null},{"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":"2604.11311","title":"Learning Discrete Diffusion of Graphs via Free-Energy Gradient Flows","created":"2026-04-13","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":"2506.06444","title":"Saffron-1: Safety Inference Scaling","created":"2025-06-06","cited_by_count":1,"area":"alignment"},{"id":"2506.11062","title":"Decoding Cortical Microcircuits: A Generative Model for Latent Space Exploration and Controlled Synthesis","created":"2025-05-29","cited_by_count":1,"area":null},{"id":"2509.12530","title":"Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphs","created":"2025-09-16","cited_by_count":1,"area":null},{"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.07256","title":"Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2602.16954","title":"Neural Proposals, Symbolic Guarantees: Neuro-Symbolic Graph Generative Modeling","created":"2026-02-18","cited_by_count":1,"area":null},{"id":"2603.10160","title":"ReMix: Reinforcement routing for mixtures of LoRAs in LLM finetuning","created":"2026-03-10","cited_by_count":1,"area":null},{"id":"2605.24395","title":"AvAtar: Learning to Align via Active Optimal Transport","created":"2026-05-23","cited_by_count":1,"area":null},{"id":"2505.13011","title":"Unveiling and Steering Connectome Organization with Interpretable Latent Variables","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2505.22935","title":"Is Noise Conditioning Necessary? A Unified Theory of Unconditional Graph Diffusion Models","created":"2025-05-28","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":"2507.03728","title":"FAROS: Fair Graph Generation via Attribute Switching Mechanisms","created":"2025-07-04","cited_by_count":0,"area":"diffusion"},{"id":"2510.08535","title":"Permutation-Invariant Spectral Learning via Dyson Diffusion","created":"2025-10-09","cited_by_count":0,"area":"diffusion"},{"id":"2510.20792","title":"BadGraph: A Backdoor Attack Against Latent Diffusion Model for Text-Guided Graph Generation","created":"2025-10-23","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":"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.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.24304","title":"CGRL: Causal-Guided Representation Learning for Node-Level Out-of-Distribution Generalization","created":"2026-03-25","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.08288","title":"UMEDA: Unified Multi-modal Efficient Data Fusion for Privacy-Preserving Graph Federated Learning via Spectral-Gated Attention and Diffusion-Based Operator Alignment","created":"2026-05-08","cited_by_count":0,"area":null},{"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.20554","title":"Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2607.21519","title":"Diffusion Language Model for Recommendation","created":"2026-07-23","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.35527","title":"GeoGAE: Scalable Graph-Level Autoencoding via Hyperball Cloud Representations","created":"2026-09-28","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.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.04056","title":"Discrete Diffusion for Large Graph Generation via Structural Candidate Restriction","created":"2026-10-02","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.16455","title":"GHOST: Geometry-Constrained Hybrid Diffusion for Open-Vocabulary 3D Scene Graph Generation","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}