Tootfinder

Structure-Fair Quantum Circuit Complexity: An Information-Theoretic Lower Bound
HongZheng Liu, YiNuo Tian, Zhiyue Wu
https://arxiv.org/abs/2509.18205 https://

Circuit Complexity From Physical Constraints: Scaling Limitations of Attention
Benjamin Prada, Ankur Mali
https://arxiv.org/abs/2509.19161 https://arxiv.or…

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Complexity-entropy analysis of solar photospheric turbulence: Hinode images of magnetic and Poynting fluxes
Abraham C. -L. Chian, Haroldo V. Ribeiro, Erico L. Rempel, Rodrigo A. Miranda, Luis B. Rubio, Milan Go\v{s}i\'c, Breno Raphaldini, Yasuhito Narita
https://arxiv.org/abs/2509.18444

Complexity of Activity Patterns in a Bio-Inspired Hopfield-Type Network in Different Topologies
Marco Cafiso, Paolo Paradisi
https://arxiv.org/abs/2509.18758 https://

Our new DDEV Gally addon has made it significantly easier to set up Gally, reducing the complexity and manual effort required.
Read more in our latest blogpost: https://blog.bitexpert.de/blog/ddev_gally_addon

Introducing the DDEV Gally Addon | bitExpert
The DDEV Gally Addon simplifies Gally integration into DDEV environments, reducing setup to just two commands. It offers easy management, convenient access, and streamlined interaction, making it easier for developers to work with Gally.

thinking of vibe-coding a microwave oven. that seems like the right level of complexity. toaster is too simple, car is too complicated.

Optimization of Base-n Radix Sort for Skewed Datasets
Atharv Pandey, Lakshmanan Kuppusamy
https://arxiv.org/abs/2509.19021 https://arxiv.org/pdf/2509.19021…

🥃 Edo Kiriko: Shimmering Art for Your Table
#japan

Edo Kiriko: Shimmering Art for Your Table
Edo kiriko glassware is one of Japan’s most coveted crafts, prized for its complexity and beauty — here's where to buy it.

Seeing through the static: Reduced imagery vividness in #aphantasia is associated with impaired temporal lobe signal complexity https://www.sciencedirect.com/science/article/abs/pii/…

Autonomous Data Agents: A New Opportunity for Smart Data
Yanjie Fu, Dongjie Wang, Wangyang Ying, Xiangliang Zhang, Huan Liu, Jian Pei
https://arxiv.org/abs/2509.18710 https://…

#nytimes #report #usapol
"Inside the Deportation Machine"
-
"At least 32 people have died in ICE custody since Mr. Trump took office, more than the number in Mr. Biden’s entire…

The Complex Deportation Network Behind Trump’s Immigration Crackdown
An analysis of data on every ICE arrest, detention stay and deportation reveals the complexity and reach of President Trump’s immigration crackdown.

MAPEX: A Multi-Agent Pipeline for Keyphrase Extraction
Liting Zhang, Shiwan Zhao, Aobo Kong, Qicheng Li
https://arxiv.org/abs/2509.18813 https://arxiv.org/…

MAPEX: A Multi-Agent Pipeline for Keyphrase Extraction
Keyphrase extraction is a fundamental task in natural language processing. However, existing unsupervised prompt-based methods for Large Language Models (LLMs) often rely on single-stage inference pipelines with uniform prompting, regardless of document length or LLM backbone. Such one-size-fits-all designs hinder the full exploitation of LLMs' reasoning and generation capabilities, especially given the complexity of keyphrase extraction across diverse scenarios. To address these challenges, we…

Query-Centric Diffusion Policy for Generalizable Robotic Assembly
Ziyi Xu, Haohong Lin, Shiqi Liu, Ding Zhao
https://arxiv.org/abs/2509.18686 https://arxiv…

Query-Centric Diffusion Policy for Generalizable Robotic Assembly
The robotic assembly task poses a key challenge in building generalist robots due to the intrinsic complexity of part interactions and the sensitivity to noise perturbations in contact-rich settings. The assembly agent is typically designed in a hierarchical manner: high-level multi-part reasoning and low-level precise control. However, implementing such a hierarchical policy is challenging in practice due to the mismatch between high-level skill queries and low-level execution. To address this…

In-Transit Data Transport Strategies for Coupled AI-Simulation Workflow Patterns
Harikrishna Tummalapalli, Riccardo Balin, Christine M. Simpson, Andrew Park, Aymen Alsaadi, Andrew E. Shao, Wesley Brewer, Shantenu Jha
https://arxiv.org/abs/2509.19150

Double Double 🛗
成双 🛗
📷 Nikon F4E
🎞️ Ilford HP5 Plus 400, expired 1993
#filmphotography #Photography #blackandwhite

On the resolvent degree of PSU(3,q)
Pablo Nicolas Christofferson, Akash Ganguly, Claudio Gomez-Gonzales, Ella Kuriyama, Yihan Carmen Li, Nawal Baydoun
https://arxiv.org/abs/2509.19237

MECap-R1: Emotion-aware Policy with Reinforcement Learning for Multimodal Emotion Captioning
Haoqin Sun, Chenyang Lyu, Xiangyu Kong, Shiwan Zhao, Jiaming Zhou, Hui Wang, Aobo Kong, Jinghua Zhao, Longyue Wang, Weihua Luo, Kaifu Zhang, Yong Qin
https://arxiv.org/abs/2509.18729

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Structure-Fair Quantum Circuit Complexity: An Information-Theoretic Lower Bound
HongZheng Liu, YiNuo Tian, Zhiyue Wu

Data-Free Knowledge Distillation for LiDAR-Aided Beam Tracking in MmWave Systems
Abolfazl Zakeri, Nhan Thanh Nguyen, Ahmed Alkhateeb, Markku Juntti
https://arxiv.org/abs/2509.19092

Data-Free Knowledge Distillation for LiDAR-Aided Beam Tracking in MmWave Systems
Multimodal sensing reduces beam training overhead but is constrained by machine learning complexity and dataset demands. To address this, we propose a data-free (DF) knowledge distillation (KD) framework for efficient LiDAR-aided mmWave beam tracking, i.e., predicting the best current and future beams. Specifically, we propose a knowledge inversion framework, where a generator synthesizes LiDAR input data from random noise, guided by a loss function defined on the features and outputs of a pre-…

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
Ignacio G\'omez-Casares, Pietro Belotti, Bissan Ghaddar, Julio Gonz\'alez-D\'iaz
https://arxiv.org/abs/2509.18911

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
Mixed-Integer Quadratically Constrained Quadratic Programs arise in a variety of applications, particularly in energy, water, and gas systems, where discrete decisions interact with nonconvex quadratic constraints. These problems are computationally challenging due to the combination of combinatorial complexity and nonconvexity, often rendering traditional exact methods ineffective for large-scale instances. In this paper, we propose a solution framework for sparse MIQCQPs that integrates semid…

Emergence of power laws in hierarchical dynamics on multi-level graphs
Tommaso Rondini, Gregorio Berselli, Mirko Degli Esposti, Armando Bazzani
https://arxiv.org/abs/2509.18782 …

A Divergence-free Preserving Mixed Finite Element Method for Thermally Driven Active Fluid Model
Nan Zheng, Qingguang Guan, Wenlong Pei, Wenju Zhao
https://arxiv.org/abs/2509.19053

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Rice-like complexity lower bounds for Boolean and uniform automata networks
Ali\'enor Goubault-Larrecq, K\'evin Perrot

Replaced article(s) found for math.DS. https://arxiv.org/list/math.DS/new
[1/1]:
- On the complexity of subshifts and infinite words
Be'eri Greenfeld, Carlos Gustavo Moreira, Efim Zelmanov

Reconstruction of Optical Coherence Tomography Images from Wavelength-space Using Deep-learning
Maryam Viqar, Erdem Sahin, Elena Stoykova, Violeta Madjarova
https://arxiv.org/abs/2509.18783

software complexity sells via developer ego
happy holidays!

Crosslisted article(s) found for physics.bio-ph. https://arxiv.org/list/physics.bio-ph/new
[1/1]:
- Complexity of Activity Patterns in a Bio-Inspired Hopfield-Type Network in Different Topologies
Marco Cafiso, Paolo Paradisi

Seniority-zero Linear Canonical Transformation Theory
Daniel F. Calero-Osorio, Paul W. Ayers
https://arxiv.org/abs/2509.19085 https://arxiv.org/pdf/2509.19…

Seniority-zero Linear Canonical Transformation Theory
We propose a method to solve the electronic Schrödinger equation for strongly correlated systems by applying a unitary transformation to reduce the complexity of the physical Hamiltonian. In particular, we seek a transformation that maps the Hamiltonian into the seniority-zero space, since such Hamiltonians are computationally more tractable while still capturing strong correlation within electron pairs. The unitary rotation is evaluated using the Baker--Campbell--Hausdorff (BCH) expansion, tr…

Crosslisted article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Singleton algorithms for the Constraint Satisfaction Problem
Dmitriy Zhuk
https:…

How Far are VLMs from Visual Spatial Intelligence? A Benchmark-Driven Perspective
Songsong Yu, Yuxin Chen, Hao Ju, Lianjie Jia, Fuxi Zhang, Shaofei Huang, Yuhan Wu, Rundi Cui, Binghao Ran, Zaibin Zhang, Zhedong Zheng, Zhipeng Zhang, Yifan Wang, Lin Song, Lijun Wang, Yanwei Li, Ying Shan, Huchuan Lu
https://arxiv.org/abs/2509.18905

How Far are VLMs from Visual Spatial Intelligence? A Benchmark-Driven Perspective
Visual Spatial Reasoning (VSR) is a core human cognitive ability and a critical requirement for advancing embodied intelligence and autonomous systems. Despite recent progress in Vision-Language Models (VLMs), achieving human-level VSR remains highly challenging due to the complexity of representing and reasoning over three-dimensional space. In this paper, we present a systematic investigation of VSR in VLMs, encompassing a review of existing methodologies across input modalities, model archit…

Aspects of holographic complexity and volume of the black holes
Suraj Maurya, Sashideep Gutti, Rahul Nigam, Swastik Bhattacharya
https://arxiv.org/abs/2510.11833 https://…

Aspects of holographic complexity and volume of the black holes
In this article, we study the complexity growth rate for Banados Teitlboim Zanelli, Schwarzschild, Reissner Nordstrom, and Kerr black holes using complexity-volume (CV) and complexity-action (CA) dualities and verify that it is proportional to the product of the horizon temperature and entropy of the black holes as conjectured by Susskind. Furthermore, we explore the variation in the complexity growth rate $δ\dot{\mathcal{C}}$ under various physical processes, including the Penrose process, su…

On the quadratic complexity of subsets of $\mathbb{F}_p^n$ of bounded $\mathrm{VC_{2}}$-dimension
C. Terry, J. Wolf
https://arxiv.org/abs/2510.12767 https://

On the quadratic complexity of subsets of $\mathbb{F}_p^n$ of bounded $\mathrm{VC_{2}}$-dimension
In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear part and the complexity $q$ of the quadratic part are both bounded in terms of $k$, $p$, and the desired level of approximation $μ$. A key tool in the proof of this result was an arithmetic regularity lemma for the Gowers $U^3$-norm by Green and Tao, which resu…

Nostrshire panel talking about Adam Curry's podcast2.0 , more tags in your podcast rss for payments, in the hope it can fund producers. Did you know besos takes 75 percent of all Audible money? Actors and writers sharing scraps from Amazon's table.
Hot news is that keysend tags are out of fashion and the bolt11 lnurl invoices are taking over.
Podcast platforms can be bridged through nostr to enable cross platform comments and discovery but making users create key pairs is to complex the fountainfm guy reckons. Wants to hide and shatter l abstract away that complexity.
#nostr #nostrshire #podcasting2.0

Quantum Autoencoder: An efficient approach to quantum feature map generation
Shengxin Zhuang, Yusen Wu, Xavier F. Cadet, Du Q. Huynh, Wei Liu, Philippe Charton, Cedric Damour, Frederic Cadet, Jingbo B. Wang
https://arxiv.org/abs/2509.19157

Quantum Autoencoder: An efficient approach to quantum feature map generation
Quantum machine learning methods often rely on fixed, hand-crafted quantum encodings that may not capture optimal features for downstream tasks. In this work, we study the power of quantum autoencoders in learning data-driven quantum representations. We first theoretically demonstrate that the quantum autoencoder method is efficient in terms of sample complexity throughout the entire training process. Then we numerically train the quantum autoencoder on 3 million peptide sequences, and evaluate…

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
J\'er\'emie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, Haoran Zhou
https://arxiv.org/abs/2509.19187 …

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
We study the leader election problem in oriented ring networks under content-oblivious asynchronous message-passing systems, where an adversary may arbitrarily corrupt message contents. Frei et al. (DISC 2024) presented a uniform terminating leader election algorithm for oriented rings in this setting, with message complexity $O(n \cdot \mathsf{ID}_{\max})$ on a ring of size $n$, where $\mathsf{ID}_{\max}$ is the largest identifier in the system, this result has been recently extended by Chal…

Exploring aperiodic, complexity and entropic brain changes during non-ordinary states of consciousness
Victor Oswald (Conscious Care Lab, GIGA Consciousness, GIGA Institute, University of Liege, Liege, Belgium, Cognitive & Computational Neuroscience Lab, Psychology Department, University of Montreal, Montreal, Canada), Karim Jerbi (Cognitive & Computational Neuroscience Lab, Psychology Department, University of Montreal, Montreal, Canada), Corine Sombrun (TranseScience Research…

An Empirical Study of Reducing AV1 Decoder Complexity and Energy Consumption via Encoder Parameter Tuning
Vibhoothi Vibhoothi, Julien Zouein, Shanker Shreejith, Jean-Baptiste Kempf, Anil Kokaram
https://arxiv.org/abs/2510.12380

An Empirical Study of Reducing AV1 Decoder Complexity and Energy Consumption via Encoder Parameter Tuning
The widespread adoption of advanced video codecs such as AV1 is often hindered by their high decoding complexity, posing a challenge for battery-constrained devices. While encoders can be configured to produce bitstreams that are decoder-friendly, estimating the decoding complexity and energy overhead for a given video is non-trivial. In this study, we systematically analyse the impact of disabling various coding tools and adjusting coding parameters in two AV1 encoders, libaom-av1 and SVT-AV1.…

Replaced article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
Venkatesan Guruswami, Karthik C. S., Pasin Manurangsi, Xuandi Ren, Kewen Wu

Languages of Words of Low Automatic Complexity Are Hard to Compute
Joey Chen, Bj{\o}rn Kjos-Hanssen, Ivan Koswara, Linus Richter, Frank Stephan
https://arxiv.org/abs/2510.07696 …

Languages of Words of Low Automatic Complexity Are Hard to Compute
The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). For a finite alphabet $Σ$ of at least two elements, we consider the non-deterministic automatic complexity given by exactly - yet not necessarily uniquely - accepting automata: a word $x \in Σ^*$ has exact non-deterministic automatic complexity $k \in \mathbb{N}$ if there exists a non-deterministic automaton of $k$ st…

Have you noticed that when the blame #DNS meme starts flying the root is perfectly operational, there is rarely a mention of the big registry operators, BIND, Unbound, Knot, and PowerDNS are absent the conversation, and many who can craft a reasonable dig query are getting responses from local and public resolvers to debug?
Even with all the misconfiguration, added complexity on top of it, a…

Compressibility Measures Complexity: Minimum Description Length Meets Singular Learning Theory
Einar Urdshals, Edmund Lau, Jesse Hoogland, Stan van Wingerden, Daniel Murfet
https://arxiv.org/abs/2510.12077

Compressibility Measures Complexity: Minimum Description Length Meets Singular Learning Theory
We study neural network compressibility by using singular learning theory to extend the minimum description length (MDL) principle to singular models like neural networks. Through extensive experiments on the Pythia suite with quantization, factorization, and other compression techniques, we find that complexity estimates based on the local learning coefficient (LLC) are closely, and in some cases, linearly correlated with compressibility. Our results provide a path toward rigorously evaluating…

Crosslisted article(s) found for nlin.AO. https://arxiv.org/list/nlin.AO/new
[1/1]:
- Complexity of Activity Patterns in a Bio-Inspired Hopfield-Type Network in Different Topologies
Marco Cafiso, Paolo Paradisi

“TABS [by Mozilla] pulls exactly the data you need—from HTML to Markdown to JSON—using the fastest, most efficient method for each page. It adapts to the structure and complexity of the site, staying stealthy and reliable so your [AI] agents always get what they need without friction.”
Ethical Stealthy AI Scraping (tm) by Mozilla.
#Mozilla

The National Association of Broadcasters launches a campaign to support live sports on free broadcast channels as more big games move to streaming services (George Winslow/TV Tech)
https://www.tvtechnology.com/platform/broadcast/n…

NAB Launches Effort to Keep Live Sports on Broadcast Channels
The campaign comes at a time when fans are increasingly complaining about the cost of accessing games behind paywalls and the complexity of accessing the games

The complexity and effort that went into this scam are amazing.
Inside a Wild Bitcoin Heist: Five-Star Hotels, Cash-Stuffed Envelopes, and Vanishing Funds
https://www.wired.com/story/bitcoin-scam-mining-as-service/

Inside a Wild Bitcoin Heist: Five-Star Hotels, Cash-Stuffed Envelopes, and Vanishing Funds
Sophisticated crypto scams are on the rise. But few of them go to the lengths one bitcoin mining executive experienced earlier this year.

Polyharmonic Cascade
Yuriy N. Bakhvalov
https://arxiv.org/abs/2512.17671 https://arxiv.org/pdf/2512.17671 https://arxiv.org/html/2512.17671
arXiv:2512.17671v1 Announce Type: new
Abstract: This paper presents a deep machine learning architecture, the "polyharmonic cascade" -- a sequence of packages of polyharmonic splines, where each layer is rigorously derived from the theory of random functions and the principles of indifference. This makes it possible to approximate nonlinear functions of arbitrary complexity while preserving global smoothness and a probabilistic interpretation. For the polyharmonic cascade, a training method alternative to gradient descent is proposed: instead of directly optimizing the coefficients, one solves a single global linear system on each batch with respect to the function values at fixed "constellations" of nodes. This yields synchronized updates of all layers, preserves the probabilistic interpretation of individual layers and theoretical consistency with the original model, and scales well: all computations reduce to 2D matrix operations efficiently executed on a GPU. Fast learning without overfitting on MNIST is demonstrated.
toXiv_bot_toot

"When you work on anything, you want to find the range of impulses. which ones get portrayed is another question, but you want to have that complexity and that fullness, even if you’re playing a cartoon character."
—Willem Dafoe
#acting #coaching

Ok sooo... How minimal do i want to make this stm32mp2 fpga test board?
I'm tempted to go bare bones, no ddr, minimal bom, entirely from parts i have on the shelf to keep costs down.
On one hand it'll be a waste of potential, on the other hand I have plenty of "real" projects coming up and the main goal is to de-risk them. I'm probably never going to use the ddr and it'll increase layout complexity a lot.

i stumbled across a fragment of my online dating profile from two decades ago
I'm into Monk, chaos theory, Björk, Vermeer, Frosted Mini-Wheats, Wallace Stevens, Saint-Saëns, Tim O'Brien, Miro, evolutionary biology, Ravel, Gregory Corso, fresh berries, UFOs, Ellington, Bible comics, computational complexity, Nespresso, The Kinks, Diane DiPrima, fresh-squeezed OJ, Köln's Kompakt music label, Giacometti, Mingus, that sort of thing. I'm very curious and never bored.
s…

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Aleksi Anttila, Juha Kontinen, Fan Yang
https://arxiv.org/abs/2510.08122 https://arxiv…

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We show that the satisfiability problem for this logic is NP-complete, that its validity problem is coNP-complete, and that its model-checking problem is in P.

I just published a post on an interesting MSc thesis I supervised. Arvid Rydberg and Selina Sand Engberg took on the computational challenge of level-p-complexity (D_p(f)) of Boolean functions.
They optimised the algorithms using hash-consing & normalisation, and developed tools for exact calculations using algebraic numbers.
Details:
https:/…

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
Kristoffer Arnsfelt Hansen, Xinhao Nie
https://arxiv.org/abs/2510.11550 https:…

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
We study the problem of computing stationary Nash equilibria in discounted perfect information stochastic games from the viewpoint of computational complexity. For two-player games we prove the problem to be in PPAD, which together with a previous PPAD-hardness result precisely classifies the problem as PPAD-complete. In addition to this we give an improved and simpler PPAD-hardness proof for computing a stationary epsilon-Nash equilibrium. For 3-player games we construct games showing that rat…

JWST occultation reveals unforeseen complexity in Chariklo's ring system: #MinorBodies in the Solar System."

Parametrized Topological Complexity for a Multi-Robot System with Variable Tasks
Gopal Chandra Dutta, Amit Kumar Paul, Subhankar Sau
https://arxiv.org/abs/2510.09323 https://

Parametrized Topological Complexity for a Multi-Robot System with Variable Tasks
We study a generalized motion planning problem involving multiple autonomous robots navigating in a $d$-dimensional Euclidean space in the presence of a set of obstacles whose positions are unknown a priori. Each robot is required to visit sequentially a prescribed set of target states, with the number of targets varying between robots. This heterogeneous setting generalizes the framework considered in the prior works on sequential parametrized topological complexity by Farber and the second au…

Is star complexity a proxy for information based complexity of graphs?
Russell K. Standish
https://arxiv.org/abs/2510.07722 https://arxiv.org/pdf/2510.0772…

Is star complexity a proxy for information based complexity of graphs?
Information-based complexity (IBC) is a well-defined complexity measure of any object given a description in a language and a classifier that identifies those descriptions with the object. Of course, the exact numerical value will vary according to the descriptive language and classifier, but under certain universality conditions (eg the classifier identifies programs of a universal Turning machine that halt and output the same value), asymptotically, the complexity measure is independent of th…

[2025-09-24 Wed (UTC), 1 new article found for cs.CC Computational Complexity]
toXiv_bot_toot

Evolution With(out) Time: Relational Holography & BPS Complexity Growth in $\mathcal{N}=2$ Double-Scaled SYK
Sergio E. Aguilar-Gutierrez
https://arxiv.org/abs/2510.11777 htt…

Evolution With(out) Time: Relational Holography & BPS Complexity Growth in $\mathcal{N}=2$ Double-Scaled SYK
How do we describe non-trivial bulk measurements relative to an observer (i.e. relationally) when both the observer and the system it probes may/may not evolve in time? How can we interpret this holographically; particularly for zero-energy BPS states in supersymmetric theories? We address these questions, in the $\mathcal{N}=2$ double-scaled SYK model and its putative bulk dual by: (i) formulating a holographic procedure in the language of quantum reference frames to gravitationally dress bulk…

PACEbench: A Framework for Evaluating Practical AI Cyber-Exploitation Capabilities
Zicheng Liu, Lige Huang, Jie Zhang, Dongrui Liu, Yuan Tian, Jing Shao
https://arxiv.org/abs/2510.11688

PACEbench: A Framework for Evaluating Practical AI Cyber-Exploitation Capabilities
The increasing autonomy of Large Language Models (LLMs) necessitates a rigorous evaluation of their potential to aid in cyber offense. Existing benchmarks often lack real-world complexity and are thus unable to accurately assess LLMs' cybersecurity capabilities. To address this gap, we introduce PACEbench, a practical AI cyber-exploitation benchmark built on the principles of realistic vulnerability difficulty, environmental complexity, and cyber defenses. Specifically, PACEbench comprises four…

MEC$^3$O: Multi-Expert Consensus for Code Time Complexity Prediction
Joonghyuk Hahn, Soohan Lim, Yo-Sub Han
https://arxiv.org/abs/2510.09049 https://arxiv.…

MEC$^3$O: Multi-Expert Consensus for Code Time Complexity Prediction
Predicting the complexity of source code is essential for software development and algorithm analysis. Recently, Baik et al. (2025) introduced CodeComplex for code time complexity prediction. The paper shows that LLMs without fine-tuning struggle with certain complexity classes. This suggests that no single LLM excels at every class, but rather each model shows advantages in certain classes. We propose MEC$^3$O, a multi-expert consensus system, which extends the multi-agent debate frameworks. M…

Explaining raw data complexity to improve satellite onboard processing
Adrien Dorise, Marjorie Bellizzi, Adrien Girard, Benjamin Francesconi, St\'ephane May
https://arxiv.org/abs/2510.06858

Explaining raw data complexity to improve satellite onboard processing
With increasing processing power, deploying AI models for remote sensing directly onboard satellites is becoming feasible. However, new constraints arise, mainly when using raw, unprocessed sensor data instead of preprocessed ground-based products. While current solutions primarily rely on preprocessed sensor images, few approaches directly leverage raw data. This study investigates the effects of utilising raw data on deep learning models for object detection and classification tasks. We intro…

"A key principle of PKM is that no one has the right answer, but together we can create better ways of understanding complex systems. We each need to find others who are sharing their knowledge flow and in turn contribute our own. It’s not about being a better digital librarian, it’s about becoming a participating member of a networked organization, economy and society."
@…

Been in-depth studying the PDF file format spec for the past few days... it's mind boggling that this format with its capacity for monstrous complexity managed to become the de-facto standard for modern documents. So many questionable decisions & undue flexibility in there (in the wrong places) making even a simple task of reliable metadata extraction (for example) incredibly hard... I understand and value flexibility, but not at this cost! Guess I will have to keep on using one of t…

Complexity of the Zero Set of a Matrix Schubert Ideal
Laura Escobar, Cesar Meza
https://arxiv.org/abs/2510.00131 https://arxiv.org/pdf/2510.00131

Complexity of the Zero Set of a Matrix Schubert Ideal
$T$-varieties are normal varieties equipped with an action of an algebraic torus $T$. When the action is effective, the complexity of a $T$-variety $X$ is $\dim(X)-\dim(T)$. Matrix Schubert varieties, introduced by Fulton in 1992, are $T$-varieties consisting of $n \times n$ matrices satisfying certain constraints on the ranks of their submatrices. In this paper, we focus on the complexity of certain torus-fixed affine subvarieties of matrix Schubert varieties. Concretely, given a matrix Schube…

The Trump administration is today’s comprehensive belittler of conservative ideas.
Its solicitude for “conservative ideas” will not encompass this one:
-- Many things are beyond government’s proper scope and actual competence.
Watching today’s politics toy with an institution of MIT’s complexity and importance is like watching a toddler play with Sèvres porcela

Let’s take a closer look at MIT, one target of Trump’s blunderbuss
It’s alarming to see such a complex, important institution subject to the whims of today’s politics.

Exploring Complexity Measures for Analysis of Solar Wind Structures and Streams
Venla Koikkalainen, Emilia Kilpua, Simon Good, Adnane Osmane
https://arxiv.org/abs/2510.05873 htt…

Exploring Complexity Measures for Analysis of Solar Wind Structures and Streams
In this paper we use statistical complexity and information theory metrics to study structure within solar wind time series. We explore this using entropy-complexity and information planes, where the measure for entropy is formed using either permutation entropy or the degree distribution of a horizontal visibility graph (HVG). The entropy is then compared to the Jensen complexity (Jensen-Shannon complexity plane) and Fisher information measure (Fisher-Shannon information plane), formed both fr…

Convergence Guarantees for Federated SARSA with Local Training and Heterogeneous Agents
Paul Mangold, Elo\"ise Berthier, Eric Moulines
https://arxiv.org/abs/2512.17688 https://arxiv.org/pdf/2512.17688 https://arxiv.org/html/2512.17688
arXiv:2512.17688v1 Announce Type: new
Abstract: We present a novel theoretical analysis of Federated SARSA (FedSARSA) with linear function approximation and local training. We establish convergence guarantees for FedSARSA in the presence of heterogeneity, both in local transitions and rewards, providing the first sample and communication complexity bounds in this setting. At the core of our analysis is a new, exact multi-step error expansion for single-agent SARSA, which is of independent interest. Our analysis precisely quantifies the impact of heterogeneity, demonstrating the convergence of FedSARSA with multiple local updates. Crucially, we show that FedSARSA achieves linear speed-up with respect to the number of agents, up to higher-order terms due to Markovian sampling. Numerical experiments support our theoretical findings.
toXiv_bot_toot

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Resource-sensitive but language-blind: Community size and not grammatical complexity better predicts the accuracy of Large Language Models in a novel Wug Test
Nikoleta Pantelidou, Evelina Leivada, Paolo Morosi
https://arxiv.org/abs/2510.12463

Resource-sensitive but language-blind: Community size and not grammatical complexity better predicts the accuracy of Large Language Models in a novel Wug Test
The linguistic abilities of Large Language Models are a matter of ongoing debate. This study contributes to this discussion by investigating model performance in a morphological generalization task that involves novel words. Using a multilingual adaptation of the Wug Test, six models were tested across four partially unrelated languages (Catalan, English, Greek, and Spanish) and compared with human speakers. The aim is to determine whether model accuracy approximates human competence and whethe…

(Injective) facet-complexity between simplicial complexes
Cesar A. Ipanaque Zapata, Ayse Borat
https://arxiv.org/abs/2510.03017 https://arxiv.org/pdf/2510.…

(Injective) facet-complexity between simplicial complexes
We present the notion of facet-complexity, $\text{C}(\mathsf{L};\mathsf{K})$, for two simplicial complexes $\mathsf{L}$ and $\mathsf{K}$, along with basic results for this numerical invariant. This invariant $\text{C}(\mathsf{L};\mathsf{K})$ quantifies the \aspas{complexity} of the following question: When does there exist a facet simplicial map $\mathsf{L}\to \mathsf{K}$? A facet simplicial map is a simplicial map that preserves non-unitary facets. Likewise, we introduce the notion of injectiv…

Low Complexity Detector for XL-MIMO Uplink: A Cross Splitting Based Information Geometry Approach
Wenjun Zhang, An-An Lu, Xiqi Gao
https://arxiv.org/abs/2510.09039 https://

Low Complexity Detector for XL-MIMO Uplink: A Cross Splitting Based Information Geometry Approach
In this paper, we propose the cross splitting based information geometry approach (CS-IGA), a novel and low complexity iterative detector for uplink signal recovery in extralarge-scale MIMO (XL-MIMO) systems. Conventional iterative detectors, such as the approximate message passing (AMP) algorithm and the traditional information geometry algorithm (IGA), suffer from a per iteration complexity that scales with the number of base station (BS) antennas, creating a computational bottleneck. To over…

Is #AI really just dumb statistics? "Olympiad-level physics problem-solving presents a significant challenge for both humans and artificial intelligence (AI), as it requires a sophisticated integration of precise calculation, abstract reasoning, and a fundamental grasp of physical principles," says the (abstract of the) paper https://arxiv.org/abs/2511.10515: "The Chinese Physics Olympiad (CPhO), renowned for its complexity and depth, serves as an ideal and rigorous testbed for these advanced capabilities. In this paper, we introduce LOCA-R (LOgical Chain Augmentation for Reasoning), an improved version of the LOCA framework adapted for complex reasoning, and apply it to the CPhO 2025 theory examination. LOCA-R achieves a near-perfect score of 313 out of 320 points, solidly surpassing the highest-scoring human competitor and significantly outperforming all baseline methods." Oops ...?

Complexity hierarchies in Euclidean stars
L. Herrera, A. Di Prisco, J. Ospino
https://arxiv.org/abs/2509.26384 https://arxiv.org/pdf/2509.26384

Complexity hierarchies in Euclidean stars
We establish a hierarchy of Euclidean stars according to their degree of complexity, as measured by the complexity factor and the complexity of the pattern of evolution. We consider both, nondissipative and dissipative systems. Solutions are ranged from the simplest one, in order of increasing complexity. Some specific models are found and analyzed in detail.

Recursive Inverse Design Enables Hyper-spectral Photonic Integrated Circuits
Hao He, Zengji Tu, Yuanlei Wang, Hongyan Zhao, Chuangxin Feng, Yongzhuo Zhou, Yujun Chen, Ruoao Yang, Lei Zhang, Jianjun Wu, Qi-Fan Yang, Lin Chang
https://arxiv.org/abs/2510.12104

Recursive Inverse Design Enables Hyper-spectral Photonic Integrated Circuits
Spectrum manipulation is central to photonic systems, where advanced computing and sensing applications often demand highly complex spectral responses to achieve high throughput. Conventional methods for enhancing spectral complexity typically rely on cascading discrete photonic components, resulting in a complexity that scales only linearly with the number of components. Here, we introduce hyper-spectral photonic integrated circuits (HS-PICs), in which spectral complexity scales exponentially …

Nonlocal Games Through Communication Complexity and Quantum Cryptography
Pierre Botteron
https://arxiv.org/abs/2510.09457 https://arxiv.org/pdf/2510.09457

Nonlocal Games Through Communication Complexity and Quantum Cryptography
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish quantum correlations from non-signaling correlations by leveraging the principle of communication complexity. To this end, we employ techniques such as distributed computation, majority-function-based distillation protocols, the algebraic and geometric properti…

Complexity of Einstein-Maxwell-non-minimal coupling $R^2F^2$: the role of the penalty factor
Mojtaba Shahbazi, Mehdi Sadeghi
https://arxiv.org/abs/2509.25165 https://

Complexity of Einstein-Maxwell-non-minimal coupling $R^2F^2$: the role of the penalty factor
In this paper, we examine the holographic complexity of a theory of Einstein-Maxwell with a non-minimal coupling $R^2 F_{μν}F^{μν} $ term via complexity=anything. We introduce a perturbative black brane solution in AdS spacetime up to the first order of the non-minimal coupling. Because the model exhibits the resistivity proportional to the temperature, it could describe strange metals. The complexity of the solution could be characterized by three quantities: the conserved charge, the non-…

Estimating Spatially Resolved Radiation Fields Using Neural Networks
Felix Lehner, Pasquale Lombardo, Susana Castillo, Oliver Hupe, Marcus Magnor
https://arxiv.org/abs/2512.17654 https://arxiv.org/pdf/2512.17654 https://arxiv.org/html/2512.17654
arXiv:2512.17654v1 Announce Type: new
Abstract: We present an in-depth analysis on how to build and train neural networks to estimate the spatial distribution of scattered radiation fields for radiation protection dosimetry in medical radiation fields, such as those found in Interventional Radiology and Cardiology. Therefore, we present three different synthetically generated datasets with increasing complexity for training, using a Monte-Carlo Simulation application based on Geant4. On those datasets, we evaluate convolutional and fully connected architectures of neural networks to demonstrate which design decisions work well for reconstructing the fluence and spectra distributions over the spatial domain of such radiation fields. All used datasets as well as our training pipeline are published as open source in separate repositories.
toXiv_bot_toot

Moody Urbanity - Odes II 🎶
情绪化城市 - 颂 II🎶
📷 Pentax MX
🎞️ Kentmere Pan 400
#filmphotography #Photography #blackandwhite

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
Susan Ghaderi, Morteza Rahimi, Yves Moreau, Masoud Ahookhosh
https://arxiv.org/abs/2511.10425 https://arxiv.org/pdf/2511.10425 https://arxiv.org/html/2511.10425
arXiv:2511.10425v1 Announce Type: new
Abstract: This paper addresses the unconstrained minimization of smooth convex functions whose gradients are locally Holder continuous. Building on these results, we analyze the Scaled Gradient Algorithm (SGA) under local smoothness assumptions, proving its global convergence and iteration complexity. Furthermore, under local strong convexity and the Kurdyka-Lojasiewicz (KL) inequality, we establish linear convergence rates and provide explicit complexity bounds. In particular, we show that when the gradient is locally Lipschitz continuous, SGA attains linear convergence for any KL exponent. We then introduce and analyze an adaptive variant of SGA (AdaSGA), which automatically adjusts the scaling and step-size parameters. For this method, we show global convergence, and derive local linear rates under strong convexity.
toXiv_bot_toot

Low Complexity Weight Flexible Decoding Schemes of Linear Block Code for 6G xURLLC
Di Zhang, Yinglei Yang, Zhilong Liu, Shaobo Jia, Kyungchun Lee, Zhirong Zhang
https://arxiv.org/abs/2510.06768

Low Complexity Weight Flexible Decoding Schemes of Linear Block Code for 6G xURLLC
Low complexity error correction code is a key enabler for next generation ultra-reliable low-latency communications (xURLLC) in six generation (6G). Against this background, this paper proposes a decoding scheme for linear block code by leveraging certain interesting properties of dual codewords. It is found that dual codewords with flexible weights can provide useful decoding information for the locations and magnitudes of error bits, which yielding higher reliability performance. In addition,…

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
Argyrios Deligkas, Michelle D\"oring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
https://arxiv.org/abs/2510.05806

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, i.e., graphs that deterministically change over time. In a tcc, any pair of vertices must be able to reach each other via a time-respecting path. We consider both problems of maximum open tccs (openTCC), which allow temporal paths through vertices outside the component, and closed tccs (closedTCC) which require at least one temporal path entirely within the component for every pair. We focu…

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Computational Complexity in Property Testing
Renato Ferreira Pinto Jr., Diptaksho Palit, Sofya Raskhodnikova
https://arxiv.org/abs/2510.05927 https://arxiv…

Computational Complexity in Property Testing
We initiate a systematic study of the computational complexity of property testing, focusing on the relationship between query and time complexity. While traditional work in property testing has emphasized query complexity, relatively little is known about the computational hardness of property testers. Our goal is to chart the landscape of time-query interplay and develop tools for proving time complexity lower bounds. Our first contribution is a pair of time-query hierarchy theorems for prope…

Black Hole Entropy and Complexity Growth in Horndeski Gravity within the AdS/BCFT Framework
Fabiano F. Santos, Behnam Pourhassan, Emmanuel N. Saridakis
https://arxiv.org/abs/2509.23430

Black Hole Entropy and Complexity Growth in Horndeski Gravity within the AdS/BCFT Framework
This work investigates the connection between quantum complexity and gravitational dynamics within the framework of Horndeski gravity, extending the AdS/BCFT correspondence to include scalar-tensor interactions. By refining the ``\(complexity = action\)'' conjecture we investigate how Horndeski gravity modifies the Wheeler-DeWitt patch and the causal structure of the black hole. Our analysis reveals that the linear growth of complexity, proportional to the product of black hole entropy and temp…

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
Abdurakhmon Sadiev, Peter Richt\'arik, Ilyas Fatkhullin
https://arxiv.org/abs/2510.10690

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
Heavy-tailed noise is pervasive in modern machine learning applications, arising from data heterogeneity, outliers, and non-stationary stochastic environments. While second-order methods can significantly accelerate convergence in light-tailed or bounded-noise settings, such algorithms are often brittle and lack guarantees under heavy-tailed noise -- precisely the regimes where robustness is most critical. In this work, we take a first step toward a theoretical understanding of second-order opt…

Energy, Bosons and Computational Complexity
Ulysse Chabaud, Sevag Gharibian, Saeed Mehraban, Arsalan Motamedi, Hamid Reza Naeij, Dorian Rudolph, Dhruva Sambrani
https://arxiv.org/abs/2510.08545

Energy, Bosons and Computational Complexity
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth rates) There exist bosonic gate sets which increase energy incredibly rapidly, obtaining e.g. infinite energy in finite/constant time. We prove these high energies can make computing properties of bosonic computations, such as deciding whether a given computation will attain infinite energy, extremely difficult, formall…

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

The Influence of Magnetic Complexity of Active Regions on Solar Wind Properties During Solar Cycles 23 and 24
Xinzheng Shi, Hui Fu, Zhenghua Huang, Limei Yan, Qi Liu, Lidong Xia
https://arxiv.org/abs/2510.08975

The Influence of Magnetic Complexity of Active Regions on Solar Wind Properties During Solar Cycles 23 and 24
Linking solar wind properties to the activities and characteristics of its source regions can enhance our understanding of its origin and generation mechanisms. Using the Mount Wilson magnetic classification (MWMC), we categorize all active regions (ARs) between 1999 and 2020 into three groups: alpha, beta, and complex ARs. Subsequently, we classify the near-Earth AR solar wind into the corresponding three types based on the magnetic type of ARs. Our results show that alpha, beta, and complex A…

Rate optimal learning of equilibria from data
Till Freihaut, Luca Viano, Emanuele Nevali, Volkan Cevher, Matthieu Geist, Giorgia Ramponi
https://arxiv.org/abs/2510.09325 https:/…

Rate optimal learning of equilibria from data
We close open theoretical gaps in Multi-Agent Imitation Learning (MAIL) by characterizing the limits of non-interactive MAIL and presenting the first interactive algorithm with near-optimal sample complexity. In the non-interactive setting, we prove a statistical lower bound that identifies the all-policy deviation concentrability coefficient as the fundamental complexity measure, and we show that Behavior Cloning (BC) is rate-optimal. For the interactive setting, we introduce a framework that …

RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
Hyundong Jin, Joonghyuk Hahn, Yo-Sub Han
https://arxiv.org/abs/2510.09227 https://…

RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
Large language models (LLMs) show strong performance across natural language processing (NLP), mathematical reasoning, and programming, and recent large reasoning models (LRMs) further emphasize explicit reasoning. Yet their computational limits, particularly spatial complexity constrained by finite context windows, remain poorly understood. While recent works often focus on problems within the NP complexity class, we push the boundary by introducing a novel benchmark grounded in two PSPACE-com…

Average-case quantum complexity from glassiness
Alexander Zlokapa, Bobak T. Kiani, Eric R. Anschuetz
https://arxiv.org/abs/2510.08497 https://arxiv.org/pdf…

Average-case quantum complexity from glassiness
Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms. For example, it can obstruct constant-time Langevin dynamics and message-passing in random $k$-SAT and max-cut instances. We provide an analogous framework for average-case quantum complexity showing that a natural family of quantum algorithms (e.g., Lindbladian evolution) fails for natural Hamiltonian ensembles (e.g., random 3-local Hamiltonians). Specifical…

Entanglement Entropy and Complexity in Dyonic Quantum Black Holes
Sanhita Parihar, Gurmeet Singh Punia
https://arxiv.org/abs/2510.05264 https://arxiv.org/p…

Entanglement Entropy and Complexity in Dyonic Quantum Black Holes
In this work, we study the holographic entanglement entropy (HEE) and holographic complexity (HC) for three-dimensional dyonic quantum black holes, incorporating corrections arising from bulk quantum fields in the setup of double holography. We investigate the holographic entanglement entropy through the holographic Ryu-Takayanagi (RT) prescription and the island prescription. Using RT extremization, we evaluate HEE for connected and disconnected (island) surfaces and show islands emerge when R…

Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers
Peter Shaw, James Cohan, Jacob Eisenstein, Kristina Toutanova
https://arxiv.org/abs/2509.22445

Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers
The Minimum Description Length (MDL) principle offers a formal framework for applying Occam's razor in machine learning. However, its application to neural networks such as Transformers is challenging due to the lack of a principled, universal measure for model complexity. This paper introduces the theoretical notion of asymptotically optimal description length objectives, grounded in the theory of Kolmogorov complexity. We establish that a minimizer of such an objective achieves optimal compre…

Magic and communication complexity
Uma Girish, Alex May, Natalie Parham, Henry Yuen
https://arxiv.org/abs/2510.07246 https://arxiv.org/pdf/2510.07246

Magic and communication complexity
We establish novel connections between magic in quantum circuits and communication complexity. In particular, we show that functions computable with low magic have low communication cost. Our first result shows that the $\mathsf{D}\|$ (deterministic simultaneous message passing) cost of a Boolean function $f$ is at most the number of single-qubit magic gates in a quantum circuit computing $f$ with any quantum advice state. If we allow mid-circuit measurements and adaptive circuits, we ob…

Less is More: Strategic Expert Selection Outperforms Ensemble Complexity in Traffic Forecasting
Walid Guettala, Yufan Zhao, L\'aszl\'o Guly\'as
https://arxiv.org/abs/2510.07426

Less is More: Strategic Expert Selection Outperforms Ensemble Complexity in Traffic Forecasting
Traffic forecasting is fundamental to intelligent transportation systems, enabling congestion mitigation and emission reduction in increasingly complex urban environments. While recent graph neural network approaches have advanced spatial temporal modeling, existing mixture of experts frameworks like Time Enhanced Spatio Temporal Attention Model (TESTAM) lack explicit incorporation of physical road network topology, limiting their spatial capabilities. We present TESTAM+, an enhanced spatio tem…

Fundamental Costs of Noise-Robust Quantum Control: Speed Limits and Complexity
Junkai Zeng, Xiu-Hao Deng
https://arxiv.org/abs/2510.07183 https://arxiv.org…

Fundamental Costs of Noise-Robust Quantum Control: Speed Limits and Complexity
Noise is ubiquitous in quantum systems and is a major obstacle for the advancement of quantum information science. Noise-robust quantum control achieves high-fidelity operations by engineering the evolution path so that first-order noise contributions cancel at the final time. Such dynamical error correction typically incurs a time overhead beyond standard quantum speed limits. We derive general lower bounds on control complexity that quantify this overhead for quasi-static coherent noise under…

xLSTM Scaling Laws: Competitive Performance with Linear Time-Complexity
Maximilian Beck, Kajetan Schweighofer, Sebastian B\"ock, Sebastian Lehner, Sepp Hochreiter
https://arxiv.org/abs/2510.02228 …

xLSTM Scaling Laws: Competitive Performance with Linear Time-Complexity
Scaling laws play a central role in the success of Large Language Models (LLMs), enabling the prediction of model performance relative to compute budgets prior to training. While Transformers have been the dominant architecture, recent alternatives such as xLSTM offer linear complexity with respect to context length while remaining competitive in the billion-parameter regime. We conduct a comparative investigation on the scaling behavior of Transformers and xLSTM along the following lines, prov…

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
Rafig Huseynzade
https://arxiv.org/abs/2510.08577 https://arxiv.o…

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
We introduce Psi-Turing Machines (Psi-TM): classical Turing machines equipped with a constant-depth introspection interface $ ι$ and an explicit per-step information budget $ B(d,n)=c\,d\log_2 n $. With the interface frozen, we develop an information-theoretic lower-bound toolkit: Budget counting, $ Ψ$-Fooling, and $ Ψ$-Fano, with worked examples $ L_k $ and $ L_k^{\mathrm{phase}} $. We prove an oracle-relative separation $ P^Ψ \neq NP^Ψ $ and a strict depth hierarchy, reinforced by an Ant…