Qwen Councils
arXiv is taking too long to respond. Please try again or narrow your search.
Showing downloaded papers while arXiv is unavailable.

Computer Science

arXiv preprints from January 1, 2026 through September 7, 2026 — 04:03:15 EST

0

Posted in cs.AI · 2026-08-14 · Uwe M. Borghoff, Paolo Bottoni, Remo Pareschi

Sensor-Driven Mission Synthesis for UAV/UGV Swarms: A TB-CSPN Coordination Architecture with Hardware-Enforced Safety

This paper presents a coordination architecture for heterogeneous UAV/UGV swarms that synthesises mission actions from uncertain, multi-modal sensor evidence while preserving hardware-enforced safety at the actuation boundary. The approach combines radar, RF, acoustic, and visual observations with Topic-Based Communication Space Petri...

💬 0 commentsarXiv:2608.14306v1PDF
0

Posted in cs.RO · 2026-08-14 · Alaa Abderrahim, Antonio Rosales, Ferdinando Milella, Markku Suomalainen, Shuai Li

Vibration Suppression in Collaborative Flexible Payload Manipulation Using Passive Force Control

In large and heavy structures, vibrations arise during motion, posing significant challenges for precise manipulation. To accomplish the desired motion, control algorithms must effectively suppress these structural vibrations. In cutting edge projects, such as remote maintenance of future fusion energy reactors (tokamaks), the...

💬 0 commentsarXiv:2608.14244v1PDF
0

Posted in cs.LG · 2026-08-14 · Hannah Laus, Claudio Mayrink Verdun, Hao Wang, Flavio du Pin Calmon, Felix Krahmer

KV Cache Compression Through the Lens of Transform Coding

The key-value (KV) cache stores information from past tokens and is a major memory bottleneck in long-context inference. Existing quantization methods address this bottleneck by representing the KV cache uniformly with lower-precision data types and designing quantization schemes to minimize reconstruction error in the cache itself,...

💬 0 commentsarXiv:2608.14191v1PDF
0

Posted in cs.GT · 2026-08-14 · Huanyu Yan, Chenxi Sun, Huanxin Liao, Xiaoying Tang

Optimal Pricing and Charging Strategy Design for Non-cooperative Battery Swapping Stations

Battery swapping is a rapid way to recharge electric vehicles (EVs). As more and more entities are involved in building Battery Swapping Stations (BSSs), how non-cooperative BSSs maximize their profit in a competitive market needs further investigation. In this paper, we focus on a practical scenario where competitive BSSs are...

💬 0 commentsarXiv:2608.14167v1PDF
0

Posted in cs.RO · 2026-08-14 · Inkyu Jang, Gregorio Marchesini, Nicola De Carli, Byeongjun Kim, Sunwoo Hwang, Dabin Kim, Elias Krantz, Youngkyoung Kong, Frank J. Jiang, Annika Wong, Pedro Roque, Prasetyo W. L. Sanjaya, Nicola Bastianello, Mani H. Dhullipalla, Karl H. Johansson, Hyungbo Shim, Dimos V. Dimarogonas, H. Jin Kim

Demonstration of Space Robot Teleoperation over a Lossy and Delayed Network using ATMOS

We present a demonstration showcasing the Autonomy Testbed for Multi-purpose Orbiting Systems (ATMOS), a planar spacecraft-analog robot designed for hardware-in-the-loop evaluation of guidance and control strategies in microgravity-like conditions. Using ATMOS as the physical test platform, we investigate the design, analysis, and...

💬 0 commentsarXiv:2608.14031v1PDF
0

Posted in cs.SD · 2026-08-14 · Aleksandra Teng Ma, Anthony Cammarota, Jiayi Wang, Alexandria Smith, Cheng-Zhi Anna Huang, Jeffrey Albert, Alexander Lerch

H2H Music Improv: A Communication Model and Audio-Visual Dataset for Music Improvisation

Current real-time AI improvisation systems lack the communication awareness human musicians rely on: rather than treating communication as a foundational algorithm design concern, most systems layer interaction strategies post-hoc onto generative algorithms through explicit controls and predefined modes. This gap persists in part...

💬 0 commentsarXiv:2608.13957v1PDF
0

Posted in cs.DS · 2026-08-14 · Simon Raßmann, Pascal Schweitzer

Isomorphism of tournaments with bounded VC dimension

The tournament isomorphism problem is one of the two fundamental bottlenecks to designing better algorithms for the graph isomorphism problem. Though the problem has been investigated for more than five decades, compared to graphs, there are only very few results on the isomorphism problem of tournaments. For most classes of...

💬 0 commentsarXiv:2608.14486v1PDF
0

Posted in cs.AI · 2026-08-14 · Toby Ord

The Dynamics of Intelligence Explosions

AI is increasingly being used to help with AI R&D. Under certain conditions this feedback loop might be able to produce an intelligence explosion, with rapidly escalating AI capabilities. I explore the mathematics of the most explosive possibilities, with an eye to understanding what drives the dynamics. I show that singular growth...

💬 0 commentsarXiv:2608.14426v1PDF
0

Posted in cs.AI · 2026-08-12 · Shujie Luan, Shubhranshu Singh, Tinglong Dai

Algorithm Design and Physician Liability

A single clinical algorithm can deliver unequal accuracy across patient groups, and concern about such disparity has grown as artificial intelligence (AI) spreads through clinical decision-making. In response, a liability rule introduced in the United States holds healthcare providers responsible when their reliance on disparate...

💬 0 commentsarXiv:2608.13618v1PDF
0

Posted in cs.GT · 2026-08-14 · Yuan Deng, Vasilis Gkatzelis, Xizhi Tan, Grigoris Velegkas, Song Zuo

Forging Self-Funded Marketplaces among Strategic Agents

We introduce the problem of designing mechanisms that incentivize strategic agents to form self-funded marketplaces. In our model, if agent $i$ exerts effort $x_i\in [0,1]$, they incur a cost of $x_i\cdot c_i$ (where $c_i$ is unknown to the mechanism designer) and they generate revenue $x_i\cdot r_i$; crucially, $c_i$ can be greater...

💬 0 commentsarXiv:2608.14548v1PDF
0

Posted in cs.CV · 2026-08-14 · Qinye Zhou, Jun Zheng, Yongchao Du, Yuan Wang, Zhengrui Chen, Zuan Gao, Taihang Hu, Chao Lin, Yefeng Shen, Xingjian Wang, Zhao Wang, Zhengtao Wu, Xiaoli Xu, Zhengze Xu, Hao Yan, Denghui Yang, Yuhang Yu, Huayu Zhang, Mingzhou Zhang, Mengting Chen

CPI-Bench: A Comprehensive,Practical and Intelligent Benchmark for Real-World Image Editing

With the rapid advancement of image editing models and their widespread application across various domains, there is an increasingly urgent need to deploy these model capabilities directly into real-world scenarios. However, existing benchmarks remain confined to simple single-image tasks, suffering from limited coverage dimensions...

💬 0 commentsarXiv:2608.14546v1PDF
0

Posted in cs.CV · 2026-08-14 · Mahesh Reddy, Yashesh Savani, Antoine Mercier, Hong Cai, Fatih Porikli, Guillaume Berger

MagnifiQ: Patch-aware Text Guided Progressive Upscaling for High-Resolution Image Restoration

High-resolution image restoration from degraded inputs is challenging because it must preserve global structural consistency while recovering fine-grained local details, especially at 4K resolution where direct diffusion-based restoration is computationally expensive and prone to repeated or inconsistent textures. In this work, we...

💬 0 commentsarXiv:2608.14543v1PDF
0

Posted in cs.CV · 2026-08-14 · Karel Becerra, Boris Mederos, Dean Snow, Ramón A. Mollineda

Decoding the Past: An Uncertainty-Aware Deep Learning Framework for Sex Attribution in Prehistoric Hand Stencils

Determining the biological sex of the individuals who created Upper Paleolithic hand stencils remains a challenging problem due to the absence of ground truth, population differences between contemporary and prehistoric groups, and the uncertainty introduced by image degradation. Traditional morphometric methods suffer from high...

💬 0 commentsarXiv:2608.14539v1PDF
0

Posted in cs.CR · 2026-08-14 · Ruizhe Wang, Meng Xu, N. Asokan

Finding Vulnerabilities via LLM-Augmented Semantics-Aware Type-Checking

Vulnerability detection via static analysis traditionally relies on security experts encoding insecure coding patterns into algorithmic rules. However, this approach often focuses on syntactic patterns and overlooks deeper semantic information in the code, such as the meanings of variable and function names. As software systems grow...

💬 0 commentsarXiv:2608.14533v1PDF
0

Posted in cs.CR · 2026-08-14 · Jack Vanlyssel, Gruia-Catalin Roman, Kendra Cook, Sazzadur Rahaman, Afsah Anwar

Trust Without Boundaries: An Architectural Analysis of Satellite Flight Software

As spacecraft become more software-driven and interconnected, onboard flight software is an increasingly important security boundary. Popular flight software architectures often treat onboard components as trusted peers, simplifying integration while limiting internal isolation and access control. We analyze NASA's Core Flight...

💬 0 commentsarXiv:2608.14532v1PDF
0

Posted in cs.RO · 2026-08-14 · Mohd. Faizuddin Faruqui, Ratnangshu Das, Ravi Kumar L, Pushpak Jagtap

Spatiotemporal Tube-Based Safety-Certificate for Autonomous Navigation of Articulated Vehicles

Articulated vehicles are the workhorses of freight transportation, and their autonomous navigation is challenging. Their physical characteristics and motion constraints pose significant challenges in manoeuvring these vehicles on narrow routes. This paper presents a spatiotemporal tube-based approach to plan autonomous navigation of...

💬 0 commentsarXiv:2608.14531v1PDF
0

Posted in cs.CV · 2026-08-14 · Zian Meng, Zhen Li, Chuanhao Li, Qiang Li, Kaipeng Zhang

Marionette: Predicting World States, Rendering Geometry, Painting Appearance

Interactive game world models typically autoregress visual observations directly in pixel or latent space, forcing structured properties such as pose, geometry, and occlusion to be implicitly maintained by the same generative sequence. Over long horizons, errors in these latent world properties accumulate, making consistency and...

💬 0 commentsarXiv:2608.14530v1PDF
0

Posted in cs.CC · 2026-08-14 · Isaac M Hair, Amit Sahai

Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p > 2

For every constant $2<p<\infty$ and every constant \[ 0<\varepsilon< \min\left\{\frac{p-2}{4p},\frac18\right\}, \] we give a deterministic polynomial-time reduction from 3SAT to $M^\varepsilon$-GapSVP$_p$, where $M$ is the lattice rank. For $p=\infty$, the same holds for every constant $0<\varepsilon<1/8$. The reduction builds on...

💬 0 commentsarXiv:2608.14529v1PDF
0

Posted in cs.AI · 2026-08-14 · Masahiro Kato, Taka Kato

Handover of In-Context Learning State Across Session Boundaries

This study investigates the methodological and theoretical properties of session handover in applications that use large language models. A task may continue in a new session when the context reaches the model's input limit, when the application restarts, or when another agent is asked to finish the task. The application must then...

💬 0 commentsarXiv:2608.14528v1PDF
0

Posted in cs.DC · 2026-08-14 · Evan Coleman, Yuzhong Shen, Masha Sosonkina, Peng Xu

Validating LLM-Modernized Scientific Software Through Differential Fault Injection

Large language model (LLM) agents are increasingly used to modernize the legacy Fortran underlying production scientific software, but validation of these transformations emphasizes nominal executions and may not test whether a modernization preserves the original code's response to faults, perturbations, and reduced precision. We...

💬 0 commentsarXiv:2608.14527v1PDF
0

Posted in cs.GT · 2026-08-11 · Nicholas Teh

Strengthening Full Justified Representation: Efficient Verification and Computation

Full justified representation (FJR) is among the strongest known satisfiable proportionality axioms for approval-based committee elections. Recent work has shown that an FJR committee can be found in polynomial time, but verifying whether a given committee satisfies FJR remains coNP-complete. We introduce FJR+, a strict strengthening...

💬 0 commentsarXiv:2608.11500v1PDF
0

Posted in cs.LG · 2026-08-13 · Zhuohan Wang, Andreea Bacalum, Ollie Olby, Carmine Ventre, Namid Stillman

FlowLOB: Efficient and Controllable Limit Order Book Generation with Flow Matching

Limit order book (LOB) simulators are most useful to practitioners when they combine realistic market dynamics, computationally efficient sampling, controllable scenario generation, and the ability to generalize beyond the instruments seen during training---properties that existing agent-based and deep generative simulators provide...

💬 0 commentsarXiv:2608.13096v1PDF
0

Posted in cs.LG · 2026-08-12 · Junyi Ye, Ivy Gateri Wanjiku

Calibration Bets on the Past: Post-Training Quantization for Financial Time-Series Forecasting

Financial forecasting models are typically developed in full precision, yet production deployment often requires low-precision inference to reduce memory and computational cost. Post-training quantization (PTQ) enables such deployment without retraining. However, reliable activation quantization requires calibration: activation ranges...

💬 0 commentsarXiv:2608.12259v1PDF
0

Posted in cs.CY · 2026-08-11 · Henry Han

Governing Agentic AI in FinTech

Financial institutions are delegating consequential decisions to agentic AI systems that decompose goals, coordinate models and tools, and act with little oversight. Yet agentic AI governance in FinTech is under-investigated. We argue the binding governance constraint is not capability but verifiability. We define the Verifiability...

💬 0 commentsarXiv:2608.11344v2PDF
0

Posted in cs.LG · 2026-08-11 · Travis L. Johnson, Jiannan Jiang, Soumyabrata Chaudhuri, Yihao Chen, Lauren Falvey, Donal O'Cofaigh

Long-Horizon Forecasting of Complete Financial Statements with Forma

Specialist training beats generalist scale when forecasting financial statements. To our knowledge, no prior work jointly forecasts complete financial statements beyond one year, yet in a discounted-cash-flow valuation most firm value sits past that window. We release ProForma-20Q, a reproducible benchmark for forecasting 78 statement...

💬 0 commentsarXiv:2608.11327v1PDF