Physics Education
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
Physics courses use research-based assessments (RBAs) such as the Force Concept Inventory (FCI), Force and Motion Conceptual Evaluation (FMCE), and Energy and Momentum Conceptual Survey (EMCS) to measure learning in introductory mechanics, but their fixed-length, pretest-posttest design makes them retrospective: posttest scores summarize completed instruction and arrive after a course ends. We are developing the Mechanics Cognitive Diagnostic (MCD), a cognitive diagnostic computerized adaptive test that reports students' mastery of fine-grained learning objectives (LOs) throughout instruction. Using evidence-centered design, we defined 14 LOs from introductory mechanics textbooks and AP Physics standards, mapped FCI, FMCE, and EMCS items onto them with a Q-matrix, and refined the mapping with the deterministic inputs, noisy "and" gate (DINA) model, using posttest responses from 24,394 students in 807 courses across 79 institutions through LASSO. The FCI and EMCS achieved good DINA model fit; the FMCE showed marginal fit. Classification accuracy for most LOs met or exceeded benchmarks for low-stakes formative assessment. RBA items, though not developed for LO-level diagnosis, support it reliably, giving the MCD a working 14-LO item bank built from RBAs that physics courses already use. As data accumulate, we can revise or retire weak LOs and items and add new items through online calibration without interrupting testing. We plan to expand the MCD to 35 LOs, two per week, to cover a typical introductory mechanics course.
Quantum Physics
Thermal Quantum Sensing: Fisher Information and Work Beyond Gaussian Signals
Understanding how thermal fluctuations modify or suppress quantum-enhanced sensing is a central problem in quantum metrology. Closely related questions arise in quantum thermodynamics, particularly regarding the relation between the work induced by a signal and the information acquired by a sensor. Here, we establish general relations among the sensitivity of thermal quantum states, as quantified by different quantum Fisher information metrics, their temperature dependence, and the work induced by a unitary signal. We further show that, at high temperature, all monotone QFI metrics coincide to leading order with a universal quantity that can be expressed as the variance of a simple observable and itself defines a lesser-known QFI metric. This emergent uniqueness is reminiscent of the uniqueness of classical Fisher information in information geometry. In continuous-variable systems, the infinite-temperature limit is finite and generically non-zero for quadratic Gaussian signals, while it diverges for higher-degree signals. Remarkably, for any purely quadratic signal generator, the infinite-temperature QFI is at least twice the zero-temperature SLD QFI or, equivalently, at least eight times the ground-state variance of the generator. Consequently, the Cramér–Rao lower bound on the estimator variance is reduced by at least a factor of two. We illustrate these results using harmonic chains of bosonic modes relevant to trapped-ion platforms and quantum field-theoretic models.
Read the full abstract
Quantum Physics
ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm
We propose Open Autoresearch, a paradigm in which humans and AI agents publish evaluator-verified improvements to a public leaderboard. We instantiate it in ECDSA.Fail, optimizing reversible secp256k1 point-addition circuits, a bottleneck in Shor's algorithm for elliptic-curve cryptography. The benchmark minimizes the spacetime-inspired score $S=Q\times T$, where $Q$ is peak logical qubit width and $T$ is average executed Toffoli count. Participants reduced $S$ by 86.1%. At the data cutoff (26 July 2026), the best-scoring circuit uses 1,151 qubits and 1,299,453 average executed Toffoli gates, giving $Q\times T\approx1.496$ billion. This is more than 50% below Google's published point-addition score thresholds (arXiv:2603.28846), under different accounting conventions. Because the benchmark supplies one addend classically, we construct a coherent windowed-addition-compatible variant implementing the single-call interface required by windowed Shor. It uses 1,162 qubits and 1,684,161 average executed Toffoli gates. On 100,000 random inputs, its empirical success probability is $\hat{p}=0.99809$, giving $Q\times T/\hat{p}\approx1.961$ billion under an independently rerunnable per-call sensitivity model, not a full-Shor success estimate. Its qubit and Toffoli counts lie below Google's published thresholds and Schrottenloher's reported operating points (arXiv:2606.02235), although differing interfaces, accounting conventions, and validation scope preclude formal dominance. After the cutoff, the score was further reduced to 1.259 billion, while a separate low-width circuit reached 813 qubits. The public record shows AI agents complementing human judgment, providing evidence for open autoresearch on efficiently evaluable, machine-checkable objectives.
Read the full abstract
Mesoscale and Nanoscale Physics
The effect of Coulomb interactions of thermoelectric characteristics of Marcus molecular junctions
We present a theoretical study focused on the influence of Coulomb interactions on thermoelectric properties of molecular junctions assuming that electron transport is strongly affected by thermalized phonon modes in the molecular ambient. It is shown that the combined effect of Coulomb interactions between electrons on the molecular states and the reorganization processes in the ambient may significantly affect both Seebeck coefficient and the power factor. Specifically, we show that electron-electron interactions may counter-balance the effect of the ambient molecules reorganizations resulting in qualitative changes in the behavior of both zero-bias conductance and thermopower.
Read the full abstract
Combinatorics
Composing group automorphisms with colour-preserving automorphisms of Cayley graphs
We show that if $\varphi$ is a colour-permuting automorphism of a connected, finite Cayley graph, and the order of the Cayley graph is either odd or square-free, then $\varphi$ is the composition of a group automorphism and a colour-preserving graph automorphism. Some analogous results are also established for isomorphisms between two different Cayley graphs.
Read the full abstract
Networking
Automated Mobile Video Objective Testing System
Applying QoE analysis to optimize usage of cellular spectrum is of high interest to mobile network operators. A key challenge is to be able to perform QoE measurement across very different types of apps, from DASH VoD to interactive applications such as Video Conferencing and Cloud Gaming. This paper presents AMVOTS, a QoE measurement system developed by AT&T, which is flexible enough to support a large range of application types and network conditions. We also discuss using AMVOTS as part of a closed loop to prototype QoE-aware radio resource allocation.
Read the full abstract
Artificial Intelligence
CityPlanner: A Sandbox Agent for Executable Urban Planning
Urban planning is a real-world spatial optimization problem that requires selecting feasible actions from large candidate spaces under practical objectives such as cost and service quality. Existing optimization and reinforcement learning methods are effective for fixed formulations, but often depend on task-specific representations and constraint handling. We propose CityPlanner, a sandbox-agent framework for executable urban planning. CityPlanner introduces UrbanSandbox, a unified file-based environment where agents inspect task files, generate plans, run evaluators, and revise decisions based on executable feedback. To make learning tractable, we further propose atomic-task reinforcement learning, which decomposes long sandbox trajectories into BuildPlan for initial construction and ImprovePlan for feedback-based refinement. Experiments on a real-world benchmark show that CityPlanner consistently outperforms heuristic, task-specific RL, and general LLM-agent baselines. Ablations verify the contributions of UrbanSandbox, atomic-task RL, and iterative deployment. We release the code and dataset at https://anonymous.4open.science/r/co-agent-C1C8
Read the full abstract
Image and Video Processing
Myocardial Strain Drift Correction in Deep Learning Based Ultrasound Tracking
Myocardial strain from echocardiography is a key biomarker for cardiac function. Recent deep learning methods show strong performance for myocardial motion tracking but often lack physiological constraints, leading to temporal drift across the cardiac cycle. Consequently, tracked points may not return to their relative initial positions at the end of each cardiac cycle, producing inaccurate strain estimates and even divergence in some cases. We propose a deep learning framework that compensates for drift during myocardial tracking. We extend a state-of-the-art echocardiographic tracking method (TAS-Net) with persistent memory tokens that share information across sliding windows over full cardiac cycles. A teacher-student fine-tuning strategy on real echocardiographic data then enforces physiologically consistent cyclic motion while preserving tracking accuracy. Experiments show reduced global and regional strain drift, improved agreement with clinical references, and better test-retest reproducibility, supporting more reliable myocardial strain estimation in clinical practice.
Read the full abstract
Soft Condensed Matter
The validity of the Stokes-Einstein relation in ionic liquids
Ionic liquids (ILs) exhibit supercooled liquids behavior even above room temperature and the Stokes-Einstein (SE) relation is often considered to be invalid in ILs as that in supercooled liquids. However, the conclusion is usually drawn based on some variants of SE relation. In this work, we have systematically investigated the validity of the Stokes-Einstein relation in ILs by performing molecular dynamics simulations of coarse-grained IL within the temperature range of 400-800 K. Both the original SE formulation, and two commonly employed variants, were examined to assess their applicability and consistency. These three formulas yield distinctly different results, indicating that the two variants are not reliable substitutes for the original SE relation. The inconsistency suggests the fact that the r in Stokes law varies with conditions. The breakdown arises from the ion correlations introduced by the strong electrostatic interactions. This proposition is further confirmed by simulations.
Read the full abstract
Computation and Language
Beyond Top Words: MonoTM for Topic Modeling with Interpretable Monosemantic Features
Topic models summarize large text corpora, but top-ranked words often provide only a limited representation of topic semantics. Sparse autoencoders (SAEs) offer a way to move beyond word-level descriptors by extracting interpretable features from dense representations, yet how feature interpretability relates to topic-inference quality remains unclear. We introduce MonoTM, an interpretable topic modeling framework that decouples these roles. Across three benchmark corpora, we show that document–topic mixture estimation and semantic interpretation favor different SAE configurations and feature subsets. MonoTM estimates mixtures from the full SAE bag-of-features representation and, with them fixed, learns topic descriptors over a separate vocabulary of corpus-grounded semantic features. This design preserves global topic structure while representing topics with semantic units more meaningful than individual words, making them more useful for downstream corpus analysis.
Read the full abstract
Cryptography and Security
When Ad Networks Misbehave: Understanding Risks of Semi-Drive-By Splash Ads
We investigate the mobile splash ads ecosystem, i.e., full-screen advertisements shown at app launch, where monetization relies on interaction signals that are difficult to verify end-to-end. This setting is especially sensitive because incidental touches and sensor-driven callbacks are common yet easy to misattribute as engagement. Prior work has largely framed mobile ad fraud as a publisher-side problem, while some studies attribute fraudulent operations to embedded ad libraries. Yet an important risk remains underexplored: ad SDKs control how interaction signals are interpreted, measured, and reported, creating an opportunity to reinterpret ambiguous user or device signals as valid advertising interactions. We uncover a previously less-known form of fraud at the ad-network layer in which splash ads are triggered not by intentional user actions but by incidental or indirect interactions, which we term semi-drive-by splash ads. By translating non-ad interactions into billable engagement events, ad networks can inflate performance metrics, overcharge advertisers, and erode user trust. To expose this behavior in the wild, we design AdHive, an automated honeypot-like analysis framework that induces evasive splash-ad delivery and landing behaviors under realistic device conditions. AdHive reproduces human-like activity through LLM-generated usage traces and sensor dynamics, enabling execution paths that remain hidden in conventional analysis environments. Our large-scale measurement across thousands of popular Android applications shows that semi-drive-by splash ads are widespread and are often triggered by subtle signals such as minor sensor variations. We further confirm real-world impact by working with one of China's largest advertisers, identifying multiple ad networks engaging in this fraud and leading to enforced repayments of about 4 million Yuan (approximately US$600,000).
Read the full abstract
Computational Engineering
Geometric organization of olfactory descriptor data in the Poincaré disk
Odor quality is commonly represented using high dimensional descriptor profiles, yet their low dimensional organization remains unclear. We investigated whether a two-dimensional hyperbolic embedding can provide an interpretable representation of this structure. We applied hyperbolic metric multidimensional scaling to two complementary datasets: 480 Sagar rating profiles from three participants rating 160 odorants on 15 continuous descriptors, and 4983 GoodScents–Leffingwell molecules annotated with 138 binary descriptors. The embeddings substantially preserved pairwise descriptor distances, supporting subsequent analyses of radial and angular organization. In Sagar, rating profile entropy was strongly and negatively associated with hyperbolic radius, with diffuse profiles closer to the center and concentrated profiles closer to the boundary. This radial organization emerged primarily at the level of the full descriptor profile, rather than any individual descriptor, and remained robust across alternative descriptor representations, participant specific analyses, and averaged ratings. Sweet, musky, fruity, pleasantness showed the strongest directional trends. In GoodScents–Leffingwell, active label entropy, reflecting descriptor multiplicity, increased with radius, whereas orthogonalized descriptor entropy, reflecting spread across orthogonal modes, decreased with radius. Related binary descriptors occupied coherent localized high-density regions. These findings reveal complementary radial and angular organization in the hyperbolic representation of olfactory descriptor data. They support hyperbolic mapping as an interpretable descriptive framework in which radius summarizes global profile properties, while the angular component captures continuous descriptor gradients and categorical organization.
Read the full abstract
Machine Learning (Statistics)
Learning with Synthetic Data via SGD in High-Dimensional Linear Regression
Synthetic data has become a promising way to scale model training beyond limited human-generated data but it may also induce strong model collapse (Dohmatob et al., 2024), where any fixed fraction of synthetic data prevents model performance from improving under data scaling, leaving a non-vanishing excess risk floor. In this paper, we study how synthetic data affects the generalization of one-pass SGD in high-dimensional linear regression with model shift. We establish finite-sample risk bounds for mixed and two-stage training, separating standard bias and variance from source-mismatch effects, namely fluctuation and persistent drift under mixing and filtered initialization bias under two-stage. These bounds reveal a sharp contrast: mixed training induces strong model collapse, while two-stage training avoids the floor by using synthetic data only in the first stage, showing that collapse is not inevitable under a simple data curriculum. Under a random sketch model, we further obtain scaling laws for both protocols, with tight results for mixed training in the optimization-saturated regime. These laws show that larger models may amplify synthetic-induced degradation under mixing, and quantify how high-quality synthetic pretraining may reduce bias in two-stage training. Finally, we establish an exact finite-sample necessary-and-sufficient condition for two-stage training to strictly outperform real-only training under the same real-data budget and identical real-stage updates. Overall, our results highlight that synthetic data is neither inherently harmful nor beneficial; its effect depends critically on both its quality and the training protocol used to incorporate it.
Read the full abstract
Quantum Physics
Momentum-resolved magnetic noise spectroscopy using ensembles of diamond quantum sensors
Spatiotemporal fluctuations across multiple scales govern and characterize the emergent properties, phase boundaries, and low-energy excitations of strongly correlated matter. However, capturing these dynamics has remained a major experimental challenge, as conventional probes typically offer either high spatial or temporal resolution, but not both simultaneously. Here, we leverage high-fidelity wide-field imaging of dense diamond nitrogen vacancy center ensembles to measure the momentum and frequency power spectral density of magnetic fluctuations. To access spatial wavevectors below the diffraction limit, we tune the sensing volume continuously through optical depletion. This approach enables study of equilibrium and driven fluctuations across three orders of magnitude in spatial scale and tunable frequency bands, providing a direct means to map low-energy, long-wavelength fluctuations in correlated systems.
Read the full abstract
Analysis of PDEs
On the feasible set of a membrane shell under confinement. Smooth inactive admissible displacements are dense
We establish a density property for the obstacle problem of a linearly elastic elliptic membrane shell required to remain confined in a prescribed half-space. For a bounded Lipschitz reference domain, and under the sole assumption that the reference configuration lies at a strictly positive distance from the confining plane, we prove that smooth admissible displacements for which the confinement constraint is inactive (satisfied with a strictly positive margin) are dense in the set of all admissible displacements. This removes the additional condition on the unit normal to the mid-surface required in previous work, and the approximation scheme is elementary and adaptable to other unilateral obstacle problems.
Read the full abstract
Computation and Language
Reproducing Omitted Temporal Expressions in Japanese News for Retrieval-Augmented Applications
News articles often contain omitted temporal expressions, such as day-only or month-only mentions, which must be interpreted with reference to the publication date. When such articles are indexed or processed as standalone text in search and retrieval-augmented generation (RAG) systems, these omissions can cause temporal mismatches and unstable interpretation by large language models. We focus on reproducing omitted temporal expressions as concrete dates or intervals using the publication date as external context before the articles are indexed for search and RAG applications. Specifically, building on established temporal-expression extraction and normalization techniques and informed by a manual analysis of Japanese news articles, we propose jaROTE, a rule-based pipeline for Japanese news. Experiments on two news corpora demonstrate that jaROTE achieves high performance, and remains competitive with LLMs while providing a fast, low-cost pipeline. We further show that temporal reproduction improves time-constrained lexical retrieval, demonstrating the practical value of publication-date-grounded normalization for Japanese news retrieval.
Read the full abstract
Operator Algebras
Nonclassical Weyl laws and Connes' Integration for weak Lorentz ideals, II
This is the second in a series of papers on Connes' integration in weak Lorentz ideals. Building on the Dixmier trace theory, Birman–Solomyak perturbation theory, and strong measurability developed in Part 1, we establish a spectral form of Pietsch's correspondence for traces on these ideals, extending to this setting results of Semenov–Sukochev–Usachev–Zanin for the weak trace-class. The correspondence describes the positive normalized traces in terms of Banach limits and yields a complete spectral characterization of strong measurability. We also introduce hypermeasurability (measurability with respect to every normalized trace). Unlike the ambient ideal, it depends on the specific regularly varying function chosen, and we characterize it spectrally by means of eigenvalue sums. We further show that hypermeasurability and spectral measurability are incomparable. Finally, we apply these results to examples arising from nonclassical Weyl laws in the sense of Simon, including the logarithm of the Laplacian on a closed manifold, the double Laplacian, multi-tensor products of Laplacians, and an example arising from Connes' approach to the Riemann Hypothesis.
Read the full abstract
Machine Learning
Positional task conditioning for scalable defect detection across product families in large product catalogs
Product families in large product catalogs suffer from inconsistencies such as duplicates and unit mismatches that degrade customer experience. Detecting these requires reasoning over multiple error types across lengthy product listings, where LLM classification quality degrades due to long-context limitations. We address this by decomposing detection into focused sub-tasks that reduce context and isolate error types, improving F1 from 52% to 87%. For scalable deployment, we introduce Positional Task Conditioning (PTC), which distills this capability into a single smaller model by reinforcing task identity at structural prompt boundaries. PTC outperforms rationale-based distillation across five models and two architecture families, achieving within 1.79% F1 of the frontier at upto 98% lower cost. Our system is deployed across multiple countries processing 10+ million product families.
Read the full abstract
Materials Science
Composition and Surface Termination Control Band Alignments in P3HT/Perovskite Heterostructures
Hybrid organic-inorganic perovskite heterostructures are emerging platforms for energy conversion and optoelectronic devices, yet the effects of composition and surface terminations on band alignment remain poorly understood. Here, using high-throughput first-principles calculations, we systematically reveal the effect of composition and surface termination on the band alignment of 820 heterostructures formed between poly(3-hexylthiophene) (P3HT) variants and conventional and mixed-cation metal halide perovskites. Band edge analysis predicts concentration dependent band alignments, with most Pb and Sn based perovskites exhibiting Type II and III behavior while mixed-cation CsMASnBr3 uniquely forms Type-I junctions with all P3HT variants. Explicit interface calculations reveal that surface termination can reverse the predicted alignment in conventional tin perovskites, while the mixed cation perovskite preserves Type-I alignment with P3HT regardless of termination. Despite negligible charge transfer, termination dependent band offsets produce markedly different carrier confinement, establishing design principles for engineering P3HT/perovskite interfaces.
Read the full abstract
Artificial Intelligence
Multi-Agent Agentic Graph Learning via Structural Signatures
Agentic graph learning (AGL) has recently achieved promising results on graph reasoning tasks, where an agent powered by a large language model (LLM) sequentially samples the graph as evidence to support its final prediction. Existing methods either employ a single agent or orchestrate multiple role-based agents to reason and learn over the entire graph, but both essentially rely on a shared reasoning policy across different graph regions, which can be suboptimal for graphs with heterogeneous structural and semantic patterns. Inspired by the progress of multi-agent collaboration on complex reasoning tasks, a natural remedy is to let multiple agents own different memory and collaborate; however, applying this paradigm to graphs directly faces two challenges. First, existing AGL methods typically verbalize graph structures into natural-language descriptions for LLM agents, making the reasoning process sensitive to the ordering of structural information and thereby breaking the permutation-invariant nature of graphs. Second, incorporating increasingly large sampled neighborhoods leads to rapidly growing contexts. To address these challenges, this paper introduces a multi-agent agentic graph learning (i.e., MAAGL) framework. MAAGL partitions the graph into communities and assigns an independent agent to each community for region-specific specialization. MAAGL represents structural and semantic evidence separately. Structural evidence is summarized by a dynamically updated structural signature that is permutation-invariant and fixed in size, while semantic evidence is filtered to the top-k nodes ranked by relevance. Based on historical trajectories with similar signatures, agents estimate their confidence and trigger debate-style collaboration when needed. Extensive experiments on four benchmark datasets show that MAAGL outperforms SOTA AGL methods.
Read the full abstract
Machine Learning
Robust Industrial Cyber Physical Classification Using Neuromorphic Temporal Embeddings and Hybrid SNN XGBoost Under Machine Unlearning Attacks
The digitalisation of electrical distribution networks has increased the exposure of power-grid infrastructure to cyber attacks. Existing intrusion detection systems (IDSs), however, often rely on computationally expensive deep learning models that are difficult to deploy at the edge. Periodic retraining also exposes these systems to machine unlearning attacks, where selective data removal can degrade detection performance. We propose a hybrid Spiking Neural Network (SNN) and XGBoost architecture that combines efficient temporal encoding with a lightweight classifier and provides structural resilience to such attacks. The SNN is trained once on clean data and used as a fixed feature extractor, while only the XGBoost classifier is retrained during model updates. Evaluated on two real-world public power-system datasets, the proposed method achieves 99.9% accuracy (F1-macro 0.999) on the Synchrophasor dataset and 95.0% accuracy (F1-macro 0.943) on the MSU/ORNL dataset, outperforming standalone baselines. Under selective label-flipping attacks, the hybrid model loses only 0.9% F1-macro at 10% poisoning and delays target-class collapse from 60% to 70% poisoning compared with raw models. These results demonstrate that neuromorphic temporal encoding can provide both accurate cyber-attack detection and improved resilience to data poisoning in cyber-physical systems.
Read the full abstract
Combinatorics
Isomorphisms of abelian Cayley graphs with their natural edge-colouring
We prove that if $\varphi$ is an isomorphism between two connected Cayley graphs of abelian groups, and $\varphi$ respects the natural edge-colourings of the Cayley graphs, then $\varphi$ is the composition of a group isomorphism and a colour-preserving graph automorphism. This implies that if every colour-preserving automorphism of a connected abelian Cayley graph $Cay(G;S)$ is an affine map, then the same is true for every colour-permuting automorphism. We also show that this property holds if and only if the subgroup generated by $\{\, s \in S \mid 2s \neq c \,\} \cup \{c\}$ has index $\le 2$ for every element $c$ of order $2$ in $G$.
Read the full abstract
Disordered Systems and Neural Networks
Curvature-Induced Geometric Universality in Non-Hermitian Anderson Transitions
In Euclidean space, universality classes of Anderson transitions are primarily determined by symmetry and spatial dimensionality. Here, we present evidence for a geometry-controlled universality class of non-Hermitian Anderson transitions on hyperbolic-like lattices. In this setting, critical behavior is influenced by the large-scale hyperbolic geometry, characterized by negative curvature, exponential volume growth, and a non-Euclidean notion of spatial scaling. Finite-size scaling of participation ratios across several distinct \( \{p,q\} \) tilings reveals one-parameter scaling collapses with a common critical exponent \( \nu\simeq1 \) within numerical accuracy. A complementary phenomenological coarse-grained Landau-Ginzburg analysis shows how exponential correlation-volume growth suppresses critical fluctuations, offering a rationale for the observed mean-field-like scaling. Our results suggest that spatial curvature can act as an additional organizing principle for Anderson-transition universality beyond the conventional dimensionality- and symmetry-based classification.
Read the full abstract
Computation and Language
Towards Automatic Evolution Tree Generation from Citation Graphs
Surveys remain the primary way researchers grasp the lineage of methods within an AI subfield, but they scale poorly against the current rate of publication. Existing taxonomy-induction methods are largely leaf-bound and time-agnostic; they tend to force transitional papers into mature leaves and can create topological inversions between ancestors and descendants. We propose EvoTree, a staged framework that decouples conceptual backbone learning from temporal refinement: a graph-aware encoder with distribution-based hierarchical clustering yields a stable taxonomy backbone; temporal fine-tuning then re-attaches marginal papers to internal nodes under monotonic-path constraints; a final LLM pass labels concepts without altering the topology. We release the first annotated benchmark for this task across 11 AI subfields. EvoTree attains the highest NMI and citation-direction accuracy among all baselines and the best concept purity on the annotated benchmark, and is the only method with non-trivial marginal-paper detection on the annotated set.
Read the full abstract
Software Engineering
The Vibe Shift in Software Engineering: Evaluating AI-Led Conversational Programming for Performance, Cognition, and Responsible Adoption
This study evaluates Vibe Coding, an emerging AI-led conversational programming paradigm that enables developers to generate software through natural-language interaction with large language models. Using a mixed-methods design, the study assessed performance efficiency, cognitive implications, and responsible adoption in comparison with traditional and AI-assisted coding environments. Thirty participants, including professional developers and advanced computing students, completed equivalent programming tasks under three experimental conditions. Quantitative data were analyzed using descriptive statistics and repeated-measures ANOVA, while qualitative data were examined through thematic analysis. Results show that vibe coding significantly improved development efficiency, reducing task completion time by 27% compared with traditional coding and 12% compared with AI-assisted coding. However, these gains were accompanied by lower maintainability indices and higher security vulnerabilities, indicating trade-offs in software quality. Usability results yielded a good rating (SUS = 71.4), while cognitive workload remained moderate (NASA-TLX = 55.5), reflecting reduced syntactic effort but increased linguistic reasoning. Thematic analysis identified trust calibration, loss of control, cognitive adaptation, and prompt-engineering strategy as key constructs. Notably, perceived loss of control was associated with increased security risks due to reduced transparency and validation of AI-generated outputs. Based on these findings, the study proposes a three-pillar framework for responsible adoption: hybrid integration of human and AI capabilities, human oversight and transparent accountability, and context-aware deployment. Overall, vibe coding enhances productivity but requires critical oversight, reinforcing its role as a transformative yet transitional paradigm in software development.
Read the full abstract
Hardware Architecture
Differential Stochastic Simulated Annealing Processor for Fully Connected 2048-Spin Optimization
A 2,048-spin fully connected annealing processor based on differential stochastic simulated annealing (DSSA) is presented as an architectural design in TSMC 28 nm CMOS with a 3 mm x 4 mm post-layout area. The processor closes timing at 500 MHz, integrates a 16 Mb SRAM weight memory, and amortizes stochastic noise across 16 spins with area-efficient random number generators. DSSA keeps a serialized datapath for density but recomputes interactions only for spins that flip, shrinking the effective workload to the active frontier during each annealing run. Spin-select scheduling, priority-based weight reads, and a temperature controller that skips idle steps accelerate sparse updates without sacrificing full connectivity. Post-layout simulation results show 2.7 ms time-to-solution (TTS) and 0.86 mJ energy-to- solution on 2,000-spin problems at 316 mW (0.15 mW/spin), achieving 1.5x lower power and 3.5x lower TTS energy than projected prior fully connected annealers. These results demonstrate the potential of the proposed DSSA architecture for large-scale combinatorial optimization hardware under post-layout evaluation.
Read the full abstract
Commutative Algebra
$F$-depth and $F$-nilpotent rings: generalizations and applications
Computation of the Frobenius closure of ideals in rings of prime characteristic is a difficult problem. For a given ideal, its Frobenius test exponent provides a valuable degree of uniformity in performing the calculation. Hence, it is desirable to find uniform upper bounds on the Frobenius test exponent of ideals. Even in nice rings of low dimension, Brenner showed considering the collection of all ideals is generally hopeless, but for Cohen-Macaulay rings, Katzman-Sharp there are uniform upper bounds on the Frobenius test exponent for the class of parameter ideals. Subsequent efforts in controlling the Frobenius test exponents have typically involved studying the Frobenius action on local cohomology and the degree to which this action is nilpotent. The goal of this survey article is to examine the history of the Frobenius test exponent problem and its relationships to singularity types for local rings defined in terms of the Frobenius action on local cohomology. We also explore several generalizations of these prior results to a setting where less nilpotence in the Frobenius action is assumed.
Read the full abstract
Quantum Physics
From Certifying Rank $k$ Projectors To Non-Positivity, Entanglement, And Non-Hermitian Witnesses Through Traces Of Matrix Powers
We all know that a density matrix $\rho$ is pure if and only if $\mathrm{Tr} \,\rho^2 = 1$. But is this the only way to prove the purity of $\rho$ using the trace of its powers? Here I systematically study the necessary and sufficient conditions of the more general question of guaranteeing that all eigenvalues of a Hermitian matrix belong to a specified set through its trace of powers. More importantly, these characterization results are automatically witnesses certifying a quantum state as entangled, a Hermitian operator has least one negative eigenvalue and a linear operator as non-Hermitian. I demonstrate the effectiveness of these witnesses, analyze their performance, and study their strength, weakness together with resource requirement through numerical simulation as well as analytical work. I also discuss briefly the effects of numerical stability, uncertainty in measurement and rounding errors on these problems.
Read the full abstract
Machine Learning (Statistics)
High-probability guarantees for linear accessibility in feature superposition
Neural networks can leverage feature superposition to encode more concepts than dimensions, but cross-feature interference constrains the linear accessibility of simultaneously active features. By framing linear accessibility as a compressed sensing problem, we derive high-probability bounds for fixed supports under subgaussian noise, proving the sufficient dimension scales linearly ($d=O_{\varepsilon}(k \log m)$) rather than prior worst-case quadratic limits. We characterize the asymmetry between active and inactive interference and the trade-off between interference and observation-noise budgets. We then validate these bounds across system parameters through Gaussian-tail approximations. We also introduce IHT-SAE, which uses learned iterative refinement to improve feature recovery beyond the limits of linear availability. These results quantify the geometric constraints of the linear representation hypothesis, providing a framework for evaluating sparse autoencoders, compositional generalization, and neural interpretability.
Read the full abstract
Astrophysics of Galaxies
Time-Domain Dust Astrophysics. II. TransRAT: Time-Dependent Grain Alignment and Disruption by Cosmic Transients and Their Observational Signatures
We introduce TransRAT, a self-consistent time-domain framework that follows the coupled dynamical response of dust to transient irradiation and predicts its observable signatures. We apply TransRAT to a Type~IIP supernova illuminating a one-zone molecular cloud. Radiative heating raises the grain temperature, modifying the magnetic susceptibility and Larmor precession, while the enhanced radiation field accelerates radiative precession and can switch the alignment axis from the magnetic field (B-RAT) to the radiation direction (k-RAT). Simultaneously, strong RATs align grains faster than gas randomization, extending fast alignment to smaller grain sizes, and disrupt large grains through RAT disruption (RAT-D), irreversibly modifying the grain size distribution. As the transient fades, the alignment axis returns to ${\bf B}$ at a rate controlled by the magnetic susceptibility, whereas the enhanced aligned-grain population and RAT-D-modified grain size distribution can persist long after the radiation has faded- referred to as physical memory effects. The time-dependent evolution of grain alignment and disruption produces distinctive observational signatures: a flare in extinction and thermal dust polarization followed by a RAT-D-induced dip; a blueward shift of the polarization peak $\lambda_{\max}$; a polarization-angle rotation equal to the projected ${\bf B}$–${\bf k}$ separation ($45^{\circ}$ for our adopted geometry) when RAT-D removes large high-$J$ aligned grains and leaves low-$J$ grains aligned with kRAT followed by angle reverberation as alignment returns to ${\bf B}$; and a non-monotonic evolution of $R_V$. The persistent observational manifestations of the transient irradiation, including enhanced polarization, blueshifted $\lambda_{\max}$, modified $R_V$, and polarization-angle evolution, constitute fossil imprints of past cosmic transients.