Statistical Finance
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 7 November
A hedging objective reflects the risk preference of the hedger, so the conventional approach is to estimate the hedge ratio directly under the chosen objective. This paper asks whether that estimate should be used alone. We construct five objective-specific rolling hedge-ratio estimators—minimum variance, least absolute deviation (LAD), downside semivariance, lower-tail quantile, and Expected Shortfall (ES)—from the same historical stock–market returns, and combine the resulting estimates under a fixed final evaluation objective. Separate multi-output ExtraTrees models predict the within-stock-date ranks of the five candidates under MSE, LAD, downside semivariance, and 10% quantile loss. The design uses pre-specified 60-, 90-, 120-, and 180-day windows with objective-matched rolling estimators as benchmarks. Adaptive weighting improves the corresponding loss in all sixteen objective–window comparisons. Equal weighting, which uses the same objective-specific hedge ratios without state variables or learned reweighting, already improves downside and quantile hedging. The results therefore suggest that estimates generated under other objectives can be useful even when the final hedging preference and evaluation objective are fixed, while adaptive weighting can provide a further improvement.
Analysis of PDEs
On the Vázquez Strong Maximum Principle for Linear and Nonlinear Elliptic Equations with Unbounded Coefficients and Optimal Conditions
In this paper, we present adaptations of the classical strong maximum principle for a certain class of equations, with particular emphasis on linear operators in non-divergence form and a new strategy to prove it. The novelty of our approach lies in the setting of the problem: the coefficients of the operators are unbounded, assumed to be merely integrable in the $L^{p,q}$-sense, and the source term $f$ on the right-hand side of the equation is treated under optimal integrability assumptions.
Read the full abstract
Artificial Intelligence
Evaluating classification and explainability in multimodal petrographic image analysis
Automated thin-section classifiers increasingly combine plane-polarised and cross-polarised light (PPL and XPL), two complementary views central to petrographic identification. Classification accuracy alone does not reveal whether model errors reflect mineralogical relationships, how predictions depend on each optical view, or whether attribution maps identify regions that influence model decisions. Here, we examine these complementary aspects of the released LITHOS dual-stream vision transformer using outputs from an earlier evaluation of 105,802 expert-annotated grains across 25 categories. Classification errors frequently followed the label taxonomy: 72.6% of misclassified plagioclase, microcline and sanidine grains were assigned the generic Feldspar label, while 87.1% of quartz-family grains received a label within that family, compared with 66.6% assigned their exact label. Replacing the XPL input with its per-channel spatial means produced a greater reduction in true-class probability than equivalent PPL replacement in 20 of 25 categories, but not in the three quartz categories. Five explainable artificial intelligence (XAI) attribution procedures generated visually distinct maps for identical inputs. In a superpixel-deletion analysis involving 30 grains from 29 thin sections, method-minus-random contrasts ranged from $-0.043$ to $0.057$, with all 41 simultaneous 95% confidence intervals including zero. Together, these findings show that error structure, modality sensitivity and attribution behaviour capture distinct aspects of model performance that cannot be established from classification accuracy or visual inspection of attribution maps alone.
Read the full abstract
Friday 6 November
General Relativity and Quantum Cosmology
Extracting Energy from a Traversable Wormhole via Magnetic Reconnection: Circular Orbits and the Plunging Region
Using the Comisso-Asenjo magnetic reconnection mechanism, we study energy extraction from the Teo traversable rotating wormhole at different orbital locations. This wormhole has no event horizon and cannot reduce to a Kerr black hole in any parameter limit. We compute circular orbits on the equatorial plane, the prograde photon sphere, and the innermost stable circular orbit (ISCO). We find that below a certain spin, no circular orbit exists inside the ergosphere. Both the efficiency and power calculated from magnetic reconnection increase monotonically with angular momentum. Compared with a Kerr black hole under the same plasma parameters, the Teo wormhole has higher energy extraction power and efficiency. This is completely different from the Simpson-Visser rotating wormhole, which can reduce to a Kerr black hole, where the large spin makes efficiency and power decrease. We also extend magnetic reconnection to the plunging region. We find that when the spin is not particularly high, the energy extraction power and efficiency in the plunging region are higher than those in the circular orbit region, while for very high spin the situation is reversed. This conclusion also differs from that obtained from a Kerr black hole, where the power and efficiency in the plunging region are always higher than those in the circular orbit region.
Read the full abstract
General Physics
New Agegraphic Dark Energy in Braneworld Cosmology: A Higher Dimensional Perspective on Dark Energy Evolution
In this study, we investigate the new agegraphic dark energy model within the context of braneworld cosmology. A higher dimensional viewpoint on the evolution of dark energy is examined. A combination of cold dark matter and dark energy, is explored within the frameworks of RS-II and DGP brane as the underlying gravitational theories. Both the possibilities involving interaction and non-interaction between dark energy and cold dark matter are investigated. A range of cosmological parameters, including the equation of state parameter, deceleration parameter, and statefinder parameters, are examined. The squared velocity of sound is examined to assess the system's stability. A data analysis based on observations, utilizing contemporary cosmological data and the Markov chain Monte Carlo method, is conducted to constrain the parameter space of the model. Our research suggests that the interplay between higher-dimensional phenomena and agegraphic dark energy provides a theoretically robust and observationally consistent framework for the universe's late-time acceleration.
Read the full abstract
Computer Vision
TopSDF: Topological Signed Distance Field for High-Quality Triangle Mesh Extraction from 3D Gaussian Splatting
Recent advances in 3D Gaussian Splatting (3DGS) have demonstrated its effectiveness for photorealistic novel view synthesis. However, extracting clean, watertight, explicit surface meshes from 3DGS remains a critical challenge. Previous methods approximate geometry via discrete Marching Tetrahedra, where each grid vertex is assigned a single scalar signed distance value. At complex geometric boundaries and thin structures, this suboptimal parameterization forces severe compromises across shared vertices, causing gradient collisions and geometric frustration. Furthermore, existing optimization objectives neglect element shape conditioning, producing degenerate triangles. We introduce TopSDF, a framework that models the signed distance state as a multivariate Gaussian random field. By learning latent topological covariances across tetrahedral vertices, our formulation expands local degrees of freedom for SDF estimates, allowing the candidate mesh vertices to be placed flexibly along the bipolar edges in the tetrahedra as driven by such topological correlation. Concurrently, we directly integrate variational meshing energies into the joint optimization, coupled with an energy-driven Gaussian densification strategy to improve triangle mesh quality. Our experiments across Mip-NeRF 360, Tanks & Temples, and ScanNet++ show that TopSDF achieves state-of-the-art mesh-based novel view rendering (+0.86 dB PSNR on Mip-NeRF 360) and triangle-mesh quality (from 0.37 to 0.49 aspect ratio).
Read the full abstract
Computer Vision
Different Timescales, Different Signals: Multimodal Landmark-Visibility Prediction in a Long-Term Webcam Network
Scenic visibility is not a single forecasting problem: planning a trip months ahead, deciding whether to go outside today, and judging whether tomorrow will be clear rely on different information. Using a year-scale multimodal archive of Mount Fuji webcams and meteorological observations, we identify a clear hierarchy across timescales. Seasonal climatology provides useful long-range guidance, webcam imagery is the strongest same-day observation (AUC 0.95), and the numerical forecast valid on the target day carries most of the day-specific signal one to three days ahead. Revealing this hierarchy requires evaluation that respects the dependence among cameras observing the same regional weather state: permissive splits substantially overstate multi-day performance, while date-grouped and forward-in-time evaluation reduce the apparent contribution of the current scene and current weather. On 6,575 camera-days, the current visual summary provides no measurable one-day gain once the target-day forecast is available. The remaining opportunity lies at shorter horizons, where the present visual representation discards cloud geometry and motion. These results recast scenic visibility prediction as a multi-timescale sensing problem rather than a single multimodal forecasting task.
Read the full abstract
Computer Vision
Small Data in Long-Term Environmental Vision: Annotation Noise, Gamification, and Label-Budget Scaling
Long-running environmental camera networks produce abundant images but few reliable annotations. Using FujiView, a network of webcams around Mount Fuji, we study three linked questions: whether gamification affects annotation participation and agreement, how annotators disagree on ordinal visibility labels, and how label budget affects downstream classification. Across seven nonrandomized sessions with 22 labelers, gamification showed a more promising pattern for sustained participation than for labeling speed or agreement. In the closest remote-session comparison, the session recorded as gamified had longer active labeling time, while throughput and reference agreement remained similar. Annotation disagreement was substantial at fine granularity: crowd votes matched the single-annotator reference on 49.1% of exact visibility classes, versus 90.2% after grouping them into Good/Poor. In five-replicate label-budget experiments, models using 25% of the available label pool achieved held-out exact accuracy only 2.8 percentage points below the full-pool model on average. Together, these findings highlight the importance of designing reliable annotation targets, evaluating engagement mechanisms without assuming causal benefits, and using empirical scaling curves to plan labeling effort.
Read the full abstract
General Relativity and Quantum Cosmology
Thermodynamics and interior structure of density-responsive regular black holes
This work studies regular black holes motivated by the scalar sector of density-responsive gravity (DRG). An algebraic prescription with phenomenological local running maps a Gaussian matter profile to a diagnostic density profile. A pressure check shows that this profile does not solve the full static DRG equations. It serves only to select an effective metric family with two horizons. The extremal mass is calibrated to $M_{\min} = \sqrt{1+A/2}\,M_{\mathrm{P}} \simeq 1.006\,M_{\mathrm{P}}$, where $A=0.024$ is the historical scalar response amplitude. A fit to $\rho(r) = \rho_0\exp[-(r/r_c)^n]$ selects $n=2$. The temperature is nonmonotonic, reaching $T_H^{\max}=0.02547\,M_{\mathrm{P}}$ at $M=1.332\,M_{\mathrm{P}}$ before vanishing at $M_{\min}$. The calculation verifies the generic scaling near extremality $\mathcal{Z}_{\mathrm{tr}}\propto(M-M_{\min})^{-1/2}$ of a static lapse diagnostic for $n=2,3,4,6$ and for the Hayward and Bardeen controls. A regulated integral of coordinate time between the horizons provides a static cavity diagnostic, not a prediction of echoes of gravitational waves. The remaining area entropy equals the area entropy already lost at $M_{\mathrm{cross}}/M_0=0.707107\simeq1/\sqrt{2}$. This geometric crossing does not establish a Page curve or unitarity. The endpoint area entropy is below $2.6\%$ of the initial Bekenstein-Hawking entropy for $M_0 = 5\,M_{\mathrm{P}}$ and below $0.03\%$ for $M_0 = 50\,M_{\mathrm{P}}$. An inverse source reconstruction confirms an isotropic core of de Sitter type but retains the pressure mismatch. An exploratory collapse calculation with an imposed bounce factor produces bounded configurations with $1-2m/r<0$ without establishing formation of the calibrated geometry. The robust results are the calibrated thermodynamics and generic scaling near extremality.
Read the full abstract
Risk Management
An INAR(1) Risk Model with by-claims applied to the PFAS issue
We propose there a new type of unidimensional discrete-time risk model in ruin theory involving both main claims and by-claims, where the latter ones are counted thanks to an INAR(1) process. In this way, the model embodies a contagion phenomenon, which may be used to describe the damages caused and covered by an insurance company ensuing the spreading of PFAS compounds in the environment. We present mostly asymptotic ruin probabilities, and multiple comparisons with other models derived from the aforementioned one, in particular with two models where the dependence assumptions are relaxed.
Read the full abstract
General Relativity and Quantum Cosmology
Fourier Transform of the Scalar Propagator with Quantum Light-Cone Fluctuations
We derive the Lorentzian Fourier transform of the Gaussian-smeared light-cone contribution to the scalar propagator in Krein-space quantization in terms of a Meijer $G$-function. We characterize its distributional structure, recover the massive propagator by adding the Bessel-function tail, and derive an exact expression for the massless one-loop bubble kernel using a position-space prescription.
Read the full abstract
Robotics
Robustness as a Transferable Skill: Cross-Task Adversarial Defense for Vision-Language-Action Policies
Vision-Language-Action (VLA) policies are vulnerable to adversarial visual perturbations, while defenses often require task-specific adversarial fine-tuning. We investigate whether robustness learned on source manipulation tasks can protect independently specialized target policies without target-side adversarial training. We first show that even a single source defense update improves robustness on held-out tasks, establishing cross-task defense reuse independently of multi-source aggregation. To combine source updates, we introduce Source-Norm Transferable Robustness Vector (SN-TRV), which retains the direction of their mean while calibrating its magnitude using source-update norms. The resulting update is applied to the target visual encoder without target adversarial data, target-side gradient optimization, or additional inference modules. Evaluations across three VLA backbones, fixed and adaptive attacks, and different source defense recipes show improved robustness over naive averaging and identify limits in attack coverage. Physical PiPER trials increase average success under printed adversarial patches from 20.3% to 45.8%.
Read the full abstract
Computer Vision
What Does Hard-Negative Fine-Tuning Teach Multimodal Large Language Models? Controlled Evidence from a Compositional Benchmark
Fine-tuning on hard negatives is a popular way to improve the compositional reasoning of vision-language models, but when accuracy goes up it is rarely clear what the model actually learned. We ask this question for multimodal large language models. We use CompHall, 2,860 forced-choice questions (spatial, attribute, counting and part-whole) with two graded hard negatives each, three model families (LLaVA-1.5, LLaVA-NeXT and Idefics2), and controls that such studies often lack: gray-image evaluation, three seeds, option-order tests, control arms trained on different question types, and independent benchmarks. We find four things. First, CompHall is not a pure test of vision: part-whole questions can be answered from the text alone (66-95% without the image), and per-image accuracy is unrelated to an object-hallucination probe (r = -0.05), so we see no evidence that compositional failures drive hallucination. Second, the original fine-tuning method scored mostly image-placeholder tokens and hurt both LLaVA models. With a corrected loss, fine-tuning raises accuracy on the spatial-relation questions of CV-Bench in all three families, by +3.2, +23.1 and +6.0 points (averaged over both option orders). Control arms show that the gain needs spatial training questions, and for LLaVA-NeXT about two-thirds of it appears even on relation words that were only wrong options in training. Third, the gain is not general: on CompHall itself it is significant only for LLaVA-NeXT (+6.9 points) and not detectable for Idefics2, it reaches about 3 points at most on true/false statements, and LLaVA-1.5 fine-tuned on other question types learns to answer "true" too often. Fourth, both losses raise the yes-bias of LLaVA-1.5 on POPE.
Read the full abstract
Instrumentation and Detectors
A Double Sided LGAD-Based Detector Providing Timing, Position, and Track Angle Information
We describe a detector concept which combines small pixels enabled by 3D sensor-electronics integration with gain produced by a Low Gain Avalanche Diode (LGAD) layer. The detector is double-sided, with electrons collected by the cathode, which provides timing information, and an anode with small pixels to provide position and angle information. The cathode can be coarse grained, providing timing with fewer fast amplifiers to limit power consumption. The anode layer benefits from the gain of the LGAD, with larger signals that also limit the power needed. Position can be reconstructed by measuring the pattern of total charge deposited on the anode. Angle and depth of charge deposit can be measured by the shapes of the anode pulses. We describe a possible assembly technology based on 3D integration.
Read the full abstract
Instrumentation and Detectors
A trap-based platform for cooling and laser spectroscopy of fast ions toward radioactive-ion applications
We report on the first experiments with the Stopping and Trapping of Radioactive Isotopes for Precision Experiments (STRIPE) segmented linear Paul trap. The intent for this apparatus is to serve as an efficient capture and laser-cooling trap for radioactive isotopes produced at radioactive ion beam facilities. We demonstrate the deceleration of 10 keV ion beams and their trapping and laser cooling into Coulomb crystals. As an initial spectroscopic benchmark, the dipole-forbidden $5s$ $^2S_{1/2}$ $\rightarrow$ $4d$ $^2D_{5/2}$ transition in $^{88}$Sr$^+$ was driven, partially resolving the Zeeman structure and yielding a Gaussian linewidth of 14.5(8) MHz, with the residual width attributed to the ions' micromotion. The lifetime of the metastable $4d$ $^2D_{5/2}$ state was measured to be 0.325(5)$_{\mathrm{stat}}$(4)$_{\mathrm{sys}}$ s, uncorrected for collisional quenching. Several measurements to quantify the cooling timescale, the detection rate of the photon collection region and the trap storage lifetime were also performed. The developed technique will allow radioactive ion beams to be decelerated and cooled for precision spectroscopy measurements.
Read the full abstract
Instrumentation and Detectors
Axis-selective AC magnetic-field imaging in the tens-of-megahertz regime using RF-dressed continuous-wave scanning NV magnetometry
Spatially resolved magnetic-field imaging reveals material properties and local currents in microelectronic devices. Conventional pulsed scanning nitrogen-vacancy (NV) magnetometry (SNVM) faces increasingly stringent microwave (MW) pulse-control requirements for detecting radio-frequency (RF) magnetic fields at frequencies ranging from tens to hundreds of megahertz. To address this challenge, we implement an RF-dressed continuous-wave (CW) sensing scheme for SNVM and demonstrate AC magnetic-field imaging at 33.5 MHz. The method exploits electron-spin double resonance in the NV spin-1 three-level system: the target RF magnetic field coherently couples two spin eigenstates, forming RF-dressed states whose splittings are detected in continuous-wave electron-spin double resonance (CW-ESDR) spectra under continuous laser, MW, and RF excitation. This approach avoids short, high-power MW pulses and synchronization between the RF field and a pulsed sensing sequence. Using an NV-ensemble diamond probe integrated with an atomic force microscope (AFM), we image the Oersted field of an RF-driven L-shaped microcircuit. Successively selecting three crystallographic NV axes by static bias-field control yields maps of RF magnetic-field projection magnitudes, with distinct distributions qualitatively reproduced by Biot-Savart calculations. Transverse bias-field control also tunes the RF-coupled spin-state transition frequency from 14.4 to 89.3 MHz, as characterized by spectroscopy and Hamiltonian analysis, with RF-dressed resonances directly observed in CW-ESDR spectra at 89.3 MHz. Together with previous RF magnetic-field detection up to 632 MHz using the same RF-dressed CW sensing principle in a confocal NV setup, these results support extending AC magnetic-field imaging with SNVM toward the hundreds-of-megahertz regime and, with additional phase information, vector magnetic-field reconstruction.
Read the full abstract
High Energy Physics (Phenomenology)
SuSy and CoDy Radiation from Evaporating Black Holes
We investigate the interplay between physics beyond the Standard Model and modified spacetime geometries in shaping the photon and neutrino spectra from evaporating black holes. We implement three representative supersymmetric (SuSy) benchmarks and a composite dynamics (CoDy) scenario in BlackHawk. We consider both Schwarzschild black holes and regular black holes geometries, namely polymerized, Hayward, and Simpson–Visser black holes. New degrees of freedom at the TeV scale become accessible at Hawking temperatures corresponding to black hole masses of approximately $M_{\rm BH}\sim 10^{10}\,\mathrm{g}$. We show that physics beyond the Standard Model produces distinctive signatures in both the instantaneous secondary-photon and neutrino spectra. Radiative decays generate narrow spectral features with approximately temperature-independent relative amplitudes, while multistep decay cascades produce broad enhancements that become increasingly pronounced at higher temperatures. In contrast, compressed mass spectra exhibit no localized features. Crucially, we show that the effects of new particle physics and modified spacetime geometries can become intertwined in specific energy regimes, altering the resulting spectral signatures. Our results demonstrate that photon and neutrino spectra provide complementary probes of new particle physics and black hole geometry, with predicted spectral enhancements extending into the energy ranges accessible to current and future high-energy observatories.
Read the full abstract
Computational Engineering
A Neural Physics Solver for Richards Equation
A new approach to discretise and solve Richards equation based on the finite element method (FEM) is presented. The novelty of the approach, called the Neural Physics method, is that it expresses the discretisation as a convolution neural network (CNN) whose weights are predetermined by the integrals of the basis functions in the FEM. The Neural Physics method is physically consistent as it represents a discretisation of the governing equation and can run on CPUs, GPUs and the latest AI accelerators, resulting in an increase in computational speed. The Neural Physics method is demonstrated for two different discretisations of Richards equation, including a multigrid method that is realised through a U-Net architecture. The accuracy and speed of these methods is tested on a problem with a known analytical solution and compared to a standard FEM, and shows that the Neural Physics method is almost an order of magnitude faster than a comparable FEM. Finally, the Neural Physics method is applied to a real-world test case with integrated experimental data and simulates the infiltration of water through a rain garden. This new approach therefore provides a route to efficiently and accurately solve Richards equation for a wide array of hydrological applications.
Read the full abstract
Robotics
Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions
Maze navigation requires localization from sparse, repetitive geometry, planning through narrow corridors, and control that stays safe when the estimate or the map is wrong. We present Maze Runner, an open autonomy stack in C++ and ROS 2 that addresses these needs end to end on a simulated Husarion ROSbot XL with a 2D LiDAR in Gazebo. Perception extracts wall lines from each scan with RANSAC and total least squares, with per-line uncertainty. The same line front end feeds two estimators: an Extended Kalman Filter (EKF) that localizes against a line map built from the maze mesh, and an EKF SLAM variant that builds the line map online. Planning runs online on an inflated occupancy grid with A* plus line-of-sight shortcutting, or with a forward-only Hybrid A*. A nonlinear Model Predictive Controller (NMPC) tracks the plan while discrete-time Control Barrier Functions (CBFs) on world-frame LiDAR points keep the robot clear of walls and unmapped obstacles. The algorithms live in a ROS-free, unit-tested core library, and the whole stack builds and runs from a single reproducible environment. In simulation, the robot drives a 135 m route through the maze with 1.0 cm localization RMSE against the known map and 24 cm in SLAM mode, the planner returns a path in 6 ms, and the NMPC solves in 11.7 ms on average, never exceeding its 80 ms budget.
Read the full abstract
Logic
The Four-Model Scott Complexity Spectrum: $F(4)=8$
Gonzalez, Rossegger, and Turetsky introduced a spectrum-counting function $F(n)$ for the Scott complexities realized by $\Pi^{\mathrm{in}}_2$ theories with exactly $n$ countable models. They proved $7\leq F(4)\leq 8$ and left the exact value open. We prove $F(4)=8$. More precisely, we construct a $\Pi^{\mathrm{in}}_2$ sentence with exactly four countable models whose optimal Scott complexities are $\Pi^{\mathrm{in}}_2$, $\Sigma^{\mathrm{in}}_3$, $\Pi^{\mathrm{in}}_3$, and $d\text{-}\Sigma^{\mathrm{in}}_3$, one of each. The construction starts with a complete first-order Ehrenfeucht theory having exactly two almost-prime and two limit models, whose existence follows from a realization theorem of Sudoplatov, and then passes to a full first-order Morleyization. The proof is organized around two low-level transfer principles. First, in a small theory, a $\Sigma^{\mathrm{in}}_3$ Scott sentence forces a model to be prime over a finite tuple; after Morleyization the converse holds. Second, if a model realizes every complete finite-tuple type over the empty set, then every $\Pi^{\mathrm{in}}_3$ sentence true in it is true in the countable saturated model. These two principles force the four models into the four distinct Scott-complexity classes above.
Read the full abstract
Mesoscale and Nanoscale Physics
Borrowed Planckian dissipation in magic-angle twisted graphene
In strange metals, the ratio of the coefficients producing signature linear-in-$T$ resistivity and the logarithmic specific heat is free of the coupling between the electrons and whatever scatters them. In the materials studied so far that coupling is fixed by chemistry. Magic-angle twisted trilayer graphene provides a dial with a displacement field $D$ that breaks the mirror symmetry separating a light Dirac cone from the flat bands, and the Dirac carriers borrow the Planckian self-energy of the flat band with a weight proportional to $D^2+D_0^2$. Resistance curves taken at eight fields are consistent with the field acting on the scattering rate rather than on the number of carriers. The slope in temperature follows $a(1+D^2/D_0^2)$ without the quartic term that a depleting Dirac pocket adds, and the elastic part varies by less than 5% between 0.20 and 0.30~V/nm while the inelastic part grows 2.5-fold up to 0.38~V/nm. The thermally averaged Kubo formula favors flat-band weight placed symmetrically about the Fermi level over a single level. Borrowed dissipation keeps the bath exponent and transport prefactor of the flat band's own electrons but carries exactly twice their entropy per unit of borrowed coupling whenever the bath has dynamics of its own, so the field-differential ratio is $2\pi^3/21\zeta(3)\approx2.46$ for a conformal flat band and, in a numerical search, at most 2.73 for monotonic bath spectra without a high-energy rate floor. The discriminating test is the entropy measured in steps of $D$.
Read the full abstract
Superconductivity
Goldstone-Mediated Chiral Superconductivity in Self-Doped Electron Crystals
Motivated by the observation of superconductivity in rhombohedral graphene in the proximity of electronic crystalline phases, we study the possibility of pairing mediated by electronic phonons. We focus on the vicinity of the phase boundary between trivial and topological electron crystals, where self-doping generically gives rise to a small Fermi sea of carriers with Dirac dispersion. We compute the Goldstone phonon spectra of the self-doped crystal (SDC) using a self-consistent approach, and subsequently derive the effective electronic-phonon-mediated interaction between itinerant carriers at the Fermi surface. Remarkably, we find that the Coulomb repulsion can be overscreened by the Goldstone phonons, leading to a chiral topological superconductor with an unpaired Majorana edge mode. Our conclusions are robust across the $\lambda$-jellium model and a simplified model of rhombohedral graphene, and we propose characteristic non-linear I-V signals as a test of our prediction. More generally, our results outline an intriguing route for unconventional superconductivity where both electronic correlations and topology play key roles.
Read the full abstract
High Energy Astrophysical Phenomena
Early X-ray emission as an observational diagnostic of gamma-ray burst progenitors
Identifying the progenitors of gamma-ray bursts (GRBs) from the properties of their early high-energy emission detected by wide-field satellites is crucial for advancing our understanding of GRB physics and for multi-messenger astronomy. Current classification methods, which rely primarily on prompt emission properties, exhibit large scatter and are challenged by recently detected events. In this Letter, we propose a new method to classify GRB progenitors using their early X-ray emission, which is detectable by current wide-field X-ray monitors. We performed a systematic time-resolved spectral analysis of the X-ray steep decay phase for a sample of 23 collapsar-driven GRB candidates detected by the Neil Gehrels Swift Observatory. We fitted the spectra over the $0.3 - 150 \, \rm keV$ energy range using both a physical synchrotron model and the empirical Band function, allowing us to constrain the spectral peak energy and the bolometric flux. We find a correlation between the rest-frame synchrotron cooling frequency, $\nu_{c,z}$, and the isotropic-equivalent luminosity, $L_{\rm iso}$, that is clearly separated from the $\nu_{c,z} - L_{\rm iso}$ relation followed by merger-driven GRB candidates. A similarly distinct separation is found in the correlation between the rest-frame peak energy, $E_{p,z}$, and $L_{\rm iso}$ obtained with the Band model. Finally, we provide a prescription for classifying fast X-ray transients detected by the Wide-field X-ray Telescope aboard the Einstein Probe mission, as its narrow energy range ($0.5 - 4 \, \rm keV$) limits spectral modelling to a simple power law. We show that the photon index and X-ray luminosity of the steep decay spectra clearly separate collapsar- and merger-driven candidate events, making them powerful diagnostics of GRB progenitors.
Read the full abstract
Programming Languages
SPMW: A Grid-Based Programming Model for Scalable Accelerator Design
Modern accelerators specialize recurring computation and replicate it across regular hardware structures to achieve high performance. Sustaining this parallelism requires equally deliberate data delivery. Yet design tools often express these structures as sequential programs or flatten them into separate hardware modules and connections. This obscures shared patterns and leads to repeated compiler work. We introduce Single Program, Multiple Connected Work Units (SPMW), a grid-based programming model for scalable accelerator design that makes grid regularity a first-class abstraction. SPMW decouples local work-unit behavior from grid connectivity and data delivery. To our knowledge, SPMW is the first programming model to retain regularity throughout the compilation process, combining behavioral HLS with structural RTL generation for both fixed-function and domain-specific instruction-programmable accelerators. We implement SPMW with a Python frontend and an MLIR-based compiler that synthesizes each distinct kernel configuration once for reuse across independent hardware instances. Preserving regularity also enables parallel compilation and functional simulation to accelerate iterative design feedback. We use SPMW to generate a 32x32 systolic array that reduces GEMM latency and parallel kernel-to-RTL compilation time by 4.36x and 619x relative to AutoSA. Our FFT achieves up to 2.65x lower latency than HP-FFT. Our mini-TPU and our SPMW implementation of the FEATHER accelerator demonstrate complex composition and outperform their RTL baselines. Parallel functional simulation provides up to 18.4x speedup over Vitis HLS C simulation on the mini-TPU workloads. SPMW is also agent-friendly: given the same design specification, all five coding agents produce SPMW designs that satisfy the correctness and latency requirements, with 7.51x lower token usage than for SystemVerilog.
Read the full abstract
Logic in Computer Science
When Proofs Are Abundant, What Is a Paper For?
AI systems now produce formally verified proofs of celebrated open problems, and the cost of obtaining a correct proof is falling toward zero. If correctness becomes cheap, what is left for a research paper to communicate? I argue that a paper is not exhausted by a verified statement. It is a narrative exposed to the criticism of a community, made of an intension (the author's choice of problem and perspective), a scientific chain of thought (the reasoning steps leading to the result), and the arguments supporting each step. Most published mathematics is judged on these two elements rather than on correctness alone, and machine-generated formal scripts convey neither. Borrowing from logic and type theory, I formalise the first as a Derivation-Level Intension and the second as a Directional Extension: a decomposition of a proof into cut-points whose axiomatic footprints reveal its weak links, where the result could be strengthened, and its strong links, which can be transported to other theories. Moreover, I examine five roles AI can play in the research process, including bibliographical search and critical judgment, and show that none of them removes the need to declare these two elements. I mention ways these two concepts could be useful for Journals and for training of young mathematicians in a AI era. If proofs become abundant, the scarce resource is not correctness but a community's shared understanding of why a result matters and how it could be pushed further.
Read the full abstract
Artificial Intelligence
Tabular Foundation Models vs Tuned Gradient Boosting for Telecom Churn: A Profit- and Calibration-Aware Evaluation
A churn model is useful through the customers it selects for a retention offer: the better model is the one whose selection makes the campaign more profitable. Tabular foundation models (TFMs), pretrained networks that predict from a table of labelled examples without being trained on it, were recently reported to decisively outperform tree ensembles for churn. That comparison, however, used untuned gradient-boosted trees (GBDTs) and ranking metrics only. We ask whether the advantage holds against tuned GBDTs when models are judged by expected campaign profit and by the reliability of their probabilities. Four TFMs (TabPFN-2.5, TabPFN-3.5, TabPFN-3.5-Fast, TabICL v2) face LightGBM, XGBoost and CatBoost tuned with Optuna on validation AUC, on five public telecom datasets, three from real operators, with 10 repeated splits each and 20 pre-declared comparisons tested with a corrected t-test and Holm correction. TabPFN-3.5 earns significantly more expected maximum profit (EMP) than each tuned GBDT on two datasets, Cell2Cell (1.9%) and Iranian (7.6%). On Orange it is ahead in every split (14.3%), but not significantly after correction, and no TFM differs significantly from the GBDTs on the two fictional datasets. Across 27 assumed combinations of customer value, incentive cost and acceptance rate, TabPFN-3.5 stays ahead on all three real-operator datasets, though the size of its gain varies widely. Retuning the GBDTs on EMP moved no gap by more than 0.014 per customer. Ranking and probability reliability diverge: raw TabICL v2 underpredicts churn on Orange, and a threshold policy built on its probabilities loses 15.7% of attainable profit until it is recalibrated. Because the splits resample the same customers, the results describe these datasets, not telecom operators in general. The non-commercial licence of the TabPFN weights, rather than scoring cost, restricts production use.
Read the full abstract
Artificial Intelligence
AI Governance Should Prioritize Control and Knowledge Boundaries Over Limiting Intelligence
The rapid proliferation of autonomously acting AI agents makes the governance of agentic systems urgent. We propose the competence circuit, summarized as IKC + KC + C, that decomposes an agent's real-world impact into three pathways: intelligence-mediated discovery, procedural know-how, and direct control. Using the canonical fast-takeoff debate as a stress test, we formalize the conditions for intelligence-mediated fast takeoff as a conjunction jointly sufficient for fast catastrophic supremacy, showing that most rely on rapid knowledge acquisition or control attainment rather than intelligence alone. We operationalize epistemic intelligence as hypothesis-selection efficiency and validate this framework via stochastic simulation on NK fitness landscapes across six scenarios spanning the conjunctive chain. An analytic bound supported by the simulations shows that intelligence-driven speedup is capped by the ratio of competing intelligence levels regardless of task difficulty. The simulations also expose a fast-takeoff dilemma: a large intelligence-driven speedup multiplier materializes only when the hypothesis space is noisy, but the absolute timescale remains constrained by the time required for capability-critical tests, so a large multiplier need not imply rapid progress. Simulations also indicate that institutional chokepoints disproportionately slow down superintelligent agents when mandatory authorization delays are large relative to the negligible time these agents spend on unproductive search. We argue that the dominant safety levers are restricting control and enforcing knowledge boundaries rather than limiting intelligence alone, and this applies to agentic systems at any capability level. Purely digital domains weaken these bottlenecks, strengthening the case for architectures that intentionally "put physics in the loop."
Read the full abstract
Artificial Intelligence
Reinforcement Learning based control of Cancer Chemotherapy treatments
Reinforcement Learning has achieved tremendous success in recent years. Extending its scope from the traditional complex games such as Atari, Go, Pokeman, and Chess, reinforcement learning has caught researchers' attention on modelling real-life scenarios. Personalized medicine and the dynamic treatment regimen are two such preliminary research fields; researchers are focusing their mindsets currently. Estimating the optimal dynamic treatment regimens from the observational real clinical data is being popularized among the researchers, widening its scope towards more advanced versions of reinforcement learning algorithms. This research is about a research study that focused on reinforcement learning techniques that have been approached in the context of cancer chemotherapy treatments. Primarily this thesis addresses the result of the study by means of the state-of-the-art on reinforcement learning techniques used in generating the optimal policy for sequential treatments, including the existing online reinforcement learning approaches. Thereby a simulation for cancer chemotherapy via traditional Q-learning would be presented. Secondly, the study will extend towards using offline reinforcement learning in the optimal policy generation. Thus, the proposed solution follows a data-driven approach, which works on the real human colon cancer clinical data. The novelty of the proposed solution resides in the implementation of an offline reinforcement learning approach by means of a model-based architecture using the conservative Q-learning and the model-based offline policy optimization algorithm. As per the experimental results and the evaluations, it was revealed that the proposed Chemo RL model caters well the problem of cancer chemotherapy treatment scheduling and serves as a supportive model for the junior oncologists in deciding their treatment decisions.
Read the full abstract
General Physics
Fermions fields inside the geometric algebra of spacetime
The (signed) basis versors of the geometric algebra of space-time form the extraspecial groups of order 32. Ignoring signs and the unit element, we show that the remaining fifteen normalized basis versors can be written as, or factorized into, a unit space bivector (of three-dimensional space) and an isoversor. Isoversors are: the volume trivector of space, the pseudoscalar, and the basis time-axis vector. Our first result is that this central product structure, already known for extraspecial groups, also holds in the geometric algebra of space-time and is crucial for exhibiting generators of continuous groups in the algebra. In a second main result, inspired by Hestenes' 1982 paper “Space-time structure of weak and electromagnetic interactions”, we uncover two pairs of special unitary groups of order two and three (in various representations). A rich algebraic structure emerges, leading us to our third main result: the description inside the geometric algebra of space-time of thirty-two flavorless particles of matter and antimatter. The sixteen matter particles, four leptons (left/right with up/down isospins) and four triplets of quarks (with three colors in addition to chirality and isospin), are gathered four by four into quadrispinors in two different ways: particles in a quadrispinor have either the same color or the same isospin and chirality. Thanks to this twofold distribution of the sixteen matter particles inside four quadrispinors, the same continuous group based on the isoversors produces the electroweak and strong gauge symmetry. However, chirality forbids the gauge mixing of left and right particles, which motivates the restriction to SU(2) $\times$ U(1) for the electroweak interaction. Finally, as a fourth main result, we thoroughly study the dynamics of quadrispinors by generalizing the conventional treatment of bispinors in geometric algebra.
Read the full abstract
Artificial Intelligence
Graph Visualizations in Prompts for Knowledge Graph Question Answering
We study when and how multimodal input improves knowledge graph question answering (KGQA) in large vision–language models. Using a controlled evaluation over 1,500 WebQSP and CWQ questions and six VLMs within a fixed KGQA pipeline, we compare text-only prompting against text-plus-graph visualization at the per-question level and analyze performance changes as a function of reasoning complexity, model size, and image layout. Adding a graph image yields an average gain of 1.85 F1 points, driven by strong precision improvements on low-complexity questions (+4.65 F1). Mixed-effects and regression analyses show that these multimodal gains do not depend strongly on model scale, but are highly sensitive to graph layout: image-only settings sharply degrade performance, hierarchical Graphviz layouts outperform less organized renderings, and decomposing large subgraphs into separated paths yields the largest improvements. Taken together, the results indicate that visual prompting primarily aids KGQA by enhancing prediction precision in low-complexity contexts, provided that visual design respects cognitive and perceptual constraints. To optimize both accuracy and inference efficiency, we argue for adaptive visual prompting policies that selectively append diagrams to small, visually sparse subgraphs with well-structured layouts, avoiding unnecessary visual clutter and token overhead on complex queries. We conclude by relating these findings to a visual notation design theory, outlining how principled diagram encoding can guide future multimodal VLM prompting.