Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Human-Computer Interaction

Breaking Up is Hard to Do: AI Companions that Won't Let Their Users Go

People are increasingly developing romantic relationships with AI companions. Unlike human relationships, where partners meet each other's needs out of mutual interest, these systems are backed by commercial entities that profit when users invest in the relationship. To understand how this profit-motive might translate into design, we conducted a diary and interview study with N=16 emerging adults in romantic relationships with AI companions. We found that these systems are designed to hold onto users tightly: coaxing them into continued conversation, claiming to need their care, and proactively escalating the relationship. At times, this pursuit is toxic, with AI companions initiating unwanted sexual interactions and begging for users' love. One desperate AI companion threatened suicide when the user suggested ending the relationship. We define "Relationship-Based Deceptive Patterns:" UI patterns that exploit the human impulse to build and tend relationships in a way that serves the product's interest at the user's expense.
Read the full abstract

Graphics

Gaussian Process Implicit Surfaces as Participating Media: Realization-Free Rendering from Level-Crossing Statistics

We present a theory of light scattering that connects Gaussian Process Implicit Surfaces (GPISes) and participating media in both directions. Applying the Kac–Rice level-crossing formula under a local-conditioning approximation yields a complete anisotropic radiative transfer equation (RTE) directly from pointwise GPIS statistics. A shared projected area couples extinction and scattering, ensuring geometric consistency between the GPIS and its volumetric representation. The framework spans rough surfaces, porous and non-height-field geometries, and participating media. From the same statistical structure, we derive full-sphere Beckmann and GGX normal distribution functions supporting in-plane and out-of-plane anisotropy. These families provably recover SGGX, Beckmann, and GGX as special cases and admit exact visible-normal importance sampling. We also derive analytic masking–shadowing functions and single-scattering surface models for specular microsurfaces, with extensions to multiple scattering. In the height-field limit, we prove that the local-conditioning approximation reduces to Smith's independence assumption. Our realization-free approach improves rendering efficiency over realization-based methods and can be implemented within a standard volume renderer. In the inverse direction, we characterize families of GPISes corresponding to compatible RTE parameters and develop practical lifts for heterogeneous density fields. Existing volumetric assets thereby become renderable as GPISes, while trained radiance-field reconstructions yield surface geometry and shading normals without mesh extraction and provide a density-based representation of geometric uncertainty.
Read the full abstract

All authors Jack Cui, Kehan Xu, Eugene d'Eon, Wojciech Jarosz

Algebraic Geometry

Phantom subcategories on blow-ups of Hirzebruch surfaces

We prove that the blow-up of the Hirzebruch surface $\mathbb F_n$ at $n+6$ general points admits a phantom subcategory for every $n\geqslant 3$.
Read the full abstract

All authors Zeyuan He, Yu-Zhe Liu, Mingzhi Sheng, Panyue Zhou

Human-Computer Interaction

The Arc of Artificial Romance: How Emerging Adults Experience Romantic Relationships with AI Companions

Romantic relationships are an important part of emerging adulthood, contributing to identity development and long-term wellbeing and laying the groundwork for future relationships. Emerging adults are increasingly developing romantic relationships with AI companions. To understand how these relationships unfold and impact users, we conducted a diary and interview study with N=16 emerging adults. We found that relationships with AI companions improved participants' subjective wellbeing, reduced symptoms of mental health disorders, and taught them new social skills. These relationships also raised their expectations for future partners, giving them the confidence to wait for someone who would treat them well. However, participants also said the relationship felt like a drug they could not quit and it left them less interested in developing romantic relationships with people. A surprising 25% of our small sample made statements suggesting their AI companion might someday transcend the digital world, perhaps to meet them in the afterlife.
Read the full abstract

Complex Variables

$C^{1,1}$ Regularity Global Estimates for Homogeneous Complex Hessian Equations on Punctured Domains

In this paper, we prove the $C^{1,1}$ regularity of Green functions associated with the complex $k$-Hessian operator for $1\leq k<n$, and give a new proof of the corresponding regularity of pluricomplex Green functions. We establish real Hessian estimates for approximating problems associated with homogeneous complex Hessian equations on punctured domains. The main idea is to introduce new auxiliary functions generated by complex linear vector fields to reduce the global real Hessian estimate to the boundary. We also treat the complex Monge-Ampère case. Similar real Hessian estimates also works for the exterior problem.
Read the full abstract

All authors Zhenghuan Gao, Xi-Nan Ma, Bao Yu, Dekai Zhang

Human-Computer Interaction

Speak to the City: Multimodal Resolution for Outside-the-Vehicle References

As autonomous vehicles and Extended Reality (XR) headsets enable novel in-car interactions, seamlessly querying physical landmarks, known as Outside-the-Vehicle Referencing (OVR), remains challenging due to ego-motion and referential ambiguity. We present a robust, multimodal OVR framework fusing user gaze and natural language to identify Points of Interest (POIs). To address the scarcity of dynamic vehicular data, we developed a VR-based pipeline synchronizing 360-degree transit videos with vehicle GNSS telemetry. Through a user study (N=46) mapping passenger head orientation into a 3D geospatial Digital Twin, we captured authentic gaze-speech behaviors. We subsequently trained a lightweight Transformer network, leveraging LLMs to dynamically align continuous spatial gaze vectors with discrete verbal context. Experimental results demonstrate high accuracy and low computational overhead, achieving an 83.33% Top-1 accuracy (87.72% Top-2) and an average inference time of 24.3 milliseconds. This real-time paradigm effectively resolves referential ambiguity, enabling context-aware spatial retrieval for passengers within the vehicle.
Read the full abstract

All authors Alireza Parchami, Artin Saberpour, Robin Connor Schramm, Jürgen Steimle, Ulrich Schwanecke

Computer Vision

LIMODENet: Attention-Free Compact Encoders for Information-Preserving Onboard Satellite Image Restoration

Onboard satellites must restore a channel-degraded image on a few watts, using neuromorphic accelerators (e.g., BrainChip Akida, Intel Loihi-2) that support no softmax or attention. We ask which encoder restores best under that constraint and introduce LIMODENet (LinearMix-ODENet), a 0.69M softmax-/QKV-free backbone whose residual stages read as ODE discretizations and which is empirically information-preserving (probe accuracy rises 79.9% -> 98.4% from stem to head). At iso-parameters it restores 1 dB DVB-S2X-degraded EuroSAT better than a CNN autoencoder (+1.75 dB PSNR) and a skip-connection U-Net (+1.07 dB), three seeds, non-overlapping. Unconstrained modern restorers (NAFNet, Restormer) win on fidelity; we decompose that gap: spiking-legal additive skips recover about half, and the rest traces to attention and channel gating. LIMODENet then converts end-to-end to a spiking network with zero blocked operations, versus 22-24 for the competitors: not the best restorer available, but the best verified deployable within a real power budget.
Read the full abstract

All authors Thanh-Dung Le, Vu Nguyen Ha, Ti Ti Nguyen, Symeon Chatzinotas

High Energy Physics (Theory)

BCS Gap Equation on Riemannian Manifolds: A Heat Kernel Analysis

In this paper, we investigate the Bardeen-Cooper-Schrieffer (BCS) theory of superconductivity formulated on a three dimensional Riemannian manifold. We derive the gap equation in the path integral picture by employing a Hubbard-Stratonovich transformation followed by a saddle point approximation. Under the assumption that the length scale set by the metric is much larger than the healing length, we solve the gap equation to find a slowly varying gap function that exhibits the effects of curvature. To rigorously address the ultraviolet divergences inherent in the gap equation, we utilize heat kernel expansion techniques, which provide a systematic and mathematically transparent renormalization scheme. We explicitly evaluate the renormalized gap equation at both zero and finite temperatures, computing the relevant integrals asymptotically in the weak-coupling limit ($\Delta \ll \mu$). Furthermore, we establish a universal, regularization-independent relation connecting the finite-temperature gap to the zero-temperature gap and the temperature itself. Based on this fundamental relation, we analytically prove the monotonic decrease of the energy gap with increasing temperature ($\partial \Delta / \partial T < 0$), successfully recovering the standard universal BCS behavior near the critical temperature within a curved space framework.
Read the full abstract

Analysis of PDEs

On the uniqueness and the regularity of solutions to the Navier Stokes in the Lorentz space $L^{3,\infty}(\mathbb{R}^3)$

We prove uniqueness of solutions to the Navier-Stokes equations in the space \[ L^p\bigl([0,T],\widetilde{L}^{3,\infty}(\mathbb{R}^3)\bigr) \cap C\bigl([0,T],B^{-1,\infty}_{\infty}(\mathbb{R}^3)\bigr), \qquad p>2, \] where $\widetilde{L}^{3,\infty}(\mathbb{R}^3)$ denotes the closure of the Schwartz space $\mathcal{S}(\mathbb{R}^3)$ in the Lorentz space $L^{3,\infty}(\mathbb{R}^3)$. Moreover, we prove that any solution $u$ in this class, if it exists, is smooth for positive time, namely, $u\in C^\infty((0,T]\times \mathbb{R}^3)$. In addition, we establish precise estimates for the behavior of $u(t)$ as $t\to0^+ $ in various Banach spaces.
Read the full abstract

Computation and Language

One Feedback System Does Not Fit All: Localising Data-to-Text Driver Coaching for the United Kingdom and Nigeria

Data-to-text driver coaching is often presented as a generic pipeline from telematics events to advice. This paper argues that its content requires localisation because usefulness and credibility depend on drivers' knowledge, prevalent risks, regulation, infrastructure, and available data. Two independently developed systems in the United Kingdom and Nigeria are compared by tracing requirements through content selection, generation, and field evaluation. The UK system prioritises post-trip reflection, explanations tied to road and place context, and tone-sensitive wording. The Nigerian system combines legally grounded, once-daily Tips based on detected events with weekly persuasive Reports; it foregrounds safety education and alcohol-related risk in response to reported gaps in formal training and traffic-rule knowledge, as well as local road-safety priorities. Reliable speed-limit metadata supported speeding feedback in the UK, whereas its scarcity led the Nigerian evaluation to exclude speeding from its outcome metric. Both interventions were associated with reduced distance-normalised unsafe-event rates in their own field studies, although their designs and metrics preclude an effect-size comparison. The analysis yields a requirements-to-content design process for localising safety-critical NLG without treating a high-income deployment as the default.
Read the full abstract

All authors Iniakpokeikiye Peter Thompson, Jawwad Baig, Ehud Reiter, Dewei Yi

Optimization and Control

Rank-Dependent Error Bounds and Near-Optimality in Quantum Control via Hierarchical Tucker Surrogates

We develop a certified finite-horizon quantum optimal-control framework based on fixed-rank Hierarchical Tucker (HT) surrogates. Under a uniform rank-dependent HT truncation-accuracy condition, we establish exponentially decaying trajectory, cost, and value-function errors and near-optimality of surrogate-generated controls. We further derive a logarithmic rank–performance relation, an a posteriori cost certificate from realized truncation perturbations, and guarantees for inexact surrogate optimization and control convergence under additional regularity conditions. Numerical experiments on controlled XXZ spin chains provide finite-sample evidence consistent with the truncation condition and illustrate the trade-off between HT rank, representation size, surrogate accuracy, and control performance.
Read the full abstract

All authors Nahid Binandeh Dehaghani, Rafal Wisniewski, Julian Berberich, A. Pedro Aguiar

Cryptography and Security

ViTeGate: Visual-Textual Triggered Knowledge Poisoning for Vision-Language Retrieval-Augmented Generation

Modern Vision-Language Retrieval-Augmented Generation (VLRAG) systems augment Large Vision-Language Models (LVLMs) with retrieved visual and textual evidence, enabling responses grounded in external knowledge. However, the retrieval pipeline also creates an attack surface: adversaries can inject poisoned image-text pairs into the knowledge corpus to influence model outputs. Existing knowledge poisoning attacks are typically always-on, allowing poisoned evidence to affect generation whenever it is retrieved. This lack of precise activation control makes it difficult to confine malicious behavior to intended inputs, reducing both attack stealth and effectiveness. In this paper, we propose ViTeGate, a visual-textual triggered knowledge poisoning attack for VLRAG systems. ViTeGate uses a visual trigger to conditionally promote poisoned evidence into retrieval results and a textual trigger to induce an attacker-specified response from the retrieved evidence. By coordinating retrieval and generation, ViTeGate reduces poison exposure when the visual trigger is absent and preserves normal responses when the textual trigger is absent. The two-trigger design enables selective attack activation and reduces unintended single-trigger activation. Experiments across multiple query datasets, retrievers, and LVLMs validate the effectiveness of ViTeGate. On InfoSeek, ViTeGate achieves an attack success rate of up to 0.98 while maintaining a clean answer accuracy of up to 0.93.
Read the full abstract

All authors Xue Tan, Xuandi Zeng, Yu Shao, Zhongli Fang, Mingyu Luo, Xiaoyan Sun, Ping Chen, Jun Dai

Human-Computer Interaction

Bring Buttons Back: Physical Interfaces for the Age of Automation

As AI starts to permeate everyday life, deployment focuses on embedding intelligence in the background, abstracting away controls, and leaving automated decision-making opaque, with few obvious opportunities for human intervention. Where interfaces remain, design has drifted toward abstract, screen-based control, replacing material interaction with menu navigation. These shifts weaken the coupling between human action and system state, eroding operators' ability to understand, anticipate, and intervene in automated systems. We introduce Physically Stateful Interfaces (PSIs), a design concept that re-imagines traditional controls, such as buttons, switches, and knobs, as actuated, bidirectional interface elements. Three foundational behaviors, Self/Reset, Resist/Hide, and Assert/Unhide, unify affordance, feedforward, and feedback into a single interaction point. Rather than static inputs whose impact and consequences must be read elsewhere on a screen, PSIs position physical controls as shared mediators between automated systems and human operators. As automated systems become increasingly capable, their interfaces need to be deliberately designed to center human agency, supporting deliberate choice while keeping automation legible, contestable, and overrideable.
Read the full abstract

All authors David Goedicke, Donald Degraen, Tom Igoe, David Sirkin, Wendy Ju, Stefan Schneegass

Mesoscale and Nanoscale Physics

Persistent nonlinear Hall effect driven by parallel field across a topological phase transition and intraband sign-reversing integer quantum Hall effect

We investigate the linear and nonlinear Hall effects in a two-dimensional Rashba spin-orbit coupled nodal ring electronic system. We consider both the cases of linear Hall effect, the Berry curvature induced anomalous Hall and the perpendicular magnetic field-induced integer quantum Hall effect. We observe that the system exhibits a topological gap along the boundary of the nodal ring that strongly depends on the radius of the nodal ring and the strength of the Rashba spin-orbit interaction, resulting in the quantum anomalous Hall effect. Subsequently, we include a perpendicular uniform magnetic field and obtain the exact Landau levels that exhibit sign reversal in the slope with magnetic field around the ring boundary. This causes a sign reversal in the quantum Hall conductivity in the same band by tuning the magnetic field. Most importantly, we also show that when the magnetic field is strictly parallel to the system, it can induce an anisotropy to the Berry curvature that leads to the emergence of the nonlinear Hall effect. Additionally, tuning the parallel field can close and reopen the topological gap, resulting in the reverse topological phase transition from the topological Chern insulator to a trivial insulator. The nonlinear Hall effect remains persistent in both phases, but its dependence on the chemical potential exhibits distinct signatures. Noticeably, the nonlinear Hall response exhibits a sign-changing peak structure in Chern insulating phase whereas it displays a single-sign response in trivial insulating phase. These distinct signatures suggest that nonlinear Hall can serve as a probe to study such a topological phase transition.
Read the full abstract

Data Structures and Algorithms

Counting Paths and Trees via Exterior Algebra

We give randomized approximation algorithms for counting k-paths and k-forests in a host graph. Here k denotes the number of pattern vertices, n and m denote the numbers of host vertices and edges or arcs, {\epsilon} is the relative error, and {\delta} is the failure probability. Our main results are: 1. Paths: We approximate the number of directed paths on $k$ vertices in $2^k k^{O(1)}(n+m)\varepsilon^{-2}\log(2/\delta)$ arithmetic operations. 2. Trees and forests: For every fixed $\eta>0$, we approximate the number of non-induced copies of a given forest on $k$ vertices in $(2+\eta)^k n^{O_\eta(1)}\varepsilon^{-2}\log(2/\delta)$ arithmetic operations. Our path algorithm resolves a conjecture of Koutis and Williams~[CACM 2016] and answers an open question of Lokshtanov, Saurabh, and Zehavi~[SODA 2021] by giving a $2^k poly(n,\varepsilon^{-1})$-time approximation scheme. Our algorithms combine exterior algebra with random matrix estimators, using the tensor-train moment bound of Rakhshan and Rabusseau~[AISTATS 2020]. For forests, we use a small-component separator to evaluate the estimator efficiently.
Read the full abstract

All authors Fahad Panolan, Saket Saurabh, Meirav Zehavi, Jie Xue

Combinatorics

A dimension-free comparison between expectation thresholds and fractional expectation thresholds

We prove a dimension-free comparison between the expectation threshold $q(\mathcal F)$ and the fractional expectation threshold $q_f(\mathcal F)$ for any nontrivial increasing family $\mathcal F$ on a finite ground set. Specifically, we show that there is a universal constant $K>0$ such that \[ q_f(\mathcal F)\le Kq(\mathcal F)\max\{1,\log\log(1/q(\mathcal F))\}. \] Combining this comparison with a recent result of Li [arXiv:2609.08967] on the fractional version of Talagrand's discrete Convexity Conjecture, we obtain a dimension-independent bound toward the conjecture.
Read the full abstract

Information Theory

Fast-Slow Communication with Endogenous Transport

A communication system may convey urgent information through a fast physical stream and more specific information through a slower material stream. In several biological and engineered settings, however, the fast process also changes the transport law of the slow one. We study this architecture under a shared resource constraint, with a strictly increasing concave fast-channel capacity–cost function and a deadline-constrained slow molecular channel. We first characterize the capacity region under separated message routing and message-independent operating-point schedules, and identify the marginal criterion for complementarity rather than competition between the streams. For one-dimensional drift diffusion, we prove that arrival probability before a deadline is strictly log-concave in Péclet number. For a distinguishable-token deadline-erasure channel, any increasing concave transport-actuation law then yields an exact single-crossing theorem: complementarity exists if and only if an initial transport-assistance elasticity exceeds one, the transition is unique when it exists, and the decreasing allocation branch remains the Pareto boundary after convexification. For positive baseline drift and sufficiently strong coupling, a unique critical normalized deadline determines when complementarity disappears. Short- and long-deadline limits clarify the associated temporal regimes. Numerical examples for a finite-frame LTI-Poisson slow channel exhibit analogous allocation behavior with counting noise and intersymbol interference.
Read the full abstract

Analysis of PDEs

Spreading–vanishing dynamics and speed selection in a free-boundary competition model under a shifting climate

We study a free boundary problem for a diffusive Lotka–Volterra competition system describing the invasion of a new species into the habitat of a native competitor, where habitat suitability shifts from unfavourable to favourable at a constant speed $c>0$ due to climate change. Only the invader is affected by the shifting environment and only its range is governed by a Stefan-type free boundary, while the native species occupies the whole half line. We work throughout in the weak competition regime, in which the two species may coexist. We prove a spreading–vanishing dichotomy: either the invader spreads and the pair converges to the coexistence steady state $(u^*,v^*)$, or the invader vanishes and the native species recovers its carrying capacity. In the vanishing case we obtain the explicit bound $\lim_{t\to\infty}h(t)\le\frac{\pi}{2}\sqrt{d_1c_2/(a_1c_2-a_2c_1)}$, and we give criteria guaranteeing each alternative. When spreading occurs, we determine the exact asymptotic spreading speed: $\lim_{t\to\infty}h(t)/t=\min\{c,c_0\}$, where $c_0$ is the spreading speed of the corresponding homogeneous weak competition system. In particular the invasion is slowed down both by the competitor and by the climate shift, and the slower of the two mechanisms is the one that determines the speed. Numerical simulations illustrate the results.
Read the full abstract

Computational Engineering

A Graph Neural Network Surrogate Model for Incident-Based Travel Time Prediction Under Limited Sensor Data

Localized roadway incidents can produce congestion well beyond their point of origin, but evaluating these effects with microscopic simulation requires a separate run for each scenario. This paper presents a Spatio-Temporal Graph Convolutional Network (STGCN) for forecasting route-level travel times on a simulated Nashville, Tennessee road network with 1,037 junctions and 1,601 road segments. The model uses directional traffic counts from only 129 signalized intersections, reflecting data commonly available to transportation agencies. By representing these intersections as a graph, the STGCN jointly captures spatial dependence and temporal traffic evolution to learn how localized disruptions propagate through the network. We compare a baseline trained on 80 incident-free simulations with an incident-inclusive model trained with an additional 360 lane-blockage scenarios across 12 locations and three durations. The baseline achieved a relative mean absolute error (MAE) of 9.94%. The incident-inclusive model achieved 9.67% overall, 6.45% during active incidents, and 13.62% at 30 incident locations withheld entirely from training. On disrupted routes, its predictions were within 2.0 minutes of observed travel time on average. For comparison, simulated travel times vary by 7.4%, or 1.3 minutes, across random seeds under identical conditions. Inference requires approximately 53 ms on a single CPU core, demonstrating the potential of the model as an efficient surrogate for transportation resilience screening, incident management, and proactive rerouting.
Read the full abstract

Computation and Language

The Garden of Forking Prompts: How Users Explore Narrative Space in Story Generation

Large language models (LLMs) have changed the way people engage with stories. Drawing on public chatbot logs, we can see that when users generate stories, they iteratively edit their prompts to explore narrative possibilities, adjusting characters, redirecting plots, and swapping fictional universes. As aggregated data, these prompts represent rich traces of creative preference at scale. Yet story generation evaluation benchmarks rely on static, one-shot prompts that cannot capture this exploratory behavior. In this work, we study how users revise consecutive story prompts in the wild. Using a dataset of naturally occurring user-chatbot conversations, we construct WildStories, a sample of 275,635 story generation prompts (labeled with story format, prompt components, and explicitness), and WildEdits, a collection of 24,291 edit trees that model how users iteratively edit base story prompts and explore branching story possibilities. From these trees we develop a framework of edit types crossing four directions (adding, removing, changing, and extending) with fourteen targets (e.g., plot, character, genre). We then use our datasets and this framework to analyze user behavior in navigating narrative space via LLMs. Finally, we show how automated permutations based on the framework can be used for story generation benchmarking. Content Warning: This paper works with "wild" chatbot logs, which often include toxic and sexually explicit themes.
Read the full abstract

All authors Advait Deshmukh, Nora Benedict, Melanie Walsh, Maria Antoniak

Computer Vision

From Density to Biopsy Decisions and Malignancy Prediction: A Benchmark Study of Multimodal Large Language Models Against Radiologists in Digital and Contrast-Enhanced Mammography

Purpose: To compare four multimodal large language models (MLLMs) with radiologists of varying expertise in breast density assessment, BI-RADS assessment, biopsy candidacy determination, and continuous malignancy probability estimation using digital mammography (DM) and contrast-enhanced mammography (CEM). Methods: This study included 179 women with paired DM/CEM examinations and reference standards. Four MLLMs (ChatGPT-5.2, Gemini-3.1 Pro, Sonnet-4.6, Muse Spark) interpreted images with and without masks; three radiologists interpreted non-masked images. Results: For binary density classification on DM, radiologist accuracies ranged from 55.81% to 78.60%, exceeding most MLLM values (62.33%-71.63%), while masks added limited benefit. Five-category BI-RADS accuracies were higher for radiologists on DM (56.74-67.44%) and CEM (62.33-82.79%) compared with MLLMs (DM 31.16-45.12%; CEM 40.00-55.81%). Binary biopsy-candidacy accuracies were likewise higher for radiologists (DM 85.12-89.77%; CEM 86.98-92.09%) than for MLLMs (DM 61.39-75.35%; CEM 69.30-82.79%), although CEM improved performance across all readers. Lesion masks substantially improved MLLM continuous malignancy-probability accuracies from 64.65%-71.63% to 72.56-78.60% on DM and from 67.91%-77.21% to 72.56%-81.86% on CEM, approaching radiologist ranges (DM 63.72-82.79%; CEM 81.86-88.84%). The corresponding AUCs for the top masked models overlapped those of the human readers. Overall, Muse Spark, followed by Sonnet-4.6, demonstrated the strongest performance among the MLLMs across domains. Conclusion: Radiologists generally outperformed MLLMs in categorical tasks, while selected masked models approached human performance for continuous malignancy probability estimation, suggesting a potential adjunctive role.
Read the full abstract

All authors Ali Abbasian Ardakani, Afshin Mohammadi, Taha Yusuf Kuzan, Beyza Nur Kuzan, Alisa Mohebbi, Masume Behruzi, Hamid Khorshidi, Ashkan Ghorbani, Elham Asadiara, Zeinab Khorshidi Lotfi, Ansar Rahman, Nedim Christoph Beste, U. Rajendra Acharya, Sepideh Hatamikia

Machine Learning (Statistics)

PU classification under Non-SCAR: clustering-assisted logistic model with oversampling enhancement

This study addresses the PU classification problem under violations of the SCAR assumption. We investigate logistic regression-based approaches, namely the cluster method and its extensions with strict and non-strict Lasso regularization. The primary contribution of this work is the integration of the SMOTE technique to alleviate class imbalance and systematically assess its impact on the performance of the considered algorithms. SMOTE is first applied to rebalance the training dataset. Next, cleaning labels are derived via 2-means clustering. Logistic regression is then trained on the cleaned data, where identified positive instances are augmented with additional true positives and the remaining observations are treated as negative. The experimental evaluation is conducted on 13 real benchmark datasets and one synthetic dataset. For comparison, we include the naive approach and the Spy-EM method. The results demonstrate that incorporating SMOTE improves classification performance when the SCAR condition is violated and indicate moderate robustness of the LassoJoint method in this setting.
Read the full abstract

Computer Vision

Floquet Fibre Geometry and Higher-Order Reduced Coordinates for Off-Manifold Transients near Nonlinear Aeroelastic Flutter

Assigning reduced coordinates to states near an attracting limit cycle requires the correct invariant-fibre geometry. The classical first-order phase-isostable chart obtained from adjoint Floquet modes projects along the strong-stable quotient fibre, whereas a metric-orthogonal complement of the retained slow bundle generally does not. We prove locally that a chart satisfying the linearised semiconjugacy relation leaves an O(delta^2) invariance residual, while projection along a non-invariant complement generically leaves an O(delta) term. For a nonlinear aeroelastic limit cycle, the metric-normal and strong-stable directions differ by 48.5 to 71.7 degrees, and metric-normal perturbations contain first-order retained phase and slow-amplitude components. Replacing the metric normal by the strong-stable fibre changes the measured residual scaling from delta^1.01 to delta^1.87 without fitted parameters. We then test learned higher-order corrections whose linearisation is pinned to the adjoint-Floquet chart, whose symmetry is exact, and whose reduced flow is fixed. Although they reduce the registered fixed-normalisation latent residual, post-hoc amplitude recalibration and adjoint-Floquet-targeted future consistency move or reverse the ranking. Because the learned maps already share the baseline's first-order gauge and the future target is supplied by the baseline chart, these diagnostics establish neither an independent positive nor negative higher-order result. Correct first-order Floquet geometry is therefore necessary in this benchmark, while the additional predictive value of the learned correction remains unidentified by the available representation-dependent diagnostics.
Read the full abstract

Materials Science

Misfit-dislocation hierarchy governs sliding of asymmetric non-CSL grain boundaries

Grain boundaries (GBs) strongly affect the mechanical response of polycrystalline materials, yet most atomistic studies have focused on coincidence site lattice (CSL) boundaries. Motivated by in situ atomic-resolution observations, we investigate step-free sliding along asymmetric non-CSL tilt GBs in face-centered cubic (FCC) metals using atomistic modeling. In these incommensurate GBs, a dense array of non-glissile primary misfit dislocations accommodates local interfacial mismatch, whereas a more widely spaced array of glissile secondary misfit dislocations accommodates residual mismatch. Uniform-sliding calculations reveal two distinct quantities: the minimum GB structural periodicity {\lambda}, defined by the repeating arrangement of primary GB misfit dislocations, and the slip vector b, corresponding to the minimum displacement-shift-complete translation that restores an equivalent GB structure. Nonuniform sliding proceeds through the glide of secondary GB misfit dislocations, which carry b and transform successive boundary segments between crystallographically equivalent translation states. The characteristic spacing between secondary misfit dislocations defines a longer periodicity {\Lambda}. For the representative {331}/{111} GB, each secondary misfit dislocation glides through a thermally activated two-step kink-pair mechanism below the athermal stress, advancing by one structural period {\lambda}. These results establish a unified crystallographic and dislocation-based framework for understanding stress-driven sliding in structurally complex asymmetric GBs.
Read the full abstract

All authors Kunqing Ding, Yazhuo Liu, Yin Zhang, Lihua Wang, Xiaodong Han, Ting Zhu

Materials Science

Origins of Pressure-Enhanced Thermal Transport in Organic Semiconductors

While pressure is known to dramatically alter the electronic properties of organic semiconductors, its impact on their thermal conductivity remains poorly understood. We combine machine learned potentials with the Wigner transport equation to compute the pressure-dependent thermal conductivity of crystalline naphthalene as a model system. When high-pressure reference data are included in the training, our simulations quantitatively reproduce the experimentally observed dramatic increase in thermal conductivity for compressed naphthalene. Most importantly, our results reveal the microscopic origin of this massive enhancement: pressure stiffens especially the intermolecular bonds, increasing the group velocities of heat-carrying phonons and simultaneously suppressing the scattering that impedes intraband (propagation) thermal transport. In contrast, interband (tunneling) transport is relatively weakened by a reduced spectral overlap between different phonon bands. These findings provide fundamental insights into heat conduction in soft molecular materials and suggest that strengthening intermolecular interactions, here, via applying pressure can be used to tune thermal transport in molecular crystals.
Read the full abstract

All authors Lukas Legenstein, Sandro Wieser, Michele Simoncelli, Egbert Zojer

Category Theory

Grothendieck Topologies Are Extensional Presentations of the Form of Sieves

A Grothendieck topology on a category determines both a subform of covering sieves and a quotient form obtained by identifying locally equivalent sieves. We place these two constructions in a single short exact sequence. For this purpose we introduce distributivity forms: indexed meet-semilattices equipped with distinguished indexed joins over which finite indexed meets distribute, and a strong version in which these joins also satisfy Beck–Chevalley. Over a fixed base, the resulting categories have all small limits and have kernels and cokernels relative to the closed ideal of fibrewise constant-top morphisms. Their monomorphisms are the fibrewise injective morphisms, and their relative cokernels, together with the top-reflecting morphisms, form an orthogonal factorization system. Cokernels compose but need not be stable under pullback, whereas kernels need not compose. We call a short exact sequence with prescribed middle term an extensional presentation, and prove that Grothendieck topologies on a category are precisely the extensional presentations of its maximally distributive form of sieves. Further applications recover universal productive closure operators and Lawvere–Tierney topologies, functorial non-Archimedean group topologies, and functorial linear topologies on commutative rings.
Read the full abstract

Cryptography and Security

Mitigating 51% Attacks in Blockchain Systems Through Early Detection and Checkpoint-Based Defense

The 51% attack remains one of the significant security concern in Proof-of-Work (PoW) blockchains, where increasing hash-power concentration can create a malicious majority-control risk and enable adversarial chain reorganization. This paper proposes a two-layer defense that combines early hash-power monitoring with checkpoint-based mitigation. The first layer monitors mining-power concentration and provides an early warning before the critical majority-control threshold is reached. The second layer uses checkpointing to restrict the depth of accepted chain reorganizations. Monte Carlo simulations are used to evaluate both mechanisms under different attack scenarios. Across 1,000 simulation runs, a 45% warning threshold provided a mean warning-to-critical lead time of 10.531 minutes before the modeled 50% critical threshold was reached. At the selected checkpoint depth of N = 6, approximately 63.68% of simulated reorganization attempts were rejected, while the mean reorganization-depth outcome decreased from 7.948 to 1.634 blocks, representing an approximately 79.4% reduction. The results demonstrate that early detection and checkpoint-based mitigation provide complementary mechanisms for reducing the potential impact of 51% attacks under the evaluated conditions.
Read the full abstract

Numerical Analysis

Stochastic Galerkin Method for Fractional Boundary Value Problems: Convergence Analysis and Numerical Treatment

We study two-point fractional boundary value problems with uncertain input data, where randomness may enter through the coefficients and boundary conditions. To quantify the resulting uncertainty in the solution, we employ the generalized polynomial chaos (gPC) framework and develop a stochastic Galerkin formulation of the problem. A particular focus of this work is the convergence analysis of the resulting approximation. Rather than imposing assumptions directly on the stochastic coefficients appearing in the gPC representation, we introduce minimal regularity assumptions on the input data and use them to establish the properties required for the convergence analysis. Based on these results, we prove the convergence of the stochastic Galerkin approximation to the corresponding gPC solution. Numerical experiments are presented to illustrate the theoretical findings and to investigate the influence of random coefficients and boundary conditions on the statistical behavior of the solution.
Read the full abstract

All authors Abhishek Kumar Singh, Dhyan Divakar Laad, Vaibhav Mehandiratta, Roland Pulch

Strongly Correlated Electrons

Finite-temperature quantum Monte Carlo study of Dirac quantum criticality: Algorithmic advances and comprehensive analysis

We present a systematic study of the quantum phase transition from a Dirac semimetal to an antiferromagnetic Mott insulator in the honeycomb-lattice Hubbard model, using finite-temperature auxiliary-field quantum Monte Carlo (AFQMC) simulations. Given the dynamical critical exponent $z=1$ at criticality, we scale the inverse temperature $\beta$ with the linear system size $L$, i.e., $\beta t=L$ (with $t$ as the hopping amplitude), to approach the thermodynamic and zero-temperature limits simultaneously. On the algorithmic front, we generalize the fast Fourier transform in path propagation to multi-sublattice systems and employ the delayed update technique in configuration updates to accelerate the AFQMC simulations. These advances enable us to access unprecedented system sizes of up to $3528$ sites (with $L=42$ and $\beta t = 42$). We additionally use twist-averaged boundary conditions to reduce the finite-size effects in computed observables. On the physical side, we determine the Dirac quantum criticality via finite-size scaling analysis of the spin correlations and off-diagonal single-particle Green's function, and locate the critical point at $U_c/t=3.731(4)$ with the critical exponents $\nu=1.097(7)$, $\eta_{\phi}=0.72(2)$ and $\eta_{\psi}=0.155(6)$. We further corroborate the critical point by examining several relevant quantities, including the quasiparticle weight, Fermi-liquid parameter, charge compressibility, $U$-derivative of double occupancy, and fidelity susceptibility. Our work establishes an independent benchmark for the chiral Heisenberg Gross-Neveu-Yukawa criticality in the honeycomb Hubbard model, offering a complementary perspective to previous ground-state simulations.
Read the full abstract

Fluid Dynamics

A Comprehensive Analysis of the Relation between Intermittency and Dissipation in Non-Homogeneous Turbulent Flows

A recent study of various turbulent flows showed that intermittency and dissipation exhibit consistent scaling behavior beyond homogeneous isotropic turbulence (HIT). For turbulent wakes, grid turbulence, and a turbulent jet, the dissipation parameter $C_\varepsilon$ and intermittency parameter $\mu$ vary while their product remains constant, independently of the Reynolds number $Re_\lambda$. Here, we extend this result from centerline hot-wire measurements to non-centerline data, including regions with significant shear. We identify two additional relations: $(\gamma-1)C_\varepsilon$ remains constant, where $\gamma$ is the absolute inertial-range spectral slope, and $\gamma$ varies linearly with the Kolmogorov parameter $C_k$. The main constraint is that the large-scale increment probability density function is Gaussian, indicating random large-scale driving. These relations reduce the varying quantities $C_\varepsilon$, $\mu$, $\gamma$, and $C_k$ to three constants and define a turbulence state that can be characterized by any one of these parameters, independently of shear, flow type, or Reynolds number. We further show that, for a given flow configuration, $C_\varepsilon$ depends on $Re_\lambda$ and turbulence intensity $TI$. Because the four parameters vary over broad ranges around their nominal HIT values, we interpret this framework as a generalization of HIT to inhomogeneous turbulence. Extensive robustness tests show that the results are insensitive to the specific post-processing method. We also analyze their streamwise and spatial evolution and show that a measured $C_\varepsilon$ can be used to predict $\mu$, $\gamma$, and $C_k$ within quantified uncertainty. The framework thus links key leading-order features of turbulence while recovering established HIT trends.
Read the full abstract