Networking
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
Rate adaptation is a crucial mechanism in IEEE 802.11 networks and next-generation cellular systems. Since the time scale for rate adaptation is typically much shorter than that for user association and scheduling, we investigate a joint design of wireless user association and scheduling and rate adaptation across different time scales to maximize cumulative network throughput while ensuring desired fairness among users. We develop a MaxWeight-type user association and scheduling algorithm that integrates virtual queues – tracking each user's scheduling debt to maintain fairness – and Upper Confidence Bound (UCB) estimates in its weight measure. Each selected user then employs the UCB algorithm for rate adaptation on a short time scale. Our theoretical findings reveal that the proposed algorithm achieves cumulative regret that grows with the square root of the time horizon up to a logarithmic factor and results in zero cumulative fairness violation after a certain number of time frames. Furthermore, since the MaxWeight-type algorithm involves evaluating all the feasible schedules that can be exponential to the number of users due to the interference constraints, leading to high computational complexity, we introduce a low-complexity alternative utilizing the so-called pick-and-compare (PC) approach. We demonstrate the effectiveness of both algorithms through simulations based on real-world data traces.
Cryptography and Security
LLMSec-AV: A Vulnerability Taxonomy and LLM-Driven Software Weakness Discovery Framework for Autonomous Vehicles
Automated vehicles rely on millions of lines of safety-critical software, yet general-purpose analyzers do not understand which code can affect vehicle motion. This study asks whether large language models (LLMs) with explicit automated-vehicle (AV) security knowledge improve weakness detection beyond rule-based tools. We developed an AV vulnerability taxonomy with 18 weakness classes from vulnerability records, security advisories, and AV-security literature, and integrated it into LLM-based Security Analysis for Automated Vehicles (LLMSec-AV). Evaluated on Autoware, the framework decomposed 770 translation units into 4,673 functions and analyzed 161 functions under four prompting conditions involving taxonomy context, retrieval from 374 prior disclosures, and multi-step analysis. Findings were compared with 46 weakness locations mined from upstream fixes and a flag-volume-matched permutation baseline. CodeQL, Semgrep, cppcheck, and the Clang Static Analyzer evaluated the same code, with AV-specific rules added to CodeQL and Semgrep. Generated fuzzing harnesses were tested using AFL++ and sanitizers. LLM conditions recovered up to 76% of the 46 known weakness locations, outperforming conventional analyzers. CodeQL, Semgrep, and the Clang Static Analyzer matched none, while cppcheck matched one despite 1,301 alerts. Unaided prompting achieved similar detection performance, showing that the taxonomy did not drive recall. However, taxonomy context increased the share of findings assigned to a weakness class from near zero to over 80%, improving interpretability and triage. Six of the 18 classes could not be directly represented as static-analysis rules. LLMSec-AV introduces an AV-specific, machine-readable vulnerability taxonomy for weakness discovery and shows that LLMs can complement conventional analyzers by identifying and organizing safety-relevant findings in real AV software.
Read the full abstract
High Energy Physics (Phenomenology)
Heavy Higgsino Interpretation of the LZ Event
The LZ experiment has recently reported a $248$ keV nuclear recoil event in a region where backgrounds are expected to be low. A pure higgsino scattering inelastically through a $Z$-boson is an exciting possible interpretation of this event, but at the mass required for thermal freeze-out to account for all dark matter, $m_\chi = 1.1$ TeV, it predicts several events in the empty high-energy sideband corresponding to $E_R\gtrsim350$ keV and is further excluded by searches for high energy neutrinos coming from the Sun by the IceCube detector. We fit the higgsino mass scale and neutral state mass splitting, $m_\chi$ and $\delta$, to the event and the empty sideband. We additionally recompute solar capture bounds as a function of $m_\chi$. The LZ data alone are best fit at low mass, $m_\chi \approx (240,\,450)$ GeV, but is excluded by solar capture. The parameter space most consistent with the event, the empty sideband and the solar capture bound is $m_\chi \approx (10^5,\,10^6) $ GeV with $\delta \approx (330,\,480)$ keV, with some dependence on DM halo modeling. Such a higgsino must be produced by some other method than standard freeze-out; this can be achieved by freezing-out during a period of early matter domination which ends by reheating the universe to temperature $T_{\rm RH}\approx 1$ TeV. We give a simple proof of concept model which does this via a Kim-Nilles mechanism and therefore connects to the origin of the Higgsino mass scale and solves the strong CP problem.
Read the full abstract
Systems and Control
Networked Admissibility-Preserving Control for Directed Safe Coordination
This paper addresses safe coordination of scalar agents with constrained input dynamics over fixed rooted digraphs. We propose a networked Admissibility-Preserving Control (APC) architecture for a common moving output corridor under heterogeneous asymmetric input bounds, wherein the Admissibility-Preserving Input Realization (APIR) generates the physical inputs. In logarithmic barrier coordinates, the closed-loop dynamics form an exact cascade of exponentially decaying realization errors and directed consensus dynamics. We derive direction-specific compatibility conditions that guarantee uniform corridor and input margins, bounded commands, unique complete solutions, and exponential consensus for compact initial sets. The closed-form expression for the agreement value quantifies the effect of the initial APIR mismatch. Under the corresponding compatibility conditions, partial pinning guarantees safe reference tracking whenever the root component contains at least one informed agent. Simulations illustrate the coordination guarantees.
Read the full abstract
Strongly Correlated Electrons
Emergent Electronic Bond-Order Wave in a Quasi-One-Dimensional Chain
Collective order is notoriously difficult to stabilize in one dimension, where strong fluctuations suppress symmetry-breaking states. Here we report the emergence of an electronic bond-order wave (BOW) in the quasi-one-dimensional (1D) material Ba9Rh8O24, in which structural bonds become active electronic degrees of freedom that overcome 1D fluctuations to establish long-range order. Single-crystal X-ray diffraction uncovers a striking inversion of inequivalent Rh-Rh bonds across a transition TA = 180 K, where short and long bonds interchange their identities rather than undergoing conventional Peierls dimerization. This bond inversion coincides with a heat-capacity anomaly and a profound reorganization of the dielectric response with strong suppression of dielectric loss upon cooling. The BOW exhibits strongly nonlinear, frequency-dependent I-V characteristics, clockwise hysteresis, and nonvolatile memristive switching. These findings uncover an unprecedented transformation from a dynamic bond liquid to a rigid yet electrically reconfigurable BOW, establishing bond-centered electronic order as a new organizing principle for 1D quantum matter.
Read the full abstract
Earth and Planetary Astrophysics
Beyond Pebble Isolation: Diverse Pathways to Giant Planet Formation Across Stellar and Orbital Scales
Context. Giant planet formation requires reaching crossover mass, i.e., when the mass of the gaseous envelope becomes equal to the mass of the core, within the disc's lifetime. The formation process depends critically on the orbital distance and stellar mass. Aims. We simulate planet formation via pebble accretion up to crossover mass around stellar hosts with masses of 0.1-1.5 M_Sun considering a range of formation locations, with and without Type I migration. Methods. We use a modified version of MESA that couples pebble accretion, gas accretion, and disc evolution. Results. We find that cold/warm Jupiters form, whereas in-situ formation fails at short orbital separations: viscous heating raises the isolation mass enough to assemble adequate cores, but the accompanying high disc temperature prevents cooling and suppresses gas giant formation. This supports migration-based explanations for the origin of hot Jupiters. At large orbital distances, crossover can be reached before pebble isolation mass. This is possible due to efficient envelope contraction in the cold, low-opacity outer disc. Inferred core masses at crossover range between about 1 and 20 M_Earth. Conclusions. Pebble accretion accommodates multiple formation pathways. Giant planets can also have very small cores. Overall, different formation conditions significantly influence planetary growth and can explain the diversity in compositions and internal structures observed in the exoplanet population.
Read the full abstract
Information Retrieval
Extracting Semantics from Cattle Reporting Categories for Data Interoperability and Findability
Livestock population data disaggregated by age, sex, and production are important inputs to calculations and models that inform our understanding of global health, yet these data are fragmented across disparate sources. Bridging data siloes to improve the findability of data requires interoperability. Conventional approaches to improving the findability and interoperability of data include indexing standardized metadata. However, creating metadata is time and resource-intensive and is often difficult in domains such as livestock, which lack standards that address the needs of broad user groups. When metadata exist, they typically need to be standardized against a pre-existing vocabulary, ontology, or thesaurus, requiring a technique known as `crosswalking'. To overcome issues in the absence of metadata, the lack of standards, and the resource-intensive solutions that currently exist, this study uses a bottom-up approach. By leveraging real-world reporting categories in datasets, the composition and semantics of terms already present in the data were extracted and analyzed. Using cattle data as a pilot, we find the age, sex, and production modifiers present across cattle terms from five datasets from four data sources capture granularity not present in AGROVOC, the largest agricultural vocabulary in the world. We discuss how the composition and semantics of these terms can be used to improve the interoperability and findability of data without first requiring metadata to be generated or standards to be created. Rather than forcing datasets to conform to an existing vocabulary, this approach uses the semantics embedded in terms already present in datasets, allowing systems to make data more discoverable and interoperable while maintaining culturally and dataset-specific terminology.
Read the full abstract
Robotics
AccelMPC: High-Rate, Low-Power FPGA-Accelerated Model Predictive Control for Tiny Drones
Unlocking the potential of tiny aerial robots requires order of magnitude improvements in the performance of embedded edge control. In particular, although recent cached model predictive control (MPC) solvers can handle the fast system dynamics and complex constraints required for agile drone flight, their computational demands remain prohibitive for resource-constrained robots, forcing prior implementations to operate at reduced control rates. AccelMPC overcomes this challenge through an end-to-end co-design approach that jointly optimizes the solver algorithm, numerical representation, hardware mapping, and physical integration. AccelMPC pairs a co-designed FPGA-accelerated alternating direction method of multipliers (ADMM)-based MPC solver with a custom 6g PCB, providing high-bandwidth communication for deployment on a 35g Crazyflie. Hardware experiments demonstrate 1 kHz onboard constrained MPC with dynamic obstacles, up to 15.6x faster solve times and 195.4x improvement in energy-delay product over state-of-the-art embedded microcontroller-based solvers, all while scaling to optimization problems with over 20,000 optimization variables and a comparable number of constraints. We release our PCB design files, firmware, and FPGA solver code open source.
Read the full abstract
Human-Computer Interaction
Agentic Web Accessibility Auditing: A Criterion-Specific Framework for Translating WCAG Requirements into Assessments
Web accessibility auditing requires interpreting diverse requirements and examining interface behavior. Rule-based checks and noninteractive model assessments can miss barriers requiring contextual or interactive evidence. We present an agentic framework that assigns a vision-language agent to each accessibility requirement. Guided by tailored instructions, agents inspect webpages, operate controls, and record evidence supporting their findings. We implement the framework for 40 requirements from the Web Content Accessibility Guidelines (WCAG). To compare detection and cost, we construct a dataset of 250 page-criterion records derived from expert audits across 11 scholarly platforms. Agents recover 67 of 78 reported positive cases (86% recall), compared with 36% for axe-core, a rule-based checker, and 67% for an uncued, noninteractive vision-language model, at lower precision (56%). They recover nine of ten Keyboard and No Keyboard Trap cases missed by both baselines. Together, the framework, implementations, and dataset support automated accessibility auditing grounded in inspectable evidence.
Read the full abstract
General Relativity and Quantum Cosmology
Gravitational Radiation from Shockwave Scattering in the Self-Force EFT
We investigate the high-energy collision of two spinless bodies within the Self-Force Effective Field Theory (EFT), taking one of them to be massless and highly energetic, such that it generates a gravitational shockwave (GSW) background. The GSW is perturbed by the second body, either massless or massive, satisfying respectively $E_2/E_1\ll1$ or $m_2/E_1\ll1$. Although the Self-Force expansion for shockwaves is frame-dependent, we freely choose a frame in which this EFT manifests its power, obtaining results valid to all orders in Newton's constant that make the underlying resummation patterns evident. Specifically, we push the expansion to 1SF order and prove the all-order vanishing of the so-called recoil operators in light-cone gauge. We obtain the exact graviton propagator on the shockwave background, matching previous results, and use it to compute the on-shell waveform at 1SF order in momentum space, specialising to the massless-massless collision. The waveform is computed to all orders in the Post-Minkowskian, or weak-field, expansion. In the trans-Planckian regime, its resummed form is proved to yield a UV-finite angular spectrum of radiated energy.
Read the full abstract
Statistical Methodology
Estimating Causal Treatment Effects in Placebo-Controlled Randomized Clinical Trials When High Placebo Response is Anticipated
In placebo-controlled randomized clinical trials (RCTs), the placebo response significantly modifies treatment effects and diminishes the intention-to-treat (ITT) treatment effect, $\Delta_{ITT}$. This study presents a novel two-stage framework for estimating the standardized causal treatment effect, $\Delta_{STD}$, among the ITT population, under the assumption that their placebo responses are similar to the levels of self-administering medication at home. The first stage employs a real-world, pragmatic, single-blinded placebo lead-in to measure placebo responses to levels expected during routine at-home use. This is achieved by preserving the participants' expectations and controlling for trial-related factors that inflate the responses. In the second stage, a double-blinded randomized phase is used to estimate the conditional average treatment effect (CATE) as a function of placebo response levels and other important effect modifiers. To facilitate CATE estimation, the prognostic scores, defined as the expected placebo responses, are used for dimension reduction. The causal estimand $\Delta_{STD}$ is computed by integrating the CATE function over the distribution of the expected placebo response levels from stage one and other modifiers. We further derive theoretical values for $\Delta_{ITT}-\Delta_{STD}$ to quantify the underestimated treatment benefit due to high placebo responses. The validity and statistical performance of the proposed framework are evaluated through comprehensive simulations.
Read the full abstract
Systems and Control
Experimental Validation of Combined Imaging and Vibration Mitigation for High-Altitude Platforms
The demand for continuous, high-resolution aerial monitoring is driving interest in High- Altitude Pseudo-Satellites (HAPS), which offer a cost-effective alternative to satellites with greater flexibility. While HAPS platforms provide valuable Earth observation potential, se- lecting an optical sensor requires balancing resolution and payload constraints, given their lightweight structures. We propose a multidisciplinary concept to enhance the Earth obser- vation capabilities of HAPS using a commercially available, weight-efficient distributed camera network, combined with advanced image processing and active vibration control. A super- resolution pipeline is introduced, where images from individual cameras are preprocessed and fed into a super-resolution algorithm. The low structural rigidity of HAPS platforms increases their sensitivity to low-frequency vibrations, which must be mitigated through active control to preserve imaging performance. A nominal H-infinity mixed-sensitivity controller is designed to suppress resonance peaks at camera locations. The methodology is experimentally validated on a simplified wing platform designed for real-time testing. Quantitative evaluation based on nine metrics demonstrates significant image quality improvements, highlighting the effectiveness of H-infinity control in mitigating low-frequency elastic modes and stabilizing the platform for super- resolution. These results show that lightweight commercial sensors, combined with advanced image processing and control, can deliver high-quality imaging for future HAPS remote sensing missions.
Read the full abstract
Strongly Correlated Electrons
Tuning Charge Density Wave transitions through lattice strain in NbSe3
The Charge Density Wave (CDW) state is a perfect example of a combined structural and electronic state, both characterized by a periodic lattice distortion and an electronic modulation of condensed electrons, resulting from electron-phonon coupling. They are thus prone to be tuned by lattice strain. NbSe3 is a prototypical example of CDW states, with a chain-like structure displaying two CDWs at 145K and 59K, with wavevectors along and inclined with respect to the chain axis b. Here, we report on the evolution of the lattice structure and CDW properties in the quasi-one-dimensional charge-density-wave system NbSe3 under tensile stresses applied along and perpendicular to the chains axis b by a combination of X-ray diffraction and transport measurements. We find that the lattice structure show exotic Poissons coefficients and strongly anisotropic Youngs moduli while the evolution of the electrical resistance demonstrates shifts of both charge-density-wave critical temperatures that are strongly correlated with the lattice parameters. The two CDW transitions display different behaviours under applied stresses, and suggest that a modification of the band curvature leads to the observed transport signatures.
Read the full abstract
Artificial Intelligence
An Autonomous GeoAI Agent for Arctic Eco-Navigation
Arctic maritime navigation is becoming increasingly important as changing sea-ice conditions expand seasonal accessibility while simultaneously introducing substantial operational, environmental, and community risks. Arctic route planning is inherently a multi-criteria problem: routes that improve vessel safety or efficiency may increase exposure to sea ice, sensitive ecosystems, or nearby communities. Existing routing methods prioritize travel time, fuel use, and navigational risk, often overlooking ecological and community impacts. We introduce a human-in-the-loop, multi-agent GeoAI system for Arctic eco-navigation that integrates operational, physical, ecological, and community-related criteria within a unified routing framework. Multiple specialized agents coordinate geospatial data acquisition and preparation, multi-objective route generation, and skyline-based decision support. The ecological criteria explicitly account for exposure to sensitive areas, including Essential Fish Habitat and seal critical habitat. By considering these ecosystem impacts and potential community burdens while keeping consequential value judgments under human control, the framework supports safer, more transparent, and socially responsible Arctic navigation. Project page and code are publicly available. https://samiraat.github.io/Arctic-Eco-Navigation-Agent/, https://github.com/samiraat/Arctic-Eco-Navigation-Agent
Read the full abstract
Quantum Physics
Non-Multiplicativity of the Holevo Barycenter of Quantum Channels
The Holevo barycenter of a quantum channel is the unique output state obtained as the average output of any ensemble achieving the Holevo capacity. Given two quantum channels, the multiplicativity problem asks whether this barycenter tensorizes under parallel composition, namely whether the barycenter of the product channel coincides with the tensor product of the individual barycenters. This question is closely related to the additivity problem for the Holevo capacity: additivity implies tensorization of the Holevo barycenter, while tensorization alone is not sufficient for additivity. Although a construction is known that demonstrates the existence of channels with non-additive Holevo capacity, their corresponding Holevo barycenters still tensorize, leaving open whether multiplicativity might ultimately hold universally. Here, we answer this question in the negative by exhibiting channels for which the Holevo barycenter is not multiplicative under the tensor product of the channel with itself. Moreover, we show that the entropy of the Holevo barycenter is neither universally subadditive nor universally superadditive under tensor product.
Read the full abstract
Computation and Language
What Does MMLU Actually Measure? A Psychometric Audit of Difficulty Structure in Aggregate Benchmark Scores
Although MMLU is widely adopted as a benchmark for calibrating general AI capabilities, we psychometrically demonstrate that its aggregate score primarily evaluates a model's factual retrieval capacity rather than its reasoning ability. By calibrating item difficulty for 1,000 open-weights language models over 14,042 MMLU test items using Item Response Theory, we show that evaluating both abilities via a single test is inherently flawed. Difficulty is then regressed on a deterministic, text-extractable framework of structural complexity. Applying a joint Wald test with subject-clustered covariances demonstrates that the MMLU conflates fundamentally separable constructs. The mapping from structural complexity to difficulty is not invariant across the benchmark's STEM and non-STEM partitions. This finding has practical consequences. Aggregate leaderboard ranks track non-STEM accuracy more closely than STEM accuracy, so selecting a Top-50 model on the aggregate for a reasoning-intensive deployment displaces roughly 22% of the STEM-appropriate choices. Furthermore, when controlling for the multiple-choice guessing floor natively inside the response model, we find that higher-ability models continue to degrade more steeply under increased reasoning depth. The MMLU aggregate therefore weights retrieval capacity and reasoning stability unequally, inadvertently favoring models optimized for retrieval. We release our deterministic framework as a reproducible auditing instrument and recommend disaggregated reporting.
Read the full abstract
Quantum Physics
Materials for Quantum Information Science: Roles in the Quantum Evolution 2.0
Quantum information science is entering a second phase, the Quantum Evolution 2.0, in which the challenge has shifted from demonstrating coherent control of individual quantum states to building scalable multi-qubit processors and networks. This transition places materials science at the center of the field. Across superconducting circuits, quantum defects, quantum photonic devices, and emerging materials platforms, including two-dimensional materials and heterostructures, performance is now limited less by device design than by poorly controlled surfaces, buried interfaces, and defects whose atomic identities remain incompletely known. This review surveys the materials challenges of these quantum platforms together with the characterization methods needed to resolve them. For each platform we identify the dominant decoherence mechanisms, the current state of materials understanding, and the most pressing open materials problems. A cross-platform comparison then reveals a shared structure-coherence problem. The implicated material chemistry recurs across platforms, involving light elements in disordered or buried environments, yet no platform can quantitatively connect a specific atomic-scale structure to a measured change in coherence. We close by identifying three needs, mechanistic understanding of decoherence at the atomistic level, high-throughput proxy metrics predictive of device performance, and characterization tools built for quantum materials, whose resolution would advance coherence, scalability, and integration across all platforms.
Read the full abstract
Machine Learning
Constraint-Aware Discrete Black-Box Optimization Using Tensor Decomposition
Discrete black-box optimization is often addressed using approaches such as Sequential Model-Based Optimization (SMBO), which aims to improve sample efficiency by fitting surrogate models that approximate a costly objective function over a discrete search space. In many real-world problems, the set of feasible inputs is often given by logical constraints known in advance. However, existing surrogate modeling techniques generally fail to capture the symbolic rules governing feasibility in discrete input spaces. In this paper, we propose a surrogate modeling approach based on tensor decomposition that captures the structure of discrete search spaces while directly integrating feasibility information. To implement this approach, we formulate surrogate model training as a constrained polynomial optimization problem and solve a relaxed formulation using a differentiable penalty term derived from T-norms. Our experiments on both synthetic and real-world benchmarks, including a pressure vessel design task, demonstrate that the proposed method improves sample efficiency by effectively guiding the search away from infeasible regions.
Read the full abstract
Classical Physics
Dunkl-Based Modeling of Vibrational Modes in Lightweight Elastic Beams
Optimizing slender elastic structures for renewable energy applications requires non-classical continuum formulations capable of accounting for spatial micro-interactions without sacrificing analytical tractability. Here, we extend beam vibration mechanics by replacing standard spatial derivatives with the Dunkl differential operator. This modification introduces a reflection-coupled mathematical structure that accounts for spatial parity effects across the beam domain. We formulate the governing dynamic equations into a generalized eigenvalue problem and derive exact analytical expressions for modal characteristics under standard boundary conditions. The classical limit confirms exact convergence to classical Euler-Bernoulli formulations. Parametric analyses reveal that the Dunkl parameter acts as a reflection-induced modulation parameter, significantly shifting natural frequencies and altering the modal characteristics of higher modes. These results provide an analytical baseline for dynamic optimization in lightweight structural components.
Read the full abstract
Computer Vision
The Living Library: Transforming Archival Collections into Conversational Knowledge Systems – Lessons from the Theodore Roosevelt Presidential Library
We present the Living Library, an end-to-end framework for transforming fragmented digital archives into governed, conversational, in-person exhibit experiences. Developed and deployed at the Theodore Roosevelt Presidential Library, the framework comprises four layers: digitization and corpus creation, AI-powered processing, retrieval and reasoning, and an optional embodied conversational interface. The first three layers aggregate a 300,000-record collection, apply OCR and structured metadata enrichment for expert curatorial review, and publish records to a hybrid dense/semantic index. Expert review is conducted through the Archivist App, a curator-facing interface that supports correction of AI-generated transcriptions and metadata. The governed corpus powers both a researcher-facing interface and Talk to TR, a continuously operating exhibit that embodies Theodore Roosevelt as a full-scale digital human within a museum environment. To support live, face-to-face interactions, Cross-Era Analogical Grounding reframes contemporary questions through documented historical parallels, allowing Roosevelt to address present-day topics without inventing facts. Dual-path retrieval and end-to-end streaming keep responses grounded and responsive. Layered watchdogs, visitor-session isolation, automated conversation management, and independently restartable services enable reliable unattended operation for hundreds of visitors. Avatar realism, spatial audio, lighting, staging, and conversational design are developed and evaluated as an integrated experience. Rather than report a controlled benchmark, we describe lessons from operating Talk to TR as a public exhibit and offer a transferable model for transforming archival collections into believable, in-person conversational experiences.
Read the full abstract
Machine Learning
Explaining f-Divergence-Based Regularization via Local Curvature and Sharpness-Aware Minimization
Divergence-based regularization and Sharpness-Aware Minimization (SAM) are two prominent approaches for improving generalization in deep learning, both motivated by robustness to perturbations. However, their relationship has remained largely unexplored. Building on classical second-order expansions of $f$-divergences, we show that the two methods are locally consistent under parameter-space perturbations: both induce curvature-sensitive penalties, with divergence regularization yielding a Fisher-weighted quadratic form and SAM penalizing sharpness through the dominant Hessian eigenvalue. For negative log-likelihood objectives with exponential-family output distributions, this correspondence becomes especially transparent, since the Fisher and Gauss-Newton matrices coincide. We further show that the same local geometric perspective extends to input-space perturbations, where divergence-based regularization is defined through transformations of the input. In this setting, the regularizer induces a pullback quadratic form on the input space, providing a more general perturbation framework than standard SAM while preserving the same local sensitivity interpretation. To validate the analysis empirically, we use the asymmetric $\alpha$-skew Jensen-Shannon divergence (JSD) family as a controlled testbed. Its local curvature coefficient scales as $\alpha(1-\alpha)$ and is maximized at the symmetric point $\alpha=\tfrac12$, which recovers the standard JSD. Loss-landscape visualizations in the input-perturbation regime show that stronger induced curvature penalization is associated with flatter local minima. Experiments on four benchmark datasets further demonstrate that both accuracy and negative log-likelihood are consistently best near this regime of maximal curvature penalization.
Read the full abstract
Number Theory
Regular Arithmetic Functions, Volume I. Theory, Applications, Examples
This is the first of two volumes on regular arithmetic functions, and an introduction to their theory. A regular arithmetic function (RAF) is a kernel whose properties come from a single defining equation. Let $G(n,k)$ be a function of two integer variables with $G(n,n)\neq 0$, and for each $\beta$ define a sequence $(a_k)$ by $\sum_{k\le n} a_k G(n,k)=n^{-\beta}$, solved rank by rank with nothing to assume and no convergence to establish. Then $G$ is regular when the partial sums $\sum_{k\le n} a_k$ change behaviour at one exponent. Below it they reproduce the forced rate, above it they absorb it. That tipping point is the regularity index $\alpha(G)$, a quantity belonging to the kernel itself. The index came out of analogies, experiment and observation, and it is arithmetic by nature. Its most visible application is the Riemann hypothesis, which holds if and only if Ingham's kernel $G(n,k)=(k/n)\lfloor n/k\rfloor$ is a RAF of index $1/2$. It is not the only one. On a problem of a quite different kind the same theory improves the known decay bound for the orthorecursive expansion of unity. Seventeen kernels are worked out in a gallery, so that the notion can be handled by the reader. What is conjectural, conditional or open is marked as such and collected in a register. Volume II is given over to that kernel alone, with its connection to the world of Hasse-Weil zeta functions through a gauged system.
Read the full abstract
Human-Computer Interaction
Echoes in the Algorithm: Analyzing the Fidelity of User Preferences Against Realized Platform Reach
What does popular content look like when platforms withhold the usual cues? On TikTok, users still form impressions about which videos are taking off even when likes and view counts are hidden, delayed, or pushed to the margins of the interface. We study this problem through TokOrNot, a web-based game in which participants compared pairs of TikTok videos and reported (i) which one they preferred and (ii) which one they believed had reached a larger audience. We benchmark these judgments against verified public view counts, which we use as a bounded proxy for realized platform reach. Across 3,513 judgments from 363 participants, participants identified the higher-reach video only modestly above chance (56.75%, 95% CI: 56.01-58.55). Preference aligned with the higher-view video at a similar rate, while preference and prediction matched in 83.48% of trials (95% CI: 83.12-85.95). Performance also varied across content categories. Taken together, these results do not suggest that users can reliably read platform success from content alone. Instead, they point to a looser and more uncertain interpretive process in which reach judgments often track personal taste or other weak heuristics when explicit popularity cues are absent. We discuss the implications for algorithmic literacy and for interface designs that reduce visible metrics without leaving users to infer reach from uneven or idiosyncratic cues alone.
Read the full abstract
Materials Science
Phase stability and mechanical response of Ag-interlayered Al/Cu resistance spot-welded joints
Dissimilar Al/Cu joints are essential to battery-pack assemblies; however, their mechanical strength is limited by brittle Al-Cu intermetallic compounds (IMCs) such as Al2Cu and Al4Cu9. Interlayer strategies to suppress these phases remain largely empirical, lacking a predictive framework linking interlayer chemistry to the phases that form and to their intrinsic mechanical character. Here an Ag interlayer is introduced and combines computational thermodynamics, first-principles calculations, microstructural characterization, and mechanical testing into a single self-consistent description of the joint. CALculation of PHAse Diagrams (CALPHAD) equilibrium and Scheil simulations predict the solidification path of the Al-rich Al-Ag fusion zone and explain why Cu incorporation is limited when Ag is present; energy-dispersive X-ray spectroscopy (EDS) and electron backscatter diffraction (EBSD) confirm an FCC Al-Ag solid solution as the dominant constituent. First-principles phonon calculations within the quasiharmonic approximation yield finite-temperature entropy and Gibbs energy, benchmarked against CALPHAD, while elastic constants assess ductility via the Pugh criterion (i.e., the bulk/shear (B/G) modulus ratio). All Al-Ag phases, including the observed solid solution, exceed the Pugh threshold of 1.75, whereas the targeted Al-Cu IMCs do not, giving a mechanistic basis for the interlayer's effectiveness. This microstructural change translates into improved performance: nominal strength rises from 47.9 to 67.4 MPa. Nanoindentation gives a fusion-zone reduced modulus of 82.8 GPa (Young's modulus 82.0 GPa), versus a calculated 0 K Voigt-Reuss-Hill value of 71.4 GPa. The present work establishes a transferable CALPHAD, first-principles, and experiment workflow for rational interlayer selection in dissimilar-metal joining.
Read the full abstract
Computation and Language
Do LLMs Make More Mistakes If They Do Not Believe the Input Data?
Large language models (LLMs) are prone to hallucinating or misinterpreting facts, which impairs their usability in retrieval-augmented generation or data-to-text systems. We analyse how faithfulness of LLMs to provided context depends on how plausible they perceive the context to be (context-memory conflict). To better identify error patterns, we make use of the increased difficulty of non-English and low-resource language text generation and input data based on local knowledge, only partially captured in models' parametric knowledge. We let the models generate text in English, Czech, Slovak and Upper Sorbian from factual (FA), counterfactual (CFA) and fictional (FI) RDF triples containing local Czech and Slovak data. Contrary to our expectations, we observe only a weak context-memory conflict on the human-annotated sample. For Kimi K3 as an LLM judge, which agrees well with human annotations on the sample, counterfactual inputs receive only slightly lower faithfulness scores than factual ones (-0.05 on a 1-5 scale). We also find that a suboptimal choice of LLM judge would lead to overestimating the strength of the context-memory conflict.
Read the full abstract
Algebraic Geometry
Automorphism groups of semi-rigid $T$-varieties of complexity one
We prove that if $X$ is a semi-rigid normal rational affine algebraic variety with torus action of complexity one, with only constant invertible global functions and finitely generated divisor class group, then the identity component of the automorphism group of $X$ is a semi-direct product of a torus and the maximal unipotent-generated subgroup.
Read the full abstract
Optimization and Control
Communication-efficient ADMM over Hierarchical Networks
This paper develops a novel distributed optimization algorithm based on the Alternating Direction Method of Multipliers (ADMM) to solve hierarchical optimization problems over tree-structured networks, termed hierarchical ADMM (hADMM), with a particular focus on enhancing communication efficiency across the network. By rearranging the augmented Lagrangian to establish a query-response communication mechanism between nodes that explicitly exploits the hierarchical tree structure, the proposed algorithm significantly reduces communication costs compared to existing ADMM-based methods for hierarchical optimization. Furthermore, hADMM guarantees asymptotic convergence under convexity assumptions. We also present a convergence rate analysis based on linear matrix inequalities to characterize the maximum theoretically achievable convergence rates across different network topologies, showing that the proposed hADMM attains linear convergence under mild conditions. Three numerical experiments demonstrate that hADMM is compatible with arbitrary tree network structures and outperforms existing approaches in terms of communication efficiency.
Read the full abstract
Analysis of PDEs
Breathing and moving vesicles in a geometric mechanochemical model
We consider a geometric mechanochemical model of vesicles which couples the Helfrich flow for the shape of a lipid bilayer vesicle membrane $X$ with a reaction-diffusion equations for a single “morphogen” $\phi$ on $X$. The Helfrich flow is the $L^2$ gradient flow of the elastic bending energy $E(X)=\int_X (H-c_0)^2 dS$ of $X$, typically supplemented by area or volume constraints, or both. The morphogen $\phi$ adsorbs/desorbs at places of high/low mean curvature $H$, i.e., the kinetics of $\phi$ depend on $H$, and conversely $\phi$ modifies the spontaneous curvature $c_0$ on $X$. The flow is no longer gradient, and hence allows for more complicated dynamics, including time periodic orbits, e.g., “breathing and moving” vesicle shapes. We show how to compute bifurcation diagrams for such solution branches via numerical continuation and bifurcation methods. We mostly focus on “planar” vesicles (1D closed curves) but also give an outlook on 3D vesicles (2D closed membranes).
Read the full abstract
Computer Vision
DensePol: Dense-Angle Polarization Dataset for Learning-Based Polarimetric Vision
Polarimetric vision is gaining increasing attention because it provides physical cues about scene shape, material, and reflection that are difficult to recover from RGB alone. Recent work has therefore explored predicting polarization directly from conventional RGB images; however, the fidelity of these methods strongly depends on the polarization supervision used for training. Most existing datasets rely on Division-of-Focal-Plane (DoFP) cameras with four spatially interleaved analyzer orientations, which provide limited angular redundancy and introduce interpolation and instantaneous-field-of-view errors. We introduce DensePol, a high-redundancy RGB–polarization dataset based on Division-of-Time (DoT) acquisition, capturing 180 full-resolution analyzer orientations at $1^\circ$ intervals. DensePol contains 2,018 paired RGB–polarization images with the angular measurements and fitting residuals retained. Dense angular sampling substantially improves polarization stability, reducing AoLP deviation from $13.36^\circ$ to $2.21^\circ$. We further introduce a deterministic diffusion-based RGB-to-polarization framework with cyclic AoLP representation and a local DoLP refiner. Experiments demonstrate improved polarization prediction and downstream surface-normal estimation. The dataset and code will be publicly available.
Read the full abstract
Information Theory
On the Sequential Test and Distributed Detection
We present a simple definition of stopping time and its role in the formulation of sequential tests for both centralized and distributed detection, providing a straightforward procedure for obtaining optimal decision rules. Upper bounds for optimal stopping time are derived and numerically shown to possess certain qualitative features expected of the optimal stopping time. The results are extended to any distributed detection network in the form of an acyclic directed graph.