Qwen Councils
arXiv could not process that search. Try a simpler keyword search or an arXiv field query such as all:quantum.
Showing downloaded papers while arXiv is unavailable.

All arXiv

arXiv preprints from January 1, 2026 through September 24, 2026 — 16:43:09 EST

0

Posted in cs.SE · 2026-01-07 · Sahil Agarwal

Contract2Plan: Verified Contract-Grounded Retrieval-Augmented Optimization for BOM-Aware Procurement and Multi-Echelon Inventory Planning

Procurement and inventory planning is governed not only by demand forecasts and bills of materials (BOMs), but also by operational terms in contracts and supplier documents (e.g., MOQs, lead times, price tiers, allocation caps, substitution approvals). LLM-based extraction can speed up structuring these terms, but extraction-only or...

💬 0 commentsarXiv:2601.06164v1PDF
0

Posted in cs.CL · 2026-01-07 · Zhaofeng Zhong, Wei Yuan, Tong Chen, Xiangyu Zhao, Quoc Viet Hung Nguyen, Hongzhi Yin

Reasoning Pattern Alignment Merging for Adaptive Reasoning

Recent large reasoning models (LRMs) have made substantial progress in complex reasoning tasks, yet they often generate lengthy reasoning paths for every query, incurring unnecessary computation and latency. Existing speed-up approaches typically rely on retraining the model or designing sophisticated prompting, which are either...

💬 0 commentsarXiv:2601.03506v1PDF
0

Posted in cs.CL · 2026-01-07 · Soheil Zibakhsh Shabgahi, Pedram Aghazadeh, Farinaz Koushanfar

Beyond Perplexity: A Lightweight Benchmark for Knowledge Retention in Supervised Fine-Tuning

Supervised Fine-Tuning (SFT) is a standard approach for injecting domain knowledge into Large Language Models (LLMs). However, relying on validation perplexity to monitor training is often insufficient, as it confounds stylistic mimicry with genuine factual internalization. To address this, we introduce the Knowledge Retention (KR)...

💬 0 commentsarXiv:2601.03505v1PDF
0

Posted in cs.CR · 2026-01-07 · Rasmus Erlemann, Charles Colyer Morris, Sanjyot Sathe

Full-Stack Knowledge Graph and LLM Framework for Post-Quantum Cyber Readiness

The emergence of large-scale quantum computing threatens widely deployed public-key cryptographic systems, creating an urgent need for enterprise-level methods to assess post-quantum (PQ) readiness. While PQ standards are under development, organizations lack scalable and quantitative frameworks for measuring cryptographic exposure...

💬 0 commentsarXiv:2601.03504v1PDF
0

Posted in math.RA · 2026-01-07 · Mikhail Kochetov, Felipe Yasumura

Direct limits of graded matrix algebras

The direct limit of finite-dimensional semisimple associative algebras arises as a purely algebraic counterpart to important $C^\ast$-algebras. In this paper, we classify direct limits of matrix algebras endowed with a grading by a finite abelian group over an algebraically closed field. In particular, we give an explicit description...

💬 0 commentsarXiv:2601.03503v1PDF
0

Posted in hep-ph · 2026-01-07 · C. V. Ventura, Saul J. Panibra Churata

Estimating JUNO's Sensitivity to Solar Neutrino-to-antineutrino Conversion and Neutrino Magnetic Moments

We investigated JUNO's sensitivity to a possible conversion of solar neutrinos into antineutrinos via the spin-flavor precession (SFP) mechanism, and assessed the implications for constraining the neutrino-magnetic moment (NMM). Using a sensitivity-based framework appropriate for counting experiments with no prior observations, we...

💬 0 commentsarXiv:2601.03502v1PDF
0

Posted in cs.CV · 2026-01-07 · Yuxuan Xia, Siheng Wang, Peng Li

SDCD: Structure-Disrupted Contrastive Decoding for Mitigating Hallucinations in Large Vision-Language Models

Large Vision-Language Models (LVLMs) demonstrate significant progress in multimodal understanding and reasoning, yet object hallucination remains a critical challenge. While existing research focuses on mitigating language priors or high-level statistical biases, they often overlook the internal complexities of the visual encoding...

💬 0 commentsarXiv:2601.03500v1PDF
0

Posted in eess.IV · 2026-01-07 · Fan Zhang, Xuanting Wu, Fei Ma, Qiang Yin, Yuxin Hu

GeoDiff-SAR: A Geometric Prior Guided Diffusion Model for SAR Image Generation

Synthetic Aperture Radar (SAR) imaging results are highly sensitive to observation geometries and the geometric parameters of targets. However, existing generative methods primarily operate within the image domain, neglecting explicit geometric information. This limitation often leads to unsatisfactory generation quality and the...

💬 0 commentsarXiv:2601.03499v1PDF
0

Posted in q-bio.NC · 2026-01-07 · Brett J. Kagan, Valentina Baccetti, Brian D. Earp, J. Lomax Boyd, Julian Savulescu, Adeel Razi

A Quantifiable Information-Processing Hierarchy Provides a Necessary Condition for Detecting Agency

As intelligent systems are developed across diverse substrates - from machine learning models and neuromorphic hardware to in vitro neural cultures - understanding what gives a system agency has become increasingly important. Existing definitions, however, tend to rely on top-down descriptions that are difficult to quantify. We...

💬 0 commentsarXiv:2601.03498v1PDF
0

Posted in stat.ME · 2026-01-07 · Shuo Wang, Joseph Feldman, Jerome P. Reiter

Differentially Private Bayesian Inference for Gaussian Copula Correlations

Gaussian copulas are widely used to estimate multivariate distributions and relationships. We present algorithms for estimating Gaussian copula correlations that ensure differential privacy. We first convert data values into sets of two-way tables of counts above and below marginal medians. We then add noise to these counts to satisfy...

💬 0 commentsarXiv:2601.03497v1PDF
0

Posted in cs.IR · 2026-01-07 · Bongmin Kim

STELLA: Self-Reflective Terminology-Aware Framework for Building an Aerospace Information Retrieval Benchmark

Tasks in the aerospace industry heavily rely on searching and reusing large volumes of technical documents, yet there is no public information retrieval (IR) benchmark that reflects the terminology- and query-intent characteristics of this domain. To address this gap, this paper proposes the STELLA (Self-Reflective TErminoLogy-Aware...

💬 0 commentsarXiv:2601.03496v1PDF
0

Posted in eess.SY · 2026-01-07 · Osasumwen Cedric Ogiesoba-Eguakun, Suman Rath

Cyberattack Detection in Virtualized Microgrids Using LightGBM and Knowledge-Distilled Classifiers

Modern microgrids depend on distributed sensing and communication interfaces, making them increasingly vulnerable to cyber physical disturbances that threaten operational continuity and equipment safety. In this work, a complete virtual microgrid was designed and implemented in MATLAB/Simulink, integrating heterogeneous renewable...

💬 0 commentsarXiv:2601.03495v2PDF
0

Posted in quant-ph · 2026-01-07 · Kaiyuan Cao, Haodong Wang, Xiang-Ping Jiang, Shu chen, Jian Wang

Tailoring Dynamical Quantum Phase Transitions via Double-Mode Squeezing Manipulation

We propose a protocol to tailor dynamical quantum phase transitions (DQPTs) by double-mode squeezing onto the initial state in the XY chain. The effect of squeezing depends critically on the system's symmetry and parameters. When the squeezing operator breaks particle-hole symmetry (PHS), DQPTs become highly tunable, allowing one to...

💬 0 commentsarXiv:2601.03494v1PDF
0

Posted in cs.CL · 2026-01-07 · Jinming Nian, Zhiyuan Peng, Hongwei Shang, Dae Hoon Park, Yi Fang

Submodular Evaluation Subset Selection in Automatic Prompt Optimization

Automatic prompt optimization reduces manual prompt engineering, but relies on task performance measured on a small, often randomly sampled evaluation subset as its main source of feedback signal. Despite this, how to select that evaluation subset is usually treated as an implementation detail. We study evaluation subset selection for...

💬 0 commentsarXiv:2601.03493v1PDF
0

Posted in cs.IT · 2026-01-07 · Sanjit Bhowmick, Kuntal Deka

Hermitian LCD $2$-Quasi Abelian Codes over Finite Chain Rings

This paper introduces a class of Hermitian LCD $2$-quasi-abelian codes over finite fields and presents a comprehensive enumeration of these codes in which relative minimum weights are small. We show that such codes are asymptotically good over finite fields. Furthermore, we extend our analysis to finite chain rings by characterizing...

💬 0 commentsarXiv:2601.03492v1PDF
0

Posted in math.AC · 2026-01-07 · Teppei Takamatsu, Shou Yoshikawa

Quasi-$F^{\infty}$-split height versus quasi-$F$-regular height for rational double points and graded rings

In this paper, we study a phenomenon concerning quasi-$F$-singularities: under suitable hypotheses, the finiteness of the quasi-$F^{\infty}$-split height ($\mathrm{ht}^{\infty}$) implies quasi-$F$-regularity, and moreover, $\mathrm{ht}^{\infty}$ coincides with the quasi-$F$-regular height ($\mathrm{ht}^{\mathrm{reg}}$). We establish...

💬 0 commentsarXiv:2601.03491v1PDF
0

Posted in cs.CV · 2026-01-07 · Yuzhe Sun, Zhe Dong, Haochen Jiang, Tianzhu Liu, Yanfeng Gu

CroBIM-U: Uncertainty-Driven Referring Remote Sensing Image Segmentation

Referring remote sensing image segmentation aims to localize specific targets described by natural language within complex overhead imagery. However, due to extreme scale variations, dense similar distractors, and intricate boundary structures, the reliability of cross-modal alignment exhibits significant \textbf{spatial...

💬 0 commentsarXiv:2601.03490v1PDF
0

Posted in cs.IT · 2026-01-07 · Sanjit Bhowmick

LCPs of Subspace Codes

A subspace code is a nonempty collection of subspaces of the vector space $\mathbb{F}_q^{n}$. A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their dimensions equals the dimension of the ambient space. In this paper, we introduce the concept of LCPs...

💬 0 commentsarXiv:2601.03489v2PDF
0

Posted in math.CO · 2026-01-07 · Julian Allagan

Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words

Let G_n = C_n square P_2 denote the prism (circular ladder) graph on 2n vertices. By encoding column configurations as cyclic words, domination is reduced to local Boolean constraints on adjacent factors. This framework yields explicit formulas for the dominion zeta(G_n), stratified by n mod 4, with the exceptional cases n in {3, 6}...

💬 0 commentsarXiv:2601.03488v1PDF
0

Posted in cond-mat.soft · 2026-01-07 · Nicholas W. Hackney, Joel T. Clemmer, Gary S. Grest

Shape Elasticity in Colloidal Bent-Core Liquid Crystals

Curved particles have been shown to stabilize a range of states with unique order in dense suspensions of colloidal bent core liquid crystals. The shape of the colloidal rods encourages the formation of curved director fields. However, states of constant bend cannot uniformly fill either two or three dimensional Euclidean space and...

💬 0 commentsarXiv:2601.03487v1PDF
0

Posted in eess.SY · 2026-01-07 · Zeyu Dong, Yuke Tian, Yu Sun

Adaptive Model-Based Reinforcement Learning for Orbit Feedback Control in NSLS-II Storage Ring

The National Synchrotron Light Source II (NSLS-II) uses highly stable electron beam to produce high-quality X-ray beams with high brightness and low-emittance synchrotron radiation. The traditional algorithm to stabilize the beam applies singular value decomposition (SVD) on the orbit response matrix to remove noise and extract...

💬 0 commentsarXiv:2601.03486v2PDF
0

Posted in math.CO · 2026-01-07 · Julian Allagan, Erin Gray, Jennifer Sawyer, Gabrielle Morgan

Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability

We study the dominion zeta(G), defined as the number of minimum dominating sets of a graph G, and analyze how local forcing and boundary effects control the flexibility of optimal domination in trees. For path-based pendant constructions, we identify a sharp forcing threshold: attaching a single pendant vertex to each path vertex...

💬 0 commentsarXiv:2601.03485v1PDF
0

Posted in cs.LG · 2026-01-07 · Kaiyuan Deng, Hangyu Zheng, Minghai Qing, Kunxiong Zhu, Gen Li, Yang Xiao, Lan Emily Zhang, Linke Guo, Bo Hui, Yanzhi Wang, Geng Yuan, Gagan Agrawal, Wei Niu, Xiaolong Ma

From Bits to Chips: An LLM-based Hardware-Aware Quantization Agent for Streamlined Deployment of LLMs

Deploying models, especially large language models (LLMs), is becoming increasingly attractive to a broader user base, including those without specialized expertise. However, due to the resource constraints of certain hardware, maintaining high accuracy with larger model while meeting the hardware requirements remains a significant...

💬 0 commentsarXiv:2601.03484v2PDF
0

Posted in cs.CL · 2026-01-07 · Lingzhi Shen, Xiaohao Cai, Yunfei Long, Imran Razzak, Guanming Chen, Shoaib Jameel

CALM: Culturally Self-Aware Language Models

Cultural awareness in language models is the capacity to understand and adapt to diverse cultural contexts. However, most existing approaches treat culture as static background knowledge, overlooking its dynamic and evolving nature. This limitation reduces their reliability in downstream tasks that demand genuine cultural sensitivity....

💬 0 commentsarXiv:2601.03483v1PDF