Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 23, 2026 — 12:04:22 EST

0

Posted in math.CO · 2026-07-28 · Alexander Schmidhuber, Matthew B. Hastings

A Spectral Proof of the Hypergraph Moore Bound

A nonempty subfamily of a $k$-uniform hypergraph is an \emph{even cover} if every vertex lies in an even number of its hyperedges; for $k=2$ these are edge-disjoint unions of cycles, so the minimum size of an even cover is the natural hypergraph analogue of girth. We prove Feige's 2008 conjecture on the hypergraph Moore bound: there...

💬 0 commentsarXiv:2607.26028v1PDF
0

Posted in cs.GR · 2026-07-28 · Santiago V. Lombeyda, Mathieu Desbrun

Interactive Extraction of High-Frequency Aesthetically-Coherent Colormaps

Color transfer functions (i.e. colormaps) exhibiting a high frequency luminosity component have proven to be useful in the visualization of data where feature detection or iso-contours recognition is essential. Having these colormaps also display a wide range of color and an aesthetically pleasing composition holds the potential to...

💬 0 commentsarXiv:2607.26025v1PDF
0

Posted in cs.HC · 2026-07-28 · Yuan-Yi Fan

LLM4OSC: Profile-Bound Natural Language Control with Deterministic Validation for Open Sound Control

Open Sound Control (OSC) is the dominant wire protocol for real-time parametric control in professional audio, live performance, and virtual production. Large language models can emit plausible OSC, but they hallucinate addresses, mishandle type tags, and fail under paraphrase- unacceptable in show-critical contexts. We present...

💬 0 commentsarXiv:2607.26024v1PDF
0

Posted in cs.AI · 2026-07-28 · Ankang Yang, Jitao Zhao, Di Jin, Yuxiao Huang, Dongxiao He

CHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer

Graph foundation models (GFMs) have emerged as a promising paradigm for transferring knowledge across graph domains and tasks. Real-world graphs associate nodes with text, images, and other modalities, making multimodal graphs essential for representing complex entities and relations. Moreover, collecting labels and adapting models...

💬 0 commentsarXiv:2607.26023v1PDF
0

Posted in cs.CL · 2026-07-28 · Siyu Xia, Chenheng Zhang, Yanting Wu, Haoxuan Li, Jiajun Chai, Xiaohan Wang, Guojun Yin, Wei Lin, Zhouchen Lin, Haifeng Zhang, Jun Wang

UniMem: Complementary Episodic-to-Parametric Memory for Boundary-Agnostic Task Streams

Memory is essential for LLM agents to accumulate task experience and reuse task-specific execution strategies. However, real-world deployment over boundary-agnostic and evolving task streams exposes a fundamental stability-plasticity dilemma. External retrieval-based memory can rapidly absorb new evidence, but it often fails to...

💬 0 commentsarXiv:2607.26017v1PDF
0

Posted in cs.AR · 2026-07-28 · Solomon Micheal Serunjogi, Rachmad Vidya Wicaksana Putra, Ayat Taha, Muhammad Shafique, Mahmoud Rasras

MDTransformer: A Hardware-Software Co-Design of Mode-Division Photonic Transformer Accelerator with Inverse-Designed Coherent Crossbar

Recently, photonic transformer accelerators (PTAs) have successfully achieved significant speedup and energy efficiency improvements over electronic accelerators for expediting Transformer inference. However, state-of-the-art rely on expensive multi-wavelength light generation and large dot-product units due to active phase-shifter...

💬 0 commentsarXiv:2607.26016v1PDF
0

Posted in cs.CL · 2026-07-28 · Zandi Eberstadt

Instruction-Tuned Models Locally Reuse Human Syntax More Than Humans Do

Syntactic convergence (the tendency of speakers to adapt in language towards the grammatical profiles of their interlocutors) is a well-documented feature of human dialogue widely considered to operate below conscious awareness. Whether large language models exhibit analogous syntactic convergence toward human users relative to human...

💬 0 commentsarXiv:2607.26015v1PDF
0

Posted in cs.FL · 2026-07-28 · Brian Curtin, Dmytro Savchuk

Combinatorial structures connecting Latin squares and bireversible automata

This paper explores the theory of letter transducers, Mealy automata, and bireversible automata from a combinatorial perspective analogous to the theory of Latin squares. We view the sets of transitions of letter transducers as analogs of orthogonal arrays, and discuss two other combinatorial encodings of Mealy automata analogous to...

💬 0 commentsarXiv:2607.26013v1PDF
0

Posted in cs.NI · 2026-07-28 · Maxime Elkael, Reshma Prasad, Tamerlan Aghayev, Salvatore D'Oro, Michele Polese, Tommaso Melodia

MAC-Gyver: Open, Programmable, Scheduling for AI-RAN 6G Systems

Cellular networks are integrating Artificial Intelli- gence (AI) into radio access network control. The MAC scheduler is a promising target because it allocates a limited resource, spectrum, at every slot, under competing latency, throughput, and reliability requirements. However, most learning-based sched- ulers are evaluated only in...

💬 0 commentsarXiv:2607.26012v1PDF
0

Posted in cs.CV · 2026-07-28 · Yuan Yin, Elias Ramzi, Marc Lafon, Valentin Charraut, Victor Bares, Yihong Xu, Éloi Zablocki, Alexandre Boulch, Thibault Buhet, Andrei Bursuc, Matthieu Cord

Pictura: Perspective-View Self-Play at Scale for Driving

Self-play in simulation produces robust driving policies at scale. Demonstrations of such behavior have been made using privileged vectorized observations such as exact poses and velocities, even for occluded agents. This assumes that perception is solved and introduces a representation gap with the partial observation of a deployed...

💬 0 commentsarXiv:2607.26005v1PDF
0

Posted in cs.CV · 2026-07-28 · Neta Shaul, Chao Liu, Arash Vahdat, Julius Berner

Parallel Decoding Distillation for Fast Image and Video Generation

Generation in video diffusion or flow models is computationally expensive due to the slow and iterative sampling process. Current state-of-the-art (SOTA) acceleration methods heavily rely on variational score distillation (VSD) and adversarial losses to distill diffusion models into few-step generators. Albeit achieving high-quality...

💬 0 commentsarXiv:2607.26004v1PDF
0

Posted in cs.LG · 2026-07-28 · Wenzhi Zhong, Edward Milsom, Michael Murray

Sharpness-Aware Minimization and Muon: Robustness under the Spectral Norm

Sharpness-Aware Minimization (SAM) aims to improve generalization by encouraging insensitivity to small, worst-case parameter perturbations. However, the notion of a "small" perturbation is inherently geometry-dependent: while existing SAM variants have explored a wide range of choices, a clear perspective on which geometries are most...

💬 0 commentsarXiv:2607.26001v1PDF
0

Posted in cs.CL · 2026-07-27 · Zhen Huang, Yikun Wang, Shijie Xia, Pengfei Liu

DataOrchestra: Learning to Orchestrate Per-Example Curation of Pretraining Data

Pretraining data processing is critical to the downstream performance of Large Language Models (LLMs). However, many existing approaches define a fixed processing strategy at the corpus or domain level and apply it uniformly to many examples, without adapting to the needs of each example. We propose DataOrchestra, a framework that...

💬 0 commentsarXiv:2607.24717v1PDF
0

Posted in cs.AI · 2026-07-27 · Ali Ansari, Yasmin Mohammadi, Farnoush Nili, Parsa Esmaeilkhani, Longin Jan Latecki, Eduard Dragut

ERUnderstand: Evaluating Vision-Language Models on Structured ER Diagrams

Entity-Relationship Diagrams (ERDs) are central to conceptual database design, yet they are typically available only as rendered images rather than machine-readable schemas, limiting AI-assisted database engineering. We introduce ERUnderstand, the first large-scale benchmark for structured understanding of ER diagrams, comprising...

💬 0 commentsarXiv:2607.24707v1PDF
0

Posted in cs.CV · 2026-07-27 · Hang Xing, Guangjun Liu, Yan Xia, Xueming Ding

SADe: Sparse-Atom Support Decontamination for Few-Shot Segmentation with Weak Support Annotations

Few-shot segmentation (FSS) commonly assumes clean pixel-level support masks, yet practical support supervision often uses boxes, scribbles, coarse masks, or pseudo-masks. These weak annotations may include texture-similar distractors and background context alongside the target, contaminating class prototypes or visual prompts before...

💬 0 commentsarXiv:2607.24706v1PDF
0

Posted in cs.CV · 2026-07-27 · Anika Knupfer, Maximilian Lindholz, Johanna Paula Müller, Jordina Aviles Verdera, Smiti Tripathy, Susanne Schulz-Heise, Jana Hutter

Panda: Unsupervised Pelvic Anomaly Detection for Real-Time MR Imaging

Female pelvic diseases remain an under researched area characterized by often delayed diagnosis. While pelvic MRI offers superior soft-tissue contrast for diagnosis and image-guided procedures, real-time anomaly detection remains challenging due to physiological motion, tissue deformation, and instrument artifacts. Existing supervised...

💬 0 commentsarXiv:2607.24703v1PDF
0

Posted in cs.CV · 2026-07-27 · Andong Lu, Ziyi Zha, Jiandong Jin, Shihao Li, Chenglong Li, Jin Tang, Bin Luo

Spatio-Temporal Conditional Denoising Transformer for Modality-Missing RGBT Tracking

Missing modalities in RGBT tracking often lead to incomplete and unstable multimodal feature representations that greatly degrade the performance. Existing methods typically attempt to recover missing modalities from available ones, but the quality of data generated in challenging scenarios might be unsatisfactory. In addition,...

💬 0 commentsarXiv:2607.24701v1PDF
0

Posted in cs.SI · 2026-07-27 · Dini Wang, Ho-Chun Herbert Chang

Modest Algorithmic Mediation can Maximize Topical Diversity in Hybrid Human-AI Systems

In the artificial intelligence (AI) era, the rise of algorithmic feeds has fundamentally transformed information diffusion on social media. While early platforms organized visibility through explicit social networks, contemporary systems mediate exposure through intelligent recommender algorithms that personalize attention. This paper...

💬 0 commentsarXiv:2607.24698v1PDF
0

Posted in cs.NI · 2026-07-27 · Jhonatan Tavori, Gur-Eyal Sela, Ion Stoica, Gil Zussman

Denial of Deadline: Network-Driven Accuracy Collapse in Distributed Inference Pipelines

Inference systems increasingly combine a fast path that returns predictions within the application's latency deadline together with a higher-accuracy slow path that runs higher-compute methods on stronger, remote hardware, so its results can be returned on time and combined with the fast path predictions. Across several application...

💬 0 commentsarXiv:2607.24692v1PDF
0

Posted in cs.DB · 2026-07-27 · Zeyu Zhang, Xue Li, Iacer Calixto, Paul Groth, Sebastian Schelter

Beyond Scale and Generation: Understanding Language Model-based Entity Matching

Entity matching identifies records that refer to the same real-world entity. Language models can be adapted to this task through bi-encoder, cross-encoder, and generative matcher architectures. However, prior studies often conflate matcher architecture with differences in model backbone, model variant(reflecting different pretraining...

💬 0 commentsarXiv:2607.24688v1PDF
0

Posted in quant-ph · 2026-07-27 · Nikhil Khatri, Stefan Zohren, Gabriel Matos

Stacking the Deck: Tunable Trainability in Stacked LCUs

Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ansätze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, while structures...

💬 0 commentsarXiv:2607.24686v1PDF
0

Posted in cs.CV · 2026-07-27 · Francisco Mena, Dino Ienco, Roberto Interdonato, Cassio F. Dantas, Simon Besnard

Co-Learning for Missing Arbitrary Modalities in Multi-modal Classification

Multi-modal classification leverages complementary information across diverse data sources to enhance predictive performance. However, real-world scenarios subject to operational constraints, such as sensor failures or privacy restrictions, lead to inconsistent modality availability between training and inference times. To handle...

💬 0 commentsarXiv:2607.24683v1PDF
0

Posted in quant-ph · 2026-07-27 · M. G. Damaceno, G. H. dos Santos, N. Rubiano da Silva, S. P. Walborn, P. H. Souto Ribeiro

Coincidence free certification and quantification of spatial entanglement with stimulated parametric down conversion

Using stimulated emission, a photon pair source can be characterized by seeding the signal mode with a bright classical beam and measuring the stimulated idler field, thus replacing two-photon coincidence counting with classical intensity detection. We apply this approach to the continuous transverse spatial degrees of freedom of a...

💬 0 commentsarXiv:2607.24718v1PDF
0

Posted in nlin.CD · 2026-07-27 · Victor de Jesus Valadão, Erik Aurell, Guido Boffetta, Massimo Cencini, Stefano Musacchio, Angelo Vulpiani

The real butterfly effect: from the pop culture to mathematics and physics

The "butterfly effect", introduced over half a century ago by Edward Lorenz, has shifted from a cornerstone of dynamical systems to a popular metaphor, yet its true physical manifestation in fully developed turbulence spans a spectrum of phenomena from standard chaotic sensitivity to the recently established concept of Eulerian...

💬 0 commentsarXiv:2607.24715v1PDF
0

Posted in quant-ph · 2026-07-27 · Fabian Kreppel, Reza Salkhordeh, Ferdinand Schmidt-Kaler, André Brinkmann

Efficient LLM-Generated Shuttling Compilers for Complex Trapped-Ion Architectures

Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the full Python code of shuttling compilers...

💬 0 commentsarXiv:2607.24714v1PDF