Cryptography and Security
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
Fully homomorphic encryption (FHE) enables inference on private data without revealing it to the server, but evaluating an entire input under FHE is expensive. We study selective homomorphic inference, where only a sensitive region of interest (ROI) is encrypted, and computations independent of that region are performed in plaintext. Selective evaluation produces the same output as full FHE on the same model, without retraining. Its efficiency depends on how quickly encrypted dependencies spread through the network. For small encrypted ROIs, locality-preserving architectures can achieve order-of-magnitude homomorphic-evaluation speedups, whereas architectures with early global mixing provide essentially no speedup. These results identify locality as the key architectural property governing the benefit of selective homomorphic inference.
Computation and Language
Auditable Emergency Triage for Maternal and Newborn Care in India
At Noora Health, our nurses answer more than 50,000 medical queries per month on our WhatsApp-based service that provides caregivers with on-demand support. Their most time-critical task is emergency triage: deciding which queries need immediate in-person attention. To support them, we built a system that uses a large language model (LLM) to classify whether a message is an emergency and provide a rationale for interpretability. But the system was opaque: analyzing mistakes meant reading reasoning chains for each message, which is infeasible at our scale. Prompt changes meant re-running a full evaluation to prevent regressions, which was both costly and operationally challenging. Clinicians follow a decision tree to make this call, but it was never documented or passed to the model, which relied on a flat list of danger signs. To address these issues, we decomposed triage into two steps: an LLM extracts canonical symptoms and patient context from the query using a clinician-authored vocabulary, and a deterministic rule engine captures the scenarios that indicate an emergency. We show that the new system raised recall from 0.565 to 0.810 and F1 from 0.606 to 0.702, with structured rules driving most of the accuracy gains while the decomposition provides auditability: clinical experts can inspect each stage of the new system to see whether the query was mistranslated, symptoms were incorrectly extracted, patient context was wrongly inferred, or the necessary rules were missing. They can add new rules independently without causing regressions and avoid running costly evaluations. Since deployment, the new system has triaged 152,421 patient queries and flagged 28,535 (18.7%) as emergencies. The over-escalation rate has been 17.8%, without any increase in missed emergencies. Clinicians have also added 48 new rules since deployment, evidence of the faster correction loop we set out to build.
Read the full abstract
Combinatorics
An 18-colour bound for locally irregular decompositions
A graph is locally irregular if adjacent vertices have distinct degrees. A graph G is decomposable if its edge set can be decomposed into locally irregular graphs, and its locally irregular chromatic index lir(G) is the least number of graphs in such a decomposition. We prove that lir(G) <= 18 for every decomposable graph G, improving the previous bound of 220.
Read the full abstract
Number Theory
Generic Manin-Mumford
Given a collection of algebraic numbers $\mathcal{S}\subset \overline{\mathbb{Q}}$ we study the varieties $V$ in $\mathbb{A}^m_\mathbb{C}$ such that $V(\mathbb{C})\cap\mathcal{S}^m$ is Zariski-dense in $V$. We show that for many classical families of algebraic numbers $\mathcal{S}$—such as the family of roots of generalized Laguerre polynomials $L_n^{(\alpha)}(x)$, for a finite collection of $\alpha\in \mathbb{Q}$—an unlikely intersections theorem holds. For example, in the case $m=2$, we prove that an irreducible curve in $\mathbb{A}^2_\mathbb{C}$ has infinitely many points from $\mathcal{S}^2$ if and only if it is of the form $x_1=x_2,$ or $x_1=s$, or $x_2=s$ for a fixed $s \in \mathcal{S}$. This is an analogue of the classical theorems of Ihara, Serre, and Tate, treating the case of $\mathcal{S}$ consisting of the roots of unity, and of the Manin–Mumford conjecture. We also show that a similar result holds almost surely for roots of a collection of random polynomials of growing degree and bounded height. The proofs rely on a uniform Galois-theoretic criterion ensuring the unlikely intersection property.
Read the full abstract
Analysis of PDEs
The computational ansatz for convex integration of hyperbolic systems and a resolution of the Strong Trace Conjecture
In this paper, we consider $2\times2$ hyperbolic systems of conservation laws in one spatial dimension. We use the computational ansatz introduced in the hyperbolic theory by the author and Székelyhidi to study the constitutive set corresponding to the PDE. The rank-one convex geometry of this set relates to non-uniqueness and the existence of low-regularity solutions. Through a computer-assisted search, we find a pressure law $p$ such that the $p$-system with this pressure law, and its natural strictly convex entropy, verifies all of the conditions necessary for the large data $L^2$ stability and the technique of “$a$-contraction with shifts” and thus we have uniqueness of certain Riemann solutions in the class of solutions verifying the Strong Trace Property. At the same time, the constitutive set contains a $T_6$ configuration and we use it to construct non-unique solutions without the Strong Trace Property. This resolves the question of sharpness of strong traces. We also present proofs which show nonexistence of $T_\infty$ structures for all genuinely nonlinear systems and nonexistence of $T_N$ structures for all $N$ for the $p$-system with $p''>0$, thus blocking these routes towards convex integration.
Read the full abstract
Quantum Physics
From the Unknown to the Desired: Transforming Unknown Initial States in the Resource Theory of Work and Heat
We study thermodynamic state transformations in the resource theory of work and heat when the initial quantum state is unknown. Moving beyond state-dependent protocols, we develop a universal framework in which a single transformation applies to all admissible input states. For mutually commuting conserved charges, we construct charge-conserving protocols whose transformation error, quantified by trace distance, decays super-polynomially with the number of system copies. As an application, we demonstrate universal work extraction: asymptotically optimal work can be extracted without microscopic knowledge of the initial state, with a super-polynomially small error. Our results show that thermodynamic state transformations remain achievable under limited prior information and establish a universal framework for resource-theoretic thermodynamics beyond the state-aware setting.
Read the full abstract
Algebraic Geometry
The algebraic geometry of 3-by-3 magic squares of squares
The question of whether a 3-by-3 magic square of squares with distinct integer entries exists has been open since the 18th century. We study the geometry of the algebraic surface parameterizing 3-by-3 magic squares of squares, which is a singular complete intersection of six quadrics in projective 8-space. We compute its geometric automorphism group via an argument involving Gale duality. We compute the basic topological invariants and Hodge diamond of its resolution. We provide an explicit rank 518 sublattice of its geometric Picard group, close to the Hodge-theoretic upper bound of 544. Finally, we study the geometry and arithmetic of del Pezzo, K3, and Enriques surfaces that arise as coordinate projections.
Read the full abstract
Quantum Physics
Measuring the entanglement-breaking index of a qubit collision channel on a quantum processor: protocol and worked example
The entanglement-breaking index of a quantum channel is the smallest number of self-compositions after which the channel destroys all entanglement with any reference system. A photonic experiment has fixed an index of 2; to our knowledge no larger index has been located by measuring the n-round channel across rounds. We give a protocol for doing so on a programmable processor, for any qubit channel realised as a collision model whose ancillas are prepared in states diagonal in a known basis, so that the bath polarisation is set exactly by weighting basis-state configurations in the analysis. Single-qubit process tomography of the n-round channel gives the smallest eigenvalue of its partially transposed Choi matrix, read against zero at a pre-registered five standard deviations; entanglement breaking survives further rounds, so the readings are monotone in n and the index follows. Comparing each direct measurement with the composition of the measured single-round map tests the repeated-interaction assumption. We show that a readable step needs margins on both sides, show how depolarising and reset errors move the readings, and give a power-based pilot rule. As a worked example we take one round of a three-qubit feedback loop, compiled to eight CZ gates on a heavy-hex path with mid-circuit reset, with certified ideal indices 3, 2 and 2 for three baths. The run is estimated to cost a few hundred seconds of processor time, and simulations under a device noise model, with the pilot's shot raise at low noise, recover all three indices.
Read the full abstract
Computation and Language
SWORD: Wikidata-based Distortions Reveal Hidden Cross-Lingual Inconsistencies in LLM Factual Error Rejection
Modern LLMs demonstrate impressive multilingual performance, yet standard benchmarks primarily reward selecting correct answers rather than evaluating genuine factual understanding. We introduce Systematic Wikidata-based Object-Relation Distortion (SWORD), a benchmark that evaluates whether models consistently reject factual errors across languages. SWORD generates syntactically well-formed but factually incorrect statements in eight widely spoken languages through controlled perturbations of Wikidata triples, ranging from random entity substitutions to semantically plausible property-based selections. Our distortion-based evaluation surfaces two critical insights that remain entirely obscured by conventional benchmarks. First, models counterintuitively achieve higher accuracy on semantically plausible distortions than on nonsensical random substitutions, suggesting reliance on distributional familiarity rather than genuine factual verification. Second, models exhibiting comparable baseline accuracy across languages show substantial performance degradation specifically on (East) Asian languages when presented with distorted statements, with cross-lingual performance gaps reaching up to 28 percentage points (49% relative reduction) in some models. These findings demonstrate that multilingual factual reasoning involves asymmetric capabilities that aggregate accuracy metrics systematically obscure.
Read the full abstract
Distributed Computing
Smart Adaptive Computing Across the Continuum: LLMs in IoT-Edge-Cloud Resource Management
Managing resources across IoT, edge, and cloud layers calls for continuous, context-aware decisions under constraints that rarely stay fixed. Deep reinforcement learning (DRL) handles this class of problems well, and large language models (LLMs) are increasingly used to augment DRL pipelines, yet the architectural relationship between the two is seldom made explicit. We build on Wang et al.'s taxonomy of Continuum Orchestration Systems employing DRL techniques and extend it with two further dimensions. The AI Augmentation Paradigm measures how LLMs are exploited, while the Feedback channel captures whether and through which system path the execution feedback returns to the LLM in order to close the MAPE control loop at the LLM Orchestration layer. We apply this taxonomy to six recent system architectures and find a common gap, as none combines full LLM orchestration with full agent-layer feedback in a Cloud Continuum setting. We relate this gap to a missing cross-tier feedback abstraction, bridging the incommensurable per-tier signals and the LLM Orchestrator.
Read the full abstract
Computational Engineering
Fixed-mesh based approach for modeling of superconducting magnetic bearings
Numerical simulations of superconducting magnetic bearings (SMBs) are complicated by the relative motion between high temperature superconductors and the magnetic guideway, which commonly requires repeated updates of the geometry and mesh. We present a fixed-mesh based approach for modeling the motion induced effects in which a coordinate transformation is applied only to the air region between the moving regions. The transformation can be included in a time-dependent anisotropic material tensor, leaving the mesh during the simulation and the rest of the formulation unchanged. To provide numerical examples, the approach is implemented in 2D using the finite element method with the $j$-$a$ formulation and is combined with homogenization and circuit coupling for double-crossed loops of coated conductors. The open-source model implementations are made available. The proposed approach is verified and validated against existing modeling approaches and experimental results from the literature for SMBs. Two simulation examples are presented, and in both of them the levitation force predicted by the fixed-mesh model agrees with the experimental results, yielding $R^2$ values above 0.99. For a verification problem, it is shown that the fixed-mesh model converges towards the remeshed reference solution under mesh refinement as expected. For an SMB undergoing vertical and horizontal translations, the homogenized fixed-mesh model reproduces the lateral-force response of a fully resolved moving-geometry reference model. Additionally, the homogenized fixed-mesh model is computationally more efficient than the reference model, indicating a significant reduction in the number of degrees of freedom and the computation time. The results demonstrate accurate and computationally efficient simulation of translational motion with the fixed-mesh based approach.
Read the full abstract
Number Theory
The addition on totally positive integers uniquely determines the totally real number field
Let $K$ be a totally real number field. We prove that the totally positive algebraic integers $\mathcal O_K^+$ of $K$, viewed as an abstract additive semigroup, uniquely determine $K$. We also describe all the additive relations by giving a presentation of $\mathcal O_K^+$ in terms of indecomposables as generators and a certain concrete set of generating relations. In fact, we obtain this presentation in a more general class of discrete semigroups which we call semilattices.
Read the full abstract
Cryptography and Security
Cross User/App Network Attacks - Hijacking TCP Connections and DNS Cache Poisoning via a Malicious User/App (Extended Version)
Off-path network attacks against TCP and DNS (over UDP) client-server connections are generally considered impractical nowadays, due to built-in security features in these protocols, e.g. randomized TCP (initial) sequence numbers and randomized UDP source ports, respectively. In this work, we refute this presumption by demonstrating that an unprivileged malicious application running on the client (but practically off-path), when combined with a remote off-path adversary, can enable powerful network attacks against such connections. We show how such a local–remote collaboration between the malicious application and a remote adversary allows inference of sensitive connection state, including TCP sequence numbers and DNS stub-resolver UDP source ports. Our attacks exploit standard socket API calls such as bind(), protocol mechanisms such as IP options, and operating system features such as cBPF and procfs to infer the TCP initial sequence number (ISN) and the UDP source port in use by the connection of interest. Specifically, we take advantage of certain properties of the ISN generation algorithm as implemented in major operating systems. We demonstrate TCP connection hijacking in Linux, Android, Windows, macOS and iOS, and DNS cache poisoning against Windows, Android and the popular systemd-resolved DNS stub resolver in Linux. We evaluate our techniques across multiple operating systems and realistic deployment settings, including environments behind port-preserving NAT-integrated routers. We disclosed our techniques to Microsoft, Apple, Linux and Google, which led to the release of several patches.
Read the full abstract
Hardware Architecture
Academia x Industry: The Role of Fundamentals for Silicon in an AI Native Era
Agentic AI is set to become one of the most transformational technologies in generations and materially change how we approach silicon design and engineering. The impact is being felt in real time amid a rapidly changing landscape, which can make it overwhelming for both silicon practitioners and academics to adapt to the AI native silicon design era. To add structure to how we navigate this transition, we provide a joint view from academia and industry silicon practitioners of the challenges, opportunities, and considerations we expect will catalyze how the community transitions into an AI native silicon future. In particular, we reemphasize the importance of core silicon design fundamentals in academic training and why they have renewed importance in research and industry practice for AI native silicon design. It is our hope that the views provided here will offer valuable and complementary perspectives to those in academia and industry to interpret, inform, and catalyze the transition to the AI native era. We expect that many similar and overlapping views will emerge, but the precise technical details will differ across stakeholders, so it is valuable for the community to amass a diversity of viewpoints.
Read the full abstract
Populations and Evolution
Persistence of n-Species Lotka-Volterra Models with Periodic Pulses
Periodic impulsive interventions arise naturally in the management of biological populations, including chemotherapy, pesticide application, and infectious-disease treatment. We develop general conditions for permanence in n-species population models subject to periodic multiplicative pulse disturbances. Our main result provides a sufficient condition for permanence in terms of weighted long-term growth rates on a Morse decomposition of the extinction set, explicitly separating the contributions of continuous population dynamics from those of the periodic pulse. To establish this result, we transform the impulsive system into an associated autonomous continuous-time dynamical system and use this correspondence to extend classical permanence theory to periodically pulsed models. We further show that the same conditions imply robust permanence under sufficiently small perturbations to the continuous dynamics, pulse period, and pulse effects. We illustrate the framework with two Lotka-Volterra models motivated by biological control: competition between chemotherapy-sensitive and chemotherapy-resistant cancer cells, and integrated control of an agricultural pest using pesticides and parasitoids. These examples demonstrate how intervention frequency and intensity interact with underlying ecological interactions to determine whether populations coexist or are excluded. Our results provide a general framework for analyzing persistence in ecological systems subject to repeated discrete disturbances.
Read the full abstract
Combinatorics
Betweenness centers of graphs
The betweenness centrality of a vertex $v$ in a graph $G = (V,E)$ is the sum of the relative numbers of shortest paths of $G$ that pass through $v$. The vertices of $G$ which have the maximum (resp. minimum) betweenness induce the betweenness center (resp. betweenness periphery) of $G$. We study betweenness of graphs and their localization in graph blocks, presenting sufficient conditions for graphs (in terms of diameter or block sizes) to have those centers contained in a single block. Further, we show that each graph occurs as the subgraph induced by the betweenness center of some graph (as well as the subgraph induced by the betweenness periphery). For trees, we show, by an alternative proof, that their betweenness center is always contained in a path; in addition, we enumerate trees of order at most 20 according to the order of their betweenness centers.
Read the full abstract
Fluid Dynamics
Influence of wall thermal boundary condition on mean-flow characteristics of a Mach 2.5 fully rough turbulent boundary layer
We investigate turbulent boundary layers at Mach 2.5 over sinusoidal roughness at matched $Re_\tau=784$. We considered three wall temperatures, $T_w/T_r=$ 1.0, 0.7, and 0.4. Each wall temperature was repeated with a smooth and rough surface, the latter following a three-dimensional sinusoidal profile with effective slope 0.5 and matched $k^+=79.1$. In total six direct numerical simulations were completed. Analysis of mean wall shear and heat transfer detailed the augmentation in skin friction and heat transfer coefficient between smooth and rough cases; resulting in the classical failure of the Reynolds analogy for rough walls. We also show that differences in shear stress across wall temperatures are driven by the viscous component even though the pressure component dominates. The roughness sublayer was found to be $R_{RSL}=3k-6k$, consistent with the literature. Moreover, the wall offset $d=d_\Theta\approx0.5k$ for both momentum and thermal boundary layers, signifying the offset represents the half peak-to-valley height rather than the "mean roughness height." For the mean momentum boundary layer, we find the present conditions recover the incompressible roughness function $\Delta u_1^+$ when matched via the semi-local roughness Reynolds number $k^*$. For this reason, an equivalent sand-grain roughness of $k_s^*\approx3.7k^*$ is proposed. The existing compressible transformations hold regardless of wall temperature or roughness - contradicting recent claims otherwise. The generalized Reynolds analogy works for smooth walls but fails for rough walls; a roughness correction term is proposed and validated. Compressible mean temperature transformations fail for cold walls, especially when $(T_w-T_e)/(T_r-T_e)<0$. The thermal roughness function, $\Delta\Theta^+$, is reported with caution given transformation singularities.
Read the full abstract
Cosmology and Nongalactic Astrophysics
A Finely-Binned Measurement of the Connected Even-Parity Galaxy 4-Point Correlation Function of DESI Year 1 Luminous Red Galaxies
We present the connected even-parity galaxy 4-Point Correlation Function (4PCF) of DESI Year 1 (Y1) Luminous Red Galaxies (LRGs). This is one of the first measurements of the connected 4PCF on data, and shows a clear detection at $\sim$12 to 17$\sigma$ in the full-sky analysis. We test the robustness of the signal by varying three factors: hemisphere (north vs. south), redshift range (either the full range $0.4 < z < 1.1$ or the higher-number-density interval $0.4 < z < 0.8$), and sample completeness (the full sample vs. only the most complete regions within the number density-motivated cut). Finally, we cross-correlate different patches that are spatially well-separated, and thus should have largely independent noise. This approach, at leading order, is able to remove mismatch between the covariance matrix of the data and that of the mocks; however, in certain cases at the cost of sensitivity. We find $\sim$15$\sigma$ evidence for an even-parity 4PCF in this approach. Overall, the studies of the 4PCF presented here probe sensitively any mismatch between mock catalogs and data, and also open up the prospect of fitting a model, constraining cosmological parameters and galaxy biases, and searching for Baryon Acoustic Oscillation (BAO) features.
Read the full abstract
Functional Analysis
Schur tests and estimates for positive semigroups on non commutative $L_p$
We extend the recent results of Arnold on estimates for Kreiss positive semigroups on $L_p$-spaces to the non commutative setting, $1<p<\infty$. We also provide a sharp example. All the results are achieved thanks to the use of the Schur test, including a new version for von Neumann algebras.
Read the full abstract
Computation and Language
Osprey: Target-agnostic Pre-training Makes Stronger Drafters in Speculative Decoding
Speculative decoding is critical for accelerating LLM inference. However, the speedup is fragile: drafters are typically trained against a narrow distribution for a single target model, and their acceptance rate collapses under workload shifts. This is a striking inversion of modern LLM development, where target models are valued precisely for the broad generalization they acquire through large-scale pretraining. We argue that the natural remedy, pretraining, has been hard to apply to drafters because existing recipes are target-specific: the drafter consumes the target's hidden states and is distilled on the target's logits, so pretraining must be repeated for each target. We introduce Osprey, which instead bootstraps drafters from off-the-shelf pretrained small language models, treating broad pretraining as a reusable, target-agnostic asset and reducing per-target work to a lightweight adaptation step. Realizing this requires overcoming two challenges: small LMs are far deeper than a latency-bound drafter can afford, and their pretrained computation must remain intact while the drafter learns to ingest target hidden states and emit tokens in the target's vocabulary. Osprey addresses both by pruning to a shallow backbone, restoring its language-modeling capability with target-agnostic next-token pretraining, and adapting it to each target through vocabulary alignment, zero-initialized QKV expansion, and distillation from the target model's output distribution. Empirically, a single pretrained Osprey backbone transfers across targets and improves mean acceptance length by 16.1% for Qwen3-8B, 21.2% for Llama-3.3-70B-Instruct, and 22.7% for the 229B MiniMax-M2.5 (with 17.5% higher tokens per second), with the largest gains on out-of-domain and multilingual data. Our code is available at https://github.com/LeanModels/Osprey.
Read the full abstract
General Economics
Credible Discourse on Climate Policy: Beyond Dueling Certitudes
Whatever the policy question under consideration, reasoned and realistic evaluation requires credible policy analysis under uncertainty. This holds particularly to the study of climate policy in the United States, where science and ideology have become increasingly entangled. Welfare economics provides a transparent formal framework to describe and evaluate the subtle tradeoffs that must be addressed when comparing alternative climate policies. The largely qualitative discussions of climate policy in public-facing reports suffer from failure to use welfare economics to assess tradeoffs. I use 2025 reports by the National Academies and by the US Department of Energy as case studies.
Read the full abstract
High Energy Physics (Phenomenology)
Constraints on Neutron-Electron Quantum Dark Forces
Interactions induced by dark matter particles which couple bilinearly to standard model particles through quantum fluctuations were termed quantum dark forces by Brax, Fichet, and Pignol, who constrained the mass and couplings of dark scalar, dark vector, and dark fermion bilinear exchange between nucleons. We extend their results to derive new constraints on quantum dark forces from bilinear scalar exchange between neutrons and electrons
Read the full abstract
Metric Geometry
Monotone invariant valuations on convex cones
We classify the monotone $\SOn d$-invariant valuations, $d\ge2$, on the space of all closed convex cones. They are precisely the linear combinations of the conic intrinsic volumes with nondecreasing coefficients, or equivalently, the nonnegative linear combinations of intrinsic volume tails, up to an additive constant. On nonzero pointed cones we obtain the corresponding characterisation by Grassmann angles, settling a conjecture of McMullen. Every such valuation is automatically continuous in the spherical Hausdorff topology and is $\On d$-invariant. Our proof builds on the signed simplex and averaging arguments of Wang and Wu, but does not rely on the continuous classification theorem.
Read the full abstract
Quantum Physics
Execution-transcript privacy for fault-tolerant surface-code memories
A fault-tolerant quantum computer runs behind a telemetry stream logging syndromes, decoder actions, resets and timing separately from the answer. Can it reveal the logical input? For a distance-$d$ rotated surface-code memory on a fixed schedule of $T=\Theta(d)$ rounds, under three stated hypotheses (sector-scalar honest backbone, transcript locality, Kotecky-Preiss smallness), the channel from logical qubit to transcript is $e^{-\Theta(d)}$-close in diamond norm to one that ignores the input. A statement of this kind follows generically from correctability-privacy duality. Anisotropy does not. Each logical axis pays the distance of its own coset, so under amplitude damping the computational-basis label is governed by the code's $Z$-distance $d_Z\ge d_{\min}$ and not by the code distance. Two codes of quantum distance $1$ make the gap concrete. A phase-flip code's $X$-syndrome transcript is exactly input-independent under unobserved damping, while a repetition code leaks at first order. A matched converse identifies the records that do expose it, among them a lattice-surgery parity readout. On a 156-qubit superconducting processor our sufficient certificate misses by $21.5\times$, so the theorem cannot be invoked there. Measured directly, a $d_Z=1$ memory's record identifies its input with total variation $\ge 0.927$ under randomised, label-balanced acquisition. Holding the code fixed and varying the damping exposure reproduces the parameter-free law, with exponent $0.85\pm0.03$ against a predicted $0.86$. Randomized encoding returns the statistic to the floor at no two-qubit-gate cost. Fault tolerance does not grant transcript privacy. It relocates it, and only to the logical state, not to the circuit's identity.
Read the full abstract
Human-Computer Interaction
Where Does the Human End? Creative Agency with Generative AI across Five Years of Chinese Digital Painting
As generative AI enters creative work, practitioners must decide where AI assistance ends and human authorship begins. Human-agent interaction (HAI) research has examined AI as a tool, collaborator, consultant, and competitor. The longitudinal problem is how these roles are revised as systems become more capable, public, and economically embedded. We report a five-year interview study with 17 Chinese digital painters, based on annual semi-structured interviews from 2021 to 2025. Participants described recurring but non-uniform patterns of protective resistance, pragmatic task delegation, and, for some, reflective agency repartitioning. Early resistance protected observation, originality, signature, and ownership from AI. Later delegation placed AI in bounded tasks such as references, backgrounds, rough sketches, and client-facing drafts. By 2025, some participants built hybrid workflows around human-only zones, while others described fatigue, precarity, or difficulty locating a remaining human role. Peer norms, emotional climates, and production pressures shaped which delegations felt useful, acceptable, or exhausting. Copyright, authorship, and creative labor remained recurring limits on what participants were willing to delegate. We frame these accounts as longitudinal agency partitioning, the situated work of deciding which stages, responsibilities, values, and claims remain human in creative human-agent interaction. We discuss design implications for revisable agency-boundary controls, provenance scaffolds, and community-facing authorship norms.
Read the full abstract
Human-Computer Interaction
Early Epistemic Settlement in AI-Assisted Writing
In trying to complete a passage, an author can make connections among her materials that change what she can argue and the demands the argument must meet. A language model can supply a passage that does the work required at that point in her argument. Accepting it can end her own attempts before those connections have developed. I call this interruption early epistemic settlement. It can occur even when she fully understands the response and correctly judges it adequate for the passage's present role in the argument. The answer can satisfy the desire for resolution that kept her at work. Returning to her unfinished attempt would take more effort, and she may be unable to anticipate what she could achieve by continuing it. With repeated assistance, accepted answers shape what the writer asks next and which relations she goes on to develop. Useful answers can thus sustain inquiry while cutting short the work through which an author could form arguments that accommodate demands she has yet to recognize.
Read the full abstract
Human-Computer Interaction
Ephemeral Feeds and Enduring Rituals: RushTok and the Formation of Event-Based Algorithmic Communities
Each August, TikTok's For You page turns the University of Alabama's sorority recruitment into RushTok. We examine RushTok as an event-based algorithmic community: a collective assembled around a bounded offline ritual and sustained by recommendation. Using a mixed-methods survey (n=71) and a reflexive account of creator outreach, we ask who participates, how, and with what stakes. Findings show an ambiguous and entertainment based throughline; many called it a community (51/71) but few claimed membership (11/71). Affiliation centered on creators rather than shared practices, with parasocial attention clustering around a small set of potential new members (PNMs) and returning figures. Higher content exposure tracked with self-identification as a community member; those members commented, followed creators, and engaged across videos. Attempts to interview creators were met with silence or refusals, reflecting community boundary-work despite viral visibility. We outline implications for platform governance, including time-bounded context, graduated visibility, and aftercare.
Read the full abstract
Signal Processing
3D Protraction Technique for Anchor-Free, Range-Free Wireless Localization in Industrial Warehouses via Multi-Level Binary Reachability
Three-dimensional (3D) localization is difficult in industrial facilities because fixed-node placement is constrained by hardware, power, networking, installation, and maintenance costs. This paper presents the 3D Protraction Technique (3D-PT), an anchor-free, range-free method that converts reciprocal packet detections at ordered transmit-power levels into reliability-weighted ordinal distance relations. It estimates a relative 3D configuration without Received Signal Strength Indicator (RSSI) magnitudes, estimated ranges, surveyed anchors, or prior coordinates. In a simulated multi-height warehouse, four transmit-power levels reduce mean network-diameter-normalized RMSE by 16.0% relative to MDS-MAP(P) in both small- and medium-network regimes, and by 23.9% and 34.0% relative to CATL-reproduction, respectively. Accuracy largely saturates beyond four power levels. The results show that multi-level binary reachability provides useful geometric information beyond a single maximum-power connectivity graph.
Read the full abstract
Instrumentation and Methods for Astrophysics
The future of high-resolution UV spectroscopy: Science with a UV Échelle spectrograph on the Habitable Worlds Observatory, or a dedicated mission
High-resolution UV spectroscopy serves a diversity of science cases, from small bodies to planets, stars, and galaxies, but is currently limited to the Hubble Space Telescope and bright targets. Major advances require increasing sensitivity by at least one order of magnitude. Here we present the UV science cases for PEGASUS (Planets, Earths, Galaxies, And Stars UV Spectrograph), a UV Échelle high-resolution spectrograph concept, with $R = \lambda/\delta\lambda \sim 100\,000$ (full range 10 000-140 000) and covering 90–400 nm, with a foreseen extension to at least 800 nm. PEGASUS is ideally suited for the Habitable Worlds Observatory (HWO), enabling transformative science across the UV/optical wavelength ranges. PEGASUS will be unique in high sensitivity (effective area) and high spectral resolution – an uncharted territory – as well as robustness, thanks to the simplicity of its design. Its UV science cases include: I) Formation and evolution of planets and their habitability: properties of exoplanets and atmospheres, protoplanetary disks, Solar System bodies; II) Stellar lives and deaths at their extremes: the first stars and the origin of the elements, compact and massive stars, Supernovae; III) Gas and metals in the baryon cycle of galaxies: the interstellar, circumgalactic, and intergalactic medium and their roles in galaxy growth. These are essential for the Astro Decadal 2020 Survey, Voyage 2050, and HWO. While this paper focuses on high-impact science enabled by UV high-resolution spectroscopy, PEGASUS will extend into the optical regime and lower spectral resolution, making it a multi-purpose, widely used, workhorse spectrograph for HWO.
Read the full abstract
Biological Physics
A thermodynamically consistent framework for finite growth of multi-constituent mixtures with application to tumor growth
Biological tissues grow by continuously producing, transporting, and reorganizing multiple interacting constituents. These processes are intrinsically coupled to finite deformation and residual stress. Existing models typically capture either finite growth kinematics or multi-constituent transport, but rarely both within a thermodynamically consistent setting. In particular, existing approaches do not consistently link the volume created by finite growth to the mass produced for each individual constituent. In this work, we develop a general continuum framework that unifies finite growth kinematics and multiphase mixture theory for fully saturated multi-constituent mixtures containing an arbitrary number of dilute dissolved solutes. Formulated in a solid-skeleton-based description, the framework rests on constituent-wise balance laws and a free-energy dissipation principle, from which thermodynamically admissible constitutive closures are derived for all mass-exchange, transport, reaction, and growth processes. The central novelty of the framework is a coupling between growth-induced volume creation and constituent mass production, expressed through volume accumulation fractions that distribute the newly created volume among the constituents while preserving saturation. We cast the resulting model in a total Lagrangian mixed weak form and specialize the general theory to a four-constituent, two-solute model of avascular tumor growth that couples nutrient transport, waste production, phenotype transitions between proliferative, hypoxic, and necrotic cells, volume growth, elastic deformation, and growth-induced residual stress. The model is implemented within a finite element setting and its capabilities are demonstrated on representative benchmark problems.