Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 3 September
We study the long-term distributional dynamics and small-noise asymptotics of two-dimensional nonautonomous stochastic primitive equations driven by Gaussian and multiplicative Lévy noise, together with moderate deviations for the purely jump model. For sufficiently small noise, uniform moment bounds and an exponentially weighted terminal estimate yield a pullback absorbing family and tightness, while a lower semicontinuous vertical-moment functional preserves admissibility under weak limits. We prove the existence and uniqueness of a pullback measure attractor in the weak topology of probability measures and establish its upper semicontinuity as both noise components vanish. For the jump-driven equation, we establish a moderate deviation principle in $\mathcal D([0,T];H)\cap L^2(0,T;V)$ with speed $a^2(\epsilon)/\epsilon$. The proof combines continuity of the skeleton map with controlled stochastic convergence based on entropy bounds, truncation, martingale estimates, and direct vertical estimates, avoiding Lipschitz continuity of the vertical derivative of the jump coefficient.
Cryptography and Security
Rent-a-RAG: Embedding-Space Watermarks for Auditing Third-Party RAG
Third-party retrieval-augmented generation (RAG) marketplaces create a new auditing problem: data providers may license corpora to a RAG operator, yet later have no visibility into whether their documents are being reused without compensation. Auditing this misuse is difficult because the operator is non-cooperative, answers are paraphrased by the generator, and one response may combine evidence from many providers. We propose DirBucket, a provider-side semantic watermarking and black-box auditing framework for document-level reuse in multi-provider RAG. DirBucket watermarks documents by meaning-preserving paraphrases whose embeddings are biased toward provider-bucket secret directions, enabling detection from black-box answers while preserving retrieval utility. On a challenging benchmark that reflects mixed-provider reuse under black-box access, DirBucket is the only method that consistently achieves strong target detection with no non-target activation, detecting non-compliance in every audit within 23 audited answers on our primary benchmark. The watermark survives adversarial post-answer laundering, and none of the evaluated evasion strategies simultaneously defeats detection while preserving user-perceived answer quality. Detection transfers unchanged to a second benchmark built from real clinical, cyber-threat-intelligence, and legal provider corpora. These results suggest that embedding-space watermarking can make document reuse in third-party RAG statistically auditable.
Read the full abstract
Quantum Physics
Thermodynamic Irreversibility from Inaccessible Endogenous Quantum Histories
Microscopic unitary dynamics preserves all fine information, yet an isolated finite system can show a robust thermodynamic window in which the entropy associated with a restricted record rises. We ask why information hidden from the current record usually fails to rebuild a low-entropy macrostate. For a fixed projective record, every finite step separates exactly into the evolution predicted from the record alone and an exact correction carried by unresolved microscopic structure. The record-only contribution starts only at second order in time, so all instantaneous change of the record comes from hidden currents between macrostates. We derive the exact entropy rate, separate entropy-spreading from return-oriented currents, and resolve those currents into energy-gap amplitudes. Transitions with the same gap add coherently, revealing how the Hamiltonian and the microscopic state organize hidden information for return. In interacting mixing dynamics the current power is spread over many frequencies; free and deliberately commensurate controls progressively concentrate it, and the engineered dynamics reconstructs a low-entropy macrostate. An independent distribution-level test separates hidden dynamical activity from finite-step return, and an exact classical measure-preserving counterpart shows which parts of the construction are not uniquely quantum. Within the specified record and observation window, irreversibility is therefore not loss of microscopic information, but the failure of that information to organize currents that restore macroscopic order.
Read the full abstract
Signal Processing
Closing the Semantic-Edge Gap: Tiny Language Models for 6G Wireless Intelligence
Sixth-generation (6G) wireless networks are envisioned as AI-native systems in which semantic communication - transmitting task-relevant meaning rather than raw bits - moves beyond Shannon's classical bit-pipe model. Large language models (LLMs) dominate semantic encoding but are unsuitable for 6G user equipment and IoT devices, given prohibitive memory, energy, and latency costs. Tiny language models (TinyLMs) - compressed via TinyML techniques into kilobyte-to-megabyte memory and milliwatt power budgets - are the missing bridge between LLM-level semantic encoding and 6G edge hardware, yet no prior work systematically maps TinyML techniques onto semantic communication architectures for this purpose. This survey closes that gap through a two-axis taxonomy connecting six compression families (quantization, pruning, knowledge distillation, low-rank adaptation, neural architecture search, hybrid pipelines) to five semantic communication architectures (end-to-end joint source-channel coding, split learning, federated learning, knowledge-graph-assisted, and multi-task/cross-modal communication), synthesized with a quantitative meta-analysis of the model-size-versus-semantic-fidelity Pareto frontier. Representative results include a CNN-Transformer encoder achieving 22 dB PSNR at 33.33% semantic-representation size reduction; a symbolic protocol machine reducing a neural MAC protocol from 4.55 MB to 1 KB (99.98% smaller) with zero performance loss; federated bidirectional knowledge distillation converging under joint model-and-data heterogeneity where FedAvg-style averaging underperforms; and knowledge-graph-assisted probability graphs cutting transmission energy by 65%. The survey identifies nine open research challenges for TinyLM-enabled 6G semantic communication, including two not previously articulated in the literature.
Read the full abstract
Representation Theory
Universal Plücker positivity and the Octopus inequality
We prove a positivity theorem for the universal Plücker coordinates of Karp and Purbhoo when exactly one parameter is negative, with a sharp uniform threshold governed by the largest Plancherel up-transition probability. At the critical specialisation, positivity of the normalised $(2,2)$-coordinate is equivalent to the Octopus inequality, the main technical tool in the proof of Aldous's spectral gap conjecture. By connecting the inequality with Schubert calculus, this answers questions raised by Caputo and Aldous. For a Wronskian with distinct real zeros, we determine the maximal common half-line on which all branching-balanced coordinates are positive semidefinite. We also give Plücker-theoretic proofs of two hypergraph inequalities of Alon, Kozma, and Puder.
Read the full abstract
Information Theory
A Quantization Problem Posed by Adaptive Streaming
In adaptive bitrate (ABR) streaming, the delivery technology behind most Internet video, each title is encoded at several bitrates, forming an encoding ladder of renditions. Each client plays the highest rendition that its network bandwidth can sustain. We show that choosing the ladder is a problem of scalar quantization of the bandwidth distribution. However, this quantization problem is of an unusual kind: the client's logic pins each quantization cell's reproduction value to the cell's left edge, and the distortion measure is a one-sided quality loss rather than a squared error. The constraint reshapes the classical theory. The quality gap of a ladder is the distance between its average delivered quality and the quality limit that infinitely many renditions would attain. For optimal $n$-rendition ladders the gap $\mathcal{G}_n^*$ decays as $\Theta(1/n)$, not the textbook $\Theta(1/n^2)$. Moreover, with large $n$, $n\,\mathcal{G}_n^*\to C_w=\frac{1}{2}(\int\!\sqrt{p\,Q'}\,\,d B)^2$, with the limit attained when the ladder's rates follow the density $\sqrt{p\,Q'}$, which replaces Panter–Dite's $p^{1/3}$; here $p$ is the bandwidth density and $Q$ the quality–rate curve of the content. The law yields closed-form design rules: quantile rung placement, the rendition count $n(\varepsilon)\approx C_w/\varepsilon$ needed to reach tolerance $\varepsilon$, and the economic ladder size $n^*=\sqrt{\lambda C_w/\kappa}$ when a rendition costs $\kappa$ to operate and the quality gap is priced at $\lambda$. The same analysis extends to the design of ladders employing different video resolutions, codecs, perceptual quality metrics, and the two-dimensional adaptation logic of modern web players.
Read the full abstract
Mesoscale and Nanoscale Physics
Generalized s-d model for Wannier-Mott excitons in layered magnetic semiconductors
The recent discovery of excitons coupled to the magnetic order, and the consequent strong magneto-optic responses, in some van der Waals magnetic semiconductors has triggered intense activity at the interface of magnetism and semiconductor optics. Here, we present an analytically tractable minimal model that describes magnetic order, electrons, holes, and excitons within a unified framework, thereby capturing a wide range of phenomena. It treats the magnetic order and itinerant carriers to be comprised by distinct electronic orbitals that are mutually coupled via orbital-dependent onsite exchange, similar to the treatment of metallic magnets using an s-d model. Investigating CrSBr bilayer as a case study, we benchmark our model and its predictions against recent experimental and ab-initio results finding good agreement as well as new insights enabled by the model's simplicity. Examining the optical selection rules, we find the conservation of a quantum number formed from a combination of spin and layer pseudospin to be a useful guiding principle, even in noncollinear magnetic configurations. Our analysis finds a series of bright and dark excitonic states in such layered A-type antiferromagnets. The presented framework should be valuable in achieving intuitive understanding of recently discovered excitonic phenomena and guiding the discovery of other excitonic states in layered magnetic semiconductors.
Read the full abstract
Commutative Algebra
Quasi S-n-ideals in commutative semirings
Let $R$ be a commutative semiring with unity $(1\neq0)$, and let $S$ be a proper multiplicatively closed subset of $R$. In this paper, we introduce the notion of quasi $S$-$n$-ideals in commutative semirings. We the study basic property of quasi $S$-$n$-ideals and establish their relationships with quasi $n$-ideals, $S$-$n$-ideals, $S$-prime ideals, and $S$-primary ideals. We also investigate their behavior under localization. Finally, we determine quasi $S$-$n$-ideals in the quotient polynomial semiring $R[x]/\langle x^m\rangle$ and study their natural extensions via the constructions of idealization and amalgamation.
Read the full abstract
Computer Vision
KnowVis: Knowledge-Centric Visual Summarization for Video Lectures
Video lectures are valuable educational resources, but their dense and lengthy formats often overwhelm novice learners. This difficulty stems from a fundamental pedagogical mismatch: while videos deliver transient information linearly, human learning requires constructing interconnected cognitive networks, a task that induces severe cognitive overload for novice learners lacking prior domain knowledge. Existing video summarization methods fail to resolve this mismatch, as they primarily produce text-heavy, linear condensations that still demand high cognitive effort. To bridge this gap, we propose KnowVis, a framework that transforms linear video lectures into pedagogically grounded visual narratives. KnowVis first extracts a detailed concept map from multimodal video content to identify important and challenging threshold concepts, then constructs structured knowledge units, and finally synthesizes engaging visual summaries. Alongside the framework, we introduce a curated dataset of 125 educational videos across 10 academic disciplines, paired with 1,079 generated visual summaries. Extensive automated evaluations and a human study demonstrate that, compared to state-of-the-art baselines, KnowVis generates more accurate and clear visuals that successfully reduce cognitive load and significantly improve student learning effectiveness and knowledge retention.
Read the full abstract
Mathematical Finance
Bayesian Confidence Recalibration and Research-Equilibrium Criticality: Temporal Support in Robust Portfolios
Robust portfolio rules that reconstruct confidence sets after learning need not preserve the evaluator obtained by prior-by-prior Bayesian transport. In the Gaussian model, this discrepancy is summarized by natural-coordinate displacement: inherited transport preserves it whereas fresh reconstruction can replace it. We price evaluator replacement and trace the resulting optimized curvature through endogenous research. Optimized robust value represents protocol regret as a functional Bregman divergence, while a within-vintage rectangular Gaussian benchmark with constant absolute risk aversion (CARA) yields a stopped recalibration tax. In a versioned model-release economy, validated history propagates through a strictly causal network and a same-cycle share of current optimized marginal value feeds back into research supply. The capacity-constrained equilibrium reduces to a scalar equation with protocol-indexed gain \(\mathfrak g_I^P=\lambda\beta_{R,I}(W_R^P)''\). Purely causal validation cannot create a same-cycle unit mode; provenance changes criticality through optimized curvature. For a scalar primitive supplier-score shock \(z\) in direction \(h_I\) and financial outcome \(\mathcal O\), sensitivity factors as \(\omega_{\mathcal O,h,I}/(1-\mathfrak g_I^P)\). Conditional on a smooth equilibrium state and active cell, completion-time information sharply bounds this multiplier when all compatible timing laws are subcritical; no finite uniform bound exists when the timing set reaches the pole.
Read the full abstract
Computer Vision
Fill My Mirror: Geometry-Constrained Mirror Inpainting
Mirrors are common in real-world images, yet producing geometrically consistent reflections with generative models remains challenging. Unlike most objects, mirror appearance depends on scene geometry and viewpoint, making it hard to synthesize using learned appearance priors alone. We address this in the mirror inpainting setting, where the scene is fixed and only the mirror region is generated. Our key insight is that much mirror content is geometrically constrained by the visible scene and need not be hallucinated. We estimate scene geometry and project visible content into the mirror to recover reflection regions determined by geometry. A generative model then completes the mirror region via a two-mask diffusion strategy balancing geometric constraints with the model's learned priors, reducing projection artifacts and improving reflection consistency. The method is training-free and applicable to complex real-world scenes. We evaluate on MirrorBench-V2 (synthetic) and real images. Using standard and geometry-aware metrics, we show that explicitly using scene geometry improves consistency.
Read the full abstract
Differential Geometry
Rigidity and volume pinching for the sharp gradient estimate in positive Ricci curvature
Colding established a sharp gradient estimate for the Green function on manifolds with non-negative Ricci curvature, which was extended to positive Ricci curvature by Manea recently. We prove almost rigidity of such gradient estimates for positive Ricci curvature. We show that the average of the gradient deficit, namely $\fint (1-|\nabla b|^2)\,dV$, controls the volume deficit in an optimal quantitative manner; here $b$ is the distance-like function defined using the Green function. This implies a quantitative almost rigidity theorem for manifolds with $\ric\ge(n-1)g$ and a gap theorem for Einstein manifolds. We also prove a rigidity theorem for closed 4-dimensional Einstein manifolds by finding a new monotonicity formula.
Read the full abstract
Representation Theory
Enumerating cores of charged multipartitions
Granville and Ono proved that there is an $e$-core partition of $n$ for every $n\in\mathbb{N}$ if and only if $e\geq 4$, which translates to a statement about the existence of defect $0$ blocks for symmetric groups in positive characteristic and defect $0$ unipotent blocks of finite general linear groups in positive, non-defining characteristic. Motivated by analogous applications to the block theory of finite classical groups, imprimitive spetses, and cyclotomic Hecke algebras, we prove similar positivity statements about different variants of $e$-cores for charged multipartitions.
Read the full abstract
Quantum Physics
Analog quantum simulation of bosonic and anyonic models with flux-driven transmons
When quantum particles interact, many-body phenomena that are hard to simulate classically emerge. Quantum analog simulation offers an alternative in which the target system's dynamics is directly realized in controllable quantum hardware. Here, we give a general protocol for simulating the Bose-Hubbard and anyon-Hubbard models using lattices of capacitively coupled flux-tunable transmons. By modulating the transmon frequencies in an alternating pattern, we resonantly drive multiple many-body transitions and can tune the on-site interaction and density-dependent hopping amplitudes for up to three bosons per site, with no additional restriction on the total particle number. By adding phases to the modulation, which renders the transition amplitudes complex-valued, we propose the first simulation protocol for the anyon-Hubbard model with transmons. Numerical simulations of the driven transmon arrays with experimentally realistic parameters reproduce the characteristic dynamics of the target models across a range of interaction strengths and statistical phases, including the interaction-dependent localization and the statistics-dependent asymmetry of the anyonic quantum walk.
Read the full abstract
Combinatorics
The half-rate linear programming bound for binary codes is $\frac12-\frac1\pi$
In their work on sphere packing and the modular bootstrap, Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini conjectured the exact high-dimensional exponent of the Cohn-Elkies sphere-packing linear program. OpenAI's Chapter 1 subsequently proved their conjecture by establishing that both Fourier sign-uncertainty radii are $(1/\pi+o(1))\sqrt d$. We prove the binary coding analogue: \[ R_D\!\left(\frac12-\frac1\pi\right)=\frac12. \] We also formulate the two Krawtchouk sign-uncertainty problems and determine both of their asymptotics. If $A^{\mathrm K}_{\pm}(n)$ denotes the smallest radius $r$ for which a nonzero Krawtchouk $(\pm1)$-eigenfunction $f$ exists with $f(0) = 0$ and $f(x) \ge 0$ for all $|x| \ge r$, then \[ \frac{A^{\mathrm K}_{\pm}(n)}n\longrightarrow \frac12-\frac1\pi. \] The lower bound proves a mass-concentration principle similar to OpenAI's Chapter 1 for Hamming space. The upper bound, on the other hand, follows the approach of the spherical-code construction in OpenAI's Chapter 2. Gay, Jeronimo, and Liu formulated a hierarchy for binary codes analogous to the spherical-code construction and improved the best known binary coding rate bounds by evaluating the first level of the corresponding hierarchy. We prove this hierarchy bounds the Delsarte program and give a construction at arbitrarily deep levels of the hierarchy, attaining the upper bound in the limit. The construction uses an $N$-qubit generalization of the pure-state channel of Alrabiah and Guruswami.
Read the full abstract
Information Theory
TokenComSR: Task-Sensitivity-Guided Token Communication for Wireless Image Super-Resolution
For resource-constrained wireless edge devices over bandwidth-limited fading channels, wireless image transmission using traditional separate coding suffers from the cliff-effect collapse. Prevailing deep joint source-channel coding (JSCC) based on convolutional neural networks can mitigate this issue but usually fail to preserve patch-level structures, thereby preventing adaptive per-token power allocation and limiting token-domain compensation for super-resolution (SR). To address these challenges, we propose a token communication framework with SR (TokenComSR). Specifically, we conceive a task-sensitive power allocation (TSPA) module and a signal-to-noise ratio (SNR)-conditioned token refinement module (TRM). TSPA distills training estimates of task sensitivity into inference token power weights, while TRM estimates an SNR-conditioned residual to correct channel-induced distortion in the token domain before decoding. Building on TSPA and TRM, the proposed TokenComSR pairs a Swin Transformer-based token transceiver with a receiver-side SR module for resource-constrained wireless image transmission. Simulation results confirm the effectiveness of the proposed TSPA and TRM, demonstrating improvements over separate coding and JSCC-SR baselines in both reconstruction fidelity and perceptual quality.
Read the full abstract
Computation and Language
Beyond BLEU: A Case for Redefining Sign Language Translation Benchmarks
BLEU-4 is the standard metric for evaluating sign language translation (SLT), but spoken-language metrics may not adequately reflect sign language proficiency. The multimodal, low-resource context of SLT allows models to exploit spurious correlations and spoken-language priors, rather than learning stronger sign representations. In this paper, we evaluate the relationship between spatio-temporal understanding and BLEU-4 across six SLT models on Phoenix-2014T and CSL-Daily, showing that gains in BLEU-4 are not on their own evidence of better sign language understanding. This work introduces an alternative inspired by language-learning assessment, using an open-weight-LLM QA protocol that measures salient content preservation. It aligns more closely with human rankings and is six to seven times more paraphrase-invariant than BLEU-4. Applied to SLT, this protocol targets content transfer, is more robust to train-test overlap, and gives a different picture of the field: the five gloss-free systems are largely within noise of one another on Phoenix-2014T, while the gloss-supervised system stands 9.3 points higher, a gap invisible to BLEU-4.
Read the full abstract
Functional Analysis
An existence result of a functional integral equation via Darbo type theorem and an iterative algorithm to solve it
In our study, Darbo's fixed point theorem and the coupled fixed point theorem have been extended. The two theorems were generalized using $C-class$ mapping. Using the Darbo type theorem, we gave an existence result for a functional integral equation along with an appropriate illustration. In addition, we explored the numerical solution of a given functional integral problem using modified homotopy perturbation.
Read the full abstract
General Relativity and Quantum Cosmology
Not All Resonances Are Created Equal: Prioritizing Tidal Resonances in EMRIs
Tidal perturbations from nearby compact objects can drive resonant "kicks" in extreme-mass-ratio inspirals (EMRIs), imprinting potentially detectable phase shifts in LISA-band gravitational waveforms. We provide a systematic survey of these tidal resonances across EMRI parameter space in the weak-tide, three-body hierarchy, treating the perturber as stationary on the resonance timescale. For generic Kerr orbits we compute (i) resonance contours in $(p,e,x)$ that locate where each $(n,k,m)$ resonance is encountered, (ii) the associated resonance duration, and (iii) the jump amplitudes in the angular momentum $L_z$ and the Carter constant $Q$ (with $\Delta E$ vanishing by time-translation symmetry in the stationary model). Combining jump amplitudes with resonance durations, we construct a practical ranking of the resonances most relevant for waveform modeling, while emphasizing that even modest resonances may still be important through their influence on the phase at which subsequent resonances are entered. All contour and jump data are publicly available.
Read the full abstract
Differential Geometry
Weightings and Lie groupoids
This note originated with a mini-course taught at KU Leuven by the author in June 2026. We review the definition of weightings (or quasi-homogeneous structures), the weighted normal bundle, and the weighted deformation space. We emphasize the algebraic approach and functorial properties, using sheaves of ideals and the character spectrum for sheaves of algebras. We review the definition of a multiplicative weighting on a Lie groupoid $G\rightrightarrows M$, and give a self-contained proof of the three-way equivalence between (i) multiplicative weightings of $G$ along $M$, (ii) Lie filtrations of the Lie algebroid $A$ of $G$, (iii) dg weightings of the NQ manifold $A[1]$ along $M$. The corresponding weighted deformation space is a weighted variant of the tangent/adiabatic groupoid and is used in the study of hypoelliptic operators.
Read the full abstract
Theoretical Economics
Proof of Steady-State Multiplicity in Aiyagari
I provide the first analytic construction of a canonical Aiyagari economy exhibiting at least three steady states. Along the way, I provide new upper and lower bounds on the stationary capital supply for the case where the net return on saving is negative. I also give parameter restrictions that guarantee the existence of a steady state with a rental rate in the neighborhood of a remarkably simple number: the capital share times the depreciation rate.
Read the full abstract
Computer Vision
Unfold The World: Factorize 4D Properties in Reinforcing Spatial Reasoning
Despite the remarkable prowess of Vision-Language Models (VLMs) in general multimodal tasks, they remain fundamentally “flat” when reasoning about the physical world. We argue that this spatial bottleneck stems from a profound dimensional mismatch: while VLMs are trained to interpret 2D projections, true spatial reasoning demands the recovery of latent 3D geometry and temporal continuity. To conquer this high-dimensional complexity, we advocate a shift from monolithic learning to a “divide and conquer” paradigm. We present FactoSR, a factorized reinforcement learning framework that explicitly interpret the dimensions collapsed by visual projection. At its core, FactoSR decomposes the monolithic problem of world-consistent reasoning into three orthogonal, geometric sub-objectives: planar correspondence ($XY$), depth consistency ($Z$), and temporal reversibility ($T$). By optimizing these verifiable constraints within a unified policy learning mechanism, we effectively transform an ill-posed projection recovery problem into a series of tangible reasoning steps. Extensive evaluations on multi-view and video benchmarks demonstrate that this elegant decomposition yields substantial gains in 3D and 4D reasoning, achieving a 5.9% boost on VSI-Bench and 4.5% on All-Angles-Bench. Our findings suggest that reinforcing explicit, factorized 4D consistency is a critical step toward evolving VLMs into robust, world-aware reasoners.
Read the full abstract
Probability
Moments for self-normalized partial sums
We consider a regularly varying stationary sequence of random variables (Xt) with tail index ___ < 2. For these sequences we study the joint convergence of sums, `p- type moduli and maxima. We focus on ratio statistics, including the studentized sums and sums normalized by the corresponding maxima, and study the existence of moments for the limit ratios. We consider particular examples of processes (Xt) whose limit ratios possess all moments. But, in contrast to the latter situation, there also exist sequences (Xt) where certain moments of the limit ratio are in___nite. This phenomenon results from extremal clusters in the sequence.
Read the full abstract
Artificial Intelligence
Proactive Service Agents: A Unified Decision Framework, Methods, and Evaluation
Large language model agents can plan, invoke tools, and modify external states, yet most systems still take an explicit user instruction as a fixed starting point. Proactive service moves the decision upstream: an agent must infer service opportunities from incomplete environmental and user signals, choose among remaining silent, asking, assisting, and acting, and account for interruption, misunderstanding, overreach, and privacy costs. This survey gives an operational definition centered on initiative and formulates the problem as a partially observable sequential decision process constrained by authorization and risk. The formulation represents timing, content, and delivery within one structured action, while making explicit the option value of waiting, the decision value of questions, and feedback-induced state changes. On this basis, we organize existing methods along one decision pipeline (state and need estimation, intervention gating, action construction, and feedback adaptation) and describe prescribed, predictive, model based, and return optimizing mechanisms as nonexclusive policy-construction components. We further normalize decision units and three-axis evidence descriptors across streaming dialogue, screen, video, software-engineering, and human-agent collaboration resources, and formalize metrics for triggering, timing, calibration, user burden, safety, and policy value. The synthesis shows why offline classification performance alone does not predict deployment benefit and why long-term memory is not a defining condition of proactivity. Reliable proactive service instead requires calibrated incremental intervention value, verifiable authorization, recoverable execution, and counterfactual evidence.
Read the full abstract
Analysis of PDEs
Inverse Scattering for Single Photons in Quantum Optics
We study inverse problems for a time-harmonic one-photon model describing the interaction of a single photon with a medium of stationary two-level atoms. After time-harmonic reduction, the unknown compactly supported atomic density appears as a frequency-dependent potential in a scattering equation for the half Laplacian. We prove high-frequency uniqueness results for three types of intensity data: source-driven measurements, renormalized far-field intensity measurements, and phaseless far-field measurements obtained from coherent superpositions of incident plane waves. In each case, the corresponding data, given at all sufficiently large frequencies, determine the atomic density uniquely; the source-driven result requires a geometric visibility condition on the source and observation sets.
Read the full abstract
Materials Science
Multimodal and Multiscale Interrogation of a Mechanically Tough Glass Forming Copper-Based Metal-Organic Framework
A copper-based metal-organic framework, Cu(Im)2, was synthesized using a sol-gel process and subsequently melt-quenched into glass upon heating above 240 {\deg}C. In this paper, we present a multimodal, multiscale interrogation of the MOF nanocrystals and the resulting glasses. Structural characterization using X-ray diffraction, atomic force microscopy, and electron microscopy was performed to understand the morphology and size of the synthesized nanocrystals and glasses. Thermogravimetric analysis and differential scanning calorimetry were employed to understand the melting process of the crystals to form the glass. Synchrotron pair distribution function analysis was performed to verify that the framework structure is maintained upon melting, and nearfield infrared nanospectroscopy provided insight into the local chemical structure of the materials. The mechanical characterization via nanoindentation revealed that the resulting glasses exhibit an appreciably high elastic modulus (~10 GPa) and the highest fracture toughness (K_1c ~ 0.5 MPa m^1/2) yet reported for MOF glasses. This development is central to the emerging field of MOF-based materials processing and shaping, while upholding mechanical robustness and resistance to cracking.
Read the full abstract
Neural and Evolutionary Computing
Genetic Algorithms for Tractable Bayesian Network Fusion via Pre-Fusion Edge Pruning
Bayesian Network (BN) fusion combines multiple input networks into a single structure, balancing dependency preservation with computational tractability. While unrestricted fusion retains all dependencies, it often results in overly complex networks with high treewidth, which affects inference scalability. Limited fusion mitigates this by pruning edges to control treewidth but risks overfitting to input-specific noise and omitting dependencies from the original BNs. This paper introduces a consensus framework that prioritizes shared structures among input networks while enforcing treewidth constraints, ensuring a good consensus. We propose genetic algorithms with advanced initialization, specialized operators, and a tailored fitness function. Additionally, we adapt existing methods to this problem and implement greedy baselines for benchmarking and further optimization. Experiments on synthetic and real-world BNs show the superiority of the proposed genetic algorithms over the adapted methods and greedy baselines.
Read the full abstract
Differential Geometry
Comparison between renormalized volume and area in the Weil–Petersson topology
We prove that the renormalized volume between the two Epstein surfaces associated with a Weil–Petersson quasicircle is continuous with respect to the Weil–Petersson topology. As a consequence, we establish that the universal Liouville action is proportional to this renormalized volume for every Weil–Petersson quasicircle. We then establish an inequality relating this renormalized volume to the renormalized area introduced by Alexakis–Mazzeo. To this end, we compare both quantities with the Hilbert–Schmidt norm of the associated Grunsky operator, which can be expressed in terms of a nonlocal Lagrangian introduced by O'Hara–Solanes.
Read the full abstract
Dynamical Systems
On the density of Lyapunov unstable elliptic equilibria
We prove that any real-analytic Hamiltonian in five or more degrees-of-freedom, with a locally integrable non-degenerate elliptic equilibrium with indefinite quadratic part, can be perturbed within the real analytic category, while preserving the Birkhoff normal form at the equilibrium up to any arbitrary order, so that the equilibrium becomes Lyapunov unstable.
Read the full abstract
Software Engineering
Can LLMs Extract Architectural Design Decisions from Source Code Commits? - A Preliminary Exploratory Study
Context: Architectural Design Decisions (ADDs) capture the rationale behind the structure and evolution of software systems but are rarely documented explicitly, and are often hidden inside source code commits. Recovering them is important for Architectural Knowledge Management (AKM). Problem: Extracting ADDs from commits is challenging due to their implicit and unstructured nature. Large Language Models (LLMs) have shown strong capabilities in understanding code and text, yet their effectiveness for this task remains underexplored. Study: We present a preliminary study using four LLMs (Gemini 3 Pro, DeepSeek R1, Kimi K2, Qwen3) with zeroshot and fewshot prompting on 30 developer-written ADDs from open-source projects. We score outputs with ROUGE-L, BLEU, METEOR, and BERTScore, and one author manually reviews the Gemini outputs. Results: All models reach a BERT-F1 above 0.81, and fewshot prompting improves alignment (Gemini BERT-F1: 0.828 to 0.847). However, the generated ADDs are often too long, implementation-focused, and miss the rationale behind the decision. This highlights opportunities for architecture-aware LLM systems and automated AKM.