Tootfinder

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[2/5]:
- Real-Time Obstacle Avoidance for a Mobile Robot Using CNN-Based Sensor Fusion
Lamiaa H. Zain, Raafat E. Shalaby

Replaced article(s) found for math.GN. https://arxiv.org/list/math.GN/new
[1/1]:
- The Lattice of Group Topologies
Dekui Peng
https://arxi…

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
Xinyue Chen, Taylor Folkersen, Kamillah Hasham, Ryan B. Hayward, David Lee, Owen Randall, Luke Schultz, Emily Vandermeer
https://arxiv.org/abs/2509.08985

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
Clobber is an alternate-turn two-player game introduced in 2001 by Albert, Grossman, Nowakowski and Wolfe. The board is a graph with each node colored black (x), white (o), or empty (-). Player Left has black stones, player Right has white stones. On a turn, a player takes one of their stones that is adjacent to an opponent stone and clobbers the opponent's stone (replaces it with theirs). Whoever cannot move loses. Linear clobber is clobber played on a path, for example, one row of a Go board.…

LL3M: Large Language 3D Modelers
Sining Lu, Guan Chen, Nam Anh Dinh, Itai Lang, Ari Holtzman, Rana Hanocka
https://arxiv.org/abs/2508.08228 https://arxiv.o…

LL3M: Large Language 3D Modelers
We present LL3M, a multi-agent system that leverages pretrained large language models (LLMs) to generate 3D assets by writing interpretable Python code in Blender. We break away from the typical generative approach that learns from a collection of 3D data. Instead, we reformulate shape generation as a code-writing task, enabling greater modularity, editability, and integration with artist workflows. Given a text prompt, LL3M coordinates a team of specialized LLM agents to plan, retrieve, write,…

Urge Coach to Stop Selling Leather #AnimalRights

Urge Coach to Stop Selling Leather
Cows suffer for leather, and animal agriculture – which includes the leather industry – is a leading contributor to the climate catastrophe. We can help stop this.

Replaced article(s) found for physics.bio-ph. https://arxiv.org/list/physics.bio-ph/new
[1/1]:
- Stochastic Models of Neuronal Growth
Cristian Staii

Replaced article(s) found for cs.SC. https://arxiv.org/list/cs.SC/new
[1/1]:
- LogicMP: A Neuro-symbolic Approach for Encoding First-order Logic Constraints
Xu, Wang, Xie, He, Zhou, Wang, Wan, Chen, Qu, Chu

Replaced article(s) found for math.ST. https://arxiv.org/list/math.ST/new
[1/1]:
- A Necessary and Sufficient Condition for Size Controllability of Heteroskedasticity Robust Test S...
Benedikt M. P\"otscher, David Preinerstorfer

A Hybrid Analytical Framework for Asymmetric Pressure and Boundary Layer Wind Simulation in Nor'easters
Seyedeh Fatemeh Mirfakhar, Reda Snaiki, Frank Lombardo
https://arxiv.org/abs/2509.09556

A Hybrid Analytical Framework for Asymmetric Pressure and Boundary Layer Wind Simulation in Nor'easters
Nor'easters frequently impact the North American East Coast, bringing hazardous precipitation, winds, and coastal flooding. Accurate simulation of their pressure and wind fields is essential for forecasting, risk assessment, and infrastructure planning, yet remains challenging due to their complex, asymmetric structure. This study introduces a novel hybrid analytical-data-driven model designed to efficiently simulate Nor'easter pressure and boundary layer wind fields. The pressure field is mode…

kNNSampler: Stochastic Imputations for Recovering Missing Value Distributions
Parastoo Pashmchi, Jerome Benoit, Motonobu Kanagawa
https://arxiv.org/abs/2509.08366 https://

kNNSampler: Stochastic Imputations for Recovering Missing Value Distributions
We study a missing-value imputation method, termed kNNSampler, that imputes a given unit's missing response by randomly sampling from the observed responses of the $k$ most similar units to the given unit in terms of the observed covariates. This method can sample unknown missing values from their distributions, quantify the uncertainties of missing values, and be readily used for multiple imputation. Unlike popular kNNImputer, which estimates the conditional mean of a missing response given an…

Replaced article(s) found for cs.RO. https://arxiv.org/list/cs.RO/new
[1/2]:
- Single-Stage Optimization of Open-loop Stable Limit Cycles with Smooth, Symbolic Derivatives
Muhammad Saud Ul Hassan, Christian Hubicki

Reducing quantum resources for observable estimation with window-assisted coherent QPE
Harriet Apel, Cristian L. Cortes, Jessica Lemieux, Mark Steudtner
https://arxiv.org/abs/2508.06677

Reducing quantum resources for observable estimation with window-assisted coherent QPE
Quantum Phase Estimation (QPE) routines are known to fail probabilistically even with perfect gates and input states. This effect stems from an incompatibility of finite-sized quantum registers to capture a phase within QPE with phase angles of infinite precision, and the effect extend even beyond what would be reasonably expected from rounding. This effect can be partially mitigated by biasing the phase register with a window, or taper state, from classical signal processing. This paper focuse…

Improved Riemannian potato field: an Automatic Artifact Rejection Method for EEG
Davoud Hajhassani (GIPSA-VIBS), Quentin Barth\'elemy (CRNL, CRNL-COPHY), J\'er\'emie Mattout (CRNL, CRNL-COPHY), Marco Congedo (GIPSA-VIBS)
https://arxiv.org/abs/2509.09264

Improved Riemannian potato field: an Automatic Artifact Rejection Method for EEG
Electroencephalography (EEG) signal cleaning has long been a critical challenge in the research community. The presence of artifacts can significantly degrade EEG data quality, complicating analysis and potentially leading to erroneous interpretations. While various artifact rejection methods have been proposed, the gold standard remains manual visual inspection by human experts-a process that is time-consuming, subjective, and impractical for large-scale EEG studies. Existing techniques are of…

Replaced article(s) found for cs.SE. https://arxiv.org/list/cs.SE/new
[1/1]:
- LLM meets ML: Data-efficient Anomaly Detection on Unstable Logs
Fatemeh Hadadi, Qinghua Xu, Domenico Bianculli, Lionel Briand

Sharper Perturbed-Kullback-Leibler Exponential Tail Bounds for Beta and Dirichlet Distributions
Pierre Perrault
https://arxiv.org/abs/2508.07991 https://ar…

Sharper Perturbed-Kullback-Leibler Exponential Tail Bounds for Beta and Dirichlet Distributions
This paper presents an improved exponential tail bound for Beta distributions, refining a result in [15]. This improvement is achieved by interpreting their bound as a regular Kullback-Leibler (KL) divergence one, while introducing a specific perturbation $η$ that shifts the mean of the Beta distribution closer to zero within the KL bound. Our contribution is to show that a larger perturbation can be chosen, thereby tightening the bound. We then extend this result from the Beta distribution to…

Are UX evaluation methods truly accessible
Andr\'es Eduardo Fuentes-Cort\'azar, Alejandra Rivera-Hern\'andez, Jos\'e Rafael Rojano-C\'aceres
https://arxiv.org/abs/2508.07620

Are UX evaluation methods truly accessible
Providing an equitable and inclusive user experience (UX) for people with disabilities (PWD) is a central goal of accessible design. In the specific case of Deaf users, whose hearing impairments impact language development and communication, it is essential to consider their specific needs during software evaluation processes. This study aimed to analyze a set of UX evaluation methods suggested in the literature as suitable for Deaf individuals, with the goal of validating their level of access…

No for Some, Yes for Others: Persona Prompts and Other Sources of False Refusal in Language Models
Flor Miriam Plaza-del-Arco, Paul R\"ottger, Nino Scherrer, Emanuele Borgonovo, Elmar Plischke, Dirk Hovy
https://arxiv.org/abs/2509.08075

No for Some, Yes for Others: Persona Prompts and Other Sources of False Refusal in Language Models
Large language models (LLMs) are increasingly integrated into our daily lives and personalized. However, LLM personalization might also increase unintended side effects. Recent work suggests that persona prompting can lead models to falsely refuse user requests. However, no work has fully quantified the extent of this issue. To address this gap, we measure the impact of 15 sociodemographic personas (based on gender, race, religion, and disability) on false refusal. To control for other factors,…

Replaced article(s) found for hep-th. https://arxiv.org/list/hep-th/new
[2/2]:
- Deciphering the viscous properties and the Bjorken expansion of the QGP medium at finite angular ...
Shubhalaxmi Rath, Nicol\'as A. Neill

Replaced article(s) found for math.SG. https://arxiv.org/list/math.SG/new
[1/1]:
- Recovering generalized homology from Floer homology: the complex oriented case
Laurent C\^ot\'e, Yusuf Bar{\i}\c{s} Kartal

Replaced article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Foliations of continuous q-pseudoconcave graphs
Thomas Pawlaschyk, Nikolay Shcherbina

Replaced article(s) found for math.GN. https://arxiv.org/list/math.GN/new
[1/1]:
- Skorokhod's topologies on path space
Nic Freeman, Jan M. Swart
https://…

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[4/4]:
- Beyond Ten Turns: Unlocking Long-Horizon Agentic Search with Large-Scale Asynchronous RL
Jiaxuan Gao, Wei Fu, Minyang Xie, Shusheng Xu, Chuyi He, Zhiyu Mei, Banghua Zhu, Yi Wu

Emergent morphogenesis via planar fabrication enabled by a reduced model of composites
Yupeng Zhang, Adam Alon, M. Khalid Jawed
https://arxiv.org/abs/2508.08198 https://

Emergent morphogenesis via planar fabrication enabled by a reduced model of composites
The ability to engineer complex three-dimensional shapes from planar sheets with precise, programmable control underpins emerging technologies in soft robotics, reconfigurable devices, and functional materials. Here, we present a reduced-order numerical and experimental framework for a bilayer system consisting of a stimuli-responsive thermoplastic sheet (Shrinky Dink) bonded to a kirigami-patterned, inert plastic layer. Upon uniform heating, the active layer contracts while the patterned layer…

A historical record of four black rainstorm episodes in Hong Kong, China in July to August 2025
P. W. Chan, Y. T. Kwok
https://arxiv.org/abs/2508.07600 https://

A historical record of four black rainstorm episodes in Hong Kong, China in July to August 2025
Four episodes of black rainstorms, the highest tier of heavy rain according to the rainstorm warning system in Hong Kong, occurred within eight days from 29 July to 5 August 2025, breaking the record for torrential rain in the territory. Providing early alerts to the public about these black rainstorms has considerable application value and has a substantial impact on their lives. This initial review of the four black rainstorm cases focuses on the predictability of the events from the synoptic…

Kinetostatics and Particle-Swarm Optimization of Vehicle-Mounted Underactuated Metamorphic Loading Manipulators
Nan Mao, Guanglu Jia, Junpeng Chen, Emmanouil Spyrakos-Papastavridis, Jian S. Dai
https://arxiv.org/abs/2509.09093

Kinetostatics and Particle-Swarm Optimization of Vehicle-Mounted Underactuated Metamorphic Loading Manipulators
Fixed degree-of-freedom (DoF) loading mechanisms often suffer from excessive actuators, complex control, and limited adaptability to dynamic tasks. This study proposes an innovative mechanism of underactuated metamorphic loading manipulators (UMLM), integrating a metamorphic arm with a passively adaptive gripper. The metamorphic arm exploits geometric constraints, enabling the topology reconfiguration and flexible motion trajectories without additional actuators. The adaptive gripper, driven en…

Replaced article(s) found for stat.ML. https://arxiv.org/list/stat.ML/new
[1/1]:
- Latency-Aware Contextual Bandit: Application to Cryo-EM Data Collection
Lai Wei, Ambuj Tewari, Michael A. Cianfrocco

What Builds Effective In-Context Examples for Code Generation?
Dongze Li, Songqiang Chen, Jialun Cao, Shing-Chi Cheung
https://arxiv.org/abs/2508.06414 https://

What Builds Effective In-Context Examples for Code Generation?
In-Context Learning (ICL) has emerged as a promising solution to enhance the code generation capabilities of Large Language Models (LLMs), which incorporates code examples inside the prompt to let LLMs learn from demonstrations. However, despite the substantial effectiveness of the code example-based ICL approach, the specific features (e.g., identifier naming styles, code formatting, solution insight) within the ICL-provided code examples that significantly contribute to the ICL's effectivenes…

Replaced article(s) found for math.CO. https://arxiv.org/list/math.CO/new
[1/1]:
- Whirling injections, surjections, and other functions between finite sets
Michael Joseph, James Propp, Tom Roby

Replaced article(s) found for hep-th. https://arxiv.org/list/hep-th/new
[1/2]:
- Mirror Symmetry and Level-rank Duality for 3d $\mathcal{N} = 4$ Rank 0 SCFTs
Thomas Creutzig, Niklas Garner, Heeyeon Kim

[2025-09-12 Fri (UTC), no new articles found for cs.SC Symbolic Computation]
toXiv_bot_toot

A variational approach to dimension-free self-normalized concentration
Ben Chugg, Aaditya Ramdas
https://arxiv.org/abs/2508.06483 https://arxiv.org/pdf/250…

A variational approach to dimension-free self-normalized concentration
We study the self-normalized concentration of vector-valued stochastic processes. We focus on bounds for sub-$ψ$ processes, a tail condition that encompasses a wide variety of well-known distributions (including sub-exponential, sub-Gaussian, sub-gamma, and sub-Poisson distributions). Our results recover and generalize the influential bound of Abbasi-Yadkori et al. (2011) and fill a gap in the literature between determinant-based bounds and those based on condition numbers. As applications we …

Crosslisted article(s) found for math.GN. https://arxiv.org/list/math.GN/new
[1/1]:
- Lotz-Peck-Porta and Rosenthal's theorems for spaces $C_p(X)$
Jerzy K\k{a}kol, Ond\v{r}ej Kurka, Wies{\l}aw \'Sliwa

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[3/4]:
- CoT-RAG: Integrating Chain of Thought and Retrieval-Augmented Generation to Enhance Reasoning in ...
Feiyang Li, Peng Fang, Zhan Shi, Arijit Khan, Fang Wang, Weihao Wang, Xin Zhang, Yongjian Cui

Vertex Features for Neural Global Illumination
Rui Su, Honghao Dong, Haojie Jin, Yisong Chen, Guoping Wang, Sheng Li
https://arxiv.org/abs/2508.07852 https://

Vertex Features for Neural Global Illumination
Recent research on learnable neural representations has been widely adopted in the field of 3D scene reconstruction and neural rendering applications. However, traditional feature grid representations often suffer from substantial memory footprint, posing a significant bottleneck for modern parallel computing hardware. In this paper, we present neural vertex features, a generalized formulation of learnable representation for neural rendering tasks involving explicit mesh surfaces. Instead of un…

Leveraging GNN to Enhance MEF Method in Predicting ENSO
Saghar Ganji, Mohammad Naisipour
https://arxiv.org/abs/2508.07410 https://arxiv.org/pdf/2508.07410

Leveraging GNN to Enhance MEF Method in Predicting ENSO
Reliable long-lead forecasting of the El Nino Southern Oscillation (ENSO) remains a long-standing challenge in climate science. The previously developed Multimodal ENSO Forecast (MEF) model uses 80 ensemble predictions by two independent deep learning modules: a 3D Convolutional Neural Network (3D-CNN) and a time-series module. In their approach, outputs of the two modules are combined using a weighting strategy wherein one is prioritized over the other as a function of global performance. Sepa…

Execution-Feedback Driven Test Generation from SWE Issues
Toufique Ahmed, Jatin Ganhotra, Avraham Shinnar, Martin Hirzel
https://arxiv.org/abs/2508.06365 https://

Execution-Feedback Driven Test Generation from SWE Issues
A software engineering issue (SWE issue) is easier to resolve when accompanied by a reproduction test. Unfortunately, most issues do not come with functioning reproduction tests, so this paper explores how to generate them automatically. The primary challenge in this setting is that the code to be tested is either missing or wrong, as evidenced by the existence of the issue in the first place. This has held back test generation for this setting: without the correct code to execute, it is diffic…

Injective edge-coloring of claw-free graphs with maximum degree 4
Danjun Huang, Yuqian Guo
https://arxiv.org/abs/2509.09407 https://arxiv.org/pdf/2509.0940…

Injective edge-coloring of claw-free graphs with maximum degree 4
An injective $k$-edge-coloring of a graph $G$ is a mapping $ϕ$: $E(G)\rightarrow\{1,2,...,k\}$, such that $ϕ(e)\neϕ(e')$ if edges $e$ and $e'$ are at distance two, or are in a triangle. The smallest integer $k$ such that $G$ has an injective $k$-edge-coloring is called the injective chromatic index of $G$, denoted by $χ_i'(G)$. A graph is called claw-free if it has no induced subgraph isomorphic to the complete bipartite graph $K_{1,3}$. In this paper, we show that $χ_i'(G)\le 13$ for ever…

[2025-09-11 Thu (UTC), 1 new article found for math.GN General Topology]
toXiv_bot_toot

The convex structure of the Parisi formula for multi-species spin glasses
Hong-Bin Chen, Victor Issa, Jean-Christophe Mourrat
https://arxiv.org/abs/2508.06397 https://

The convex structure of the Parisi formula for multi-species spin glasses
We study the free energy of mean-field multi-species spin glasses with convex covariance function. For such models with $D$ species, the Parisi formula is known to be valid, and expresses the limit free energy as a supremum over monotone probability measures on $\mathbb{R}_+^D$. We show here that one can transform this representation into a supremum over all probability measures on $\mathbb{R}_+^D$ of a concave functional. We then deduce that the Parisi formula admits a unique maximizer. Using …

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[2/4]:
- Neural-Enhanced Dynamic Range Compression Inversion: A Hybrid Approach for Restoring Audio Dynamics
Haoran Sun, Dominique Fourer, Hichem Maaref

Verification Method for Graph Isomorphism Criteria
Chuanfu Hu, Aimin Hou
https://arxiv.org/abs/2508.07615 https://arxiv.org/pdf/2508.07615

Verification Method for Graph Isomorphism Criteria
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide candidate spaces. The sufficient conditions are used to rebuild the isomorphic reconstruction of special graphs, but their drawback is that the isomorphic functions of subgraphs may not form part of the isomorphic functions of the parent graph. The use of sufficie…

[2025-08-12 Tue (UTC), 2 new articles found for physics.ao-ph Atmospheric and Oceanic Physics]
toXiv_bot_toot

Improving the Developer Experience with a Low-Code Process Modelling Language
Henrique Henriques, Hugo Louren\c{c}o, Vasco Amaral, Miguel Goul\~ao
https://arxiv.org/abs/2508.06299

Improving the Developer Experience with a Low-Code Process Modelling Language
Context: The OutSystems Platform is a development environment composed of several DSLs, used to specify, quickly build, and validate web and mobile applications. The DSLs allow users to model different perspectives such as interfaces and data models, define custom business logic and construct process models. Problem: The DSL for process modelling (Business Process Technology (BPT)), has a low adoption rate and is perceived as having usability problems hampering its adoption. This is problematic…

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[1/4]:
- Depth-Bounded Epistemic Planning
Thomas Bolander, Alessandro Burigana, Marco Montali

Asymptotic structure. II. Path-width and additive quasi-isometry
Tung Nguyen, Alex Scott, Paul Seymour
https://arxiv.org/abs/2509.09031 https://arxiv.org/p…

Asymptotic structure. II. Path-width and additive quasi-isometry
We show that if a graph $G$ admits a quasi-isometry $ϕ$ to a graph $H$ of bounded path-width, then we can assign a non-negative integer length to each edge of $H$, such that the same function $ϕ$ is a quasi-isometry to this weighted version of $H$, with error only an additive constant.

A short proof of free energy limit of two spin spherical Sherrington-Kirkpatrick model at any temperature
Debapratim Banerjee
https://arxiv.org/abs/2508.06298 https://

A short proof of free energy limit of two spin spherical Sherrington-Kirkpatrick model at any temperature
In this paper, we present a short proof of the limit of free energy of spherical 2 spin Sherrington-Kirkpatrick (SSK) model without external field. This proof works for all temperatures and is based on the Laplace method of integration and considering a discrete approximation of the whole space. This proof is general enough and can be adapted to any interaction matrix where the eigenvalue distribution has some nice properties. The proof in the high-temperature case is the same as the proof give…

PureSample: Neural Materials Learned by Sampling Microgeometry
Zixuan Li, Zixiong Wang, Jian Yang, Milos Hasan, Beibei Wang
https://arxiv.org/abs/2508.07240 https://

PureSample: Neural Materials Learned by Sampling Microgeometry
Traditional physically-based material models rely on analytically derived bidirectional reflectance distribution functions (BRDFs), typically by considering statistics of micro-primitives such as facets, flakes, or spheres, sometimes combined with multi-bounce interactions such as layering and multiple scattering. These derivations are often complex and model-specific, and typically consider a statistical aggregate of a large surface area, ignoring spatial variation. Once an analytic BRDF's eva…

[2025-09-12 Fri (UTC), no new articles found for math.GN General Topology]
toXiv_bot_toot

Understanding Inconsistent State Update Vulnerabilities in Smart Contracts
Lantian Li, Yuyu Chen, Jingwen Wu, Yue Pan, Zhongxing Yu
https://arxiv.org/abs/2508.06192 https://

Understanding Inconsistent State Update Vulnerabilities in Smart Contracts
Smart contracts enable contract terms to be automatically executed and verified on the blockchain, and recent years have witnessed numerous applications of them in areas such as financial institutions and supply chains. The execution logic of a smart contract is closely related to the contract state, and thus the correct and safe execution of the contract depends heavily on the precise control and update of the contract state. However, the contract state update process can have issues. In parti…

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[5/5]:
- TANGO: Traversability-Aware Navigation with Local Metric Control for Topological Goals
Stefan Podgorski, Sourav Garg, Mehdi Hosseinzadeh, Lachlan Mares, Feras Dayoub, Ian Reid

The Eigenvalue Method in Coding Theory
Aida Abiad, Loes Peters, Alberto Ravagnani
https://arxiv.org/abs/2509.08917 https://arxiv.org/pdf/2509.08917

The Eigenvalue Method in Coding Theory
We lay down the foundations of the Eigenvalue Method in coding theory. The method uses modern algebraic graph theory to derive upper bounds on the size of error-correcting codes for various metrics, addressing major open questions in the field. We identify the core assumptions that allow applying the Eigenvalue Method, test it for multiple well-known classes of error-correcting codes, and compare the results with the best bounds currently available. By applying the Eigenvalue Method, we obtain …

Tanaka formula for SDEs driven by fractional Brownian motion
Tommi Sottinen, Ercan S\"onmez, Lauri Viitasaari
https://arxiv.org/abs/2508.06261 https://

Tanaka formula for SDEs driven by fractional Brownian motion
We derive a Tanaka-type formula for the solution of a stochastic differential equation (SDE) driven by fractional Brownian motion (fBm) with Hurst parameter $H > \frac{1}{2}$. While Tanaka formulas for the fractional Brownian motion itself have been established, a corresponding result for non-linear SDEs driven by fBm has so far been unavailable. Our formula reveals a structure not previously observed: it features both a Skorokhod integral and a Malliavin trace correction, where the analogue of…

[2025-08-12 Tue (UTC), 5 new articles found for cs.GR Graphics]
toXiv_bot_toot

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[4/5]:
- Prompt-Driven Image Analysis with Multimodal Generative AI: Detection, Segmentation, Inpainting, ...
Kaleem Ahmad

Position: Intelligent Coding Systems Should Write Programs with Justifications
Xiangzhe Xu, Shiwei Feng, Zian Su, Chengpeng Wang, Xiangyu Zhang
https://arxiv.org/abs/2508.06017 …

Position: Intelligent Coding Systems Should Write Programs with Justifications
Intelligent coding systems are transforming software development by enabling users to specify code behavior in natural language. However, the opaque decision-making of AI-driven coders raises trust and usability concerns, particularly for non-expert users who cannot inspect low-level implementations. We argue that these systems should not only generate code but also produce clear, consistent justifications that bridge model reasoning and user understanding. To this end, we identify two critical…

Replaced article(s) found for math.CO. https://arxiv.org/list/math.CO/new
[1/1]:
- Simplex faces of order and chain polytopes
Aki Mori
https://

Approximation by zero-free continuous maps
Alexander J. Izzo
https://arxiv.org/abs/2508.05931 https://arxiv.org/pdf/2508.05931

Approximation by zero-free continuous maps
We prove that a continuous R^n-valued map on a subset E of R^n that is zero-free on the interior of E is a uniform limit of continuous R^n-valued maps that are zero-free on all of E.

Distribution Dependent Birth-Death Processes: $\mathbb{W}_p$-Estimate, Ergodicity and Propagation of Chaos
Feng-Yu Wang, Yi Zhao
https://arxiv.org/abs/2508.06198 https://…

Distribution Dependent Birth-Death Processes: $\mathbb{W}_p$-Estimate, Ergodicity and Propagation of Chaos
For a class of time inhomogenous distribution dependent birth-death processes, we derive the well-posedness, $\mathbb{W}_p$-estimate, exponential ergodicity, and uniform in time propagation of chaos. These extend the corresponding results derived for distribution dependent SDEs and mean field particle systems. As preparation, a criterion on the well-posedness of inhomogenous jump process is presented in the end of the paper, which should be interesting by itself.

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[3/5]:
- \emph{FoQuS}: A Forgetting-Quality Coreset Selection Framework for Automatic Modulation Recognition
Yao Lu, Chunfeng Sun, Dongwei Xu, Yun Lin, Qi Xuan, Guan Gui

Impact-driven Context Filtering For Cross-file Code Completion
Yanzhou Li, Shangqing Liu, Kangjie Chen, Tianwei Zhang, Yang Liu
https://arxiv.org/abs/2508.05970 https://

Impact-driven Context Filtering For Cross-file Code Completion
Retrieval-augmented generation (RAG) has recently demonstrated considerable potential for repository-level code completion, as it integrates cross-file knowledge with in-file preceding code to provide comprehensive contexts for generation. To better understand the contribution of the retrieved cross-file contexts, we introduce a likelihood-based metric to evaluate the impact of each retrieved code chunk on the completion. Our analysis reveals that, despite retrieving numerous chunks, only a sma…

Crosslisted article(s) found for math.CO. https://arxiv.org/list/math.CO/new
[1/1]:
- An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
Aditi Laddha, Madhusudhan Reddy Pittu

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[1/5]:
- ToDMA: Large Model-Driven Token-Domain Multiple Access for Semantic Communications
Li Qiao, Mahdi Boloursaz Mashhadi, Zhen Gao, Robert Schober, Deniz G\"und\"uz

Replaced article(s) found for cs.GR. https://arxiv.org/list/cs.GR/new
[1/1]:
- MoDA: Multi-modal Diffusion Architecture for Talking Head Generation
Li, Li, Lin, Qian, Yao, Jia, Wang, Chen, Wang

[2025-08-11 Mon (UTC), 1 new article found for math.GN General Topology]
toXiv_bot_toot

Localization of One-Dimensional Random Band Matrices
Reuben Drogin
https://arxiv.org/abs/2508.05802 https://arxiv.org/pdf/2508.05802

Localization of One-Dimensional Random Band Matrices
We consider a general class of $n\times n$ random band matrices with bandwidth $W$. When $W^2\ll n$, we prove that with high probability the eigenvectors of such matrices are localized and decay exponentially at the sharp scale $W^2$. Combined with the delocalization results of Erdős and Riabov [arXiv:2506.06441], and Yau and Yin [arXiv:2501.01718], this establishes the conjectured localization-delocalization transition for a large class of random band matrices.

A Survey on Task Scheduling in Carbon-Aware Container Orchestration
Jialin Yang, Zainab Saad, Jiajun Wu, Xiaoguang Niu, Henry Leung, Steve Drew
https://arxiv.org/abs/2508.05949 …

A Survey on Task Scheduling in Carbon-Aware Container Orchestration
The soaring energy demands of large-scale software ecosystems and cloud data centers, accelerated by the intensive training and deployment of large language models, have driven energy consumption and carbon footprint to unprecedented levels. In response, both industry and academia are increasing efforts to reduce the carbon emissions associated with cloud computing through more efficient task scheduling and infrastructure orchestration. In this work, we present a systematic review of various Ku…

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
Tung Nguyen, Alex Scott, Paul Seymour
https://arxiv.org/abs/2509.08762 https://…

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want the paths to be far apart, say at distance at least $c$? One might hope that we can find either $k+1$ paths pairwise far apart, or $k$ sets of bounded radius that separate $S$ and $T$, where the bound on the radius is some $\ell$ that depends only on $k,c$ (t…

Exploring Interactive Simulation of Grass Display Color Characteristic Based on Real-World Conditions
Kojiro Tanaka, Keiichi Sato, Masahiko Mikawa, Makoto Fujisawa
https://arxiv.org/abs/2508.06086

Exploring Interactive Simulation of Grass Display Color Characteristic Based on Real-World Conditions
Recent research has focused on incorporating media into living environments via color-controlled materials and image display. In particular, grass-based displays have drawn attention as landscape-friendly interactive interfaces. To develop the grass display, it is important to obtain the grass color change characteristics that depend on the real environment. However, conventional methods require experiments on actual equipment every time the lighting or viewpoint changes, which is time-consumin…

[2025-08-11 Mon (UTC), 6 new articles found for math.PR Probability]
toXiv_bot_toot

[2025-08-12 Tue (UTC), no new articles found for math.GN General Topology]
toXiv_bot_toot

Enhancing Software Vulnerability Detection Through Adaptive Test Input Generation Using Genetic Algorithm
Yanusha Mehendran, Maolin Tang, Yi Lu
https://arxiv.org/abs/2508.05923 …

Enhancing Software Vulnerability Detection Through Adaptive Test Input Generation Using Genetic Algorithm
Software vulnerabilities continue to undermine the reliability and security of modern systems, particularly as software complexity outpaces the capabilities of traditional detection methods. This study introduces a genetic algorithm-based method for test input generation that innovatively integrates genetic operators and adaptive learning to enhance software vulnerability detection. A key contribution is the application of the crossover operator, which facilitates exploration by searching acros…

Property O and Erd\H{o}s--Szekeres properties in linear hypergraphs
Suyun Jiang, Ander Lamaison, Minghui Ouyang
https://arxiv.org/abs/2509.08692 https://ar…

Property O and Erdős--Szekeres properties in linear hypergraphs
An oriented $k$-uniform hypergraph, or oriented $k$-graph, is said to satisfy Property O if, for every linear ordering of its vertex set, there is some edge oriented consistently with this order. The minimum number $f(k)$ of edges in a $k$-graph with Property O was first studied by Duffus, Kay, and Rödl, and later improved by Kronenberg, Kusch, Lamaison, Micek, and Tran. In particular, they established the bounds $k! + 1 \le f(k) \le \left(\lfloor\tfrac{k}{2}\rfloor+1 \right) k! - \lfloor\tfra…

DogFit: Domain-guided Fine-tuning for Efficient Transfer Learning of Diffusion Models
Yara Bahram, Mohammadhadi Shateri, Eric Granger
https://arxiv.org/abs/2508.05685 https://…

DogFit: Domain-guided Fine-tuning for Efficient Transfer Learning of Diffusion Models
Transfer learning of diffusion models to smaller target domains is challenging, as naively fine-tuning the model often results in poor generalization. Test-time guidance methods help mitigate this by offering controllable improvements in image fidelity through a trade-off with sample diversity. However, this benefit comes at a high computational cost, typically requiring dual forward passes during sampling. We propose the Domain-guided Fine-tuning (DogFit) method, an effective guidance mechanis…

Replaced article(s) found for math.GN. https://arxiv.org/list/math.GN/new
[1/1]:
- Regularity Conditions for Critical Point Convergence
Thomas J. Maullin-Sapey, Samuel Davenport

Recent Progress on Fractal Percolation
Istv\'an Kolossv\'ary, Sascha Troscheit
https://arxiv.org/abs/2508.08150 https://arxiv.org/pdf/2508.08150

Recent Progress on Fractal Percolation
This is a survey paper about the fractal percolation process, also known as Mandelbrot percolation. It is intended to give a general breadth overview of more recent research in the topic, but also includes some of the more classical results, for example related to the connectivity properties. Particular emphasis is put on the dimension theory of the limiting set and also on the geometry of the non-trivial connected components in the supercritical regime. In particular, we show that both the Ass…

AI-Guided Exploration of Large-Scale Codebases
Yoseph Berhanu Alebachew
https://arxiv.org/abs/2508.05799 https://arxiv.org/pdf/2508.05799

AI-Guided Exploration of Large-Scale Codebases
Understanding large-scale, complex software systems is a major challenge for developers, who spend a significant portion of their time on program comprehension. Traditional tools such as static visualizations and reverse engineering techniques provide structural insights but often lack interactivity, adaptability, and integration with contextual information. Recent advancements in large language models (LLMs) offer new opportunities to enhance code exploration workflows, yet their lack of groun…

On Sidorenko exponents of hypergraphs
Hyunwoo Lee
https://arxiv.org/abs/2509.08680 https://arxiv.org/pdf/2509.08680…

On Sidorenko exponents of hypergraphs
For an $r$-graph $F$, define Sidorenko exponent $s(F)$ as $$s(F):= \sup \{s \geq 0: \exists \text{$r$-graph $H$ s.t. } t_F(H) = t_{K^{(r)}_r} (H)^s > 0\},$$ where $t_{H_1}(H_2)$ denotes the homomorphism density of $H_1$ in $H_2$. The celebrated Sidorenko's conjecture states that $s(F) = e(F)$ holds for every bipartite graph $F$. It is known that for all $r \geq 3$, the $r$-uniform version of Sidorenko's conjecture is false, and only a few hypergraphs are known to be Sidorenko. In this paper, …

Utilizing Composer Packages to Accelerate Laravel-Based Project Development Among Students: A Pedagogical and Practical Framework
Rohaizah Abdul Wahid, Muhamad Said Nizamuddin Nadim, Suliana Sulaiman, Syahmi Akmal Shaharudin, Muhammad Danial Jupikil, Iqqwan Jasman Su Azlan Su
https://arxiv.org/abs/2508.05747

Utilizing Composer Packages to Accelerate Laravel-Based Project Development Among Students: A Pedagogical and Practical Framework
Laravel has emerged as a foundational framework in university web development curricula. However, despite its scaffolding capabilities, students often struggle to complete projects within limited academic timelines. This conceptual paper introduces Composer, PHP's standard dependency manager, and categorizes a curated selection of Composer packages that significantly reduce development effort while fostering professional software practices. Grounded in practical and pedagogical considerations, …

[2025-08-11 Mon (UTC), 2 new articles found for cs.GR Graphics]
toXiv_bot_toot

Rearrangements and infimum convolutions
Devraj Duggal, James Melbourne, Cyril Roberto
https://arxiv.org/abs/2508.07983 https://arxiv.org/pdf/2508.07983

Rearrangements and infimum convolutions
We develop a general comparison result for inf convolution operators related to rearrangement. As a consequence we derive comparison results under spherically symmetric rearrangement for Laplace and polar transforms. As a by product we simplify existing proofs related to the functional Blaschke Santalo inequality of Keith Ball and derive a comparison result for some parabolic PDE.

Bi-Equivariant Extensions Of Maps
Pavel S. Gevorgyan
https://arxiv.org/abs/2509.08616 https://arxiv.org/pdf/2509.08616

Bi-Equivariant Extensions Of Maps
The problem of bi-equivariant extension of continuous maps of binary $G$-spaces is considered. The concept of a structural map of distributive binary $G$-spaces is introduced, and a theorem on the bi-equivariant extension of structural maps is proven. A theorem on the bi-equivariant extension of continuous maps defined on the cross sections of a distributive binary $G$-space is also proven.

DDE-SOLVER: A Maple Package For Discrete Differential Equations
Hadrien Notarantonio
https://arxiv.org/abs/2509.08639 https://arxiv.org/pdf/2509.08639

DDE-SOLVER: A Maple Package For Discrete Differential Equations
We introduce DDE-Solver, a Maple package designed for solving Discrete Differential Equations (DDEs). These equations are functional equations relating algebraically a formal power series F(t, u) with polynomial coefficients in a "catalytic" variable u, with specializations of it with respect to the catalytic variable. Such equations appear in enumerative combinatorics, for instance in the enumeration of maps. Bousquet-Melou and Jehanne showed in 2006 that when these equations are of a fixed po…

Klear-CodeTest: Scalable Test Case Generation for Code Reinforcement Learning
Jia Fu, Xinyu Yang, Hongzhi Zhang, Yahui Liu, Jingyuan Zhang, Qi Wang, Fuzheng Zhang, Guorui Zhou
https://arxiv.org/abs/2508.05710

Klear-CodeTest: Scalable Test Case Generation for Code Reinforcement Learning
Precise, correct feedback is crucial for effectively training large language models (LLMs) in code reinforcement learning. However, synthesizing high-quality test cases remains a profoundly challenging and unsolved problem. In this work, we present Klear-CodeTest, a comprehensive test case synthesis framework featuring rigorous verification to ensure quality and reliability of test cases. Our approach achieves broad coverage of programming problems via a novel Generator-Validation (G-V) framewo…

Replaced article(s) found for cs.GR. https://arxiv.org/list/cs.GR/new
[1/1]:
- Lifting the Winding Number: Precise Discontinuities in Neural Fields for Physics Simulation
Yue Chang, Mengfei Liu, Zhecheng Wang, Peter Yichen Chen, Eitan Grinspun

Site Frequency Spectrum in stationary branching populations
Romain Abraham (IDP), Jean-Fran\c{c}ois Delmas (CERMICS), Patrick Hoscheit (MaIAGE)
https://arxiv.org/abs/2508.07906 …

Site Frequency Spectrum in stationary branching populations
This paper explores the Site Frequency Spectrum (SFS) in stationary branching populations. We derive estimates for the SFS associated with a sample from a continuous-state branching process conditioned to never go extinct, utilizing a quadratic branching mechanism. The genealogy of such processes is represented by a real tree with a semi-infinite branch, and we compute the expectation of the SFS under the infinitely-many-sites assumption as the sample size approaches infinity. Additionally, we …

Bisection width, max-cut and internal partitions of 5-regular graphs
Endre Cs\'oka, Panna T\'imea Fekete, Zolt\'an L\'or\'ant Nagy, Levente Szemer\'edi
https://arxiv.org/abs/2509.08531

Bisection width, max-cut and internal partitions of 5-regular graphs
In this paper, we present a new factor of IID process based on the local algorithm introduced by Díaz, Serna, and Wormald (2007). This new approach allows us to improve the previously known upper bounds on the minimum and maximum bisection width and the maximum cut of random d-regular graphs for d > 4 by introducing a new recoloring phase after the termination of the original algorithm. As an application, we show that random 5-regular graphs asymptotically almost surely admit an internal parti…

Empirical Evaluation of AI-Assisted Software Package Selection: A Knowledge Graph Approach
Siamak Farshidi, Amir Saberhabibi, Behbod Eskafi, Niloofar Nikfarjam, Sadegh Eskandari, Slinger Jansen, Michel Chaudron, Bedir Tekinerdogan
https://arxiv.org/abs/2508.05693

Empirical Evaluation of AI-Assisted Software Package Selection: A Knowledge Graph Approach
Selecting third-party software packages in open-source ecosystems like Python is challenging due to the large number of alternatives and limited transparent evidence for comparison. Generative AI tools are increasingly used in development workflows, but their suggestions often overlook dependency evaluation, emphasize popularity over suitability, and lack reproducibility. This creates risks for projects that require transparency, long-term reliability, maintainability, and informed architectura…

CameraVDP: Perceptual Display Assessment with Uncertainty Estimation via Camera and Visual Difference Prediction
Yancheng Cai, Robert Wanat, Rafal Mantiuk
https://arxiv.org/abs/2509.08947

CameraVDP: Perceptual Display Assessment with Uncertainty Estimation via Camera and Visual Difference Prediction
Accurate measurement of images produced by electronic displays is critical for the evaluation of both traditional and computational displays. Traditional display measurement methods based on sparse radiometric sampling and fitting a model are inadequate for capturing spatially varying display artifacts, as they fail to capture high-frequency and pixel-level distortions. While cameras offer sufficient spatial resolution, they introduce optical, sampling, and photometric distortions. Furthermore,…

Regularity of Solutions of Mean-Field $G$-SDEs
Karl-Wilhelm Georg Bollweg, Thilo Meyer-Brandis
https://arxiv.org/abs/2508.07867 https://arxiv.org/pdf/2508.…

Regularity of Solutions of Mean-Field $G$-SDEs
We study regularity properties of the unique solution of a mean-field $G$-SDE. More precisely, we consider a mean-field $G$-SDE with square-integrable random initial condition and establish its first and second order Fréchet differentiability in the random initial condition and specify the $G$-SDEs of the respective Fréchet derivatives.

The rainbow covering number of clean tangled clutters
Ahmad Abdi, G\'erard Cornu\'ejols
https://arxiv.org/abs/2509.08505 https://arxiv.org/pdf/2509…

The rainbow covering number of clean tangled clutters
In this brief note, we prove a min-min equality for a clean tangled clutter, that the rainbow covering number is equal to the connectivity of its setcore.

[2025-08-11 Mon (UTC), 12 new articles found for cs.SE Software Engineering]
toXiv_bot_toot

[2025-09-12 Fri (UTC), 2 new articles found for cs.GR Graphics]
toXiv_bot_toot

Feynman-Kac formula gor general time dependent stochastic parabolic equation on a bounded domain and applications
Yaozhong Hu, Qun Shi
https://arxiv.org/abs/2508.07793 https://

Feynman-Kac formula gor general time dependent stochastic parabolic equation on a bounded domain and applications
This paper establishes a Feynman-Kac formula to represent the solution to general time inhomogeneous stochastic parabolic partial differential equations driven by multiplicative fractional Gaussian noises in bounded domain where L_t is a second order uniformly elliptic operator whose coefficients can depend on time and generates a time inhomoegenous Markov process. The idea is to use the Aronson bounds of fundamental solution of the associated heat kernel and the techniques from Malliavin calcu…

On the independence number in subcubic graphs
Jochen Harant, Ingo Schiermeyer
https://arxiv.org/abs/2509.08367 https://arxiv.org/pdf/2509.08367

On the independence number in subcubic graphs
For a connected subcubic graph $G\neq K_1$ let $V_i(G) = \{v \in V(G) ~|~ d_G(v)=i\}$ for $1 \leq i \leq 3.$ Given $c_1, c_2, c_ 3 \in \mathbb{R}^+$ and $ d \in \mathbb{R}$, we show several results of type $α(G) \geq c_1|V_1(G)| + c_2|V_2(G)| + c_3|V_3(G)| - d.$ We also derive classes of graphs $G$ showing sharpness of these lower bounds on the independence number $α(G)$ of $G$.

Crosslisted article(s) found for cs.GR. https://arxiv.org/list/cs.GR/new
[1/1]:
- Revisiting Deepfake Detection: Chronological Continual Learning and the Limits of Generalization
Fontana, Diko, Lanzino, Marini, Kaddar, Foresti, Cinque

Ergodicity of infinite volume $\Phi^4_3$ at high temperature
Pawe{\l} Duch, Martin Hairer, Jaeyun Yi, Wenhao Zhao
https://arxiv.org/abs/2508.07776 https://…

Ergodicity of infinite volume $Φ^4_3$ at high temperature
We consider the infinite volume $Φ^4_3$ dynamic and show that it is globally well-posed in a suitable weighted Besov space of distributions. At high temperatures / small coupling, we furthermore show that the difference between any two solutions driven by the same realisation of the noise converges to zero exponentially fast. This allows us to characterise the infinite-volume $Φ^4_3$ measure at high temperature as the unique invariant measure of the dynamic, and to prove that it satisfies all…

[2025-09-11 Thu (UTC), 7 new articles found for math.CO Combinatorics]
toXiv_bot_toot

X-Part: high fidelity and structure coherent shape decomposition
Xinhao Yan, Jiachen Xu, Yang Li, Changfeng Ma, Yunhan Yang, Chunshi Wang, Zibo Zhao, Zeqiang Lai, Yunfei Zhao, Zhuo Chen, Chunchao Guo
https://arxiv.org/abs/2509.08643

X-Part: high fidelity and structure coherent shape decomposition
Generating 3D shapes at part level is pivotal for downstream applications such as mesh retopology, UV mapping, and 3D printing. However, existing part-based generation methods often lack sufficient controllability and suffer from poor semantically meaningful decomposition. To this end, we introduce X-Part, a controllable generative model designed to decompose a holistic 3D object into semantically meaningful and structurally coherent parts with high geometric fidelity. X-Part exploits the bound…

Wicksell's corpuscle problem in spaces of constant curvature
Panagiotis Spanos, Christoph Th\"ale
https://arxiv.org/abs/2508.07762 https://arxiv.o…

Wicksell's corpuscle problem in spaces of constant curvature
In this paper, we study Wicksell's corpuscle problem in spaces of constant curvature, thus extending the classical Euclidean framework. We consider a particle process of balls with random radii in such a space, assumed to be invariant under the action of the full isometry group. We refer to the process of intersections of these balls with a fixed totally geodesic hypersurface as the induced process. We first derive a section formula expressing the distribution of the induced process in terms of…

[2025-09-11 Thu (UTC), 1 new article found for cs.GR Graphics]
toXiv_bot_toot