Computation and Language
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 30 August
Large language models (LLMs) are increasingly used to simulate human behavior but frequently fail to exhibit realistic cognitive constraints, suffering from a "superhuman bias." Using a dataset of over 71,000 reading comprehension responses from 2,359 primary-school students (grades 4–6), we demonstrate that standard persona prompting yields near-perfect, deterministic performance, failing to capture the natural variance of developing readers. To address this, we introduce the Cognitively Bounded User Simulator (CBUS), an architectural framework that explicitly models the restricted working memory of young readers through an episodic bottleneck. Within this framework, we formalize two distinct test-taking strategies to emulate different reading behaviors. Our evaluation shows that explicitly modeling cognitive bounds significantly narrows the simulation gap across multiple LLM backbones, demonstrating that enforcing architectural constraints is more effective for high-fidelity simulation than simply scaling raw model capabilities.
Soft Condensed Matter
A unified geometric design framework for kirigami structures
In recent years, kirigami metamaterials have been widely studied and applied in science and engineering. While various two- and three-dimensional kirigami design methods have been developed, most of them are only applicable to a limited class of kirigami structures. In this work, we develop a unified framework for kirigami design that encompasses a wide range of 2D-to-2D, 2D-to-3D, and 3D-to-3D shape-morphing effects, as well as additional geometric and physical properties such as compact reconfigurability and rigid deployability. In particular, by reformulating the design task as a length-based constrained optimization problem and solving it simultaneously for multiple target states of the kirigami structure, our unified design framework enables greater design flexibility and stronger theoretical support. Experimental results with a wide range of shape-morphing effects are presented to demonstrate the effectiveness of our framework. We further present a rigorous theoretical analysis of several key aspects of kirigami design, covering inertia transposition, aspect-ratio law, and angle defects, thereby elucidating important design rules and limitations. Altogether, our work paves a new way for the design of shape-morphing mechanical metamaterials.
Read the full abstract
Geometric Topology
Ziggurats, taut foliations, and contact structures
We study the geography of taut foliations on compact $3$-manifolds with toroidal boundary components. The central object of our work is the set of boundary multislopes realized by foliations transverse to a fixed flow on such a manifold. We prove that these sets exhibit remarkable structural properties (rationality, rigidity, and convexity) which motivate the name ziggurats. Our main tool, of independent interest, is a two-way correspondence between foliations and contact structures on $3$-manifolds with boundary: we generalize the Eliashberg-Thurston theorem, which produces pairs of positive and negative contact structures from foliations, and a construction of the first author, which builds foliations from such contact pairs. Using both directions of this correspondence, we bring contact-geometric methods to bear on the architecture of ziggurats.
Read the full abstract
Earth and Planetary Astrophysics
The $\gamma$ Cephei System: Updated Orbits, Dynamical Architecture, and Limits on Additional Companions
The $\gamma$ Cephei system hosts one of the first exoplanets discovered and is orbited by one of the closest known stellar companions to a planet-hosting star. Here, we derive updated orbital fits for $\gamma$ Cep AB, the stellar binary, and Ab, the planet, by combining literature data with Hipparcos-Gaia astrometry, new radial velocities (RVs), and adaptive optics imaging. We acquired 328 RVs of $\gamma$ Cep A with Keck/HIRES, AFP/Levy, McDonald/Tull, and Whipple/TRES, and eight adaptive optics imaging epochs with Keck/NIRC2, including the earliest spatially resolved image of $\gamma$ Cep B in 2003. These observations extend the precision RV baseline of $\gamma$ Cep to 45 years and the direct imaging baseline to 23 years, improving inferred orbital parameter precisions by a factor of 2–10 compared to previous work. For $\gamma$ Cep B, we derive a semi-major axis of $a_B=20.07 \pm 0.06$ AU, a mass of $M_B=415 \pm 2$ $M_{Jup}$ ($0.396 \pm 0.002$ $M_{\odot}$), an eccentricity of $e_B=0.422 \pm 0.002$, and an inclination of $i_B=119.8^{\circ}\pm0.1^{\circ}$. For $\gamma$ Cep Ab, we find a separation of $a_{Ab}=1.978 \pm 0.007$ AU, a minimum mass of $M_{Ab} \sin i = 1.62 \pm 0.04$ $M_{Jup}$, and an eccentricity of $e_{Ab}=0.07 \pm0.03$. Using the RV residuals and dynamical constraints, we rule out additional Jovians between 2.5–20 AU, and companions more massive than Neptune for $a<1$ AU, both at $>90\%$ confidence. The absence of additional giant planets over a broad range of orbital separations is consistent with a dynamically sculpted system in which the close stellar companion limited the formation or long-term survival of other distant companions.
Read the full abstract
High Energy Astrophysical Phenomena
Vortex pinning and the elastic response of neutron-star crusts - I. Axisymmetric loading
Vortex pinning is central to the standard interpretation of pulsar glitches, but the mechanical load exerted by a pinned vortex array on the solid crust has received less attention than the angular-momentum reservoir itself. We calculate the axisymmetric elastic response of a continuously stratified neutron-star crust to this load using realistic SLy4 and BSk21 stellar backgrounds and composition-dependent Coulomb shear moduli. The superfluid-crust lag sets the Magnus force, while the mesoscopic pinning force of Seveso et al. (2016) provides a local upper bound. At low lag the response is linear; progressive local saturation then produces a broad transition and a finite high-lag envelope. The stress maximum is robustly located at the deep crustal boundary towards the rotation axis, although the local Magnus force vanishes on-axis, showing that the localization is produced by global elastic-gravitational redistribution. Realistic elasticity changes the stress amplitude by 10-20 per cent relative to the common mu=10^-2 P prescription and reverses the SLy4-BSk21 ordering. At a Vela-motivated lag of 10^-2 rad s^-1, the maximum strain is only 3.1 x 10^-5 (SLy4) and 4.7 x 10^-5 (BSk21), remaining below 1.4 x 10^-4 on the formal plateau. A 1.2-2.0 solar-mass scan changes the stress amplitude by only about 20 per cent and leaves the deep-polar localization unchanged. Pinning therefore supplies a structured and astrophysically relevant crustal pre-stress, but cannot by itself break an initially relaxed crust.
Read the full abstract
Machine Learning
Multiclass Linear Perceptrons with Multiplicative Margins
This paper introduces a family of multiclass linear Perceptron classifiers with a multiplicative margin mechanism (MMPerc), as an alternative to standard margin-free and additive margin Perceptrons. The multiplicative formulation enforces classification confidence by requiring the true class score to exceed that of competing classes by a specified fraction of itself, rather than by a fixed additive threshold. This avoids dependence on score magnitudes arising from varied norms of data and class weight vectors. We propose several architectural and algorithmic variants of MMPerc, derive associated loss functions and mistake bounds for both linearly separable and non-separable data, and analyze key design considerations, including bias, margin threshold selection, and training modes. Extensive experiments on synthetic and real datasets show that MMPerc classifiers typically outperform the standard Perceptron, as well as classic baselines such as Support Vector Machines and Ridge classifiers. Owing to their simplicity, minimalistic design, and computational efficiency, MMPerc classifiers are promising candidates for conventional machine learning tasks, linear evaluation of Deep Neural Networks, integration with Hyperdimensional Computing / Vector Symbolic Architecture representations, and deployment in resource-constrained applications.
Read the full abstract
Differential Geometry
Under Ricci flow, a 3-torus goes flat
We determine the long-time behavior of the canonical Ricci flow on a closed three-manifold of Thurston type $\mathbb{R}^3$, Nil, or Sol, starting from an arbitrary initial metric. In the Euclidean case, the metric $g(t)$ converges exponentially fast to a flat metric. The Gromov–Hausdorff limit of $(M,t^{-1}g(t))$ is a point in the Euclidean and Nil cases, and a metric circle or a compact interval of positive length in the Sol case. In all three cases, the blowdown flows lifted to the universal cover, $s^{-1}\widetilde g(s\tau)$, converge, in the pointed Cheeger–Hamilton sense, to an explicit homogeneous expanding Ricci soliton solution.
Read the full abstract
Data Structures and Algorithms
Socially Fair Clustering: Parameterized Approximation and Local Search
We study the Socially Fair Clustering problem introduced by Abbasi, Bhaskara, and Venkatasubramanian (2021) and Ghadiri, Samadi, and Vempala (2021), along with its extension, the $(p,q)$-Socially Fair Clustering problem. This problem generalizes $k$-medians and $k$-means to settings where data points are partitioned into $\ell$ groups, and the goal is to find a fair clustering that is simultaneously good for all groups. We present several algorithms for this problem. For $\ell_p$-Socially Fair Clustering, we give the first constant-factor FPT-approximation parameterized by the number of groups $\ell$, resolving the open question raised by Ghadiri, Singh, and Vempala (2022). Our main ingredient is a new algorithm for closing additional centers in parameterized time inspired by local search. We then turn to the more general $(p,q)$-Socially Fair Clustering problem. The known algorithm for this problem, proposed by Chlamtáč, Makarychev, and Vakilian (2022) achieves a very good approximation but is complex, slow and difficult to implement. We analyze the performance of a simple local search algorithm and show that it provides an $O(q)$ approximation in the worst case. Finally, we design approximation algorithms for the facility location variant of the problem, where the number of facilities (centers) is not fixed in advance, and opening each facility incurs an opening cost. Unlike in previous work, we do not assume these opening costs are the same for all groups.
Read the full abstract
Artificial Intelligence
Interpreting and Steering for Safe and Correct Code Generation
Large language models (LLMs) frequently generate source code containing vulnerabilities, yet little work studies the internal mechanisms that distinguish safe from vulnerable generation in them. In this work, we systematically perform a mechanistic interpretation of LLMs, aiming at both understanding how code safety-vs-vulnerability is represented or driven by components in an LM and turning the insights into actionable steering strategies to encourage safer code generation. To this end, we introduce CodeSec-Pairs, a dataset of 9,342 Python safe-and-vulnerable contrastive code pairs, sampled from Llama-3.1-8B-Instruct. Utilizing the dataset, we explore approaches to localize layers and attention heads that relate to code safety, and further experiment with different steering strategies for inference-time vulnerability reduction. In particular, we propose DuoSteer, a double-steering approach that simultaneously applies safety and code-correctness steering to attention heads. In experiments over five vulnerability types, DuoSteer leads to an average of -26.9% vulnerability rate reduction and +7.5% functional correctness improvement, which outperforms not only other steering variants but also prompting and supervised fine-tuning baselines. The advantage also replicates on Qwen-2.5-Coder-7B-Instruct with another 2,500 contrastive pairs sampled from that model.
Read the full abstract
General Relativity and Quantum Cosmology
Exotic Spinor Deformation of a Schwarzschild Black Hole: Perturbations and Stability
In this work we investigate how exotic spinorial topology modifies the propagation of fermionic modes in the Schwarzschild geometry. By incorporating a topological gradient, $\partial_\mu\varphi$, into the Dirac operator through a tetrad deformation, we show that the exotic spinorial sector naturally induces an effective geometric deformation of the Schwarzschild background. The central consequence of this construction is the emergence of a topological impedance surface at $\rtopo=1/q$, which suppresses the radial group velocity of the exotic spinorial modes, yielding a birefringent propagation pattern. Using a spinorial perturbation we discuss the greybody factor and the quasinormal response. The quasinormal spectrum shows the stability of the background metric and the absence of isospectrality for the superpartner potentials.
Read the full abstract
Information Retrieval
Demand-Side Measurement for Generative Engine Optimization: Constructing and Validating a Million-Persona, Intent-Annotated Buyer Corpus
Generative engines such as ChatGPT, Gemini, and Perplexity answer buyer questions directly and name a shortlist of brands inside the answer. Studying how brands enter or fail to enter that shortlist requires demand-side data: what buyers in a category ask, what information they need, and which sources they trust. Existing large persona corpora are built for training-data diversity and carry neither a staged search-intent label nor a preferred-sources field, so they cannot be joined to supply-side recommendation measurements. We built and validated PersonaGen-1M, a corpus of 1,031,732 synthetic buyer personas spanning 511 industry labels and 4 market contexts, carrying 19,416,821 structured behavioral attributes, 5,160,046 of them search queries. Each persona carries a single primary_intent label covering its query set (78.3% informational, 17.4% commercial, 4.3% transactional) and a preferred_sources field naming the source types that buyer would trust. The corpus was built from roughly 40 million raw persona descriptions drawn from four public datasets through GPU-accelerated MinHash LSH plus semantic deduplication, then enriched to a fixed schema. The intent field selects the commercial-evaluation personas whose queries drive recommendation, and the preferred_sources field pairs against citation-provenance data; that join is the primary intended use, and its controlled empirical estimate is future work. Among million-scale persona corpora surveyed in August 2026, one other carries a source-preference attribute, as a six-value media-channel enum; PersonaGen-1M pairs named per-persona source lists with a staged commercial search-intent label and an attached query set. The full corpus is shared on request for non-commercial research; a stratified subset is published openly so the protocol, the schema and the validation can be inspected and reused without asking us.
Read the full abstract
Artificial Intelligence
Automatic Conversion of NICE Guidelines to an Executable Computational Model Using Large Language Models
Introduction: NICE guidelines provide evidence-based recommendations for clinical care but remain largely in unstructured natural language. Existing approaches to converting them into computable representations often focus on individual diseases, require substantial manual encoding, and do not scale. Large language models (LLMs) may enable much of this translation to be automated. Methods: We present an end-to-end approach that converts textual clinical guidelines into executable models capable of generating explainable, patient-specific recommendations. A stepwise LLM-based transformation with in-context examples produces human-inspectable intermediate artifacts. We apply the approach to NICE pancreatic and lung cancer guidelines, use expert review to assess rule alignment, and evaluate the executable pancreatic cancer model on 20 patient vignettes. Results: Expert review showed strong alignment between the source guidelines and generated executable models. Most discrepancies were partial omissions rather than incorrect logic, while hallucinated or fundamentally incorrect rules were rare. On the patient vignettes, the executable model achieved an F1 score of 82.5%. Conclusion: LLMs can transform natural-language NICE guidelines into interpretable, executable models that preserve guideline structure, support transparent inspection and modification, and generate patient-specific recommendations. These findings demonstrate the feasibility of scalable automated generation of computable clinical guidelines.
Read the full abstract
Machine Learning
Error Detection for PET/CT Radiology Reports: Domain-Specific vs Large Language Models
Errors in radiology reports can adversely affect patient treatment, yet automated report quality assurance remains challenging because errors are often subtle and require domain expertise to detect. Although large language models (LLMs) have recently been proposed for radiology report verification, their ability to detect clinically meaningful errors beyond chest X-ray datasets remains under-explored. To this end, we present the first systematic evaluation of language models for PET/CT report error detection, comparing compact domain-specific models with SOTA open-weight LLMs. We collected 30,633 oncology FDG PET/CT reports from 23 radiologists over 10 years. We trained domain-specific BERT models to detect clinically motivated synthetic reporting errors and evaluated alongside zero-/few-shot Qwen3-32B, Gemma-3-27B and Llama-3.3-70B on a held-out benchmark of 11,500 reports. A 15M-parameter model achieved 94.4% balanced accuracy with a 5.8% false-positive rate, compared with 84.0% for the strongest prompted LLM. Task-specific adaptation of Llama-3.3-70B closed this performance gap (94.4%) but retained substantially greater computational requirements. Our results suggest that domain-specific training matters more than model scale for PET/CT report error detection, supporting compact models as an accurate and computationally efficient approach to automated radiology report quality assurance.
Read the full abstract
Numerical Analysis
Second-Order Accuracy from Large Local Errors in Interface Problems: A Discrete Green's Function Analysis
Finite difference methods for interface problems often exhibit large local truncation errors near the interface, particularly when discontinuities in coefficients or solution derivatives are present. Nevertheless, many such schemes achieve second-order accuracy, a phenomenon not fully explained by standard pointwise consistency arguments. In this work, we provide a precise explanation of this behavior through the structure of the discrete Green's function associated with the underlying conservative difference operator. An explicit representation of the Green's function reveals a two-plateau structure in its weighted increments. By expressing the numerical error in terms of this Green kernel, we show that the dominant interface truncation errors, although individually of order \(O(1)\), possess a cancellation structure that reduces their effective contribution to the global error. The exact Green's-function analysis leads to a class of conservative interface flux–balance schemes for which the cancellation mechanism yields second-order accuracy in the maximum norm. The weighted harmonic discretization is included as a particular member, and its cancellation property is established directly. For Cartesian grids with a flat interface parallel to a coordinate direction, the same conservative cancellation mechanism persists along grid lines crossing the interface. Numerical experiments in one and two dimensions directly illustrate the predicted cancellation behavior and the resulting second-order accuracy. These results demonstrate that second-order accuracy in interface problems can arise from the interaction between localized truncation errors and the global structure of the discrete operator, rather than from pointwise consistency alone.
Read the full abstract
Networking
Predictive Traffic Shaping as a UE Network Control Loop in Wireless Systems
Wireless systems usually react to current channel conditions, queue state, and policy. Yet service conditions can often be anticipated seconds ahead. This paper studies predictive traffic shaping, a slower user-equipment (UE) control loop that changes when flexible demand reaches the radio access network (RAN). The UE estimates useful pre-event demand and releases it across a lookahead window. Cooperative deployments may also send a compact future-risk descriptor to the network. The trigger uses prediction confidence. Predictive service is confined to available surplus, while a debt account preserves long-term fairness after temporary pre-event preference. A bandwidth-time model captures efficiency gains and load smoothing. It also accounts for prediction waste and shared-resource cost. In a stylized shared- cell simulation, paced demand release substantially expands the stable-feasible region. A safe service cap and admission control provide further gains at longer windows. PRISM, an application-owned middleware prototype, implements the local control policy using ordinary mobile transfer mechanisms.
Read the full abstract
Statistics Theory
Self-normalization for Spectral Density Integrals
Integrals of spectral densities are frequently used to summarize spectral characteristics of linear processes. This work studies self-normalization for estimators of such integrals based on sequential periodograms and establishes weak convergence of the corresponding processes. For linear functionals of the spectral density, self-normalization yields pivotal limiting distributions that are free of unknown spectral quantities. For non-linear functionals, however, additional components with distinct covariance structures may arise in the limiting process. We demonstrate this phenomenon for the integrated squared spectral density.
Read the full abstract
Optimization and Control
On the suboptimality of stochastic MPC with varying constraint horizon
Enforcing stochastic state constraints over the full prediction horizon in Model Predictive Control (MPC) can be computationally demanding. Here we study stochastic MPC without terminal ingredients in which chance constraints are enforced only over a shorter constraint horizon. Using stochastic relaxed dynamic programming, we derive an explicit upper bound on the average expected closed-loop cost that depends on both prediction and constraint horizons. For linear quadratic problems with affine chance constraints and bounded uniform disturbances, we provide a deterministic reformulation via coordinate transformation and constraint tightening. Simulations illustrate the trade-off between computational effort and performance.
Read the full abstract
Rings and Algebras
Polynomial joint first-order differential projective invariants
We study polynomial absolute and relative joint first-order differential projective invariants for configurations of $n$ points in the plane. The main approach is based on passing to a homogeneous vector–covector representation, which reduces the problem to the classical invariant theory of the group $SL(3,\mathbb C)$. The algebra of polynomial absolute invariants is described and shown to be generated by cyclic invariants. For polynomial relative invariants of weight $-1$, a graded description is obtained, their finite generation as a module over the algebra of absolute invariants is proved, and an explicit finite generating system is constructed. For $n=3$, the corresponding module is shown to be free of rank $1$. For $n=4$, a minimal homogeneous generating system consisting of $39$ elements is constructed. The obtained results complement the rational theory of joint projective differential invariants by its polynomial counterpart and provide an algebraic foundation for the further construction of projectively invariant integral characteristics.
Read the full abstract
Statistics Applications
Nonlinear trajectories of lung function recovery in patients with pulmonary disease: empirical evaluation of longitudinal modeling approaches
Introduction: Longitudinal lung function recovery after pulmonary disease commonly follows nonlinear trajectories, and failure to adequately model these trajectories can lead to biased or misleading estimates of treatment effects. However, an important methodological gap remains as there is limited assessment of statistical methods for modeling nonlinear lung function trajectories. Methods: We compared several longitudinal modeling approaches for characterizing recovery in percent predicted forced expiratory volume in one second (FEV1p) using data from a phase 2 randomized trial for pulmonary tuberculosis (TB). We estimate the differences in repeated mean FEV1p between each treatment arm and control arm over a 180-days follow-up period. We compared 6 different statistical models: (1) linear mixed-effects model, (2) a piecewise linear mixed-effects model, (3) quadratic and (4) natural cubic spline mixed-effects models, (5) a nonlinear mixed-effects model with exponential recovery function, and (6) a generalized additive mixed model. We discussed the assumptions, clinical interpretations, and resulting treatment-effect estimates across these approaches. Results: The results from the TB trial analyses showed that the conventional linear mixed-effects model provided limited evidence of treatment differences over follow-up, whereas several flexible models identified significant differences during specific periods of recovery. Conclusion: Flexible longitudinal models can complement conventional linear mixed-effects models by revealing treatment differences at certain periods of follow-up that may be obscured by assuming a single linear trend. The choice of nonlinear modeling strategy should be guided by the scientific objective, available data, and the desired balance between clinical interpretability and flexibility.
Read the full abstract
Human-Computer Interaction
Looking Around by Looking Around: Omnidirectional Gaze-based VR Viewport Control
Traditional VR viewport control primarily relies on head and torso movement, which can be effortful and limiting in both constrained and extended-use settings. We introduce Looking Around by Looking Around (LALA), a gaze-based VR pitch-and-yaw viewport control technique designed for natural and effortless omnidirectional exploration via eye movements, without requiring or obstructing movement of the head, hand, or body, offering a low-effort and highly accessible interaction method. Because gaze is primarily used for perception and exhibits oculomotor and perceptual asymmetries, using it directly for control is difficult. To address this, we designed an asymmetric omnidirectional control profile for the eye, then built on it to exploit tendencies for eyes to stay within comfortable regions for viewport control. We evaluated LALA in a user study (N=18) featuring two contrasting tasks: alignment towards known directions and open-ended visual search towards unknown directions. LALA was strongly preferred over the traditional baseline, achieving competitive performance while enabling fully hands-free interaction with minimal physical movement.
Read the full abstract
Human-Computer Interaction
Multimodal Takeover Requests for Drivers with Hearing Loss: Implications for AI-Enabled Communication in Automated Vehicles
More than 430 million people worldwide live with disabling hearing loss. Although people with hearing loss are legally permitted to drive and may benefit from conditionally automated vehicles, SAE Level 3 systems still require drivers to respond to takeover requests when automation reaches its limits. Existing takeover requests often rely on auditory information, yet little evidence addresses visual and tactile designs for drivers who cannot rely on sound. This driving-simulator study with 40 participants examined the effects of information type (instructional, informative, and baseline), signal type (visual, tactile, and visual-tactile), and hearing condition (normal hearing and simulated hearing impairment) on takeover performance. Information type significantly affected reaction time, with baseline displays producing the shortest times. Signal type significantly affected reaction and takeover time, with visual-tactile displays producing the shortest times. The interaction between signal type and information type was significant for all three measures. Visual-tactile displays produced the shortest reaction times within every information type. With visual-tactile signaling, simple baseline alerts prompted the fastest reactions and the most abrupt maneuvers, whereas informative content produced the lowest mean maximum resulting acceleration. Hearing condition showed no significant main effect on any measure. These findings suggest that AI-enabled vehicles can support urgent takeover communication through visual-tactile displays and can adapt message content to the time available and the maneuver quality required, with implications for drivers across hearing abilities.
Read the full abstract
Mathematical Physics
Uniqueness of universal quantum dimensions
We prove, under some assumptions, the uniqueness of universal quantum dimension formulae. We first show that the quantum dimensions of classical algebras have a specific form that can be represented universally, in Vogel's sense, as the product/ratio of q-dimension factors with arguments $a\alpha+b\beta+c\gamma$ where $c=0, 1, 2$ and $a, b$ are integers. On this basis, we derive simple uniqueness criteria, according to which all known universal quantum dimensions are unique.
Read the full abstract
Astrophysics of Galaxies
Caught Napping by JWST UNCOVER+MegaScience: Constraining bursty star formation histories and number densities of mini-quenched galaxies at redshifts 4-7
We explore the prevalence of mini-quenched or “napping” galaxies selected from spectroscopic and photometric samples in the UNCOVER/MegaScience survey. These galaxies are empirically identified by the presence of moderate Balmer breaks, weak emission lines ($EW(H\alpha) < 100$A) and relatively blue UV continua. We infer the star formation histories (SFHs) of our sample using flexible non-parametric models with Prospector optimized to capture recent episodes of bursty star formation and quenching, and find that they are uniquely identifiable in the SFR$_{10}$/SFR$_{100}$ parameter space moving towards (temporary) quiescence. We demonstrate that although spectroscopy is best able to identify rapidly declining SFRs, densely sampled medium-band photometry recover these key spectral features and thus robustly identify pure samples of this transient phase – with imaging alone. We quantify the number density of napping galaxies at $z=4-7$ in the Abell 2744 lensing field, finding 8 spectroscopically confirmed nappers and 60 photometric candidates spanning log$_{10}$(M$_*$/M$_\odot$) $= 7.5-10$. We verify that the photometry alone can identify a pure sample of nappers, leveraging a smaller high signal-to-noise ratio spectroscopic sample. Consistent with previous studies, we find that nappers are most common at low stellar mass (log$_{10}$(M$_*$/M$_\odot$) $\sim9$). We see a hint that the number densities increase from $z\sim6$ to $z\sim4$, though our small sample is likely affected by cosmic variance. Our study demonstrates the increasing importance of stochastic star formation as a regulator of low-mass galaxy growth in the several hundred Myr after reionization, and offers a direct observational testbed for the strength and duty cycle of stellar feedback in cosmological simulations.
Read the full abstract
Superconductivity
Twist-Tunable Paramagnetic Superconductivity in $d$-wave Altermagnet/Superconductor Heterostructures
The interplay between twist-angle engineering and unconventional magnetism provides a powerful new route to control quantum phenomena. We theoretically investigate a heterostructure comprising a $d$-wave superconductor proximitized by a two-dimensional $d$-wave altermagnet. We reveal that the momentum-space mismatch between the superconducting gap nodes and the altermagnetic spin-splitting nodes generates a robust, twist-tunable odd-frequency spin-triplet pairing. Consequently, the macroscopic electromagnetic response of the system can be tuned from a conventional diamagnetic Meissner state to an anomalous paramagnetic Meissner effect driven entirely by the interfacial twist angle. For a $d_{x^2-y^2}$ altermagnet, the paramagnetic response is maximized at perfect alignment ($\phi=0$) and completely suppressed at a maximal twist of $\phi=\pi/4$, while a $d_{xy}$ altermagnet exhibits the exact complementary behavior. Our results establish twisted altermagnetic heterostructures as a versatile platform for engineering odd-frequency pairing and macroscopic superconducting phases.
Read the full abstract
Astrophysics of Galaxies
Multiscale Synthetic observations of Polarized dust emission: On the origin of Depolarization effect from Molecular clouds to Starless cores and Constraints on Dust Physics
Submillimeter observations of polarized dust emission from molecular clouds to starless cores frequently report a decrease in polarization fraction (p) with increasing dust emission intensity (I). This feature is commonly attributed to the alignment loss of dust grains or the geometrical effects of magnetic fields, yet, the detailed contributions remain unclear. To investigate the mechanism responsible for the depolarization, we use POLARIS to perform the multiscale synthetic dust polarization observations at $850\mu m$ from magnetically aligned dust grains by RAdiative Torques (RATs) mechanism. We adopt three collapsing cloud models with different magnetic energy levels and explore the effects of grain magnetic properties and grain growth on dust polarization. The field geometrical effect is the dominant depolarization mechanism at $N_{\rm H}<10^{21}-10^{22}\rm cm^{-2}$. We find that if grains grow beyond $>0.5\mu m$ and are superparamagnetic (SPM) with large iron clusters, RATs remain effective at high column densities, and grain alignment loss contributes to depolarization only at $N_{\rm H} > 10^{23}\rm cm^{-2}$. If neither of these conditions is satisfied, the alignment loss (in cases of insufficient grain growth); or the reduced grain alignment efficiency by gaseous damping (for paramagnetic grains or SPM grains with small iron cluster sizes) can become the dominant depolarization mechanism at $N_{\rm H} > 10^{22}\rm cm^{-2}$, regardless of how tangled the magnetic field lines in our simulation. Finally, we show that the depolarization mechanism and the underlying dust physical properties inside starless cores may be identified through the $p-I$ slope and the mean p at the core center.
Read the full abstract
Neurons and Cognition
Local connectivity balance shapes population dynamics in random recurrent networks
Disordered dynamical systems comprising many interacting units, from ecological communities to neural circuits, are ubiquitous, and understanding how connectivity shapes their collective behavior is a central theoretical challenge. One long-recognized feature of neural circuits is local connectivity balance, in which the excitatory and inhibitory weights converging onto each unit approximately cancel. Although local connectivity balance has been proposed to serve functions such as gating incoming signals, its effect on collective network dynamics remains unclear. Here we analytically study randomly connected recurrent networks with varying degrees of local connectivity balance. We show that this balance leaves the connectivity spectrum unchanged yet drastically reshapes the dynamics in a manner that depends critically on the single-unit nonlinearity. Local balance suppresses unbounded growth of the network state and stabilizes network dynamics when the activation function scales linearly or faster, whereas it drives the network into chaos when the activation function is sub-linear or saturating. Importantly, these effects vanish for odd activation functions, which are commonly assumed in previous work. We further find that, for saturating nonlinearities, the effective dimension of the dynamics varies nonmonotonically with the degree of balance. We show that all these phenomena arise from a unifying mechanism: the suppression of a self-generated feedback input by local connectivity balance. Our results identify local connectivity balance as a previously overlooked control parameter for collective dynamics in realistic disordered networks.
Read the full abstract
Other Condensed Matter
Chiral-symmetry breaking and degeneracy in Koch fractal geometries
Fractal geometries provide a distinctive platform for controlling quantum interference, topology, and localization. We investigate the Su–Schrieffer–Heeger (SSH) model constructed on the Koch curve, where a triangular geometry enables additional same-sublattice hoppings that break chiral symmetry and modify the conventional topological behavior captured by a real-space local marker. Destructive interference within the triangular units produces a highly degenerate flat level at $E=-t$. Although this level originates from the local geometry, its degeneracy and spectral weight are controlled by the self-similar connectivity of the Koch curve. The hierarchy reduces the number of independent flat states and reorganizes the spectrum into an intricate distribution of energy levels. Our results reveal complementary roles for local triangular interference and global fractal connectivity in shaping the electronic properties of geometrically modified SSH chains.
Read the full abstract
Quantum Physics
Frame phase retrievability and state distinguishability of quantum channels
This survey introduces the role of frame phase retrieval in pure-state identification and information preservation by quantum channels. For unit vectors, the lift $x\mapsto xx^*$ identifies vectors that differ only by a global phase with the same rank-one quantum state, converts frame intensities into linear functionals of the lifted state, and makes the adjoint pullback of output observables an operator-valued measurement on the input system. From this viewpoint, a channel is phase retrievable exactly when it is injective on pure states. We develop this correspondence through Choi-rank-two linear combinations of Kraus operators, higher-rank relative spectra, structural obstructions, and constructions with prescribed Choi rank. We distinguish injective identification from full tomography, perfect one-shot discrimination, zero-error classical communication, and exact quantum correction. Twirling channels then provide a structured setting in which commutants, irreducible dimensions, multiplicities, orbit-frame orthogonality, coding indices, and phase-retrievable subspaces can be read from group representations.
Read the full abstract
Computation and Language
Small Language Models as Judges for Rubric-Based Reinforcement Learning
Rubric-based reinforcement learning extends RL beyond tasks with exact answers or rule-based verifiers by scoring responses against instance-specific criteria. However, this makes reward computation expensive: training requires repeated rubric judging, often with proprietary APIs or local generative LLM judges with 7B parameters or more. We study whether smaller language models can serve as efficient and reliable rubric-based judges. To make this question measurable, we construct PointRubric and RaR-Science-Static, two pointwise rubric-based evaluation datasets with instance-specific criteria and itemwise satisfaction labels. We compare three ways of extracting criterion-level judgments from small models: Generative verdicts, Yes/No Logprob margins, and Probe judges. Across both datasets, the Qwen3-1.7B Probe judge achieves the strongest criterion-level agreement among these methods, outperforming Generative and Logprob judges. Used as a GRPO reward model, it trains a policy from 0.232 to 0.643 on RaR-Science rubric score, compared with 0.594 for an 8B Generative judge baseline, while the baseline requires 10.7$\times$ more reward-judge time. Task and domain transfer experiments further suggest that Probe judges preserve criterion-level reward structure across settings.
Read the full abstract
Cryptography and Security
Beyond Object Authentication: Context-Closed Post-Quantum Authentication for the WebPKI
Post-quantum migration increases WebPKI authentication cost, but authenticating a compressed certificate object does not by itself preserve the mutable authorization context under which a relying party accepts it. We formalize context closure: the authenticated projection accepted by a verifier must determine the selected authorization semantics it claims, relative to declared source contracts and event-coverage witnesses. We instantiate this idea with \LRp, a two-plane post-quantum construction that authenticates mutable CA-context state in an update plane while the warm path carries only state-local dependency references selected by explicit profile negotiation. In a pinned CCADB reconstruction, we obtain 44,912 path/view contexts and 16,858 physical CA lineages across Apple, Chrome, Microsoft, and Mozilla views. The core compiler yields $m_{50}=6$, $m_{95}=16$, and $m_{\max}=18$ typed dependencies. A warm LR+ selector therefore costs 296, 776, and 872 bytes at median, p95, and maximum, compared with 3,842, 5,932, and 6,350 bytes for a one-signature stateless bundle carrying the same dependency vector. The retained all-view closure state is 16.15 MB, and per-view lifecycle crossovers range from 19.60 to 50.41 median-path warm authentications/day under the stated checkpoint and update model. The implementation and evaluation artifact are available at https://github.com/nserser/LR-WebPKI