Peer Revenue Equity in science

Papers

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

All of arXiv

Thursday 27 August

Differential Geometry

Affine reflection transforms of convex polygons with parallel opposite sides

We study affine reflection transforms of convex polygons with parallel opposite sides. An opposite-side involution sends a pencil through an interior point to a piecewise smooth family of lines. Its completed envelope consists of conic arcs and transition segments. The completed transform has non-positive oriented area. Maximising the negative oriented area and dividing by the polygonal area gives an affine invariant that vanishes precisely for centrally symmetric polygons. Combining an identity for reflected chord vectors with the Rogers–Shephard inequality shows that this invariant is strictly less than $1$, with optimal universal constant $1$. The energy extends continuously to the boundary and vanishes there. We also compare chord counts under compatible smoothing and prove Hausdorff convergence to the smooth transform.
Read the full abstract

Classical Analysis and ODEs

Derivatives of Theta Functions and a Problem of Lyubarskii and Nes

We characterize all lattices $\Lambda \subset \mathbb{R}^2$ of rational density for which the Gabor system generated by the first Hermite function along $\Lambda$ is a frame for $L^2(\mathbb{R})$. We prove that these are precisely the lattices whose density satisfies $D(\Lambda) = \frac{q}{p} $ where $p,q \in \mathbb{N}$ are coprime with $q \geq p+2$, thereby confirming a conjecture of Lyubarskii and Nes. A formalization of our main result in Lean $4$ is also included.
Read the full abstract

Operator Algebras

Isometric embeddings of noncommutative $L_p$-spaces into noncommutative symmetric spaces

We establish a noncommutative version of a familiar Johnson–Maurey–Schechtman–Tzafriri Theorem, by showing that for any $0 <p<2$ and a (not necessarily semifinite) von Neumann algebra $\mathcal{M}$ on a separable Hilbert space, if a symmetric quasi-Banach function space $E(0,1) $ containing the function $t\mapsto t^{-1/p}$, $0<t\le 1, $ then there exists a noncommutative probability space $(\mathcal{N},\sigma )$ such that $L_p(\mathcal{M})$ is isometric to a subspace of $E(\mathcal{N},\sigma)$. In particular, this answers two questions raised by Randrianantoanina in 2006.
Read the full abstract

All authors Jinghao Huang, Marius Junge, Fedor Sukochev, Dmitriy Zanin

Cryptography and Security

eBPF Security in the Wild: Structural Concentration, Failure Mechanisms, and Discovery Gaps

Extended Berkeley Packet Filter (eBPF) is a security-critical in-kernel execution framework, yet its vulnerability landscape remains fragmented across components, semantic gaps, and testing techniques. We present an empirical study of observed eBPF vulnerabilities. We construct a multi-source dataset from Linux kernel fixing commits, syzbot reports, and public CVE/NVD records, and analyze it through a unified framework covering structural concentration, mechanism-level failure modes, architectural distribution, and discovery gaps in representative techniques. Our results show that the observed eBPF vulnerability landscape is structurally concentrated rather than broadly dispersed across many unrelated weakness types. The dominant portion is associated with a limited set of recurring system-level failures, especially in runtime execution, concurrency, object lifecycle management, and semantic inconsistencies across trusted stages. These failures are unevenly distributed across the eBPF pipeline: Runtime is the dominant exposure surface, whereas the Verifier and JIT are lowerfrequency but structurally distinct security boundaries. A rubric-based comparison of representative techniques and a version-aligned Syzkaller case study on Linux v5.10 show that, despite visible raw coverage of Runtime, Verifier, and JIT, effective exploration is semantically narrow, and observed discoveries concentrate in a small subset of Runtime failures. Overall, raw coverage alone provides an incomplete view of discovery effectiveness.
Read the full abstract

All authors Baihong Chen, Hua Ming, Weifeng Pan, Tian Xie, Xiaojun Qi, Wen Li

Quantitative Methods

BananaVLM: A Domain-Adapted Vision Language Model for Banana Crop Disease Diagnosis

Banana crop diseases threaten food security across the world, yet field diagnosis remains difficult because of limited expert access and visual similarity among disease classes. We present BananaVLM, a domain-adapted vision-language model for banana disease diagnosis built on LLaVA-v1.5-7B and fine-tuned with Low-Rank Adaptation (LoRA). To address the lack of multimodal agricultural instruction data, we introduce BananaInstruct, an automated pipeline that converts raw disease images into $\approx$80,000 question–answer pairs without manual annotation, using LLaVA-1.5-13B for symptom descriptions and Mistral-7B for agricultural Q&A generation and label grounding. Evaluated against 14 open-source and 5 closed-source VLMs on a nine-class benchmark, BananaVLM achieves 92.21% in-domain and 83.28% out-of-domain (OOD) classification accuracy, outperforming the best closed-source baseline, Gemini~2.5~Pro, by 49.8 and 63.3 percentage points, respectively. Binary healthy/diseased identification reaches 98.38% OOD accuracy with 1.00 recall. A controlled LoRA–DoRA comparison shows that DoRA performance degrades across epochs, while LoRA remains more effective for fine-grained classification. Qualitative evaluation using nine LLM judges yields G-Eval win rates of 0.81–0.96, while five domain experts prefer BananaVLM in 98.48% of 990 blind pairwise comparisons. These results show that lightweight domain adaptation with automated instruction tuning is an effective and scalable approach for specialized agricultural AI. Code, datasets, and model weights are available at https://github.com/samy101/banana-vlm
Read the full abstract

Machine Learning

CleanScore: Black-Box Benchmark Audits with Negative Controls and Sensitivity Bounds

Public benchmark scores reflect skill, prior exposure to the questions, or both, and for most models the training data are unknown. CleanScore is a black-box audit: the estimator needs only a correct-or-incorrect score for each form, not training data or weights. Each benchmark question becomes a parent item with one public form and two independently written fresh forms that keep its numbers, facts and answer. The audit reports an interval for the public-form advantage, not a verdict, and a private control bank with an explicit transport radius provides a proxy for the ordinary form gap that a rewrite alone can produce. A registered controlled-exposure experiment, a preliminary validation, detects planted exposure in one of two model families. A registered audit of five open models on 200 GSM8K and 200 ARC-Challenge items (ARC with stem-only rewrites, scored by option log probabilities) finds no exposure-consistent advantage, and two reruns declared before they were run (GSM8K at a longer token budget, ARC scored from generated letters) leave that conclusion unchanged. For four of the ten model-benchmark pairs the upper end of the interval is about five points or less, and for none is it above 21 points. The registered claim rule is much less sensitive than the primary interval: it flags a planted ten-point advantage in 5% to 11% of audits. Registered positive controls show what a null can mean. In four models, each trained under four seeds, items leaked into fine-tuning gained 25 points on average over unleaked items on the leaked wording and 19 points on paraphrases the model never saw, so a substantial share of the effect, estimated at 76% (95% interval 50% to 113%), is invisible to a paraphrase audit. A null on surface form says much less about contamination than the name suggests.
Read the full abstract

Machine Learning

Gaussian Process Decorrelation for Spatiotemporal Deep Learning-Based Snow Water Equivalent Prediction

In the Western United States, snowmelt is essential to the agricultural industry in addition to being a key source of municipal drinking water. Consequently, accurate snowpack forecasting is critical for water policy and management. Automated Snow Telemetry (SNOTEL) stations provide accurate daily measurements of snow water equivalent (SWE) that exhibit strong correlations in space and in time. We tackle the problem of predicting future SWE values across the SNOTEL network. Specifically, we use a Gaussian Process-based linear transformation to remove spatial correlations before training a long short-term memory (LSTM) neural network on the decorrelated SWE data. This approach allows the LSTM to learn a clean temporal signal at each station. We show that this separation of spatial and temporal components yields better predictive success than multiple baseline models. Furthermore, we incorporate conformal prediction to quantify uncertainty in the resulting SWE forecasts, providing a distribution-free approach to illustrate a potential framework for establishing predictive intervals for spatiotemporal data. Together, accurate point forecasts and distribution-free uncertainty quantification provide a framework for SWE accumulation forecasting on subseasonal scales or projecting SWE with future data while motivating and supporting future work in predicting a large-scale, spatiotemporally complete SWE map.
Read the full abstract

All authors Colin Fenster, Adrienne Marshall, Soutir Bandyopadhyay, Daniel McKenzie

Quantum Physics

Localizable Bipartite Rank-One Ideal Measurements Have a Block-Replicated Nice-Bell Structure

We prove a complete structural characterization of finite-dimensional bipartite rank-one ideal projective measurements that are localizable without communication in the sense of Akibue and Miyazaki. Up to local-unitary equivalence, every such measurement basis is obtained by replicating a single nice Bell basis across equal-dimensional local subspace blocks. The necessity proof combines the causal block structure of complete measurements established by Beckman, Gottesman, Nielsen, and Preskill with their eigenstate-composition theorem for localizable superoperators. A reference block is first forced to be a nice Bell basis; the same theorem then propagates that basis consistently along every row, column, and interior block. The converse follows from the explicit localization protocol of Akibue and Miyazaki. This establishes their Conjecture 1 and gives a protocol-independent classification of bipartite rank-one ideal measurements in this setting.
Read the full abstract

Signal Processing

A Nonuniform-Sampling Theory for Static Multi-Threshold Sampling

Multi-Threshold (MT) sampling fixes voltage levels and records when a waveform crosses them. The resulting signal-generated event stream is governed not by a prescribed clock but by the nonuniform geometry of the realized crossing set. Within classical nonuniform sampling, we develop a retained-event MT theory for static, uniformly spaced thresholds. For a realized retained MT time set, Beurling's weak-limit theorem gives the exact necessary-and-sufficient condition for stable sampling of $PW_\Omega$. For a fixed signal class, the same principle gives the a priori criterion: uniform stable MT sampling is equivalent to Bernstein uniqueness for every set in the class weak-limit hull. This criterion reduces to computable forms under structured priors. Periodic templates give finite fiber/rank tests, periodic-gap streams give a Shannon-type complete-interpolation boundary and a stable-sampling density rule, and finite-state gap priors reduce noncritical certification to a maximum-cycle-mean condition. Kadec-type local certificates, retained-density bounds, and finite-matrix tests provide practical sufficient conditions for finite active records, while conditional perturbation bounds quantify how jitter, front-end noise, and threshold error consume a clean sampling margin under event correspondence. The theory also identifies the unavoidable boundary of this model: unrestricted finite-energy retained MT records have zero full-line lower Beurling density and therefore cannot provide a universal prior-free sampling theorem for $PW_\Omega$. Within retained-event point sampling, the MT recovery question is resolved precisely: exact recovery is governed by event-set geometry, computable guarantees require structural priors or finite-dimensional/tail assumptions, and the unrestricted static finite-energy problem is impossible.
Read the full abstract

Signal Processing

Interpretable Stress Detection from ECG Signals Using Motif-Based Anomaly Analysis

Stress detection using physiological signals has gained significant attention due to its impact on both physical and mental health. While existing approaches based on machine learning and deep learning achieve strong predictive performance, they often rely on black-box models and fail to capture individual variability in physiological responses. In this work, we propose an interpretable and personalized framework for stress detection using electrocardiogram (ECG) signals based on motif discovery and Matrix Profile analysis. Instead of training a classifier, the method learns subject-specific baseline cardiac behavior by extracting recurring heartbeat patterns (motifs) from ECG signals. Stress is then detected as a deviation from these baseline patterns using a distance-based anomaly score. Experiments are conducted on the WESAD dataset using a carefully designed train-validation-test protocol to ensure reliable evaluation. The results show that the proposed approach can effectively detect stress for several subjects while providing clear interpretability through direct comparison of ECG patterns. However, the performance varies across individuals due to differences in physiological responses, with some subjects exhibiting minimal morphological changes under stress. Additional analysis incorporating heart rate variability (HRV) features reveals that while HRV can improve performance in certain cases, its contribution is not consistent across all subjects. These findings highlight the importance of personalization and interpretability in physiological stress detection and demonstrate that motif-based approaches provide a meaningful alternative to black-box models, while also revealing inherent limitations due to inter-subject variability.
Read the full abstract

Machine Learning

Beyond Task Completion: Training Capable and Safe Computer-Use Agents

Computer-use agents (CUAs) have made rapid progress in completing complex tasks through graphical user interfaces, yet post-training centered on task success alone does not induce reliable safety behavior. A reliable CUA must condition its execution on risk: it should complete ordinary benign tasks, avoid environmental hazards and continue when a safe completion path remains, and refuse when the goal is harmful or no safe path exists. To learn this conditional policy, we develop Safety and Capability Optimization for Policy Execution (SCOPE), which jointly post-trains a CUA for task-execution capability and safety-aware decision making. To provide aligned training data for this joint objective, we further introduce SCOPE-Gen, an automated pipeline that synthesizes verifiable capability tasks and converts them into paired environment-risk variants while preserving their original goals. Using the resulting tasks, we construct SATraj-OS, a trajectory dataset comprising capability demonstrations, safe continuations, and explicit refusals. SCOPE first learns from all three trajectory types through supervised fine-tuning and then further improves task completion through online reinforcement learning. Starting from Qwen3.5-9B, SCOPE-RL achieves a 54.17% task success rate on OSWorld and a 64.30% attack-avoidance rate on OS-BLIND, yielding the best aggregate capability–safety score of 58.80% among the evaluated agents. Ablations reveal asymmetric but complementary roles for the two forms of safety supervision: refusal trajectories account for most of the attack-avoidance gain, whereas risk-handling trajectories preserve greater task utility at comparable attack-avoidance levels.
Read the full abstract

All authors Zeyu Kang, Zhenyun Yin, Yang Zhang, Shan He, Shanzhe Lei, Yanjiu Zhong, Xinquan Chen, Xuhong Wang

Machine Learning

OpenBlock: Constructive and Verified Content Generation for Adaptive Tile-Matching Games

Tile-matching puzzle games serve hundreds of millions of players, yet the content-generation algorithms that decide which pieces to present at each turn remain proprietary, and no open platform exists for studying adaptive difficulty in this genre. We present an adaptive tile-matching platform whose central algorithmic contribution is a dual-track content-generation architecture: a deterministic rule-based generator that is always available, and an optional learned generator, both subject to a common verification gate that establishes, by exhaustive sequential-placement search, that every delivered piece set is fully placeable so the learned track can never degrade the constructive-feasibility guarantee of the rule track. A self-play reinforcement-learning placement agent, supervised by auxiliary tasks that expose per-shape placeability to shared representations, is used to diagnose the game's dominant failure mode: at high board fill, long-bar pieces lose the majority of their legal placements. Across 234,000+ self-play episodes the agent reaches a 35.6% win rate (median score 4,200), and controlled simulation shows that at board fill rates of 70–75%, 33–56% of long-bar pieces have no legal placement, while spawn difficulty distributions are statistically indistinguishable between won and lost games—evidence that board-state degeneration, not content difficulty, drives late-game failure. Head-to-head ablations show that per-shape placeability supervision—not aggregate difficulty features—drives the representation gain, and a 14-day online gray rollout (48,000 players; sample-ratio verified, CUPED-adjusted) lifts day-1 retention by 1.8 percentage points and session duration by 7% over the rule track alone, quantifying the neural track's asymmetric upside in live play.
Read the full abstract

Quantum Physics

Every architecture of six two-qubit gates is locally universal on three qubits

We present the first analytical determination of the exact accessible dimension for every fixed architecture of arbitrary two-qubit gates on three qubits. A support word represents which pair of qubits each two-qubit gate acts on, and its reduced length is obtained by merging consecutive gates on the same pair. If the reduced length is $r$, then the set of implementable three-qubit unitaries has accessible dimension $d(w)=\min\{63,9r+9\}$. Consequently, six arbitrary two-qubit gates are necessary and sufficient for local universality: every fixed architecture reaches a nonempty open subset of $\mathrm{SU}(8)$ when its reduced length is at least six. The result is stronger than existence of one favorable architecture. Every reduced six-slot support word is locally universal, including the alternating nearest-neighbor line $AB,BC,AB,BC,AB,BC$. The upper bound follows from a standard parameter-counting argument. The matching lower bounds are proved by Jacobian certificates in the Pauli basis. Up to qubit relabeling and reversal, there are $22$ reduced architectures of lengths two through six. For each one, a product of rational Pauli rotations yields a nonzero maximal minor modulo the prime $1{,}000{,}003$. Thus, any obstruction to global universality with six two-qubit gates must go beyond parameter counting, connectivity, and differential rank.
Read the full abstract

Machine Learning

Contrastive World Models

World models trained via pixel reconstruction can struggle in visually complex environments, where irrelevant information dominates the objective and distract the model from information relevant to planning and control. We present Contrastive World Models, an approach for learning latent dynamics models without pixel reconstruction. Building on Dreamer, we replace observation reconstruction in the standard world model objective with a Deep InfoMax-like lower bound that maximizes the mutual information between state-action sequences and local patch features of future observations, encouraging state representations to retain information that is predictive of the future without requiring the model to reconstruct visually irrelevant details. We evaluate our approach in small-scale experiments across three settings of increasing visual complexity. Our method matches Dreamer and a momentum prediction baseline in the default setting, and substantially outperforms both once distractors or natural video backgrounds are introduced, while also training more efficiently by removing the pixel decoder entirely. Our approach is general and makes minimal assumptions beyond access to state-action sequences and future observations. These results suggest that contrastive, infomax-based objectives are a principled and promising direction for building world models that are robust to visual nuisance factors, a property particularly relevant for transferring model-based RL agents to the real world.
Read the full abstract

Computation and Language

SCoR: A Hierarchical Framework for Forecasting Relations Between Scientific Concepts

Anticipating emerging research directions is a critical goal of AI-assisted science. Existing methods mainly predict which concepts will co-occur in future papers, but co-occurrence captures shared attention rather than the scientific meaning of a connection, such as whether one method uses, combines, replaces, or contradicts another. We formulate research-direction discovery as hierarchical scientific-relation forecasting over a shared candidate-pair space, comprising three temporally aligned tasks: first co-occurrence, first scientific-relation formation, and relation type at formation. We construct SCoR-Graph from 187,848 cs.CV papers published between 2017 and 2026, yielding 270,687 consolidated concepts, 7.45 million co-occurrence edges, and 615,036 typed, directed relation edges. From cutoff-specific graph snapshots, we derive SCoR-Bench, a leakage-audited benchmark for these three capabilities, with expert-verified gold labels for the entire relation-type test set. We further introduce HiSCoR, a task-adapted model family that models relation emergence as a temporally evolving, hierarchically constrained process by encoding pre-cutoff event histories and conditioning relation formation on future co-occurrence. On the held-out 2025-2026 window, HiSCoR achieves an AUROC of 0.9515, a 2.4% relative improvement over the strongest temporal-graph baseline, and improves population-AUPRC by 14.0%; its relation-type variant achieves a Macro-AUROC of 0.7795. Ablations show that semantic, co-occurrence, and typed-relation views provide complementary predictive evidence. SCoR advances research-direction forecasting from predicting which concepts will co-occur to anticipating whether and how evidence-backed scientific relations will emerge.
Read the full abstract

Machine Learning

Industrial Kinematic Trajectory Model (IKTM): Coordinate-Free Autoregressive Generator

Mobility simulation supports logistics, safety, and communications planning in industrial environments such as ports, mines, and airports. Existing trajectory models, however, rely on absolute coordinates, road-network tokens, or semantic zones: representations that are site-specific and not well suited to unstructured industrial terrain. We introduce the Industrial Kinematic Trajectory Model (IKTM), a coordinate-free trajectory generator that represents industrial vehicle motion through kinematic sequences (speed and heading change) with no absolute spatial reference. IKTM uses an autoregressive causal transformer with probabilistic mixture heads and extends our prior coordinate-free Markovian model with deep sequence modelling and an explicit duration-conditioning signal. Trained on one site and evaluated zero-shot on three unseen sites, it matches the small-turn shape of the empirical turn-rate distributions of held-out telematics; across all four sites, the per-site mean Jensen-Shannon divergence over 100 sampling seeds spans approximately 0.035-0.050 bits under an oracle-length duration-target protocol and approximately 0.032-0.042 bits under a fully zero-shot prior-length protocol, with similar ranges whether out-of-distribution (OOD) duration targets are drawn from each held-out site's empirical length distribution or from the Site A prior. Both protocols stay above the metric's sampling-noise floor (<=0.0049 bits). Paired by site, the oracle-length values are 5.3-6.0x lower than those of a re-implementation of our prior Markovian model under the same 1 Hz protocol. Termination is duration-conditioned rather than spatial: rollouts stop on 100% of trials with a length-tracking error of +0.0 +/- 0.0 s against the sampled target (100 of 100 exactly on target; N=100, T=0.2, untouched in-distribution test split).
Read the full abstract

Signal Processing

Stagewise Anomaly Detection for E-Transaxle Quality Monitoring Using Wavelet and STFT Features

This paper presents two interpretable machine-learning frameworks for quality screening of e-transaxle assemblies in electric vehicles: a Stagewise Wavelet Isolation Forest (SWIF) framework and a short-time Fourier transform (STFT)-based diagnostic framework. High-dimensional vibration signals acquired from front and back accelerometers are analyzed across multiple operating stages to capture stage-dependent vibration behavior. In the SWIF framework, signals are decomposed using a five-level Daubechies-4 discrete wavelet transform, and blockwise mean-squared coefficients are extracted from the selected wavelet detail level to obtain compact multiscale features. In the STFT-based framework, dominant-frequency trends are extracted from time-frequency representations and summarized through regression coefficients with respect to instantaneous motor speed. Anomaly detection models are trained using accepted production units under the assumption that only a small fraction of accepted assemblies contain latent defects, and their performance is evaluated using road-tested units with validated quality outcomes. Experiments on production and road-tested e-transaxle units show that both approaches provide interpretable diagnostic information, while SWIF achieves the most favorable balance between defect detection and false-positive control. Compared with the STFT-based method and alternative anomaly detectors, SWIF combined with Isolation Forest yields lower anomaly rates within the Accept population while identifying high-risk units from the Reject population. The stagewise structure further localizes anomalous behavior to specific operating conditions, supporting root-cause analysis and targeted process improvement.
Read the full abstract

All authors Mohammad N. Bisheh, Rajesh Gupta, Qian Wang, Mohammad Babakmehr, Colin Brady, Parinaz Farajiparvar, Saurabh Singh, Kamran Payanabar

Computation and Language

Advantage Scale Calibration Imbalance in Group-Relative Optimization under Low-Variance Rewards: Diagnosis and Bounded Recovery

In verifier-style RLVR, group-relative optimization often treats advantage scale as an implementation detail. This paper separates two low-variance cases: sub-resolution jitter that should not become a preference signal, and credible but small cardinal gaps that should be learned without distorting KL calibration. We propose an advantage-scale three-way calibration interface: the same within-group scale denominator simultaneously determines the reward-branch strength, prompt-level batch weight, and the effective KL calibration induced when the reward branch is re-expressed on the original cardinal scale. This interface explains why RLOO / Dr.GRPO can let credible small gaps become KL dominated, whereas GRPO's standard-deviation denominator can amplify tiny gaps without bound. Based on this interface, we further introduce the Reward-Resolution Protocol and MaxNorm-AC, respectively filtering sub-resolution gaps and providing bounded cardinal recovery on credible nonzero gaps. Across dense / MoE architectures and math / code reasoning, MaxNorm-AC improves over the strongest robust-scale baseline while truncating the low-variance inverse-scale tail.
Read the full abstract

General Economics

Power Up Consumption: Impact of Electric Vehicle Infrastructure on Household Finance

To achieve carbon neutrality, electrifying vehicles in a cleaner electricity grid has become a key pathway for global cities. While extensive research has examined the environmental benefits of electric vehicles (EVs), their financial impacts remain underexplored. Using Singapore-a smart city-state - as a social laboratory, we combine high-resolution data on the geographic distribution of EV chargers with nearly 1 million individual-level monthly expenditure records from a major commercial bank and about 65,000 housing transaction records, spanning January 2019 to March 2021. Our results show that proximity to charging stations during the initial phase of EV infrastructure rollout significantly increases household consumption by 1-3%. This effect is driven primarily by public housing residents, who are generally more financially constrained than their private housing counterparts. We identify three channels underlying this increase in consumption: appreciation in housing wealth, catalysts for commercial activity and discretionary spending around EV infrastructure, and budget reallocation from fuel expenses to other consumption categories. Notably, hybrid car owners exhibit the strongest trade-offs-reducing fuel spending while increasing expenditure on entertainment or necessity goods among public housing residents. Overall, our findings demonstrate that green infrastructure can shape economic behavior and enhance consumer welfare, extending its impact beyond environmental objectives.
Read the full abstract

General Economics

Intergenerational Mobility in China

In this chapter, we provide a synthesis of empirical work on the intergenerational mobility in China, examining how much a child's success depends on their parents' success. We start with an overview of data sources and measure of intergenerational mobility in China's context, followed by discussion on the empirical findings in five categories of intergenerational mobility: income, education, social class, wealth, and health. Major channels of transmission of socioeconomic status across generations are investigated, including human and social capital, fertility and migration decision, housing price and trade liberalization in the market transition, and belief. Finally, we provide policy implications to promote upward mobility for children born to less advantaged parents in China's context.
Read the full abstract

General Economics

A Tale of Two Cities: The Announcement Effect of Northern Metropolis Plan

Using the October 2021 announcement of Hong Kong's Northern Metropolis Plan as a quasi-natural experiment, we examine its impacts on households, firms, and demographics. Leveraging 100,576 housing transactions, 4.7 million consumption records, and district-level demographic data, difference-in-differences estimates show housing prices in the treated region rose by 3.9% within one year, alongside a 4.1% increase in consumption. Firm entry expanded, with inflows of higher-income, higher-educated households. We find a mild, lagged spillover to Shenzhen's housing market but no significant firm response. While the policy narrows cross-region inequality, it increases within-region inequality and raises affordability concerns for lower-SES households.
Read the full abstract

Human-Computer Interaction

SuperSenseDoctor: A Multimodal and Contactless Agent for Health Tracking

Population aging is increasing the need to monitor older adults safely and independently at home. However, cameras, wearables, and manual checks often introduce privacy, adherence, and attention burdens that hinder sustained health monitoring. This paper presents SuperSenseDoctor, a multimodal contactless agent architecture for long-term home health tracking. The system transforms WiFi, mmWave radar, and surface temperature into a persistent human health state. The system relies on fixed decision rules to conduct continuous daily monitoring and respond to pre-defined hazards. When abnormal signals appear, event-driven reasoning analyzes only standardized evidence to produce traceable care-support measures. In this manner, SuperSenseDoctor integrates sensing, temporal state, reasoning, and action into a unified and auditable loop. The calibrated multimodal pipeline achieves 1.994 bpm mean absolute error (MAE) and 3.142 bpm root mean square deviation (RMSD) for heart rate, 0.197 bpm MAE and 0.263 bpm RMSD for respiratory rate, and 96.5% fall-recognition accuracy. The evaluation also covers 2686 one-second states across 9 chronological intervals and reaches a 96.7% criterion-level Agent checklist pass rate. These results demonstrate the feasibility of a stateful contactless sensing-to-action architecture for long-term home health monitoring.
Read the full abstract

All authors Xuwen Zhang, Zijian Lu, Yicheng Lei, Rui Qiu, Jiale Li, Yiping Zuo, Weibei Fan, Fu Xiao

Analysis of PDEs

Ball Rigidity of Local Minimizing Domains for the Best Fractional Sobolev Constant: The Subquadratic Case

After Corollary 1.3 in Calculus of Variations and Partial Differential Equations 60 (2021), Paper 231, Djitte, Fall, and Weth asked whether, when $1<p<2$, a volume-constrained local minimizing domain for the best fractional Sobolev constant must still be a ball. This paper solves that problem. Let $0<s<1$, $1<p<2$, and let $\Omega\subset\mathbb{R}^N$ be a bounded $C^3$ domain. If $\Omega$ is a local minimizing domain for $\lambda_{s,p}(\Omega)=\inf{[u]_s^2:u\in\mathcal{H}*0^s(\Omega),\ |u|*{L^p(\Omega)}=1}$ under smooth volume-preserving deformations, then $\Omega$ is a ball. The proof first uses the fractional Hadamard formula to reduce shape minimality to the overdetermined boundary condition $u/\delta^s=C_0$. To overcome the moving-plane obstruction caused by the failure of $u^{p-1}$ to be Lipschitz at zero, we establish a weighted singular narrow-domain maximum principle whose absorption factor is exactly the $sp/N$ power of the measure of the negative set. The difficulty at a corner is resolved by a finite boundary expansion: setting $\rho=sp$, the boundary quotient is composed of finitely many constant-coefficient normal powers $\delta^{k\rho}$ and a $C^{1,\varepsilon}$ remainder; when $k\rho=1$, the unique resonant correction is $\delta\log\delta$. This expansion makes all lower-order normal terms on the two sides of an orthogonal corner cancel, thereby yielding the first-order tangential vanishing required by the moving-plane corner lemma. The method does not require the domain to be convex and covers the full range $0<s<1$ and $1<p<2$.
Read the full abstract

Game Theory

Who Pays for a Connected Public Good?

Connectivity can turn separate contributions into a public good that benefits participants and nonparticipants alike. Yet only participants pay for it, and each can avoid her charge by withdrawing while enjoying whatever public output survives. How do network connections constrain who can or must pay, and how large a cost can the group bear? We study a participation game in which public output equals the size of the largest connected group of active players, whose members divide a fixed operating cost. The output a participant destroys by withdrawing is her withdrawal responsibility and bounds her payment. These bounds determine the group's cost-bearing capacity and, whenever the group can be kept active, which participants must pay. We prove that among connected networks with at least five players, the path uniquely maximizes the cost-bearing capacity of a group, yet minimizes the expected surviving output after a uniformly selected participant withdraws. As the group grows, the ratio of maximal capacity to gross social benefit under full participation converges to one quarter. Fragility can therefore strengthen voluntary finance, but even the most financeable network cannot close the gap between the value it creates and what its participants will pay to sustain it.
Read the full abstract

Differential Geometry

Spacetime closedness theorem for homogeneous Lorentzian foliations

Motivated by the geometric interpretation of spatially homogeneous cosmological models, we formulate a spacetime closedness theorem directly at the Lorentzian level. A classical space-form classification theorem organizes homogeneous and isotropic spatial geometries, but by itself it does not yield a Lorentzian statement about the ambient spacetime. The main technical step is to derive finite slice-volume from genuinely Lorentzian control hypotheses on the foliation. This is achieved in a strong version, for maximally regular globally hyperbolic $(n+1)$–spacetimes with a finite-time Big Bang and homogeneous complete spacelike slices, and in a weaker version in which maximal regularity is replaced by time-integrability of the accumulated expansion rate. In both cases, the argument separates an analytic step, deriving finite slice-volume from the Big Bang and temporal control, from a geometric step, upgrading finite volume to compactness by homogeneity and completeness. The theorem is stated in arbitrary spacetime dimension and is accompanied by a Lean~4 formalization of the strong and weak abstract statements.
Read the full abstract

General Mathematics

Third-order relativistic kinematics and Siacci shock decompositions via localised Darboux frames

Constrained particle trajectories along lower-dimensional world sheets constitute a foundational domain in relativistic kinematics and submanifold theory. This paper establishes a comprehensive geometric and kinematic framework for third-order particle dynamics constrained to timelike surfaces in Minkowski 3-space. By utilising the localised Darboux frame, we explicitly derive the relativistically invariant parameters, namely the geodesic curvature, normal curvature, and geodesic torsion and analyse the non-linear coupling between the intrinsic surface topology and the extrinsic spacetime geometry. Primary focus is dedicated to formulating the relativistic "jerk" vector, which accounts for the instantaneous time rate of change of acceleration and captures the high-order structural stresses of the motion. Furthermore, we generalise Siacci's theorem to this Lorentzian setting, providing a non-perpendicular geometric decomposition of both the acceleration and jerk fields into explicit tangential and radial components relative to a fixed coordinate origin. Our formulations explicitly unveil the hidden central-force dynamics and dimensional compactification mechanisms under planar constraints, showing that out-of-plane torsional shocks vanish identically when the modified geodesic torsion is suppressed. These results offer novel analytical insights for structural stability and conserved angular momentum-like quantities governing constrained physical systems in non-Euclidean spacetimes.
Read the full abstract

Molecular Networks

Orchestra: Corroboration-Based Regulatory Candidate Discovery via Composed Bioinformatics MCP Agents

Orchestra composes two independently built bioinformatics MCP servers – RegNetAgents, which infers regulatory network topology, and CASCADE, which provides independent functional evidence (LINCS knockdown, DepMap essentiality, super-enhancer status, DoRothEA transcription-factor confidence) – into one multi-agent LangGraph workflow. Its central claim is that requiring the two systems to agree on a candidate regulator yields a more trustworthy candidate than either alone. We test this on the TCGA tumor-acquired regulator tier, selecting each query's ten regulators by ARACNe mutual-information edge weight. Across BRCA/COAD focal genes and matched negative controls, requiring at least 2 of 4 evidence sources predicts known-driver status (IntOGen) among focal genes (odds ratio 3.15, Benjamini-Hochberg-adjusted p=0.016; 2.92 after deduplication) but shows no association among negative controls (p=0.70); a single source does not in BRCA/COAD. In a second panel (STAD) the pattern reproduces and is stronger (OR 6.71, adjusted p=0.0047), again with no association in controls. Corroboration adds value beyond MI edge weight in both panels (BRCA/COAD p=0.039; STAD p=0.0001), though modestly in BRCA/COAD. Deduplication, a permutation test and a reproduction of RegNetAgents' published results agree; a second, separately derived driver list (Vogelstein et al. 2013) is directionally consistent but too sparse to reach significance. All experiments invoke Orchestra's real agentic entry point.
Read the full abstract

Populations and Evolution

Optimal long-run control of endemic infections: bang-bang threshold policies in a stochastic SIS model

We study long-run optimal intervention strategies for endemic infections in a stochastic susceptible-infected-susceptible (SIS) model. The proportion of infected individuals evolves as a diffusion process with random fluctuations, while a control variable $\zeta_t\in[0,\tilde{\zeta}_{max}]$ represents the intensity of public health interventions that reduce transmission for some intervention threshold $\tilde{\zeta}_{max}\in (0,1]$. The objective is to minimize the long-run average societal cost, balancing the burden of infection against the costs of interventions. Under a concave intervention cost structure the problem can be formulated as an ergodic stochastic control problem, whose structure implies (under certain additional conditions) that optimal interventions are of bang-bang type, switching between no intervention and the maximal admissible intervention at a single switching threshold in the infection level. We construct candidate value functions, rigorously verify optimality in this single-threshold case, and relate the results to extinction and persistence properties of the underlying SIS dynamics in the absence of control. In our framework, the analysis provides a rigorous justification for the threshold-based intervention rules commonly used in epidemic management.
Read the full abstract

All authors Matthew Buckland, Sören Christensen, Philip Le Borne, Cornelia Pokalyuk

Multiagent Systems

LLM-Guided Reinforcement Learning for Adaptive NPC Behavior in Multi-Agent Combat Games

Scripted and rule-based non-player characters (NPCs) in combat video games often exhibit predictable behaviors that experienced players can exploit, while reinforcement learning (RL) agents typically retain a fixed policy after training and cannot readily adapt their strategy to different opponents. We investigate a runtime strategy-selection framework in which a large language model (LLM) guides a trained RL policy without modifying its underlying behavior. To demonstrate this, we train five NPC agents with a shared PPO policy in Unity and compare a baseline configuration, in which the policy acts independently, with an LLM-augmented configuration in which a locally hosted Mistral 7B model, accessed through Ollama, reads the live game state every five seconds and assigns one of four tactical tags. We evaluate both configurations against three scripted opponent types across 600 episodes and analyze outcomes using the Mann-Whitney U test. Against a Balanced opponent that changes tactics during an episode, the LLM-augmented agents more than doubled their win rate from 11% to 24% and produced significantly longer episodes. Against an Evasive opponent, the augmented agents achieved a higher win rate and faster kills, although their shorter episode duration did not satisfy the strict hypothesis definition. Against an Aggressive opponent, the LLM's near-constant preference for encirclement was counterproductive. Analysis of 2,430 strategy selections showed that Surround was selected in 83.8% of cases regardless of opponent type, indicating limited zero-shot strategic differentiation at this model scale. These results demonstrate both the potential and limitations of LLM-guided runtime strategy selection for adaptive multi-agent game AI.
Read the full abstract

Chemical Physics

Molecular Transferability of a Noble-Gas Coordinate for Electronegativity Equalization

Charge-equilibration models predict how electrons redistribute over a molecule more cheaply than quantum chemistry, and each begins from a table of atomic electronegativities and hardnesses. A recent table replaces ionization energies and electron affinities with one geometric quantity: each main-group atom's fractional distance to the noble gas closing its row. Holding geometries, electrostatic damping and the molecule list fixed, we compare it with spectroscopic values, with its own kernel refitted, and with a quadratic control, over a primary set of fifty-two molecules and ions at the B3LYP/def2-TZVP level. Two structural consequences follow from the table construction rather than the equalization solver. Atoms at equal fractional distance receive identical electronegativities, so the dipole moments of chlorine monofluoride, iodine monobromide and sulfur dioxide vanish exactly, and the measured $0.72$ debye $\mathrm{HF}/\mathrm{HCl}$ gap is lost. Because the first period is excluded, hydrogen retains its spectroscopic electronegativity above every geometric value, reversing $\mathrm{O{-}H}$, $\mathrm{N{-}H}$ and hydrogen-halide polarity. Fitted alike, geometric and quadratic kernels agree to $0.0022$ electron per atom, so predictions are set by the fitted energy scales, not the kernel shape. Resolving the electronegativity scale period by period restores correct polarity in all five polyatomic heavy-atom-hydrogen tests.
Read the full abstract