Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 23, 2026 — 04:00:14 EST

0

Posted in cs.DS · 2026-01-11 · Anay Sinhal, Arpana Sinhal, Amit Sinhal, Amit Hirawat

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems

This paper presents two real-world scheduling problems and their algorithmic solutions through polynomial-time reductions. First, we address the Hospital Patient-to-Bed Assignment problem, demonstrating its reduction to Maximum Bipartite Matching and solution via Network Flow algorithms. Second, we tackle the University Course...

💬 0 commentsarXiv:2601.06737v1PDF
0

Posted in quant-ph · 2026-01-11 · Guanyu Zhu, Ryohei Kobayashi, Po-Shen Hsin

Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes

A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical non-Clifford gates, one needs to resort to 3D product-code constructions. In this work, we extend Kitaev's...

💬 0 commentsarXiv:2601.06736v1PDF
0

Posted in cond-mat.supr-con · 2026-01-11 · Xia-Ji Liu, Hui Hu

Altermagnetism-driven FFLO superconductivity in finite-filling 2D lattices

We systematically investigate the emergence of finite-momentum Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) superconductivity in a square lattice Hubbard model with finite filling, driven by either $d_{xy}$-wave or $d_{x^{2}-y^{2}}$-wave altermagnetic order in the presence of on-site $s$-wave attractive interactions. Our study combines...

💬 0 commentsarXiv:2601.06735v1PDF
0

Posted in cs.NE · 2026-01-11 · Boquan Jiang, Zhenhua Yang, Chenkai Wang, Muyao Zhong, Heping Fang, Peng Yang

Calibrating Agent-Based Financial Markets Simulators with Pretrainable Automatic Posterior Transformation-Based Surrogates

Calibrating Agent-Based Models (ABMs) is an important optimization problem for simulating the complex social systems, where the goal is to identify the optimal parameter of a given ABM by minimizing the discrepancy between the simulated data and the real-world observations. Unfortunately, it suffers from the extensive computational...

💬 0 commentsarXiv:2601.06920v1PDF
0

Posted in quant-ph · 2026-01-11 · Meng-Dong Zhu, Cheng Zhang, Shi-Pu Gu, Xing-Fu Wang, Ming-Ming Du, Wei Zhong, Lan Zhou, Yu-Bo Sheng

High-capacity dual degrees of freedom quantum secret sharing protocol beyond the linear rate-distance bound

Quantum secret sharing (QSS) is the multipartite cryptographic primitive. Most of existing QSS protocols are limited by the linear rate-distance bound, and cannot realize the long-distance and high-capacity multipartite key distribution. This paper proposes a polarization (Pol) and phase (Ph) dual degrees of freedom (dual-DOF) QSS...

💬 0 commentsarXiv:2601.06919v2PDF
0

Posted in math.CO · 2026-01-11 · Paula M. S. Fialho, Aldo Procacci

On the zero-free region for the chromatic polynomial of claw-free graphs with and without induced square and induced diamond

Given a claw-free graph $G=(V,E)$ with maximum degree $Δ$, we define the parameter $κ\in [0,1]$ as $κ={\max_{v\in V}|I_v|\over \lfloorΔ^2/4\rfloor}$ where $I_v$ is the set of all independent pairs in the neighborhood of $v$. We refer to $κ$ as the pair independence ratio of $G$. We prove that for any claw-free graph $G$ with pair...

💬 0 commentsarXiv:2601.06918v1PDF
0

Posted in math.AP · 2026-01-11 · Yuxiang Cheng, Xiaoxu Xu

Asymptotic formulas for phase recovering from phaseless data of biharmonic waves at a fixed frequency

This paper focuses on phase retrieval from phaseless total-field data in biharmonic scattering problems. We prove that a phased biharmonic wave can be uniquely determined by the modulus of the total biharmonic wave within a nonempty domain. As a direct corollary, the uniqueness for the inverse biharmonic scattering problem with...

💬 0 commentsarXiv:2601.06917v2PDF
0

Posted in cs.SE · 2026-01-11 · Antonio Abu Nassar, Eitan Farchi

Enhancing Formal Software Specification with Artificial Intelligence

Formal software specification is known to enable early error detection and explicit invariants, yet it has seen limited industrial adoption due to its high notation overhead and the expertise required to use traditional formal languages. This paper presents a case study showing that recent advances in artificial intelligence make it...

💬 0 commentsarXiv:2601.09745v1PDF
0

Posted in cs.LG · 2026-01-11 · Mohammed Azeez Khan, Aaron D'Souza, Vijay Choyal

Active Learning Strategies for Efficient Machine-Learned Interatomic Potentials Across Diverse Material Systems

Efficient materials discovery requires reducing costly first-principles calculations for training machine-learned interatomic potentials (MLIPs). We develop an active learning (AL) framework that iteratively selects informative structures from the Materials Project and Open Quantum Materials Database (OQMD) using compositional and...

💬 0 commentsarXiv:2601.06916v2PDF
0

Posted in math.DS · 2026-01-11 · Tristán Radić

Infinite sumsets in $U^k(Φ)$-uniform sets

Extending recent developments of Kra, Moreira, Richter and Roberson, we study infinite sumset patterns in $U^k(Φ)$-uniform subsets of the integers, defined via the local uniformity seminorms introduced by Host and Kra. We relate the degree $k$ of a $U^k(Φ)$-uniform set to the existence of a rich variety of sumset patterns. As a...

💬 0 commentsarXiv:2601.06915v2PDF
0

Posted in cs.CR · 2026-01-11 · Ying Zhou, Jiacheng Wei, Yu Qi, Faguo Wu, Xiao Zhang

Towards Compositional Generalization in LLMs for Smart Contract Security: A Case Study on Reentrancy Vulnerabilities

Large language models (LLMs) demonstrate remarkable capabilities in natural language understanding and generation. Despite being trained on large-scale, high-quality data, LLMs still fail to outperform traditional static analysis tools in specialized domains like smart contract vulnerability detection. To address this issue, this...

💬 0 commentsarXiv:2601.06914v1PDF
0

Posted in cs.LG · 2026-01-11 · Taehyun Hwang, Dahngoon Kim, Min-hwan Oh

Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities

We study the multinomial logit (MNL) contextual bandit problem for sequential assortment selection. Although most existing research assumes utility functions to be linear in item features, this linearity assumption restricts the modeling of intricate interactions between items and user preferences. A recent work (Zhang & Luo, 2024)...

💬 0 commentsarXiv:2601.06913v1PDF
0

Posted in cs.NI · 2026-01-11 · Peichun Li, Liping Qian, Dusit Niyato, Shiwen Mao, Yuan Wu

Toward Resource-Efficient Collaboration of Large AI Models in Mobile Edge Networks

The collaboration of large artificial intelligence (AI) models in mobile edge networks has emerged as a promising paradigm to meet the growing demand for intelligent services at the network edge. By enabling multiple devices to cooperatively execute submodels or subtasks, collaborative AI enhances inference efficiency and service...

💬 0 commentsarXiv:2602.13206v1PDF
0

Posted in cs.CL · 2026-01-11 · Shaoning Sun, Mingzhu Cai, Huang He, Bingjin Chen, Siqi Bao, Yujiu Yang, Hua Wu, Haifeng Wang

Distributional Clarity: The Hidden Driver of RL-Friendliness in Large Language Models

Language model families exhibit striking disparity in their capacity to benefit from reinforcement learning: under identical training, models like Qwen achieve substantial gains, while others like Llama yield limited improvements. Complementing data-centric approaches, we reveal that this disparity reflects a hidden structural...

💬 0 commentsarXiv:2601.06911v1PDF
0

Posted in cs.SE · 2026-01-11 · Huihui Huang, Jieke Shi, Junkai Chen, Ting Zhang, Yikun Li, Chengran Yang, Eng Lieh Ouh, Lwin Khin Shar, David Lo

PenForge: On-the-Fly Expert Agent Construction for Automated Penetration Testing

Penetration testing is essential for identifying vulnerabilities in web applications before real adversaries can exploit them. Recent work has explored automating this process with Large Language Model (LLM)-powered agents, but existing approaches either rely on a single generic agent that struggles in complex scenarios or narrowly...

💬 0 commentsarXiv:2601.06910v1PDF
0

Posted in cs.CV · 2026-01-11 · Zengyuan Zuo, Junjun Jiang, Gang Wu, Xianming Liu

UDPNet: Unleashing Depth-based Priors for Robust Image Dehazing

Image dehazing has witnessed significant advancements with the development of deep learning models. However, most existing methods focus solely on single-modal RGB features, neglecting the inherent correlation between scene depth and haze distribution. Even those that jointly optimize depth estimation and image dehazing often suffer...

💬 0 commentsarXiv:2601.06909v2PDF
0

Posted in cs.LG · 2026-01-11 · Fei Ma, Han Lin, Yifan Xie, Hongwei Ren, Xiaoyu Shen, Wenbo Ding, Qi Tian

E^2-LLM: Bridging Neural Signals and Interpretable Affective Analysis

Emotion recognition from electroencephalography (EEG) signals remains challenging due to high inter-subject variability, limited labeled data, and the lack of interpretable reasoning in existing approaches. While recent multimodal large language models (MLLMs) have advanced emotion analysis, they have not been adapted to handle the...

💬 0 commentsarXiv:2601.07877v1PDF
0

Posted in cs.CL · 2026-01-11 · Quan Zheng, Yuanhe Tian, Ming Wang, Yan Song

Fine-grained Verbal Attack Detection via a Hierarchical Divide-and-Conquer Framework

In the digital era, effective identification and analysis of verbal attacks are essential for maintaining online civility and ensuring social security. However, existing research is limited by insufficient modeling of conversational structure and contextual dependency, particularly in Chinese social media where implicit attacks are...

💬 0 commentsarXiv:2601.06907v1PDF
0

Posted in cs.IT · 2026-01-11 · Chong Huang, Gaojie Chen, Pei Xiao, Zhu Han, Rahim Tafazolli

Large Artificial Intelligence Models for Future Wireless Communications

The anticipated integration of large artificial intelligence (AI) models with wireless communications is estimated to usher a transformative wave in the forthcoming information age. As wireless networks grow in complexity, the traditional methodologies employed for optimization and management face increasingly challenges. Large AI...

💬 0 commentsarXiv:2601.06906v1PDF
0

Posted in gr-qc · 2026-01-11 · T. L. Razinkova, A. V. Yudin, S. I. Blinnikov

Numerical Study of Polytropes with n=1 and Differential Rotation

The solution space of differentially rotating polytropes with n=1 has been studied numerically. The existence of three different types of configurations: from spheroids to thick tori, hockey puck-like bodies and spheroids surrounded by a torus, separate from or merging with the central body has been proved. It has been shown that the...

💬 0 commentsarXiv:2601.06905v1PDF
0

Posted in astro-ph.SR · 2026-01-11 · Jyoti Sheoran, Supratik Banerjee, Vaibhav Pant, Dipankar Banerjee, M. Saleem Khan

Turbulent Properties of Interplanetary Coronal Mass Ejections Observed by Solar Orbiter in the Inner Heliosphere

We investigate the turbulent properties of 12 interplanetary coronal mass ejections (ICMEs) observed by Solar Orbiter between 0.29 and 1.0 AU. We analyze fluctuation power, spectral indices, break scales, and correlations between magnetic and velocity fluctuations (v-b) to quantify differences between ICME substructures (sheath and...

💬 0 commentsarXiv:2601.06904v1PDF
0

Posted in cs.DC · 2026-01-11 · Bingnan Xiao, Feng Zhu, Jingjing Zhang, Wei Ni, Xin Wang

Divergence-Based Adaptive Aggregation for Byzantine Robust Federated Learning

Inherent client drifts caused by data heterogeneity, as well as vulnerability to Byzantine attacks within the system, hinder effective model training and convergence in federated learning (FL). This paper presents two new frameworks, named DiveRgence-based Adaptive aGgregation (DRAG) and Byzantine-Resilient DRAG (BR-DRAG), to mitigate...

💬 0 commentsarXiv:2601.06903v2PDF
0

Posted in cs.HC · 2026-01-11 · Stinne Zacho, Chris Hall, Jakob Kusnick, Stefan Jänicke

Santa Clara 3D: Digital Reconstruction and Storytelling of a Francoist Concentration Camp

This paper explores the potential of digital reconstruction and interactive storytelling to preserve historically suppressed sites. The main objective of an interdisciplinary team of data scientists from the MEMORISE project and associates of the memory association Asociacion Recuerdo y Dignidad was to preserve the memory of the...

💬 0 commentsarXiv:2601.06902v1PDF