Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 18, 2026 — 09:06:17 EST

0

Posted in math.NT · 2026-01-19 · Ruofan Li, Jiuzhou Zhao

Non-Wieferich property of prime ideals and a conjecture of Erdös

Let $K$ be a number field with ring of integers $\mathcal{O}$ and $α\in\mathcal{O}$. For any prime ideal $\mathfrak{p}$ of $\mathcal{O}$, we obtain its higher $α$-Wieferich property, which implies a nonexistence theorem for higher Wieferich unramified prime ideals. If $β\in\mathcal{O}$ is relatively prime to $α$ and all prime ideal...

💬 0 commentsarXiv:2601.12753v1PDF
0

Posted in cs.SD · 2026-01-19 · Naqcho Ali Mehdi, Mohammad Adeel, Aizaz Ali Larik

SoundPlot: An Open-Source Framework for Birdsong Acoustic Analysis and Neural Synthesis with Interactive 3D Visualization

We present SoundPlot, an open-source framework for analyzing avian vocalizations through acoustic feature extraction, dimensionality reduction, and neural audio synthesis. The system transforms audio signals into a multi-dimensional acoustic feature space, enabling real-time visualization of temporal dynamics in 3D using web-based...

💬 0 commentsarXiv:2601.12752v1PDF
0

Posted in cs.LG · 2026-01-19 · Manjish Pal

A Boolean Function-Theoretic Framework for Expressivity in GNNs with Applications to Fair Graph Mining

We propose a novel expressivity framework for Graph Neural Networks (GNNs) grounded in Boolean function theory, enabling a fine-grained analysis of their ability to capture complex subpopulation structures. We introduce the notion of \textit{Subpopulation Boolean Isomorphism} (SBI) as an invariant that strictly subsumes existing...

💬 0 commentsarXiv:2601.12751v1PDF
0

Posted in cs.DS · 2026-01-19 · Danny Segev, Uri Stein

Approximation Schemes for Sequential Hiring Problems

The main contribution of this paper resides in providing novel algorithmic advances and analytical insights for the sequential hiring problem, a recently introduced dynamic optimization model where a firm adaptively fills a limited number of positions from a pool of applicants with known values and acceptance probabilities. While...

💬 0 commentsarXiv:2601.12750v1PDF
0

Posted in cs.DC · 2026-01-19 · Hui Zhang, Yuquan Yang, Zechuan Gong, Xiaohua Xu, Dan Keun Sung

Efficient Local-to-Global Collaborative Perception via Joint Communication and Computation Optimization

Autonomous driving relies on accurate perception to ensure safe driving. Collaborative perception improves accuracy by mitigating the sensing limitations of individual vehicles, such as limited perception range and occlusion-induced blind spots. However, collaborative perception often suffers from high communication overhead due to...

💬 0 commentsarXiv:2601.12749v1PDF
0

Posted in cs.CL · 2026-01-19 · Bin Xie, Bingbing Xu, Xueyun Tian, Yilin Chen, Huawei Shen

Towards Robust Process Reward Modeling via Noise-aware Learning

Process Reward Models (PRMs) have achieved strong results in complex reasoning, but are bottlenecked by costly process-level supervision. A widely used alternative, Monte Carlo Estimation (MCE), defines process rewards as the probability that a policy model reaches the correct final answer from a given reasoning step. However, step...

💬 0 commentsarXiv:2601.12748v1PDF
0

Posted in cs.CV · 2026-01-19 · Jingkai Li, Xiaoze Tian, Yuhang Shen, Jia Wang, Dianjie Lu, Guijuan Zhang, Zhuoran Zheng

SSPFormer: Self-Supervised Pretrained Transformer for MRI Images

The pre-trained transformer demonstrates remarkable generalization ability in natural image processing. However, directly transferring it to magnetic resonance images faces two key challenges: the inability to adapt to the specificity of medical anatomical structures and the limitations brought about by the privacy and scarcity of...

💬 0 commentsarXiv:2601.12747v1PDF
0

Posted in math.CO · 2026-01-19 · Eli Berger, Daniel Carter, Paul Seymour

When all directed cycles have the same weight

A digraph $G$ is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that $G$ admits a 0/1-weighting with the same property, or that $G$ contains no subdivided "double-cycle" as a subdigraph, or that for every triple of vertices,...

💬 0 commentsarXiv:2601.12746v1PDF
0

Posted in cs.LG · 2026-01-19 · Miao Ye, Jing Cui, Yuan huang, Qian He, Yong Wang, Jiwen Zhang

A Graph Prompt Fine-Tuning Method for WSN Spatio-Temporal Correlation Anomaly Detection

Anomaly detection of multi-temporal modal data in Wireless Sensor Network (WSN) can provide an important guarantee for reliable network operation. Existing anomaly detection methods in multi-temporal modal data scenarios have the problems of insufficient extraction of spatio-temporal correlation features, high cost of anomaly sample...

💬 0 commentsarXiv:2601.12745v1PDF
0

Posted in cs.AI · 2026-01-19 · Tasnim Ahmed, Yifan Zhu, Salimur Choudhury

Vision Language Models for Optimization-Driven Intent Processing in Autonomous Networks

Intent-Based Networking (IBN) allows operators to specify high-level network goals rather than low-level configurations. While recent work demonstrates that large language models can automate configuration tasks, a distinct class of intents requires generating optimization code to compute provably optimal solutions for traffic...

💬 0 commentsarXiv:2601.12744v1PDF
0

Posted in physics.optics · 2026-01-19 · Debobrata Rajak, Bikash Kumar Das, Rajaram Shrestha, Bálint Kiss, Eric Cormier, Carmelo Rosales-Guzman, Stephan Fritzsche, Qiwen Zhan, Wenlong Gao, Camilo Granados

Twisting harmonics: Transfer of orbital angular momentum in solid-state high-harmonic generation

Although solid-state platforms underpin modern electronics, little is known about how intense ultrashort light pulses carrying orbital angular momentum (OAM) interact with solids. This gap persists even though, for more conventional light-matter interactions, the complex underlying electron dynamics can often be confined to a single...

💬 0 commentsarXiv:2601.12743v1PDF
0

Posted in cs.RO · 2026-01-19 · Xuecheng Chen, Zongzhuo Liu, Jianfa Ma, Bang Du, Tiantian Zhang, Xueqian Wang, Boyu Zhou

AirHunt: Bridging VLM Semantics and Continuous Planning for Efficient Aerial Object Navigation

Recent advances in large Vision-Language Models (VLMs) have provided rich semantic understanding that empowers drones to search for open-set objects via natural language instructions. However, prior systems struggle to integrate VLMs into practical aerial systems due to orders-of-magnitude frequency mismatch between VLM inference and...

💬 0 commentsarXiv:2601.12742v1PDF
0

Posted in cs.PL · 2026-01-19 · Gyeongwon Jeong, Seonghun Park, Hongseok Yang

An Introduction to Razborov's Flag Algebra as a Proof System for Extremal Graph Theory

Razborov's flag algebra forms a powerful framework for deriving asymptotic inequalities between induced subgraph densities, underpinning many advances in extremal graph theory. This survey introduces flag algebra to computer scientists working in logic, programming languages, automated verification, and formal methods. We take a...

💬 0 commentsarXiv:2601.12741v1PDF
0

Posted in cs.HC · 2026-01-19 · Zijian Zhang, Fangshi Du, Xingjian Liu, Pan Chen, Oliver Huang, Runlong Ye, Michael Liut, Alán Aspuru-Guzik

TreeWriter: AI-Assisted Hierarchical Planning and Writing for Long-Form Documents

Long documents pose many challenges to current intelligent writing systems. These include maintaining consistency across sections, sustaining efficient planning and writing as documents become more complex, and effectively providing and integrating AI assistance to the user. Existing AI co-writing tools offer either inline suggestions...

💬 0 commentsarXiv:2601.12740v1PDF
0

Posted in quant-ph · 2026-01-19 · Techapon Kampu, Salvatore De Vincenzo

Constructing the Hamiltonian for a free 1D KFGM particle in an interval

We analyze the problem of a free 1D Klein-Fock-Gordon-Majorana (KFGM) particle in an interval. By free, we mean that there is no potential within the interval and that its walls are penetrable; hence, the pertinent energy current density does not vanish at the walls. Certainly, quantization in an interval is not trivial because...

💬 0 commentsarXiv:2601.12739v1PDF
0

Posted in math.OC · 2026-01-19 · Ba Khiet Le, Zakaria Mazgouri, Michel Théra

Monotonicity of Pairs of Operators and Generalized Inertial Proximal Method

Monotonicity of pairs of operators is an extension of monotonicity of operators, which plays an important role in solving non-monotone inclusions. One of challenging problems in this new tool is how to design the associated mappings to obtain the monotone pairs. In this paper, we solve this problem and propose a Generalized Inertial...

💬 0 commentsarXiv:2601.12738v1PDF
0

Posted in math.NT · 2026-01-19 · Yuto Nakajima, Hiroki Takahasi, Baowei Wang

Hausdorff dimension of sets of numbers whose continued fractions contain arbitrarily long arithmetic progressions

Continued fractions with prescribed structures on sequences of their partial quotients have been intensively studied in the literature. As far as an integer sequence, especially a randomly generated one is concerned, an attractive question is whether it contains arbitrarily long arithmetic progressions. In this paper we study the...

💬 0 commentsarXiv:2601.12737v1PDF
0

Posted in cs.CV · 2026-01-19 · Qingtian Zhu, Xu Cao, Zhixiang Wang, Yinqiang Zheng, Takafumi Taketomi

KaoLRM: Repurposing Pre-trained Large Reconstruction Models for Parametric 3D Face Reconstruction

We propose KaoLRM to re-target the learned prior of the Large Reconstruction Model (LRM) for parametric 3D face reconstruction from single-view images. Parametric 3D Morphable Models (3DMMs) have been widely used for facial reconstruction due to their compact and interpretable parameterization, yet existing 3DMM regressors often...

💬 0 commentsarXiv:2601.12736v1PDF
0

Posted in cs.SE · 2026-01-19 · Hao Chen, Yunchun Li, Chen Chen, Fengxu Lin, Wei Li

OOPS: Automated generation of REST API specification via LLMs

REST APIs, based on the REpresentational State Transfer (REST) architecture, are the primary type of Web API. The OpenAPI Specification (OAS) serves as the de facto standard for describing REST APIs and is crucial for multiple software engineering tasks. Automated OAS generation can help developers identify and correct issues in...

💬 0 commentsarXiv:2601.12735v2PDF
0

Posted in math.NA · 2026-01-19 · Zetao Ma, Rui Du, Lei Zhang

Optimal Error Estimates of a Linearized Backward Euler Localized Orthogonal Decomposition for the Landau-Lifshitz Equation

We introduce a novel spatial discretization technique for the reliable and efficient simulation of magnetization dynamics governed by the Landau-Lifshitz (LL) equation. The overall discretization error is systematically decomposed into temporal and spatial components. The spatial error analysis is conducted by formulating the LL...

💬 0 commentsarXiv:2601.12734v1PDF
0

Posted in math.AP · 2026-01-19 · Minh Le

A Sharp Global Boundedness Result for Keller--Segel--(Navier--)Stokes Systems with Rapid Diffusion and Saturated Sensitivities

We investigate the Keller--Segel--(Navier--)Stokes system posed in a smooth bounded domain \(Ω\subset \mathbb{R}^N\) with \(N = 2,3\): \begin{equation*} \begin{cases} n_t + u \cdot \nabla n = Δn - \nabla \cdot \big( n S(n)\nabla c \big), \\[2mm] u \cdot \nabla c = Δc - c + n, \\[2mm] u_t + κ(u \cdot \nabla) u = Δu - \nabla P + n...

💬 0 commentsarXiv:2601.12733v1PDF
0

Posted in math.AP · 2026-01-19 · Chen Huang, Zhipeng Yang

On a class of logarithmic Schrödinger equations via perturbation method

In this paper, we consider the following logarithmic Schrödinger equation \[ -Δu + V(x)u = u \log u^{2},\quad x\in\mathbb{R}^{N}. \] Assuming that \(V\in C(\mathbb{R}^{N},\mathbb R)\), \(V\) is bounded away from zero, and \(V(x)\to+\infty\) as \(|x|\to\infty\), we develop a new perturbative variational approach to overcome the...

💬 0 commentsarXiv:2601.12732v2PDF
0

Posted in cs.CL · 2026-01-19 · Stefano Civelli, Pietro Bernardelle, Nicolò Brunello, Gianluca Demartini

A Shared Geometry of Difficulty in Multilingual Language Models

Predicting problem-difficulty in large language models (LLMs) refers to estimating how difficult a task is according to the model itself, typically by training linear probes on its internal representations. In this work, we study the multilingual geometry of problem-difficulty in LLMs by training linear probes using the AMC subset of...

💬 0 commentsarXiv:2601.12731v1PDF
0

Posted in cs.LG · 2026-01-19 · Zhaochun Li, Chen Wang, Jionghao Bai, Shisheng Cui, Ge Lan, Zhou Zhao, Yue Wang

Distribution-Centric Policy Optimization Dominates Exploration-Exploitation Trade-off

The exploration-exploitation (EE) trade-off is a central challenge in reinforcement learning (RL) for large language models (LLMs). With Group Relative Policy Optimization (GRPO), training tends to be exploitation driven: entropy decreases monotonically, samples convergence, and exploration fades. Most existing fixes are...

💬 0 commentsarXiv:2601.12730v1PDF
0

Posted in cs.CV · 2026-01-19 · Hanyu Zhu, Zhihao Zhan, Yuhang Ming, Liang Li, Dibo Hou, Javier Civera, Wanzeng Kong

DC-VLAQ: Query-Residual Aggregation for Robust Visual Place Recognition

One of the central challenges in visual place recognition (VPR) is learning a robust global representation that remains discriminative under large viewpoint changes, illumination variations, and severe domain shifts. While visual foundation models (VFMs) provide strong local features, most existing methods rely on a single model,...

💬 0 commentsarXiv:2601.12729v1PDF