Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 23, 2026 — 00:09:27 EST

0

Posted in cs.IT · 2026-08-25 · Hengzhuo Li, Chong Shangguan, Hengjia Wei

The Optimal Asymptotic Rate of Generalized Covering Codes

Let $G_q$ be an alphabet of size $q\geq2$. We determine the optimal asymptotic rate of generalized covering codes $C\subseteq G_q^n$, whose covering centers in $G_q^{t\times n}$ are constrained to the product form $C^t$. For every fixed integer $t\geq1$ and every $ρ\in[0,1]$, we prove that \[ κ_t(ρ,q)= \begin{cases}...

💬 0 commentsarXiv:2608.24856v1PDF
0

Posted in cs.CV · 2026-08-25 · Hsiang-Wei Huang, Jianxu Shangguan, Junbin Lu, Jenq-Neng Hwang

LeFlow: Generative Latent Flow Planning for World Models

Latent world models are inherently strong encoders that transform image pixel to latent embedding, yet existing world models still rely on online trajectory optimization for action planning: for every state-goal pair, an iterative optimizer is run from scratch to search for optimal action sequences, treating the world model as a...

💬 0 commentsarXiv:2608.24855v1PDF
0

Posted in cs.NE · 2026-08-25 · Gabriel Bontemps, Abhishek Banerjee

Learning Whom to Trust : Decision-Generated Credibility in Social Learning

Social interaction can improve collective learning but also amplify early mistakes. We study this tension when the credibility of social information is generated by the sender's own decision process rather than fixed ex ante. Reinforcement-learning agents make binary choices through a drift--diffusion process that jointly determines...

💬 0 commentsarXiv:2608.24851v1PDF
0

Posted in cs.CR · 2026-08-25 · Tran Duc Le

Research Methodologies for Cybersecurity in Enterprise Environments: A Narrative Review, Synthesis and Executable Guide

Enterprise cybersecurity research draws on a wider range of methods than any single community routinely teaches. Researchers face a selection problem before they face a technical one: a study may simultaneously need a systematic review, a design-science artifact, a controlled detection experiment, an interview study, or an...

💬 0 commentsarXiv:2608.24850v1PDF
0

Posted in cs.CL · 2026-08-25 · Fei Tang, Huawen Shen, Zhiqiong Lu, Zhengxi Lu, Pengyuan Lyu, Chengquan Zhang, Weiming Lu, Jun Xiao, Yueting Zhuang, Yongliang Shen

BrowserForge: Scaling Web Episode via Parallel Browser Sandboxes

Web agents that act from rendered pixels avoid the fragility and heavy token cost of reading a page's HTML or accessibility tree, but training them depends on large amounts of high-quality interaction trajectories, and how to produce such data at scale remains an open problem. Public datasets typically contain only a few thousand...

💬 0 commentsarXiv:2608.24848v1PDF
0

Posted in cs.AI · 2026-08-25 · Md Saikat Islam Khan Bappy, Oshani Seneviratne

FedV-KGQA: Multi-Hop Question Answering over Vertically Partitioned Knowledge Graphs

Real-world data for knowledge graph question answering is often distributed across different organizations due to governance and data sovereignty constraints. While centralized systems exist, they cannot answer multi-hop questions when the required facts are split across vertically partitioned silos. In this paper, we propose...

💬 0 commentsarXiv:2608.24846v1PDF
0

Posted in cs.CV · 2026-08-25 · Andreas Hochlehnert, Marianna Nezhurina, Mehdi Cherti, Andrej Radonjic, Thaddäus Wiedemer, Christoph Schuhmann, Romain Beaumont, Wieland Brendel, Bernhard Schölkopf, A. Sophia Koepke, Jenia Jitsev, Matthias Bethge

LAION-BVD: A 10-Million-Hour Open Video Dataset for Multimodal Pre-training

We present LAION-BVD, a large-scale open video dataset for multimodal learning, which contains 1.3B platform-specific video URLs collected from CommonCrawl. From these, we download 80M videos with a total duration of 10 million hours. The dataset is designed for multimodal pre-training across the video, audio, and image modalities....

💬 0 commentsarXiv:2608.24845v1PDF
0

Posted in cs.CL · 2026-08-25 · Miao Liu, Zhizhe Liu

Reading Is Not Using: Retrieval, Judgment, and the Design of AI Financial Research Workflows

Large language models (LLMs) are increasingly deployed as AI analysts to process financial disclosures and support AI-assisted investment decisions. Yet such systems are usually evaluated by what they can retrieve, not whether retrieved information affects their judgments. We identify a retrieval-integration gap in long-context...

💬 0 commentsarXiv:2608.24842v1PDF
0

Posted in cs.IT · 2026-08-25 · Nguyen Phuc Tran, Brigitte Jaumard, Oscar Delgado

Next-generation O-RAN Edge: Energy-aware Joint Placement and Migration of Cloud-Native Functions

The transition toward Open Radio Access Networks (O-RANs) is reshaping how cellular infrastructure is deployed, managed, and optimized. This paper investigates the energy-aware joint placement and migration of cloud-native functions (CNFs) in an O-RAN edge cloud. We consider both a Single-CU-UP association model and a slice-aware...

💬 0 commentsarXiv:2608.24841v1PDF
0

Posted in cs.ET · 2026-08-25 · Alex Sensintaffar, Roop Kiran, Yang Chen, Mai Zheng, Bingzhe Li

HORIZON: A Read-Efficient Firmware for DNA Storage with Horizontal Layout

DNA storage is a promising medium for long-term archiving, but its read performance is limited by coarse-grained random access. Existing random-access DNA storage designs suffer from high read amplification because their sequential layouts co-locate frequently and infrequently accessed data under the same primer pair, where any read...

💬 0 commentsarXiv:2608.24839v1PDF
0

Posted in quant-ph · 2026-08-25 · Dakshita Khurana, Bhaskar Roberts, Avishay Tal

Certified Randomness without Structure Against Shallow-Query Adversaries

In a recent breakthrough, Yamakawa and Zhandry (J. ACM 2024) constructed a proof of quantumness in the quantum random oracle model (QROM) in which the quantum prover samples a codeword preimage of a publicly computable function H. They conjectured that given any H, a successful prover must sample their preimage from a high-entropy...

💬 0 commentsarXiv:2608.24832v1PDF
0

Posted in cs.AI · 2026-08-25 · Jing Huang, Jihong Zhang, Hua-Hua Chang

A Dual-Dimensional LLM Framework for Automated Item Incidental Content Similarity Analysis in Large-Scale Assessments

The rapid expansion of large-scale assessments and the growing adoption of automatic item generation have intensified concerns about incidental content redundancy, where construct-irrelevant elements such as wording or contextual framing become unintentionally repetitive across items. Traditional similarity metrics like BLEU or cosine...

💬 0 commentsarXiv:2608.24825v1PDF
0

Posted in cs.AI · 2026-08-25 · Emanuel Kitzelmann

Constrained Entity Selection under Partial Knowledge for LLM-Based Knowledge Graph QA

Large language models are increasingly used for knowledge graph question answering (KGQA), but can fail to correctly ground answers in the underlying graph. Current approaches to LLM-based KGQA either rely on full semantic parsing into executable queries such as SPARQL, which is brittle in practice due to complex schemas or...

💬 0 commentsarXiv:2608.24824v1PDF
0

Posted in cs.LG · 2026-08-25 · Seungik Cho, Betul Orcan-Ekmekci

BioKERN: Biological Kernel Regularization for Histology-to-Transcriptomics Neighborhood Retrieval

Spatially resolved biology requires representations that preserve biological neighborhood structure rather than only exact cross-modal correspondences. Existing histology--transcriptomics objectives can emphasize instance-level matching even when non-paired spots share molecular or spatial context. We introduce BioKERN, a multimodal...

💬 0 commentsarXiv:2608.24823v1PDF
0

Posted in math.NT · 2026-08-25 · Adriana Cardoso, António Leite, António Machiavelo, Rafael Moreira, Luís Roçadas

Metaconjugation and Quadratic Forms

We present a quaternionic proof that the quadratic form $t^2+2x^2+5y^2+10z^2$ represents all positive integers, and that the form $t^2+x^2+7y^2+7z^2$ represents all natural numbers which are neither equal to $3 \cdot 7^\ell$ nor equal to $6 \cdot 7^\ell$, for any $\ell \in \mathbb{N}_0$. To do this we introduce a technique that may be...

💬 0 commentsarXiv:2608.24854v1PDF
0

Posted in math.DG · 2026-08-25 · Daoqiang Liu

Spectral Geroch conjecture and noncompact area enlargeable summands

We prove that the connected sum of a possibly noncompact area enlargeable manifold $M_1$ with an arbitrary spin manifold $M_2$ of the same dimension admits no complete Riemannian metric of uniformly positive scalar curvature. This extends a theorem of Wang--Zhang, where $M_1$ is assumed closed, to noncompact enlargeable summands; in...

💬 0 commentsarXiv:2608.24853v1PDF
0

Posted in math.AG · 2026-08-25 · Rafael B. Andrist, Andriy Regeta

The bracket width for Lie algebras of vector fields is finite

We prove that the bracket width of the Lie algebra of vector fields on any smooth affine algebraic variety of dimension $n$ is at most $(n+1)^2$. We give improved bounds for some families of $\mathbb{C}^*$-varieties, in particular for $\mathrm{SL}_n(\mathbb{C})$ and for the Koras--Russell cubic threefold.

💬 0 commentsarXiv:2608.24849v1PDF
0

Posted in math.ST · 2026-08-25 · Yann Issartel, François Roueff

On the privacy cost for dependent Gaussian data: spectral density estimation under local differential privacy

We study the fundamental problem of estimating the dependence structure of a centered stationary Gaussian process under local differential privacy (LDP). In this setting, the spectral density characterizes the dependence structure of the data and is the quantity to be estimated. Our main contribution is to close the open...

💬 0 commentsarXiv:2608.24847v1PDF
0

Posted in gr-qc · 2026-08-25 · Sven Hirsch, Yiyue Zhang

Classification of Maximally Charged Black Holes

We characterize all maximally charged black hole spacetimes in $3+1$ dimensions. More precisely, given any initial data set $(M,g,k)$ saturating the mass-charge inequality that satisfies the charged dominant energy condition, we show that $(M,g,k)$ must arise from an isometric embedding into a Majumdar-Papapetrou spacetime.

💬 0 commentsarXiv:2608.24843v1PDF
0

Posted in math.AP · 2026-08-25 · Dengjun Guo, Xiaoyutao Luo

Inviscid damping without derivatives near Couette flow

We study the long-time dynamics near Couette flow for the 2D Euler equations in unbounded geometries. We identify a mechanism of nonlinear inviscid damping at Yudovich regularity, distinct from classical phase mixing: velocity decay driven by spatial evacuation of vorticity. The mechanism leads to a geometry-sign classification of...

💬 0 commentsarXiv:2608.24840v1PDF
0

Posted in math.PR · 2026-08-25 · Ian Meng Si

Strategic geometry of competing first-passage random walks

Two competitors choose starting vertices for independent, constant-speed random walks, and each site is acquired by its first visitor. We study the spatial geometry of the resulting first-passage location game. On every finite path the optimal strategies are exactly the distributions supported on the central vertices. The proof...

💬 0 commentsarXiv:2608.24837v1PDF
0

Posted in math.RT · 2026-08-25 · Robert Cass, Miao Pam Gu, Elad Zelingher

Kloosterman sheaves and Bessel functions for generic principal series of finite groups

Let $G$ be a quasi-split reductive group over a finite field and let $Ĝ$ be the Langlands dual group. Assuming the derived subgroup of $G$ is almost simple, we use techniques from the geometric Langlands program to relate special values of Bessel functions for generic principal series representations of $G$ to the trace of Frobenius...

💬 0 commentsarXiv:2608.24836v1PDF
0

Posted in math.FA · 2026-08-25 · Vasily Melnikov

Complemented Copies of $c_{0}$ in Positive Tensor Products of Banach Lattices

A result of Cembranos states that a non-trivial injective tensor product of a $C$-space contains a complemented copy of $c_{0}$, and in particular fails the Grothendieck property. We establish a positive analogue of the Cembranos theorem for tensor products of Banach lattices. If $E$ and $F$ are infinite dimensional Banach lattices,...

💬 0 commentsarXiv:2608.24834v1PDF