Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Wednesday 9 September

Data Structures and Algorithms

Minimum-makespan completion and vertex selection leave the Wang-Sitters constant at 11/6

Wang and Sitters' rounding scheme for graph balancing (each job allowed on at most two machines) keeps the makespan, the busiest machine's load, within 11/6 of the optimum, and a companion note shows that no smaller constant holds. One suspected cause is Step 3's freedom to match leftover jobs to slots in any valid way. We show that removing that freedom does not improve the constant. An idealized oracle that always picks the valid matching with the smallest makespan still has worst-case constant exactly 11/6 against the optimum. Both natural 7/4 bounds for it, against the relaxation's target and against the optimum, are false. Requiring Step 1 to return a vertex (corner) of the relaxation does not help when that vertex is chosen adversarially. The loss therefore does not come from Step 3's freedom alone. We also prove a reduction confining every overload above 7/4 to two shapes, give a seven-machine instance on which the natural two-phase repair fails, and prove a strict 7/4 bound on the generalized three-path family.
Read the full abstract

2609.10004 · 9 Sep · 52 pages, 11 figures. v2: new results: where the cut-term bound 3/2+1/(r+1) is attained on the three-path family (correcting v1), and strong NP-completeness of completing a supplied fractional solution with two slots per machine (polynomial with one); corrects two complexity remarks and smaller misstatements. Companion to arXiv:2609.03890. Code and data: https://doi.org/10.17605/OSF.IO/SKX86

Combinatorics

An Improved Upper Bound for the Turán Number of the Hexagon

For a graph $F$, the Turán number $\operatorname{ex}(n,F)$ is the maximum number of edges in an $n$-vertex graph containing no copy of $F$. Determining the Turán numbers of even cycles is a central problem in extremal graph theory and remains open in general. For $C_6$, the best previous upper bound was due to Füredi, Naor, and Verstraëte [Advances in Mathematics, 2006], who proved that, for sufficiently large positive integer $n$, $$ \operatorname{ex}(n,C_6) \leq \lambda n^{4/3}+O(n)<0.6272 n^{4/3}, $$ where $\lambda$ is the real root of $ 16\lambda^3-4\lambda^2+\lambda-3=0$. We improve this bound by showing that, for sufficiently large positive integer $n$, $$ \operatorname{ex}(n,C_6) \leq \alpha n^{4/3}+O(n)<0.6144 n^{4/3}, $$ where $\alpha$ is the unique real root of $ 4 \alpha^{3} (3/2)^{1-1/(2\alpha)} =1$ in the interval $(1/2,2/3)$.
Read the full abstract

All authors Sandip Das, Sk Samim Islam, Aashirwad Mohapatra, Saumya Sen

Computer Vision

What Makes Adversarial Examples Transfer Across Deepfake Detectors?

Deepfake detectors remain vulnerable to transfer-based black-box attacks, in which adversarial examples are generated on a source surrogate model and transferred to a target model, unknown to the attacker. Yet how source–target compatibility shapes attack success remains poorly understood. Prior studies evaluate limited detector pools and rarely disentangle architectural from training factors. We conduct a controlled evaluation of adversarial transferability across 60 detectors spanning six backbones, two pretraining regimes, and five training-data configurations, using two attack procedures: AutoAttack (AA) and the Carlini–Wagner attack with Expectation over Transformation (CW–EOT). Matched comparisons reveal significantly higher transfer when source and target share an exact backbone, architecture family, pretraining regime, or training data. This compatibility structure is attack-dependent: exact backbone compatibility has the largest effect under AA, whereas shared pretraining and training data have the largest effects under CW–EOT. When transfer is averaged across non-target sources, mean attack success rate (ASR) is $7.21\%$ under AA and $19.52\%$ under CW–EOT. By contrast, a multi-source oracle combining both attacks attains a \(64.48\%\) mean ASR after excluding exact backbone and training-data matches, showing that source averaging can substantially understate target vulnerability. We release 240,000 adversarially perturbed images, complete pairwise transfer results, detector configurations, and evaluation code. These findings establish source–target compatibility and source-model selection as central dimensions of credible transfer-based black-box robustness evaluation.
Read the full abstract

Computer Vision

From Few-Shot Segmentation to Clinician-in-the-Loop Medical Image Analysis

Few-shot medical image segmentation (FSMIS) seeks to delineate unseen structures from a small support set, but its standard formulation fixes task-defining evidence before inference. This assumption is fragile under acquisition shift, atypical pathology, ambiguous boundaries, and poor image quality. Adding clinician interaction and rapid adaptation is not sufficient: the binding constraint is deciding when asking or changing is warranted. We therefore reframe FSMIS as a three-layer sequential decision problem. First, decidable self-assessment separates errors that a bounded intervention can repair from those that no admissible intervention can reach. We formalize this distinction through a correctable set defined by the update operator and remaining interaction budget. Second, selective interaction allocates a distinct expert-attention budget by response-conditioned net expected value of information, yielding explicit accept, query, and defer actions. Third, bounded adaptation emphasizes reversibility and independent safety reassessment rather than speed. A complementary cross-case memory stores reproducible correction priors over failure modes instead of disease-specific mask priors. This structure links sparse support representation, cross-domain robustness, multi-level risk estimation, clinician feedback, and governed experience transfer. We state six hypotheses with an explicit dependency order and propose a minimal pilot that can falsify the foundational self-assessment claim before a clinician study. The central claim is not that interaction resolves domain shift, but that scarce expert attention should be used only when a bounded intervention is expected to reach a clinically better outcome.
Read the full abstract

Numerical Analysis

Convergence of a single-ensemble multilevel scheme for McKean-Vlasov SDEs

Numerically solving McKean-Vlasov stochastic differential equations is computationally challenging due to the compounding costs of discretizing in time and in the distribution of the solution. Multilevel ideas have been proposed to provide speed-ups. In this work, we study the multilevel Monte Carlo method proposed by Ricketson (2015) for equations whose drift and diffusion terms depend on the law of the solution $X_t$ through the expectation $E[R(X_t)]$. The scheme follows the single-ensemble paradigm, where particles interact across levels at each timestep. While cross-level feedback makes this scheme attractive in practice, the correlations it introduces have so far confined its cost-error analysis to a model problem with linear drift, deterministic diffusion, and $R$ the identity. We use additional coarse particles to enforce geometrically decaying coupling errors towards the coarser levels. This allows us to prove our main contribution, an $L^p$-error of $O(\epsilon)$ at cost $O(\epsilon^{-2-\delta})$ for any $p\ge2$ and $\delta>0$ (with a constant that grows as $\delta\to0$), assuming only global Lipschitz bounds on the drift, the diffusion, and $R$. An exploratory experiment is consistent with the derived rates and suggests that in practice the constant does not grow significantly for small $\delta$. Our methodology and proof strategy may also be useful for other single-ensemble multilevel schemes, such as multilevel ensemble Kalman filters.
Read the full abstract

Computation and Language

SalamandraTA at WMT 2026 Terminology Shared Task: Hard Examples Are Better Teachers

Terminology-aware translation asks for more than a correct translation: the output must use the exact terms a glossary prescribes. The standard recipe, fine-tuning on glossary-annotated translation pairs, hides an inefficiency: for most examples the glossary prescribes exactly what the model would have produced anyway, so they teach nothing about following a glossary. We therefore keep only the examples where the model's own translation contradicts the glossary. In a controlled study at fixed data volume, this selection alone raises term accuracy from 78.7% to 89.9%. The filtered data, built by a two-way synthetic pipeline on open models, is part of the instruction-tuning mixture of our public release SalamandraTA-7b-instruct v3.0, which, used exactly as released and wrapped in a document-level inference pipeline, forms the BSC submission to the WMT26 Terminology Shared Task Track 1. At the official WMT26 evaluation, our system achieves 94.2% term success at 74.6 chrF++, with only two of the twenty-two submissions outperforming it on both metrics. On last year's benchmark, it also surpasses our GRPO-based system, despite being trained solely with ordinary supervised fine-tuning.
Read the full abstract

Applied Physics

A Multi-Model Non-Intrusive Reduced-Order Framework for Parametric Erosion Prediction via Kinematic Cross-Moment Compression

High-fidelity Eulerian–Lagrangian simulations of solid particle erosion in curved pipes require hours of compute per operating point, preventing rapid parameter sweeps and real-time wear assessment. Existing reduced-order models (ROMs) speed up these evaluations, yet they are typically trained on a single, fixed empirical erosion formula (e.g., Oka or Finnie). Changing the material law or target hardness then requires a complete retrain of the surrogate. Here, we present a non-intrusive reduced-order framework that avoids this model-locking by approximating the underlying particle collision kinematics instead of scalar wear rates. Specifically, we project and compress 23 Eulerian boundary cross-moments ($\mathbb{E}[V_p^u \sin^v\alpha_p \cos^w\alpha_p]$) across the pipe surface. Using 372 high-fidelity CFD-DPM cases of $90^\circ$ elbows over three bend ratios ($R/D \in \{1.5, 2.0, 5.0\}$), five Reynolds numbers, five density ratios, and six particle diameters in the inertial regime ($St > 1$), we evaluate a hybrid compression scheme. Linear Proper Orthogonal Decomposition (POD) and Mode-1 tensor unfolding SVD are combined with block-wise Convolutional Autoencoders (CNN-AE) to handle both broad convective transport and localized impact craters. An anisotropic Gaussian Process Regression (GPR) surrogate maps four dimensionless $\Pi$-groups to the compressed latent space, evaluating full 2D wear topographies in roughly $2\,\mathrm{ms}$ ($R^2 > 0.99$ on primary kinematic fields). Because kinematics are decoupled from material damage laws, the resulting surrogate evaluates multiple empirical models post-hoc exactly matching Finnie and closely approximating Oka, McLaury, and Arabnejad without retraining.
Read the full abstract

Strongly Correlated Electrons

SIM-GRAPH: A universal guide to symmetric interactions

Symmetry plays a central role throughout physics, from Fourier analysis on discrete lattices to the classification of elementary particles in the standard model. In finite quantum systems, symmetries are often discrete, such as reflection and rotational symmetries. Here, we present the SIM-GRAPH method (Symmetric Ising Models - Graph Reduction And Projected Hamiltonians), which uses such symmetries to efficiently calculate ground-state observables of interacting quantum systems. By projecting all interactions onto a symmetric subset of the system, the method effectively reduces the number of sites, thus providing an exponential speedup over standard exact diagonalization. Furthermore, we introduce two extensions that broaden the applicability of the method and allow for a controlled trade-off between computational cost and accuracy.
Read the full abstract

Number Theory

Pencils of norm form equations and a conjecture of Thomas, II

We continue our studies on parametric norm forms $F_t({\bf x})$, with ${\bf x}=(x_0,x_1,\ldots,x_{d-1})$ lying in some parametric linear subvariety $W_t$ and integers $t$ sufficiently large. In a previous paper [Am-Ma-Za2] we proved some effective specialization results for integer solutions $\bf x$ of $F_t({\bf x})=1$. Here we modify our techniques to treat $F_t({\bf x})=q$ for an arbitrary integer $q$. Under mild conditions (not however including the crucial index assumption in [Am-Ma-Za2]) we show that all $\bf x$ are polynomially bounded in terms of $|q|$ and $t$. As in [Am-Ma-Za2] we use the methods of our paper[Am-Ma-Za] based on diophantine approximation techniques to bound certain heights. In particular we do not use linear forms in logarithms and indeed it seems unlikely that those can lead to such polynomial bounds, even for Thue equations in two variables with $x_2=\cdots=x_{d-1}=0$. We present an example with eight variables.
Read the full abstract

Quantum Physics

Coded Clifford Measurements for Multiqubit Magic-State Cultivation

Magic-state cultivation suppresses errors by measuring logical Clifford checks and discarding inconsistent outcomes. For an entangled resource, several measurement branches are usable, so their outcomes form a multibit classical record whose corruption can produce a logical-frame error. We show that this measurement record can be protected as a binary linear code. For any third-level Clifford-hierarchy unitary $U\in\mathcal C_3$, every parity of the branch bits can be measured by a commuting Hermitian Clifford check $C(v)=UX(v)U^\dagger$. Choosing which parities to measure therefore defines a binary code $y(a)=aG$. If the valid records have minimum distance $d$, at least $d$ readout-bit flips are required to confuse one valid branch with another, giving $P_{\rm wv}=O(q^d)$. A Plotkin bound limits the length of any binary branch record, and the Clifford schedules attain this limit: at distance four, six logical measurements suffice for $|CS\rangle$ and seven for $|CCZ\rangle$, compared with eight and twelve under independent repetition. Thus restricting the logical schedule to Clifford parities requires no additional measurements. In a native-CZZ-assisted Steane implementation, the $[6,2,4]$ CS schedule is also the unique minimum-cost distance-four solution within the compiled Clifford-check family, reducing the cultivation core by $26.6\%$ in active locations. State-vector simulations without a final ideal code-space projection further show higher acceptance and approximately half the residual error weight on the two Steane blocks. Coding the logical measurement record therefore reduces both measurement redundancy and compiled fault-tolerant overhead.
Read the full abstract

Quantum Physics

Direct Cultivation of Entangled $|CS\rangle$ Magic States

Magic-state cultivation has largely targeted single-qubit non-Clifford resources. We show that the entangled state $|CS\rangle=CS|++\rangle$ can be cultivated directly rather than synthesized from three $T$-type resources. Two commuting Hermitian Clifford involutions project onto four Pauli-frame branches, so no ideal branch is discarded, while a minimal six-bit $[6,2,4]$ record protects their history. The small-code state cannot itself be certified: late two-fault patterns evade its record, placing the certified boundary after surface-code growth. Under a fixed decoder that sees 136 operational detector bits per patch and withholds 168, exact audits find no accepted closed-boundary logical failure through fault order two, while order-three mechanisms exist. Escaping from the small code directly into a distance-3 patch and growing it to distance 13 in a single round keeps this certificate. Compared with a re-decoded three-$T$ comparator matched to the same binary logical-error target, the direct route uses $2\%$ fewer active locations at $p=5\times10^{-4}$ and $16$–$28\%$ more at $8\times10^{-4}$–$10^{-3}$, without charging the comparator for $T$-state storage. Counted in qubit-ticks under one rule for both routes, it uses $21$–$39\%$ less spacetime. Adding idle-memory noise to both routes under one rule and one optimized schedule raises the direct route's cost more, to $8\%$ and $46\%$ above the comparator at $5\times10^{-4}$ and $10^{-3}$, because that cost is limited by acceptance. The result is architectural: an entangled non-Clifford state can itself be cultivated with a certified output interface.
Read the full abstract

Systems and Control

Review on State-of-the-art Energy Systems in the Arctic

The Arctic regions remain heavily dependent on fossil fuels for energy generation. At the same time, the Arctic is warming at a rate considerably faster than the global average, increasing the need for low-carbon and climate-resilient energy systems. This review documents the current energy systems and assesses state-of-the-art energy solutions applicable to Arctic and cold-climate regions, as well as the future direction of these emerging energy systems, and analyses the role of energy storage, heating requirements, and advanced energy solutions. A total of 88 research articles were systematically reviewed. The reviewed studies indicate the potential for wind and solar to reduce dependence on fossil-fuel based energy generation. For energy storage, the reviewed solutions include hydrogen for long-term storage, battery-based system for short-term storage and regulation, and thermal storage using boreholes to meet heating demand. Where a fully renewable system cannot provide the required reliability, diesel can serve as back up generation. Some barriers to widespread adoption are technological, such as the need for specialized planning tools and equipment resilient to harsh weather, and social and institutional, such as the need for governmental support, subsidies, and appropriate legal frameworks.
Read the full abstract

General Relativity and Quantum Cosmology

Critical Scalarization for a Self-Gravitating Bosonic Condensate

We establish a minimal nonrelativistic realization of scalarization in a self-gravitating bosonic condensate coupled to a scalar response field. A local effective-mass shift and nonlinear saturation generate a multibranch structure with two distinct transition routes. In the linearly stable regime, a finite perturbation drives a first-order transition with type-I logarithmic scaling near threshold. Beyond the linear onset, small perturbations grow tachyonically, and the response time controls both the growth and the subsequent breathing dynamics. These results identify a common mechanism for scalarization across relativistic compact objects and nonrelativistic condensates, and point toward laboratory analogues in coherent media.
Read the full abstract

All authors Meng-Yun Lai, Hyat Huang, Wen-Cong Gan, De-Cheng Zou, Yun Soo Myung

Chemical Physics

Analytic Gradients and Nonadiabatic Couplings for Device-Resident DMRG-QD-NEVPT2 Through Conical Intersections on a Consumer GPU

Nonadiabatic dynamics through a conical intersection requires both static and dynamic correlation and, at every geometry, an excited-state gradient and interstate nonadiabatic coupling (NACME). Analytic multireference derivatives at this level have been confined to datacenter-scale hardware. We report device-resident \mbox{DMRG-QD-NEVPT2} with analytic gradients and NACMEs within the $8$\,GB of a consumer GPU: a density-matrix-renormalization-group (DMRG) active-space reference supplies the static correlation, and quasi-degenerate SC-NEVPT2 dresses it through a multi-state effective Hamiltonian that remains valid through a conical intersection, where single-state perturbation theory develops a vanishing denominator and fails. Every gradient and NACME is one reverse-mode transpose of a single contraction graph: the DMRG sweep enters as a gauge-free differentiable node, and all two-electron work is AO-direct through Cholesky factors. The DMRG reference is exact within the active space ($\sim\!10^{-15}$\,Ha). The corrected adiabats close smoothly to a real $S_0/S_1$ conical intersection with a non-vanishing, $1/\Delta E$-divergent NACME—where linear-response TDDFT returns zero identically—and the dressing restores the differential dynamic correlation that ionic $\pi\pi^*$ states require. DMRG-NEVPT2 and quasi-degenerate NEVPT2 are each established; what is new is the combined stack—multi-state and through a conical intersection, with analytic gradients and couplings—realized device-resident on commodity hardware.
Read the full abstract

Computation and Language

Stable Answers, Unfinished Reasoning: Why Self-Consensus Is Not a Safe Early-Exit Signal

A natural way to cut reasoning-model inference cost is to repeatedly probe a single partial trajectory for its current answer and stop once probes agree – self-consensus. We ask whether any such rule is both safe and token-saving, and whether one can be selected once and reused. A preregistered sweep of 3,520 consensus rules, replayed on frozen trajectories from two models and three benchmarks, clears none of three acceptance gates fixed in advance; the frontier reproduces on a held-out split and on two unseen models – while a boundary-confidence control (DEER) swept through the same pipeline clears all three. The reason lies in the signal: agreement establishes that the current answer persists under a fixed probing procedure, not that the reasoning has terminated – a consensus-termination gap. Stopping on it commits non-terminal answers. At a rule still saving 32% of the tokens, one stop in nine fires on an answer the trajectory itself later abandons, and most of those stops cut off a correction it would otherwise have made. Widening the agreement window does not remove them: the share levels off near 7%, and by then the saving has fallen to 8%. Probe re-wording and a hand-labelled error taxonomy show the agreed answer is often a placeholder the model had not settled on. Used on its own as the stop signal, agreement fails not because it is insufficiently strict, but because it repeatedly measures the wrong object.
Read the full abstract

Statistical Mechanics

Efficient protocol for the Markovian Mpemba effect in $N$-level systems

The Mpemba effect is an anomalous phenomenon in which the time to thermalize does not depend monotonically on the distance from equilibrium, allowing systems with an initially larger temperature difference to thermalize before those with a smaller one. The rarity of the effect makes it hard to find parameters that produce it, complicating the design of experiments and the development of applications. Here, we find necessary and sufficient conditions for the Markovian Mpemba effect in three-level systems and explain its underlying physical mechanisms. Based on our understanding of the three-level case, we develop an efficient algorithm to determine the parameters for the effect in $N$-level systems. This protocol could open the door for the realization of Mpemba experiments and related applications in large systems.
Read the full abstract

Software Engineering

Beyond Repository Boundaries: Cross-Repository Graph Retrieval for Code Generation

Repository-level code generation requires generated code to be compatible not only with the target repository but also with its dependency environment. Existing retrieval-based methods mainly retrieve context from the local repository, leaving external API usage dependent on the model's pretrained knowledge, which can be insufficient for unseen or version-specific APIs. Moreover, current retrieval strategies largely focus on one-hop evidence and overlook the structural relationships among code components. We propose CrossCoder, a cross-repository code generation framework that explicitly incorporates external libraries into the retrieval context through a unified knowledge graph over repository and library entities. CrossCoder identifies important nodes via planning and semantic retrieval, then selectively expands neighboring nodes to retrieve richer multi-hop contextual evidence for generation. To further evaluate dependency-version compatibility, we introduce VersionExec, an execution-based benchmark derived from BigCodeBench that evaluates generation under different dependency versions. Experimental results on RepoExec, DevEval, and VersionExec demonstrate that CrossCoder consistently improves both functional correctness (up to 6.3% on pass@1) and robustness to dependency-version changes.
Read the full abstract

All authors Minh Le-Anh, Nam Le Hai, Quyen Tran, Anh Nguyen Hoang, Linh Ngo Van, Bach Le, Nghi D. Q. Bui

Data Structures and Algorithms

A Sharp Barrier of Consistent Submodular Maximization: Any Improvement over $2-\sqrt{2}$ Entails Exponential Queries or Linear Recourse

Consistent submodular maximization aims to maintain a high-utility subset of size at most $k$ as new elements arrive one by one, while changing only a limited number of elements per update. Previously, [DFL+25](STOC '25) established an information-theoretic bound of $2/3$ and gave the first polynomial-time randomized algorithm with a $0.51$-approximation guarantee. However, a fundamental question remained open: Is it possible to design an efficient algorithm for consistent submodular maximization that matches the classical offline $(1-1/e)$-approximation? In this paper, we answer this question in the negative by proving that the sharp approximation threshold achievable with polynomially many value queries and worst-case constant recourse is \[\beta:=2-\sqrt{2}\approx0.5858<1-1/e.\] Specifically, we develop an improved poly-time randomized algorithm, which can attain a $(\beta-\varepsilon)$-approximation in expectation at each fixed time with $O(\varepsilon^{-2})$ worst-case recourse. The cornerstone of this algorithm is a novel anchored sampling scheme, which uses only value queries on subsets of the elements seen so far to construct a solution that remains competitive under unknown future arrivals. Conversely, we establish a matching lower bound by showing that any fixed improvement over $\beta$ requires either exponentially many value queries or $\Omega(k)$ changes per update. Furthermore, we characterize the impact of curvature by establishing a sharp threshold of $1-(\sqrt{2}-1)\vartheta$ for consistent submodular maximization, where $\vartheta\in[0,1]$ denotes the total curvature. Surprisingly, for weighted coverage objectives, we devise a poly-time randomized algorithm that can match the optimal $(1-1/e-\varepsilon)$-approximation with $O(\varepsilon^{-1})$ worst-case recourse, thereby separating coverage maximization from general submodular maximization in the consistent settings.
Read the full abstract

Computation and Language

VLX-VR: An Agentic-Aware Video Reasoning Model

Real-world video understanding requires integrating visual, audio, textual, and temporal evidence distributed across a video. Yet many pipelines use a fixed video context and single-pass inference, limiting adaptive evidence acquisition when observations are incomplete, ambiguous, or conflicting. We present VLX-VR, an agentic-aware video reasoning model trained within a video reasoning framework defined by a Think–Memory–Observation loop. At each step, VLX-VR determines the needed evidence, invokes read_memory or write_memory, incorporates the returned Observation, and decides whether to continue or produce the task output. We train VLX-VR with multimodal data, including videos and agent trajectories, using reinforcement learning to learn evidence acquisition, memory use, and termination. On MINERVA, VLX-VR achieves state-of-the-art performance among the models included in our comparison, with 78.79% accuracy. Under the original three duration groups, its accuracies are 76.70%, 78.73%, and 80.92%, with a cross-duration accuracy variance of 2.97~$\mathrm{pp}^2$. On correctly answered samples, 96.20% of VLX-VR's reasoning traces are consistent with the MINERVA reference reasoning traces and the evidence described by them, while approximately 75.80% of all evaluated samples satisfy both answer correctness and this evidence-grounded trace criterion. These results show strong performance and broadly stable behavior across durations, while counting, state changes, causal reasoning, and spatial perception remain challenging.
Read the full abstract

All authors Sheng Li, Peng Liu, Qianqian Zhang, Tiancheng Zhao

Computation and Language

Multi-Functional Embedding Models for Funder Name Disambiguation in Scientific Publication Records

Understanding the historical allocation and distribution of research funding advances our knowledge of how scientific research is supported across fields, institutions, and regions. However, large-scale analyses are hindered by the lack of comprehensive funder name disambiguation solutions, as funder names often exhibit spelling variations, translations, abbreviations, and inconsistent levels of granularity. In this paper, we present a framework for developing multilingual, multi-functional funder name disambiguation models and demonstrate its application to research publications in biodiversity conservation. To construct a training dataset, we integrated the Research Organization Registry (ROR), which provides unique identifiers for research organizations, with two publication datasets: the Web of Science (WoS) and the Crossref Open Funder Registry (OFR). We used multi-task learning with Contrastive Loss and Multiple Negatives Ranking Loss to fine-tune three open-weight embedding models from the Sentence Transformer, Gemma, and Qwen3 families. The best-performing models achieved accuracy above 0.90 when matching WoS funder names to ROR identifiers, outperforming general-purpose LLMs, including GPT-5.2, Claude-Sonnet-4.6, and Gemini-2.5-Flash, by more than 0.1. For funder names not indexed in ROR, we constructed a similarity network among funder names and identified clusters within it. Finally, we analyzed the disambiguation results and highlighted challenges arising from limited knowledge of smaller funders and funders from non-English-speaking countries. This work provides a reusable framework for funder name disambiguation with potential applicability across different model architectures and datasets, featuring cost-effective training data creation and multi-task learning and disambiguation.
Read the full abstract

All authors Kanyao Han, Zhiwen You, Jinseok Kim, Jana Diesner

Cryptography and Security

Dependency-Aware ROM/CBD Correctness Bounds for ML-KEM-768 at the Heuristic Failure Scale

We certify an honest-decapsulation failure upper bound for ML-KEM-768 in an explicit random-function/centered-binomial (ROM/CBD) abstraction. Domain-separated public-matrix streams are modeled as independent uniform ring elements and secret/noise polynomials as independent CBD2 primitives; this is not an information-theoretic statement about the fixed SHAKE instantiation of FIPS 203. Recent formal assessments identify rigorous justification of ML-KEM's heuristic decapsulation-failure scale as an open problem; within the explicit ROM/CBD abstraction studied here, we obtain a dependency-preserving certified upper bound at that scale. The analysis preserves dependencies induced by the public matrix and by both ciphertext-compression terms. Its terminal chain has three components: an exact graph-coupled full-ideal reference for the joint c_u/c_v residual; a proper-ideal bivariate Fourier transport whose rare |T|>=3 branch is closed by an exhaustive three-factor anti-concentration replay; and exact bit-specific FIPS decoding events followed only by a 256-coordinate union bound. A formal partial-Fourier lemma makes the spectral-to-total-variation step explicit. The reduced rational certificate satisfies Pr[K' != K] <= P_* <= 2^-164.81, with -log2(P_*) = 164.810716201343121.... The 164.81 threshold is exact but numerically tight: the certified exponent exceeds it by only about 0.0007162 bit, and 164.82 is not certified. The result is an upper bound for an arbitrary message fixed independently of the public and secret randomness, under honest encryption and decapsulation. It is not an exact DFR, not a fixed-SHAKE equivalence theorem, not a new IND-CCA reduction, and not an adaptive delta-correctness result.
Read the full abstract

Optimization and Control

Boundary approximate controllability of some linear parabolic systems

This paper focuses on the boundary approximate controllability of two classes of linear parabolic systems, namely a system of $n$ heat equations coupled through constant terms and a $2 \times 2$ cascade system coupled by means of a first order partial differential operator with space-dependent coefficients. For each system we prove a sufficient condition in any space dimension and we show that this condition turns out to be also necessary in one dimension with only one control. For the system of coupled heat equations we also study the problem on rectangle, and we give characterizations depending on the position of the control domain. Finally, we exhibit a cascade system for which the distributed controllability holds whereas the boundary controllability does not. The method relies on a general characterization due to H.O. Fattorini.
Read the full abstract

Machine Learning (Statistics)

Optimal Value Inference for Reinforcement Learning

We study offline inference for the optimal value in reinforcement learning under finite state and action spaces. Two new nuisances are derived as fixed points of a self-induced Bellman equation, in which we approximate the maximum Bellman operator by its softmax correspondence. We propose a debiased estimator through the Neyman orthogonality and establish its asymptotic normality under diverging horizons even when the behavior policy changes with time, as long as the nuisances have the statistical rates that can be achieved by many machine learning methods. We provide a concrete estimating procedure for these nuisances and show they can lead to valid inference. Synthetic experiments validate the numerical performance of our inference method, and we implement it in real-life decision-making problems, including bike repositioning and AI agentic tool use.
Read the full abstract

All authors Nan Lu, Ethan Lee, Ruicheng Ao, David Simchi-Levi, Junwei Lu

Quantum Physics

Fidelity-Aware Scheduling of Quantum Circuits on Multi-QPU Systems

High Performance Computing-Quantum Computing (HPCQC) platforms expose multiple Quantum Processing Units (QPUs) that may differ in size, topology, native gates, and noise characteristics. For current noisy devices, errors compound along the compiled circuits quickly, and minimizing them, that is, maximizing the circuits' execution fidelity, is essential for reliable results. Fidelity depends on the compilation to a specific target device: the same high-level circuit may produce different executables and, therefore, different expected fidelities across QPUs. We present a low-overhead fidelity-aware scheduling framework for multi-QPU systems based on a Graph Neural Network (GNN) that estimates, before compilation, the expected fidelity of each circuit on each available QPU. Then, a tunable scheduler uses these estimates to control the trade-off between execution fidelity and parallelism. Results show that this framework allows for approximating an exhaustive fidelity-based assignment, saving computational resources compared to a brute-force approach that compiles each circuit on every device.
Read the full abstract

All authors Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto, Patrick Hopf, Deborah Volpe, Helmut Seidl, Giovanna Turvani, Robert Wille, Christian B. Mendl, Martin Schulz

Molecular Networks

Thermodynamic and Statistical Signatures of Modality Changes in Concentration Distributions Driven by Stochastic Switching Between Two Activity States

Stochastic switching between gene expression states, coupled with production and degradation dynamics, governs the accumulation of mRNA and proteins in cells. The concentrations of these accumulated entities dictate the phenotypic distribution of genetically identical cells. The underlying accumulation dynamics are well-captured by a two-state promoter switching model, with statistical and thermodynamic properties quantified via the Fano factor and entropy production rates. However, how these measures correlate with concentration distributions and their shifts under varying kinetic parameters remains largely unexplored. To this end, we use chemical master equations to study a generalized model of mRNA accumulation dynamics in the presence of stochastic switching between two activity states and state-dependent production and degradation rates. We derive exact expressions for the steady-state probability distribution and analytically compute the mean concentration, Fano factor, and entropy production rate (EPR). Simplifying these expressions, we identify contributions arising from stochastic switching rates and relaxation dynamics toward equilibrium in each activity state. Next, using our theoretical results, we characterize the variation in the Fano factor and EPR as a function of mean expression during modality changes of the distributions mediated by the variation of switching rates. We also identify the conditions in kinetic parameters that achieve the highest Fano factor and entropy production rates. Our findings establish a generalized framework for examining stochastic accumulation dynamics, clarifying how kinetic parameters dictate molecular distributions, noise, and dissipation. These insights extend readily to broader contexts coupling stochastic switching with accumulation, including protein burst dynamics, phenotype-switching-mediated drug intake, and queuing theory.
Read the full abstract

Databases

Few Rows Tell Them Apart: Equivalence of Queries Mixing Set and Bag Semantics

Bounded SQL equivalence checkers search for a counter-example database of bounded size, and a search that comes back empty proves nothing. We supply missing theory: computable bounds $B$ such that agreement on all databases with at most $B$ tuples per relation implies equivalence. We work in the combined-semantics framework, which captures SQL's mix of duplicate-eliminating (DISTINCT) and duplicate-preserving computation over set-valued relations. For conjunctive queries we prove a bound linear in the query size for fixed multiset width: inequivalent queries already disagree on a database with at most $2^w |Q|$ tuples, where the width $w$ counts only the columns the queries actually read, independently of the total number of multiset variables. Declared keys shrink the bound to $2^{kw} |Q|$ for the smaller key-width $kw$, acyclic foreign keys leave it unchanged, and the result extends to several classes of queries with comparisons, for which equivalence had not previously been characterized. For these fragments, bounded search becomes a terminating, complete decision procedure.
Read the full abstract

Quantum Physics

From Block-encoding to Generalized Quantum Signal Processing: Principles, Algorithms and Applications

Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.
Read the full abstract

All authors Tal Gurfinkel, Kaushika De Silva, Anuradha Mahasinghe, Jens Renders, Jack Blyth, James Greenwell, Archie Butterworth, Yusen Wu, Lyle Noakes, Miloud Bessafi, Frederic Cadet, Jingbo Wang

Algebraic Geometry

Automorphism groups and Homogeneous fibrations on projective varieties with nef anticanonical divisors

We explore the homogeneous structures of Albanese morphisms and maximal rationally chain-connected fibrations of algebraic varieties with nef anticanonical divisors. Furthermore, we show that there exists a natural group homomorphism associated with a maximal rationally chain-connected fibration, which induces the Chevalley decomposition of $\operatorname{Aut}^0$ up to an isogeny. This result is analogous to a similar theorem of Nishi and Matsumura for Albanese morphisms. In addition, we reprove Nishi and Matsumura's theorem using the modern language of algebraic geometry.
Read the full abstract

Software Engineering

Socio-technical and Ethical Dimensions of Architecture Practices in FLOSS

This project investigates how software architecture practices in Free/Libre Open Source Software (FLOSS) are shaped by socio-technical and ethical factors, and how education can support more explicit, inclusive, and reflective architectural work. Motivated by FLOSS's role in digital sovereignty, it is observed that architectural decisions are often undocumented and scattered across issues, pull requests, and mailing lists. While prior research has studied architectural artifacts, erosion, and communication, the interplay between architectural work, governance arrangements, and ethical commitments in FLOSS remains underexplored. The research follows a three-phase design: (1) multi-method case studies of 3-4 domain-pairs of architecturally non-trivial FLOSS projects, (2) framework and intervention design with practitioners and educators, and (3) pilot evaluations in projects and courses. It will produce (i) cross-case empirical evidence on FLOSS architecture practices, (ii) a conceptual framework linking architecture practices to socio-technical conditions and ethical dimensions, and (iii) lightweight practices and teaching formats that render architectural work more explicit and inclusive.
Read the full abstract