Instrumentation and Methods for Astrophysics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 9 November
We introduce the NASA-funded mission STARI (STarlight Acquisition and Reflection toward Interferometry), a two-spacecraft technology demonstrator for future long-baseline interferometers. STARI will perform, to our knowledge, the first in-space transfer of starlight between free-flying spacecraft, a critical step toward long-baseline space interferometry. Two propulsive 8U CubeSats in low Earth orbit will fly in formation with separations up to 200 m: one relays a narrow stellar beam to the other, where an off-axis parabola reimages it into a single-mode fiber. Using differential GNSS, visible LED beacons, and fast-steering mirrors in closed-loop control, we aim to sustain diffraction-limited, high-throughput fiber coupling during formation flight. STARI, targeting launch in 2029, is designed to mature key technologies needed for future mission concepts such as the Large Interferometer for Exoplanets (LIFE), which would seek atmospheric biomarkers on nearby Earth-like exoplanets.
High Energy Physics (Theory)
Tripartite nonlocal magic from reflected and negativity spectra
A tripartite pure state is local-unitary equivalent to a stabilizer state if and only if its marginal, reflected, and negativity spectra (up to signs) are flat. These conditions are quantified using anti-flatness, giving a diagnostic of tripartite nonlocal magic that is computable and experimentally measurable using randomized measurements. In non-abelian quantum doubles, it appears only when the triple points of the tripartition lie on plaquettes. In random tensor networks, it appears exactly when the entanglement wedge of two boundary regions connects.
Read the full abstract
Machine Learning
IC-GNN: Modeling Individualized Brain Community Organization for Disease Prediction
Brain networks exhibit modular organization, where community structures vary substantially across individuals and diseases. Understanding these individual differences is crucial for advancing both basic neuroscience research and precision medicine. However, widely used predefined group-level brain atlases often overlook this heterogeneity. While individualized functional parcellations capture subject-specific variability in community boundaries, they often require lengthy scan times to achieve fine-grained resolution and complicate cross-subject comparisons. To address this trade-off and investigate how individualized community organization captures disease-associated changes across individuals, we propose IC-GNN, an atlas-anchored model that forms distinct, individualized functional communities directly over atlas-defined brain regions. IC-GNN derives discrete, individualized multiscale communities from resting-state functional magnetic resonance imaging (fMRI) data, refines community-guided connections, and adapts shared regional weights to each subject's community context to enable both individualized modeling and group-level comparisons. Across more than 30,000 participants from ABIDE (autism spectrum disorder), ADNI (Alzheimer's disease), and the UK Biobank (depression), IC-GNN achieves the highest performance compared with 15 baseline methods. We further demonstrate that these individualized communities are reproducible within scans and across sessions, and carry predictive power on their own. Furthermore, IC-GNN identifies disease-related shifts in community organization that align with established literature, highlighting a promising approach for modeling individualized community structure for disease prediction and biomarker discovery.
Read the full abstract
Machine Learning
INTENT: Out-of-Sample, Out-of-Time, and Cold-Start Evaluation on User Event Sequences
Banks now train foundation models on ordered sequences of customer events such as transactions, app sessions, and authorizations. Deployed, such a model predicts forward in time, often for customers and merchants absent from training, yet each is evaluated on private data, so no two can be compared. Public benchmarks for such sequences rarely test a period the model has not seen; recommendation studies usually hold out each user's last events instead. We present INTENT (INTEraction, Novelty, and Transfer evaluation for next-action prediction), a public benchmark that scores a model in seven cells defined by whether the user, the period, and the target item appeared in training. An audit of 59 public dataset families retains five datasets; the most common defect is the lack of a calendar timestamp that orders events. No date lies within the time span of all five datasets, so each is split at its own cutoff, chosen by one rule fixed before any model is evaluated. Summed over the datasets, every cell holds at least 111,769 users. In reference results the cell determines the best model: a transformer leads on seen items after the cutoff but scores zero on new items, a variant that embeds item metadata helps mainly on MicroLens, and repeating the user's last item leads on new items in four of five datasets. This parameter-free control also shows that on three datasets most of the score lost after the cutoff reflects changed behavior rather than the model. The pipeline, the cutoff rule, and the per-cell user counts are publicly available.
Read the full abstract
Mathematical Physics
The Supercritical Ten Martini Problem
We solve the ten martini problem for the positive-Lyapunov part of the spectrum of any nonconstant real analytic one-frequency Schrödinger operator. The proof uses the intrinsic symplectic structure of the dual center of Ge–Jitomirskaya [28] and extends the Kotani–almost-reducibility strategy of Ge–Jitomirskaya–You [30] from two-dimensional centers to arbitrary finite center dimension.
Read the full abstract
Systems and Control
Control Barrier Functions for Counting Tasks in Multi-Agent Systems
Multi-agent systems increasingly operate in dynamic environments and execute complex tasks that require coordination, posing significant computational challenges. Counting tasks, which require a minimum number of agents to satisfy a given condition, arise naturally in such systems. Examples include surveillance tasks, where at least m drones must continuously monitor a critical area, and emergency-response tasks, where at least m robots must converge to an incident location. The identities of the agents assigned to these tasks may change dynamically depending on their states, input bounds, and individual objectives. In this work, we propose a control barrier function (CBF)-based framework for enforcing counting invariance and counting convergence tasks, without explicitly assigning agents or enumerating all possible subteams. We develop a recursion-based method for constructing differentiable CBFs for counting tasks. The resulting CBF constraints are incorporated into quadratic programs, enabling online controller synthesis. Numerical experiments demonstrate scalability to large multi-agent systems, while a multi-drone emergency-response case study illustrates the satisfaction of counting tasks.
Read the full abstract
Combinatorics
Monochromatic or rainbow triangles in the triangular lattice
Erdős, Graham, Montgomery, Rothschild, Spencer, and Straus conjectured that for each non-equilateral triangle $\operatorname{T}$, every 2-coloring of the plane contains a congruent copy of $\operatorname{T}$ with monochromatic vertex set. We confirm this conjecture for triangles with a ratio $\sqrt{7/3}$ between two side lengths. We further prove that every coloring of the plane, regardless of the number of colors used, contains congruent copies of 36 specific triangles with monochromatic or rainbow vertex sets, partially answering a question of Gehér, Sagdeev, and Tóth. Both these results were obtained by considering finite configurations on the triangular lattice.
Read the full abstract
Data Structures and Algorithms
Combinatorial optimization with bounded subdeterminants
We take a first step toward a broader study of classical combinatorial optimization problems through the maximum subdeterminants of their standard integer programming formulations, yielding new positive results for several famous (NP-hard) problems. An integer matrix is totally $\Delta$-modular if every square submatrix has determinant of absolute value at most $\Delta$. For every fixed $\Delta$, it has been known that maximum clique, maximum stable set, and minimum vertex cover can be solved in polynomial time on instances for which the coefficient matrix of the natural formulation is totally $\Delta$-modular. We extend this list by showing that the same holds for many other problems, including the weighted versions of maximum cut, the traveling salesman problem, feedback vertex set, odd cycle transversal, dominating set, max 2-sat, induced matching, and cluster vertex deletion, as well as for $k$-colorability and graph isomorphism. Our proofs reveal several new ways in which bounded subdeterminants impose combinatorial structure: they bound the size or maximum degree of the input graph, bound packings of cycles and other obstructions, or yield decompositions into tractable graph classes such as forests, chordal graphs, graphs of bounded treewidth, and graphs of bounded linear mim-width.
Read the full abstract
Instrumentation and Methods for Astrophysics
Mars Seed: A Reference Architecture for Biomanufacturing Habitats from Martian Resources
Human exploration of Mars will require enormous quantities of materials for the first crewed missions and substantially more for permanent habitation, making flexible and scalable technologies for in situ resource utilization (ISRU), including biological ISRU, of significant interest. However, no existing mission architecture quantitatively evaluates whether in situ biomanufacturing can realistically deliver materials at the scales required for human settlement. Here, we present Mars Seed, an end-to-end reference architecture for using biomanufacturing to produce bioplastics at scale entirely from in situ resources on Mars. We provide a complete analysis of a space bioprocess in which feedstocks are generated entirely from Martian resources, converted biologically into polyhydroxybutyrate (PHB) bioplastic, and purified to produce material suitable for constructing human habitats. We show that the upfront power and upmass costs of deploying the equipment required for this bioprocess are recovered within two synodic periods relative to Earth-shipped alternatives. Further, because the process relies entirely on feedstocks sourced from Martian materials, production can continue until equipment failure without requiring additional materials from Earth, enabling scalable conversion of local resources into useful materials. Mars Seed demonstrates that biological ISRU can be mass- and power-competitive with Earth-shipped alternatives, establishing biomanufacturing as a practical component of Mars mission architecture rather than an aspirational capability.
Read the full abstract
Fluid Dynamics
Numerical Investigations on Bitumen Liberation from Oil Sands Lump
The dynamic liberation and digestion of viscous oil-solid aggregates under turbulent flow is a critical transport phenomenon in multiphase chemical processes, including slurry transport, soil remediation, and industrial extraction. A primary industrial application of this phenomenon is oil sands hydrotransport, where pipelines are widely utilized to simultaneously transport and extract bitumen from lump ore. However, optimizing operating conditions requires a fundamental understanding of the localized hydrodynamic mechanisms governing detachment. To address this, a three-dimensional (3D) Eulerian-Eulerian (E-E) CFD approach coupled with k-omega SST turbulence model has been utilized to investigate bitumen detachment dynamics from complex solid matrices. Six numerical cases were analyzed across lump diameters (D) of 4 and 5 cm and particle Reynolds numbers (Re_p) between 2000 and 4000. The simulation results reveal that bitumen liberation is a shear-driven process, occurring only when the shear stresses exerted by the flow on the lump surface exceed a critical threshold value. The bitumen liberation rate increases with higher Re_p and smaller D, due to enhanced local shear forces and reduced particle shielding. Based on these mechanistic insights, a novel semi-empirical shear-driven model was formulated. The proposed model demonstrates excellent predictive accuracy when validated against experimental liberation data, with an error less than 8.3%. Overall, these findings clarify the fluid-particle interactions governing bitumen detachment and offer a robust, physics-based tool for predicting recovery efficiency in industrial hydrotransport operations.
Read the full abstract
Artificial Intelligence
Elicitation of the parameters of a multi-criteria sorting model
Multiple-criteria decision aiding (MCDA) proposes models and methods for different types of decision problems such as choice, ranking or sorting. Such models involve various parameters that must be elicited. In the elicitation process, all necessary information has to be taken from the decision-maker. For this, several direct and indirect elicitation methods are suggested in the literature. In this work, we concentrate on direct elicitation: we aim at providing a rigorous elicitation procedure for the parameters of the Non-Compensatory Sorting model (NCS), which has been characterized by an axiomatic analysis. A basic version of the NCS model is considered, i.e., a model with two categories and no vetoes. The parameters are the set of sufficient coalitions of criteria and the profile separating the two categories. Regarding the sufficient coalitions, we propose several questioning algorithms that engraft questions on classical graph exploration algorithms such as depth-first search. Such algorithms are implemented and evaluated by simulation. For eliciting the limit profile, we design a questioning algorithm using dichotomy. Questioning algorithms can be optimal in the worst case or on average. An optimal algorithm in the worst case has been proposed by Hansel in the framework of monotone Boolean functions. We implement and evaluate this algorithm as a variant of the depth-first search approaches. Regarding optimal questioning strategies on average, we evaluate decision trees for up to four criteria. On the other hand, we assess how more general is NCS as compared to MR-Sort, a particular case of the NCS model in which sufficient coalitions can be represented by additive weights.
Read the full abstract
Formal Languages and Automata
The Left Ripple of Byte-Pair Encoding: Certified Lookbehind for Every Dictionary
Berglund and van der Merwe formalized byte-pair encoding and bounded how far an appended string can change a tokenization, leaving the converse open: how far can a string prepended on the left change it, which dictionaries make that ripple infinite, and can it be computed efficiently when finite? We answer all three for every dictionary. The origin radius, how far a prepend can change covering spans, is decided with radius certificates by a product of two runs of the automaton that guesses the final tokens, in time polynomial in the dictionary written out, and it is infinite exactly when one periodic word has two canonical tilings with no common boundary. Under their ordering condition it is infinite exactly when some rule (t, t) finds its two copies adjacent at its own stage, and such a rule makes any dictionary infinite. A finite radius makes every window of a width read off the radii have a cut, and the radius is finite exactly when such cuts are dense. The token machine completes for every dictionary, and the tokenization is subsequential, extending what Berglund, Martens and van der Merwe proved for proper ones under one pass per rule. A streaming tokenizer emits after every symbol exactly the tokens that no continuation changes, in polynomial time, answering a question of Dalirrooyfard and Ye. Boundedness of the label measure, the edit distance of the token sequences, is decided for every dictionary in polynomial time as well, and under the ordering condition the largest distance one edit causes over dictionaries of m rules lies asymptotically between m^2/10 and m^2/2. GPT-2's merge table carries 244 effective self-pairs, so its origin radius is infinite from the forty-second merge on, and that of cl100k, o200k and Llama 3 from their first. Every measured number is its program's output, and what is not executed is named.
Read the full abstract
Instrumentation and Methods for Astrophysics
Aster: A Flexible and Robust Collection of Numerical Tools for N-Body Problems
The Aster library is an open-source collection of numerical tools designed for large-scale gravitational N-body simulations. Aster provides a flexible environment to its users, enabling it to be used in the analysis of a broad range of astrophysical problems. The library implements efficient force calculation algorithms, including a spatial tree solver optimized with coordinate-dependent identifiers, which has been fine-tuned for both CPU and GPU architectures. Despite its high degree of modularity, many parts of the library have been optimized with SIMD instructions, heavy parallelization, and support on dedicated hardware. Aster also offers a wide variety of numerical symplectic integrators, such as SABA (from first to tenth order), the classic leapfrog algorithm, and the more advanced Wisdom-Holman (WH) integrator, while also providing a vast collection of mathematical tools, e.g., post-newtonian expansions (1PN, 2PN, 2.5PN), data collection and graphing systems, a built-in renderer, and presets for faster instantiation of large amounts of bodies. In this work we will discuss in depth the details of each module as well as the results of several performance- and accuracy-related tests, probing the library's capabilities in different physical applications.
Read the full abstract
Computation and Language
A Multi-Word Tokenizer for 204 Languages That Needs Fewer Tokens Than GPT-4o's, Including on English
Languages of India need 1.6 to 14 times as many tokens as English on GPT-4o's tokenizer for the same content, which makes them more expensive and slower to serve. We train tokenizers from scratch on human-written text in about 200 languages. Havon v3 is a byte-level BPE tokenizer with 262,144 tokens and a pre-tokenizer that keeps combining marks with their letters and chunks scripts written without spaces. On FLORES-200 devtest it needs fewer tokens than GPT-4o's o200k_base on all 25 languages of India (median 0.74 of GPT-4o's count) and on 172 of 204 languages, but 7% more on English. Havon v4 adds a second, multi-word training stage (SuperBPE) to v3. At exactly GPT-4o's vocabulary size of 200,019 tokens, v4 needs 6.1% fewer tokens than GPT-4o on English and fewer on 161 of 204 languages and all 25 languages of India (median 0.74); at the same size, v3 needs 9.4% more on English and wins on 133. With 262,144 tokens, v4 needs 9.6% fewer tokens on English and fewer on 182 of 204 languages, and with 524,288 tokens it needs fewer on 203 of 204. The gains are largest for English, Hindi and the Romance languages; scripts without spaces, such as Khmer, Burmese and Tibetan, gain little and lose subword merges. Havon v5 replaces v4's Python-only code sample with permissively licensed code in 15 languages: on code it needs 1.03 to 1.22 times GPT-4o's tokens, against 1.11 to 1.29 for v4, while keeping all 25 languages of India (median 0.74, all significant under a sentence-level bootstrap) and English (0.94). These are compression results only: we have not yet evaluated a model trained with v4 or v5.
Read the full abstract
Computation and Language
The Indic Token Tax in 2026: Measuring Tokenizer. Disparity and Its Cost for the Languages of India
Commercial language model APIs bill per token, so a tokenizer that needs more tokens for the same content in one language makes that language more expensive, slower, and able to fit less text in a fixed context window. We measure this disparity for nine public tokenizers, including those of GPT-4, GPT-4o, Qwen2.5, DeepSeek-V3, Mistral-Nemo and four Sarvam models, on all 25 languages of India available in FLORES-200 (2,009 professionally translated sentences aligned with English) and on 13,732 human-translated Hinglish-English social media pairs from PHINC. On GPT-4o's tokenizer the same content needs between 1.57 times (Hindi) and 5.01 times (Odia) the tokens of English, and 13.7 times for Santali in Ol Chiki script; GPT-4's tokenizer needs up to 12.8 times. Sarvam-30B/105B is the only third-party tokenizer that stays below 2.6 times on every language (median 1.53). In an illustrative scenario using official list prices accessed on 5 November 2026 and stated assumptions, a support bot handling 100,000 chats a month on GPT-4o would cost about INR 56,640 in English and INR 102,829 in Marathi; these are estimates, not measured production costs. Against an openly licensed Hindi and Marathi morphological segmentation set, no tokenizer places more than 35% of its word-internal boundaries on morpheme boundaries (boundary F1 at most 0.48). In a companion paper we present a tokenizer that reduces this tax. Code, pinned artifacts and raw token counts are available at https://github.com/HavonAI/indic-token-tax.
Read the full abstract
Machine Learning
Continuous-Time Set-Transformers for Asynchronous WiFi-IMU Indoor Localization
Indoor localization commonly combines WiFi received signal strength indicator (RSSI) fingerprints with inertial measurements. However, these sensor streams are sampled asynchronously at different rates; therefore, observations rarely align in time and may be missing or stale. Most existing methods resample the data onto a shared clock and process each modality using a separate branch. We instead present a continuous-time transformer that represents observations as an unordered set of timestamped tokens. Each token encodes its measurement, modality, and elapsed time since acquisition. A single attention block jointly fuses information across modalities and time, avoiding both resampling and modality-specific branches while remaining invariant to token order. During training, we randomly mask entire modalities and individual observations, enabling the model to operate under missing or outdated inputs. We validate the modality-specific encoders on their respective benchmarks and evaluate the fused model on both simulated and real datasets, including a crosssession dataset collected on unseen days. The proposed approach improves upon an open WiFi fingerprinting baseline under cross-session drift, remains competitive with learned fusion and dead-reckoning baselines, and degrades gracefully as observations become missing or stale. These results suggest that a single continuoustime transformer provides a practical framework for indoor localization from asynchronous sensors.
Read the full abstract
Image and Video Processing
SNIF: a Self-Navigator Intelligent Filter correcting off-center and spin-history artifacts in quasi-random radial MRI
For self-navigation and self-gating in MRI, self-navigators are extracted from the complex values of the k-space center, called DC-signal, through a temporal frequency analysis. However, this signal often carries artifacts. This paper introduces a Self-Navigator Intelligent Filter (SNIF) that models the physical origin of the k-space center artifacts to properly estimate them and thus more accurately remove them. The artifact affecting the DC-signal $S_{DC}$ generally has two main origins: the jitter of the k-space center (”off-center artifact”) and the cumulative history of the spins (”spin-history artifact”). Both add noise-like artifacts to the signal. The off-center effect can be modeled as a perturbative signal $S_0$ and the spin-history effect as a convolution kernel $h$ so that the measured DC-signal is $S_{DC} = S_m + S_0 \star h$, where $S_m$ is the motion-related component which effectively contains the expected self-navigators. Methods to compute $h$ and $S_0$ were developed, which gives the possibility to extract $S_m$ from $S_{DC}$. They were implemented and evaluated on thoracic UTE datasets acquired on a healthy volunteer. Qualitative visual comparison and quantitative spectral analysis of the DC-signal before and after SNIF demonstrate that the method improves both the accuracy and the precision of the extracted respiratory and cardiac self-navigators. By considering the physical origin of the DC-signal artifacts, SNIF makes both respiratory and cardiac self-navigators more sensitive to motion, which supports finer MRI motion tracking.
Read the full abstract
Software Engineering
Beyond the Document: Compiled Context and Governed Agents for Any Work Product
A document preserves the visible result of professional work but often discards the research, calculations, assumptions, evidence, and authorization boundaries behind it. We study a different unit of delivery: a Portable Agent Format (PAF) package that carries a work product together with compiled context, evidence, provenance, and rules for subsequent interaction. To test whether this context remains useful beyond the process that produced it, we evaluate four new packages, created after the hosted and offline readers were fixed: an investment proposal, fund research, financial-statement analysis, and an engineering incident review. Two packages were produced by specialized agents and two through a general-purpose assistant's packaging skill. Across 400 frozen questions and 12,000 evaluated responses, a hosted governed reader succeeds on 96% of questions versus 86% with instructions plus raw-file retrieval (Holm-adjusted p < 10^-7). On the 260 answerable questions per condition, success is 94% versus 79%; the gap varies by package. Source-material chat and instructions alone reach 48% and 74% overall. A separate 0.8-billion-parameter offline reader succeeds on 69% overall, but 54% on answerable questions. Its -1 response rate is 2.9%, combining materially wrong and unauthorized answers, versus 56% with the source and instructions alone. Ablations suggest advantages for the integrated selector and package-adapted writer, without isolating representation from training effects. The same run exposes a failure: offline retrieval resolves none of the 40 historical-record questions in one financial-data package. These findings support treating compiled knowledge as part of the delivered work product, while leaving independent standards interoperability and end-to-end governance conformance unproven.
Read the full abstract
General Physics
Entropy: the Route from the Gaussian Field to the Statistical Mechanics of the Thermal Radiation
Maximum Entropy or canonical typicality applied to the electromagnetic field can provide starting points for arriving at the Bose distribution of the photon numbers of thermal radiation, but they rely on statistical postulates whose experimental testability is controversial. Here we start from experimentally verifiable assumption of Gaussianity of the electromagnetic field. We analyze the field by projecting it onto orthonormal time-frequency basis functions with unitary bandwidth duration product that represent field's orthogonal time-frequency modes. Through the Glauber-Surashdan representation, we see that the joint density operator of the modes in the photon number basis factorize into diagonal density operators with geometric coefficients of individual modes, while the mean photon occupations of the modes remains still unknown. The independent imposition of Clausius' relation on each one of the entropies and energies of the modes leads to Bose's mean photon occupancy. Thus, our main claim is that for the first time Bose statistics is recovered in the paper under explicit, experimentally verifiable statistical assumptions, without assuming any statistical postulate that is not directly experimentally verifiable. From the mean occupation numbers, the Boltzmann distribution of the energy of matter particles of the material that generates/absorbes the radiation is then derived by retracing in the backward direction the Einstein-Feynman detailed balance.
Read the full abstract
Systems and Control
Opacity of Discrete Event Systems under Sensor Attacks
Many information control problems in discrete event systems can be addressed using strong opacity, weak opacity, and non-opacity. These opacities depend on observations. If cyber attackers can attack sensors (or observation channels), then opacities will change. An opaque system may become not opaque, or a not opaque system may become opaque. Therefore, it is important to investigate opacities under sensor attacks. In this paper, we consider opacities under sensor attacks for two settings. The first one is the user has prior knowledge of sensor attacks in which the opacities are called as W-CA-opacities. The second one is the user has no prior knowledge of sensor attacks, and opacities are called as N-CA-opacities. For the former, we construct an augmented automaton that integrates the information of sensor attacks and then converts W-CA-opacities into classical opacities to solve the verification problem. For the latter, we construct the observers for the given system without sensor attacks and with sensor attacks, respectively. We then do the parallel operation on these two observers to obtain a method of verifying N-CA opacities. Furthermore, by adopting the detector technique, we find polynomial algorithms for verifying weak opacity and non opacity for both settings.
Read the full abstract
Machine Learning
Explanation-Aware Fairness Beyond Output Parity: Joint Output-Attribution Regularization for Medical Image Classification
Output-level fairness does not constrain whether demographic groups rely on similar predictive contributions in representation space. For a nonlinear encoder with a linear head, we show that outcome-conditioned output score disparity equals the signed sum of feature attribution differences across subgroups by allowing small prediction gaps to arise through cancellation effect. We test whether an attribution disparity penalty complements output-level equalized odds based fairness surrogates. Across 960 DINOv2-LoRA models on HAM10000 and Harvard-GF datasets for gender and race fairness, attribution augmentation increases utility-fairness trade-off performance for hypervolume in six different settings with paired 95% confidence intervals and relative gains of 1.49-10.57%. Under a predefined utility constraint, augmented model families also achieve 9.0-38.7% lower equalized odds difference, lower attribution disparity, and reduced cancellation ratio while preserving predictive utility. These results support attribution fairness as a complementary explanation-aware constraint on output fairness.
Read the full abstract
Probability
Mean-field BSDEs with jumps under quadratic-exponential growth
This paper studies the well-posedness of mean-field backward stochastic differential equations (BSDEs, for short) with Poisson jumps, where the generator has quadratic growth with respect to $Z$ and exponential growth with respect to $U$, where $(Y,Z,U)$ denotes the solution of this BSDE. First, we prove the existence and the uniqueness of local solutions to mean-field backward stochastic differential equations with jumps (BSDEJs, for short) by using a fixed-point argument. Then, based on these local results, we discuss the solvability of global solutions in the following two cases: in the first one, the generator has linear growth with respect to $Y$ and the corresponding marginal distribution $\mu_1$; and in the second one, the generator has subquadratic growth with respect to the marginal distribution $\mu_2$ and linear growth with respect to the marginal distribution $\mu_3$, corresponding to $Z$ and $U$, respectively. Finally, by employing a Girsanov transformation we establish a comparison theorem for mean-field BSDEJs under quadratic-exponential growth conditions.
Read the full abstract
Combinatorics
Koszul duality and determinant formulas for affine hyperplane arrangements
For real affine hyperplane arrangements, we prove Lam's determinant conjecture for the inverse Varchenko matrix restricted to bounded chambers. The proof combines Lam's comparison of twisted intersection forms with the period determinant formula of Varchenko, Loeser-Sabbah and Douai-Terao. For normal crossing arrangements, we introduce the taut path algebra and the chamber intersection algebra and establish a Koszul duality between them, yielding an explicit multivariate formula for the inverse Varchenko matrix. After specializing the parameters to $q$, its restriction to bounded chambers is a scalar multiple of the $q$-intersection matrix, proving a determinant conjecture of the authors. We also discuss how the Koszul duality results generalize to affine oriented matroids.
Read the full abstract
Software Engineering
The Gene Is Not the Gate: Conceptualizing the Semantic Genome of Quantum Software
Quantum software spans applications, program representations, compilers, runtimes, and hardware-facing control. Existing abstractions describe these artifacts and layers, but they do not capture the semantic responsibilities that must remain valid as a computation is transformed across the stack. This limits systematic reasoning about cross-layer correctness, evolution, and reuse. We present QGenome, a semantic foundation for quantum software genomics. We define a quantum software gene as a typed, reusable responsibility characterized by an explicit contract, execution context, concrete expressions, and supporting evidence. QGenome organizes genes across five software strata and ten responsibility families grouped into computational semantics, coordination, realization, and assurance. Typed genes compose into pathways and genomes through dependency, refinement, provenance, and phenotype relations, enabling responsibilities to be traced across alternative implementations and execution contexts. We illustrate the taxonomy using representative public artifacts across the quantum software stack and define principles for contextual validity, genome evolution, environmental adaptation, and capability expression. Rather than presenting a complete taxonomy or an automated extraction technique, QGenome establishes a falsifiable framework and a concrete research agenda for gene mining, lineage recovery, cross-layer regression testing and repair, and evidence-grounded quantum software agents.
Read the full abstract
Symbolic Computation
Reliable Computation of the $L_{\infty}$-Norm of Linear Time-Invariant Systems Depending on One Parameter
The $L_{\infty}$-norm of a linear time-invariant system is a central quantity in robust control, used in robust stability tests, stability margins, and $H_{\infty}$ controller design. Physical models depend on parameters, such as masses, stiffnesses, or gains, so the $L_{\infty}$-norm becomes a function of these parameters. This computation reduces to studying the real critical points of a plane algebraic curve whose coefficients depend on the parameters. Previous approaches based on cylindrical algebraic decomposition describe the $L_{\infty}$-norm on the whole parameter space, but their cost grows very quickly with the number of parameters. In this paper, we propose instead to compute a generic parametrisation of the solutions, valid outside an explicitly characterised set of non-generic parameter values. In the case of one parameter, this parametrisation is obtained by interpolation from a certified solver for the non-parametric case. The resulting algorithm is fully certified, relying on a priori bounds and multimodular computations rather than on Gröbner bases. It is illustrated on examples from the robust control literature.
Read the full abstract
Optimization and Control
State-constrained optimal control with the theory of functional connections: squared slacks and junction exponents
For optimal control problems with an affine state constraint, we combine the theory of functional connections (TFC), which writes every function satisfying prescribed linear conditions as an explicit expression in terms of a free function, with the squared-slack substitution $b - a^\top x(t) = s(t)^2$. Every trial trajectory then satisfies the endpoint conditions and the path constraint identically. The accuracy depends on the regularity of the slack function at the junctions with a boundary arc. Along an optimal trajectory, the constraint residual vanishes like $(t_1 - t)^m$, where the junction exponent $m$ is equal to the order $p$ of the constraint if and only if the $p$-th derivative of the constraint jumps at the junction, and thus a single polynomial slack converges algebraically. The multiple-arc TFC method that we introduce, with unknown junction times and with residuals $(t_1 - t)^m \sigma(t)^2$ on the free arcs, represents the optimal trajectory exactly and converges geometrically when the arcs are analytic. In a linear-quadratic class, an exact cost identity shows that the cost of every trial trajectory is an upper bound of the optimal cost. We compare both approaches with direct collocation and indirect shooting on the Bryson-Denham problem, on a rendezvous problem with an approach corridor and on the six-dimensional atmospheric reentry of a space shuttle with three state constraints.
Read the full abstract
Computer Vision
SpatialSR: Spatial Resolution-Centric Pipeline for Arbitrary-Scale Remote Sensing Super-Resolution
Although remote sensing image arbitrary-scale super-resolution (RSI-ASSR) methods support reconstruction at arbitrary or continuous scales, they predominantly condition on the relative scale factor and have not sufficiently investigated the absolute spatial resolution itself as a reconstruction prior, thereby disregarding the inherent spatial context of objects, which frequently leads to spatial-related distortions and compromised performance in downstream remote sensing applications. To address these challenges, we introduce SpatialSR, a SRe-centric arbitrary-scale RSISR method that leverages the spatial resolution (SRe) of remote sensing images (RSI) as an essential prior for super-resolution reconstruction. Distinct from existing SR methods, SpatialSR aims to restore high-resolution remote sensing images with a target SRe (typically set to 0.1m/pixel to align with the metadata of commonly used downstream task datasets). Specifically, we design a Spatial Resolution Estimation Module (SREM) to estimate the SRe of low-resolution (LR) images, thereby dynamically determining the required arbitrary scaling factor. Next, we employ a pretrained SRe-to-image diffusion model to extract SRe-specified texture-style codes, which are further incorporated into a carefully designed Resolution-aware Style Consistency Module (RSCM) to constrain the SRe-aware texture consistency of reconstructed images. Furthermore, to overcome the high computational expense inherent in diffusion-based SR methods, we wrap the iterative diffusion process as a Trajectory Consistency (TC) loss, which enables comparable reconstructed texture quality of the generative model in SpatialSR within a single step. Extensive experiments demonstrate that the proposed SpatialSR achieves state-of-the-art (SOTA) performance on commonly used RSISR and downstream (image classification and segmentation tasks) datasets.
Read the full abstract
Computer Vision
MICRO: A Surgery-Phase Retinal Image Rigid Registration Benchmark and One-Step Frequency-Structure Similarity Registration Learning
Precise multimodal retinal image rigid registration (MRIRG) is essential for aligning cross-modal vessel structures, offering critical guidance for ophthalmic surgery. Despite its significance, the advancement of MRIRG is hindered by the lack of publicly available multimodal retinal image rigid registration datasets spanning various ophthalmic surgery phases (e.g., preoperative, intraoperative, and postoperative). To address this issue, we introduce the MICRO dataset, a large-scale MRIRG benchmark, comprising 1,365 cross-modal retinal image pairs with standardized annotations across all ophthalmic surgery phases. Moreover, existing deep registration methods achieve competitive MRIRG results via a two-step segmentation-then-detection framework, but segmentation quality heavily constrains their performance. We argue that this dependency stems from an implicit need for keypoint topology constraints, which have not been exploited for MRIRG through a one-step registration framework. Inspired by the above analysis, we propose a novel One-step Frequency-Structure Similarity Registration (OFS2Reg) learning framework for MRIRG that leverages the potential of cross-modal vessel structure similarities to construct keypoint topology constraints under a shared detection network. To be specific, OFS2Reg applies a well-designed frequency-guided structure preservation descriptor to construct coarse keypoint topology constraints in descriptors by highlighting significant vessel structures. Additionally, we develop a new cross-modal vessel structure similarity learning method that refines cross-modal keypoint topology constraints to precisely align pixel-level cross-modal vessel structures by leveraging cross-modal vessel structure similarity priors.
Read the full abstract
Information Theory
Cyclically covering subspaces and additive perfect codes
Let $h_q(n)$ be the largest codimension of a subspace of $\mathbb{F}_q^n$ whose cyclic shifts cover the whole space. For $r>0$, we characterize the inequality $h_q(n)\ge r$ in terms of cyclic $\mathbb{F}_q$-linear codes over vector alphabets with covering radius one, no nonzero word of block weight one, and a scalar dual generated by the shifts of one word. For $k,m\ge2$, let $I_q(j)$ count the monic irreducible polynomials of degree $j$ over $\mathbb{F}_q$. If $k$ is prime or $m\ge2\sum_{j=1}^{k-1}I_q(j)+2$, we prove that a cyclic $\mathbb{F}_q$ linear perfect code of length $\frac{q^{km}-1}{q^k-1}$ over $\mathbb{F}_q^k$ exists if and only if $\gcd(m,q-1)=1$. When this condition holds, we also obtain \(h_q\!\left(\frac{q^{km}-1}{q^k-1}\right)=k(m-1).\) Restriction of scalars gives the same criterion for every $m\ge2$ when $q$ is odd, $q+1$ is a power of two, and $k=2p$ with $p$ prime. We also show that $h_q(q^k+1)=k$ exactly when $q$ is even, for every $k\ge1$.
Read the full abstract
Systems and Control
Proportional Neuro-Impulsive Control of SISO LTI Systems
This paper explores a controller that is at the crossroads of neuromorphic, i.e., spike-based, and impulsive control systems. The controller consists of a single integrate-and-fire-like neuron that generates an input proportional to the system output when the neuron variable reaches a threshold. We prove that any static output-feedback stabilizable single-input single-output (SISO) linear time-invariant (LTI) plant can be made semi-globally asymptotically stable (sGAS) in closed loop with the proposed neuro-impulsive controller. This improves on existing fixed-amplitude neuromorphic controllers, which only achieve practical stability, but at the price of using graded spiking inputs. Moreover, we provide an algorithm for choosing appropriate controller parameters given a set of admissible initial conditions. A numerical example of an inverted pendulum linearized around its upright equilibrium illustrates the method.