Earth and Planetary Astrophysics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 1 September
Accurate stellar ages are fundamental to interpreting the evolutionary histories of habitable zone (HZ) planets. Because stellar luminosity evolves over time, HZ boundaries migrate outward, meaning that present-day HZ planets may have experienced different irradiation environments earlier in their evolution. Accurate ages are therefore required to estimate HZ residence times and place planetary habitability in an evolutionary context. We use the Bayesian Analysis of Stellar Evolution with nine parameters (BASE-9) code to constrain ages and masses for exoplanet host stars with planets located in the HZ. Our sample includes single stars with effective temperatures of 4475-7200 K that host planets within their calculated HZ boundaries. We fit isochrones to broadband photometry from Gaia DR3, Pan-STARRS, and 2MASS jointly with Gaia parallaxes, spectroscopic metallicities, and extinction estimates, and assess the resulting age posterior distributions. Using these age constraints, we track HZ migration along stellar evolutionary sequences to estimate continuous HZ residence times, allowing us to identify ideal targets for followup high resolution characterization. Because isochrones separate most strongly near and beyond the main-sequence turnoff, our analysis emphasizes evolved and turnoff hosts, where BASE-9 produces the tightest constraints. We quantify age precision across the sample, yielding highly precise ages for subgiants and evolved main-sequence or turnoff stars, and less precise but measurable ages for lower main-sequence hosts. The final catalog provides our age constraints for 149 HZ planets around 146 host stars and supports evolutionary interpretations of planetary histories.
Number Theory
Ranks and integer points on elliptic curves induced by Fibonacci triples
Let $F_n$ and $L_n$ denote the Fibonacci and Lucas numbers, respectively, and consider \[ E_k:\qquad y^2=(F_{2k}x+1)(F_{2k+2}x+1)(F_{2k+4}x+1). \] These elliptic curves arise naturally from the regular Diophantine triples \[ \{F_{2k},F_{2k+2},F_{2k+4}\}. \] For odd $k$, we exhibit the rational point \[ Q_k=\left( -\frac{F_{k-1}}{L_kF_{k+1}F_{k+2}}, \frac{F_{2k+1}}{L_kF_{k+1}F_{k+2}} \right). \] For every odd $k\geq 3$, this point is independent of the standard point $P_k=(0,1)$; in particular, $\operatorname{rank}E_k(\mathbb{Q})\geq 2$. Moreover, if $k\geq 3$ is odd and $\operatorname{rank}E_k(\mathbb{Q})=2$, then all integer points on $E_k$ are exactly the points arising from the two known solutions of the Hoggatt-Bergum extension problem. By parametrizing the two conics $L^2-5F^2=\pm4$ and applying an injective specialization criterion, we also show that the corresponding one-parameter elliptic families have generic ranks $2$ in the odd case and $1$ in the even case. Finally, we discuss computational data and propose the heuristic rank distribution $1/4,1/2,1/4$ for ranks $1,2,3$, respectively, with density zero for rank at least $4$.
Read the full abstract
Computation and Language
VakyArth: Evaluating Pragmatic Competence in LLMs across Indic Languages
Real-world communication often requires pragmatic reasoning: interpreting meanings implied through context and cultural convention rather than stated literally. Existing pragmatic evaluation remains largely limited to English and high-resource languages, leaving Indic languages unexplored despite their linguistic and cultural diversity. We introduce VakyArth, the first pragmatic benchmark for Indic languages, designed as a diagnostic evaluation covering Hindi, Punjabi, Tamil, and Malayalam. VakyArth evaluates models across five phenomena: deixis, speech acts, implicature, social pragmatics, and coherence; through multiple-choice questions, natural language inference, and translation, with all items authored by native speakers. Across multilingual large language models (LLMs) of varying families and sizes, we find consistent failures on pragmatic meanings rooted in Indic linguistic and cultural conventions. Our analysis shows systematic differences across languages and tasks: MCQ accuracy exceeds NLI accuracy in all model-language combinations, translation performance does not reliably track pragmatic understanding, and Indo-Aryan languages show a translation advantage over Dravidian languages. We further show that automatic translation metrics can miss fluent but pragmatically unfaithful outputs, especially for implicature and deixis.
Read the full abstract
Computer Vision
CoViT: Instance-Correspondence Contrastive Learning for Vision Transformer
Vision Transformers (ViT) excel in semantic understanding but fail to discriminate between object instances (e.g., identical embeddings for two dogs), limiting their use in instance-level tasks such as object detection and instance segmentation. We propose Contrastive Vision Transformer (CoViT), a self-supervised learning framework that injects instance-awareness into ViT through geometry-guided contrastive learning. CoViT uniquely coordinates ViT's attention maps and embeddings by constructing triplets: (1) Attention-guided masking: Refine multi-head attention via adaptive thresholding and morphological operations to generate instance masks, identifying foreground anchors; (2) Hardest contrastive mining: For each anchor, computing pairwise embedding similarities to select the intra-instance hardest positive (least similar patch within its mask) and inter-instance hardest negative (most similar patch from other instances), with intra-instance regions masked during negative search. These triplets drive a contrastive loss that simultaneously compresses intra-instance variance and expands inter-instance margins, forcing ViT to discern subtle geometric and appearance differences between instances. CoViT consistently achieves stable performance gains of over 2 AP points across multiple instance-level perception tasks by using ViT as backbone architecture. Notably, CoViT requires no extra decoders or labels, demonstrating that a pure ViT can learn instance-aware representations via inherent attention priors and targeted contrastive constraints. Code and models will be released.
Read the full abstract
Computer Vision
Ten Architectures, One Error: Shared Failure Modes in Hyperspectral Classification under Spatially Disjoint Evaluation
Hyperspectral image classification still relies heavily on random pixel splits within a single scene. The Salinas dataset, randomly split, is among the most widely used datasets for comparing different architectures. However, under a random split method, a large fraction of test pixels fall immediately adjacent to a training pixel, which inflates reported accuracy. This work introduces a leakage-free evaluation protocol linking spatial separation to the model's receptive field. Applying this protocol across ten different architectures, including classical, spectral, spectral-spatial, transformer, vision-backbone, and state-space families, shows that Macro-F1 drops by 0.147 on average and model rankings change by as many as five places. Furthermore, leakage-free evaluation limits which architectures can be tested on a given benchmark. Since each partition supports patches only within a finite radius, reporting this radius alongside the receptive field is essential for fair comparison. In addition, this study reveals that all ten architectures misclassify largely the same pixels, pointing to a spectral ambiguity in the data that none of them resolves.
Read the full abstract
Earth and Planetary Astrophysics
IFU Observations of Comet 3I/ATLAS = C/2025 N1 (ATLAS) using the Hobby-Eberly Telescope with the VIRUS Instrument
We observed interstellar object 3I/ATLAS = C/2025 N1 (ATLAS) on 9 December 2025 UT with the VIRUS spectrograph on the Hobby-Eberly Telescope. VIRUS is a low spectral resolving power, multi-IFU, optical spectrograph. We used a single IFU for the observations and were able to obtain spectra spaced every one arcsec (1327 km) from the optocenter out to about 85,000 km in the sunward direction. The spectra include molecular features normally seen in the optical for spectra of Solar System comets, with the addition of many very strong lines of FeI and NiI. We modeled these observations using the Haser (1957) model framework and find that the data can only be fit if we assume that the outflow velocity of the gas is half that of comets in our Solar System observed at the same heliocentric distance. We derived Haser model scale lengths for three NiI and four FeI lines. We discuss the implication of the similarities and differences between this object and normal Solar System comets. The excellent spatial resolution of VIRUS, coupled with a FOV of 50X50 arcsecs and a geocentric distance of 1.83 au, allowed us to probe the coma of 3I in great detail.
Read the full abstract
High Energy Astrophysical Phenomena
The Mass-Ratio Distribution of the Low-Mass Binary Black Hole Subpopulation: A Natural Outcome of Isolated Binary Evolution
The observed merging binary black hole population is increasingly consistent with being composed of a mixture of subpopulations, each likely the result of different formation mechanisms. In particular, the low-mass subpopulation, with primary black hole masses below $\approxeq 15\,M_{\odot}$, has been attributed to mergers formed through isolated binary evolution. We use the binary population synthesis code POSYDON to study the mass ratio $(q)$ distribution of binary black hole mergers from isolated binary evolution and compare to the observed low-mass subpopulation. We explore variations in supernova remnant prescriptions, common-envelope efficiency, and black hole accretion efficiency. We find that our models have a preference for asymmetric $q$, most with a broad peak near $q\approxeq0.5-0.7$, and a near-equal-mass component whose relative strength varies across models. This resultant $q$ distribution is consistent with the $q$ distribution of the low-mass subpopulation observed with gravitational waves. We find that for the majority of models these features arise from physically distinct formation subchannels: the asymmetric peak reflects contributions from common-envelope and stable mass-transfer systems, while the near-equal-mass component traces double-core common envelope and contact systems. We conclude that the features in the $q$ distribution of the observed low-mass subpopulation emerge naturally from isolated binary evolution across a range of model assumptions. As the gravitational-wave catalog continues to grow, the relative strength of these $q$ features will provide an increasingly powerful diagnostic of isolated binary evolution and its formation subchannels.
Read the full abstract
Statistical Methodology
Robust Bayesian Inference for Unnormalized Models with Mixed-Domain Data
Many statistical models involve parameter-dependent normalizing constants that are computationally intractable, creating substantial obstacles to standard Bayesian inference. Although existing likelihood-based algorithms can often circumvent these constants, their uncertainty quantification may be poorly calibrated under model misspecification. To address these challenges, we propose SME-BETEL, a semiparametric Bayesian framework that combines score matching estimating equations with Bayesian exponentially tilted empirical likelihood. The resulting posterior avoids evaluation of normalizing constants and does not require learning-rate calibration. Building on this framework, we develop a new score matching criterion for mixed-domain data, extending SME-BETEL to models whose observations combine components from different sample spaces. This construction enables robust Bayesian inference for mixed-domain doubly-intractable models. We establish consistency and asymptotic normality of the score matching estimator, and prove a Bernstein-von Mises theorem for the SME-BETEL posterior. These results show that SME-BETEL credible sets are asymptotically calibrated to the sampling variability of the score matching estimator, yielding valid frequentist coverage under model misspecification. Simulation studies show that SME-BETEL remains competitive under correct specification and substantially improves uncertainty quantification under misspecification. An ozone-monitoring application demonstrates the practical utility of the mixed-domain construction for spatial preferential modeling.
Read the full abstract
Combinatorics
A short proof that $R(3,k)=\Theta(k^2/\log k)$
We give a nibble-free construction proving $R(3,k)\ge(1/200+o(1))k^2/\log k$. We also include Shearer's proof bounding the independence number of a triangle-free graph, which implies $R(3,k)\le (1+o(1))(k^2/\log k)$.
Read the full abstract
Software Engineering
Modelstamp: Pre-Deserialization Verification of Machine-Learning Artifacts and Runtime Environment State
Persisted machine-learning models can remain byte-identical while the software environments in which they are loaded evolve, creating a verification problem that artifact integrity checks alone cannot expose. This paper presents Modelstamp, a lightweight Python persistence library for verifying artifact integrity and represented runtime-environment state before deserialization. At persistence time, Modelstamp associates a serialized artifact with a sidecar JSON manifest containing a SHA-256 digest, runtime metadata, and installed versions from a bounded tracked-package set; a separately recorded model-relevant subset determines which package versions participate in drift comparison. Optional HMAC authentication supports workflows in which the producer and verifier share a secret key. At verification time, the artifact and represented current environment are checked against this recorded evidence before the model is deserialized. Modelstamp is evaluated using 14 controlled environment-drift scenarios, eight controlled trust-boundary scenarios, and an artifact-size scaling benchmark from 10 MiB to 1 GiB. The controlled drift experiments behaved as specified across relevant dependency changes, unchanged environments, and unrelated environmental changes, including broader noise controls. The trust-boundary experiments similarly confirmed both intended detections and expected limitations, including shared-key forgery and replay. Median verification time increased from 0.032 s at 10 MiB to 3.334 s at 1 GiB, with measured throughput of approximately 307-312 MiB/s in the benchmark environment. These results characterize Modelstamp as a complementary pre-deserialization reference-state verification control rather than as a replacement for dependency-management systems, malicious-model detection, safe deserialization, or public publisher authentication.
Read the full abstract
Information Retrieval
KGVoyager: Knowledge Graph Agnostic Question Answering via Agentic Navigation
Knowledge Graph Question Answering (KGQA) over RDF graphs remains challenging in domain-specific settings, where formal ontologies and curated text-SPARQL pairs are often unavailable. We present KG Voyager, a KG-agnostic agentic architecture that generates SPARQL queries from natural language questions by dynamically discovering graph structure and semantics, requiring only a query endpoint of the underlying graph. Using a think-act-observe loop with search, exploration, and execution tools, KG Voyager maps terms to graph Internationalized Resource Identifiers (IRIs), uncovers structure, and refines queries through execution feedback – all without pre-existing ontologies or examples. Unlike the prior state of the art, KG Voyager requires only a lightweight class index which renders it applicable for far more real-world endpoints. Across four benchmarks, KG Voyager improves F1 by $\sim$4 points on average compared to the state of the art while cutting cost by $\sim$38% and runtime by $\sim$24%.
Read the full abstract
Networking
Agents That Model Agents: Five Principles Toward a Theory of Mind for 6G Networks
Future 6G networks will rely on Large Language Model (LLM) agents to manage the Radio Access Network (RAN). However, current architectures assume inter-agent messages convey objective facts. A message is instead a trace of the sender's reasoning: it carries a subjective conclusion, so a syntactically valid report can propagate an AI hallucination and trigger a cascading outage invisible to protocol validation. Reading such a trace requires a Theory of Mind (ToM)—before acting, the receiver must model what the peer believes, and what a peer in that position should have believed. Modeling these interactions as cognitive channels on a cellular sheaf, we obtain a unified framework for resilient multi-agent systems, from which five design principles emerge: (i) a message is evidence of the sender's hidden reasoning; (ii) trust is a continuous cognitive Signal-to-Noise Ratio (SNR)—asserted precision over deviation from the modeled peer belief; (iii) network-wide consistency and resistance to hallucination contagion are computable via the sheaf's Laplacian; (iv) peer-modeling must halt at exactly two levels to conserve compute and survive mutual information decay; and (v) credible capacity is bounded by operational goal alignment, not link bandwidth. A signaling-storm study on locally deployed 1B-parameter telecom language models validates it: cognitive SNR isolates a hallucinating peer that three of its four neighbors agree with, where a divergence gate ranks every wrong peer above the right one; only depth two ToM recovers the correct action; and the spectral gap decides whether a topology reaches consistency inside the near-real-time budget.
Read the full abstract
Computer Vision
Allocate Before You Embed: Adaptive Visual Input Allocation for Video Embeddings
Large-scale video retrieval requires embedding models to encode long and diverse videos under tight visual-input and inference budgets. Existing methods typically sample a small, fixed set of frames at their original resolution, limiting temporal coverage and ignoring frame importance. Our empirical analysis shows that expanding temporal coverage improves retrieval even under a fixed visual-input budget. Gains are larger when the original per-frame resolution is preserved, highlighting the complementary roles of temporal coverage and spatial fidelity. Motivated by this finding, we propose AllocEmbed, an allocate-then-embed framework that reallocates a fixed visual-input budget across more frames. A lightweight allocator uses low-cost previews to assign frame-wise resolutions before the embedding backbone, preserving more detail where it most benefits retrieval while reducing visual cost elsewhere. We further introduce Retrieval-Driven Policy Optimization (RDPO), which learns the allocator directly from retrieval feedback using a rank-validated similarity gap and a confidence-guided efficiency incentive. Operating entirely before the backbone, AllocEmbed integrates with existing retrieval systems without modifying the embedding model or downstream pipeline. Experiments on the MMEB-V2 V-QA and V-RET tasks and our LongRet benchmark show that AllocEmbed achieves the best overall retrieval performance among the evaluated budget-matched methods and transfers across embedding backbones. Our code is publicly available at https://github.com/jinsong8/AllocEmbed.
Read the full abstract
Geophysics
TREMORS: An Agentic Assistant for Multi-Datacenter Seismic Data Acquisition
Seismology increasingly depends upon large data retrieval across multi-datacenter platforms. Yet, data procurement often demands domain expertise, user burden, and is difficult to reproduce. As archives continue to grow, translating scientific intent into structured workflows that operate across multiple repositories and produce high quality, AI ready data is becoming an increasingly urgent challenge. We present TREMORS (Text Referenced Event Mapping and Output Renderer for Seismographs), an agentic framework that uses large language model reasoning within a constrained execution graph to automate seismic data retrieval. TREMORS translates natural language queries into a structured intermediate schema, which drives execution through a constrained LangGraph workflow. Example workflows demonstrate support for both event-based and continuous waveform acquisition. The framework is designed to extend across heterogeneous multi-datacenter systems through a portable schema and modular workflow components. This work positions agentic workflows as the catalyst that will connect scientific intent with distributed seismic data systems, enabling a future of reproducible, data-driven inquiry while reducing the burden of routine acquisition tasks.
Read the full abstract
Number Theory
On the cuspidal cohomology of Iwahori congruence subgroups of $\mathrm{SL}(3, \mathbb{Z})$
We investigate automorphic forms for congruence subgroups of $\mathrm{SL}(3, \mathbb{Z})$ that are Iwahori at $p$. In particular, we study the cuspidal cohomology of Iwahori congruence subgroups $\mathcal{I}(3, p)$, which are comprised of matrices in $\mathrm{SL}(3, \mathbb{Z})$ that are upper triangular modulo $p$. In order to work with $\mathcal{I}(3, p)$, we generalize key results from Ash, Grayson, and Green [J.\ Number Theory 19 (1984), pp.\ 412-436]. For levels $\mathcal{I}(3, p)$ with $p \leq 227$, we found three levels with nonzero cuspidal classes and were able to compute the action of Hecke operators at two of these levels. These are the first examples of non-essentially-self-dual automorphic representations of trivial cohomological weight that are Steinberg at $p$ appearing at Iwahori level.
Read the full abstract
Emerging Technologies
Dictionary-Guided Mutation Operators for Automated HDL Repair
Automated repair of Hardware Description Language (HDL) designs remains challenging due to the large search space of candidate repairs and the strict syntactic and semantic constraints imposed by HDL grammars. Generic mutation strategies overwhelmingly generate syntactically invalid candidates that waste compilation and simulation budget, while synthesis-driven and template-based approaches impose their own constraints on generality and portability. In this paper, we propose a dictionary-guided HDL repair system that combines ANTLR-derived DUT-specific mutation vocabularies with a simulation-divergence fault localization (FL) module. The mutation operator applies category-constrained token substitutions, insertions, and deletions directly to Verilog source via regex-based matching, without requiring AST manipulation or synthesis. The FL module identifies diverging output wires from a single simulation run and scores source lines by structural proximity to those signals, directing the mutation search toward high-suspicion regions. A deterministic targeted sweep exhausts all dictionary mutations on the highest-scored lines before falling back to a genetic programming (GP) search. Evaluated on the CirFix benchmark suite across six design under test (DUT) families, the proposed approach produces correct oracle-passing repairs on 14 bug variants, including a 6-edit multi-bug instance that CirFix cannot repair, and achieves an 18x speedup over CirFix on a two-edit benchmark variant. These results indicate that dictionary-constrained mutation operators, combined with lightweight simulation-divergence FL, are a practical and competitive approach to automated HDL repair for common bug classes without formal analysis or synthesis dependencies.
Read the full abstract
Analysis of PDEs
Hypoellipticity on time-periodic space-times
We study the hypoellipticity of operators on a product type Lorentzian manifold where the time variable is periodic. In particular, we prove that hypoellipticity holds for such time-periodic equations, with a stronger estimate when the mass parameter or time period lies outside a set of arbitrarily small measure. We consider both compact and noncompact spatial manifolds and provide explicit examples involving the wave operator. The proof relies on a Fourier series decomposition and asymptotics for eigenvalue counting functions.
Read the full abstract
Computers and Society
From Open Standards to Openly Governed: Standards-Setting Organizations as Stewards of Openness amid Platformization and Digital Sovereignty
Open geospatial standards let data, services, and systems work across platforms. But openness is not just a property of specifications. It also depends on the institutions that produce them and the infrastructures in which they operate. Standards may function as digital public goods and, once embedded in public systems, as digital public infrastructure. Those roles can diverge. This paper asks when open geospatial standards remain public infrastructure rather than becoming channels of enclosure. It makes two claims. First, standards-setting governance matters: institutional design shapes whether open specifications retain their public-good character. Second, geospatial coordination is shifting toward proprietary location stacks, APIs, and cloud platforms, where roadmaps, pricing, and service terms increasingly set the rules. Sovereign-cloud and sovereign-AI strategies relocate this power rather than remove it. These dynamics reinforce each other. Weak governance pushes coordination toward the implementation layer; platformization, in turn, reduces incentives to invest in open standardization, weakening portability and FAIR reuse. Standards bodies cannot reverse platformization, but they still control the specification layer. Where legal safeguards are limited, internal governance becomes key. We frame this through four dimensions: Purpose, Principles, People and Processes, and Policies and Practices (the 4Ps framework) while stressing the limit that internal governance cannot solve alone an external structural problem.
Read the full abstract
Computation and Language
MemeCULT-1K: Benchmarking South Asian Cultural Context and Humor Understanding of Multimodal Models
Meme understanding goes beyond recognizing visual content or literal text; it requires implicit cultural knowledge and pragmatic inference that most vision-language models still lack. We introduce MemeCULT-1K, a multilingual benchmark of 1,000 South Asian memes in Bengali, English, and Hindi, where each meme is paired with a cultural context note and three human-written explanations, along with a supplementary set of 54 Bengali regional dialect memes. We evaluate thirteen popular Vision Language Models (VLMs) under two settings: meme-only and context-aware. Providing minimal cultural context yields consistent gains across all models and languages: mean SBERT similarity improves from 44.6 to 56.4 (+11.8), BLEURT from 37.3 to 42.3 (+5.0), and LLM-as-a-Judge scores from 2.57 to 3.43 out of 5 (+0.86). Fine-grained error analysis reveals that closed-source models fail mainly on entity and reference misidentification, while open-source models are bottlenecked by broader cultural knowledge gaps, with linguistic and phonological failures proving the most context-resistant across both. These results highlight the difficulty of culturally grounded meme understanding and motivate future work on explicit cultural knowledge integration. Our dataset and code are publicly available at TawsifDipto17/MemeCULT-1K.
Read the full abstract
Quantum Physics
GadIR: A Spatial-Topology Preserving Compiler for Quantum Many-Body Systems Simulation
Simulating quantum many-body systems has been one of the most important applications of quantum computation. For simulation, the Hamiltonian of a physical system is compiled into quantum programs with native instructions for quantum hardware. In previous works, the Hamiltonian is represented as Pauli strings, then compiled and optimized based on the quantum circuit model. Such representation paradigm neglects the spatial topology of original physical models, which is vital information to reducing the overhead of compiling many-body systems Hamiltonians. To address such neglect, we introduce a spatial-topology preserving compiler for quantum many-body simulation. Using Pauli gadgets as the representations of the Hamiltonian, we introduce our intermediate representation – GadIR, to preserve the spatial-topology information of original physical models. Our compiler frontend performs the group reduction algorithm based on Pauli gadget model, which is a hardware-independent optimization. Our compiler backend performs trotterization and scheduling on Pauli gadgets, then synthesizes the Pauli gadgets into hardware-native quantum programs. We evaluate our compiler on all the canonical quantum many-body system models, while achieving a significant reduction on compilation overhead regarding four major quantum architectures. Overall, our spatial-topology preserving IR exploits the compilation optimization space for quantum many-body systems Hamiltonian.
Read the full abstract
Probability
Support of Dyson Brownian Motion
We consider beta-Dyson Brownian motion, with $\beta >= 1$, started from a deterministic configuration with uniformly bounded support. Let $\mu_t$ be the semicircular free-convolution flow issued from the initial empirical measure, and set $S_t = supp(\mu_t)$. For every fixed $T, \epsilon > 0$, with probability at least $1 - C \exp(-(log n)^2)$, every particle remains within an epsilon-neighborhood of $S_t$ for all $0 <= t <= T$. The result holds from time zero, requires no regularity assumption at the initial spectral edges, and applies to multi-cut supports with macroscopic interior gaps. A key ingredient is a deterministic local resolvent exclusion principle: an $o((n \eta)^(-1))$ comparison of Stieltjes transforms on a complex disc above a real point separated from the reference support excludes eigenvalues from the corresponding real interval. This gives a model-independent mechanism for converting local resolvent estimates into spectral confinement.
Read the full abstract
Software Engineering
From Silicon to Boot Code: Extending Automated Program Repair to Firmware-Layer Security Workarounds
Automated program repair (APR) research has been constrained to design time. Current techniques localize and fix bugs in RTL or HLS designs before a chip reaches production. Once a hardware vulnerability surfaces post-silicon, the patch must be manually generated: existing automation addresses patch deployment but not patch synthesis. We study the feasibility of extending a dictionary-guided, localize-synthesize-validate APR methodology originally developed for RTL repair to this firmware layer. An automated commit-clustering miner surfaces recurring fix templates across the EDK II (UEFI) firmware repository's full commit history without depending on known CVE identifiers, recovering all three known CVE-fix campaigns and surfacing two additional candidate bug families. Grounded in real fix evidence, we build four independent localizers: missing speculation barriers in C (CVE-2017-5753, Spectre v1), missing bounds checks before array writes in C (a decompression library CVE), missing Return Stack Buffer stuffing in x86 assembly (CVE-2017-5715), and missing integer-overflow guards in Hand-Off Block creation code (surfaced by the miner itself). All four achieve 100% recall; precision ranges from 2.1-15.5% on the C families to 100% on the assembly and HOB families. Root-cause analysis of the C-family false positives attributes 77-90% to two intra-procedural causes, isolating the inter-procedural alias-analysis gap as a measured 15-20% rather than an estimate. A held-out test confirms Spectre v1 localization holds at 100% recall on unseen files; a fifth, independently built dictionary entry (CVE-2018-3630) shows the methodology extends to a new bug signature at low cost; and a naive syntactic baseline recalls at most 14% where our detector recalls 100%. We frame these results within a broader research agenda for a unified hardware-to-firmware correctness lifecycle.
Read the full abstract
Machine Learning
Emergence of Fibrations, Compression, and Symmetry Breaking in Artificial Neural Networks
Artificial neural networks are often regarded as powerful yet opaque black boxes. Here, we demonstrate that learning in deep neural networks generates local symmetries known in graph theory as fibrations and coverings. We prove that covering symmetries are stable attractors of stochastic gradient descent. Consistent with this theory, we report the emergence of covering symmetries across major network architectures, including multilayer, convolutional, recurrent, and transformer networks. Exploiting these symmetries enables drastic model compression - reducing networks to 17% of their original size without sacrificing performance. Furthermore, controlled breaking of covering symmetry overcomes the loss of plasticity, achieving state-of-the-art performance in continual learning. The theoretical results provide a new foundation for AI systems based on symmetries that convert black boxes into interpretable colored graphs and enable more efficient inference and lifelong learning.
Read the full abstract
Neurons and Cognition
Slow-Fast Brain-Computer Interfaces: Preventing Neuroadaptive Overfitting in AI-Mediated Neural Interfaces
Artificial intelligence (AI) is transforming brain-computer interfaces (BCIs) from task-specific neural decoders into adaptive systems that complete language, smooth movement, regulate rehabilitation support and adjust stimulation. These capabilities can increase speed, fluency, usability and clinical reach, yet conventional performance metrics may overlook losses in intent fidelity, authorship, agency, therapeutic challenge and durable clinical benefit. I define neuroadaptive overfitting as a closed-loop failure mode in which an AI-mediated BCI becomes over-optimized to short-term proxies of success, including reduced effort, rapid acceptance, lower workload or smooth task completion, while drifting from the user's durable goals. I then propose Slow-Fast BCI, a framework for pacing AI assistance according to decoder evidence, uncertainty, contextual and clinical stakes, fatigue, and user- or clinician-defined goals. The framework distinguishes fast assistance when intent is clear and stakes are low, guarded assistance under uncertainty and slow assistance when misalignment could compromise safety, agency, authorship, motor learning or therapeutic value. Across communication, motor-control, neurorehabilitation and closed-loop neuromodulation applications, I outline corresponding safeguards and evaluation measures. This Perspective argues that AI-mediated BCIs should be evaluated not only by decoding accuracy and task performance, but also by how AI assistance is deployed: when systems act autonomously, seek confirmation, preserve user effort or return control to the user.
Read the full abstract
Combinatorics
An infinite small-step $\mathbb Z^3$-walk with no collinear triple
We construct an infinite walk in $\mathbb{Z}^3$ whose steps come from a fixed set of sixteen vectors and no three of whose vertices are collinear, answering a problem of Gerver and Ramsey popularized as Erdős Problem 193.
Machine Learning
Toward Explainable and Policy-Aware AI for Carbon Credit Price Prediction: A Research Framework for Emerging Carbon Markets
Carbon markets put a price on emissions, yet that price remains hard to forecast. Work in this area clusters on the EU and Chinese schemes, compresses regulatory text into a sentiment score, and reports accuracy without calibration or explanation stability. We distil ten recurring gaps into an impact-feasibility matrix and propose EPA-CarbonNet, a six-layer architecture that fuses market series with policy text by cross-attention and calibrated intervals alongside policy-attributed explanations. We then build and test it on eleven years of daily S and P carbon index data. The findings are largely negative, and reported as measured: a random walk beats the model on five-day RMSE (0.0365 against 0.0475), SHAP rankings agree at rho = 0.54 across resampled backgrounds, and policy attention never coincides with documented regulatory events. Directional accuracy, at 58.6 percent, leads every baseline. Code, data documentation and all result artifacts are available at https://github.com/Kimalice/Toward-Explainable-and-Policy-Aware-AI-for-Carbon-Credit-Price-Prediction
Read the full abstract
Networking
Curriculum-Guided Reinforcement Learning for Energy-Efficient UAV-ISAC in Post-Disaster Search-and-Rescue Operations
Uncrewed aerial vehicles (UAVs) are promising platforms for integrated sensing and communication (ISAC), but their limited onboard energy creates a strong coupling among sensing accuracy, communication quality, and propulsion cost. This paper proposes a curriculum-guided soft actor-critic (CG-SAC) framework with propulsion-aware reward shaping for energy-efficient UAV-ISAC, jointly optimizing the 3D trajectory, communication-sensing power split, and per-user power allocation. A rotary-wing propulsion model is incorporated to derive a closed-form propulsion-economic cruising speed, which is used to construct a propulsion-aware speed-shaping term within a normalized composite reward together with navigation, node-visiting, energy-efficiency, and constraint-penalty terms. A log-linear curriculum progressively tightens the communication, sensing, and proximity requirements during training. Across 2000 randomized scenarios, CG-SAC achieves an average energy efficiency of 0.72 Mbits/J, substantially outperforming the evaluated DRL baselines. Among successfully completed missions, it requires 107.6 steps on average, corresponding to a 66%–82% reduction in flight steps relative to the baselines. Crucially, the learned policy exhibits mission-aware speed adaptation by decelerating near service points and accelerating during transit, while achieving a 99.6% communication-rate satisfaction ratio at service instants. Ablation results further demonstrate the complementary roles of the reward components in balancing mission feasibility and energy efficiency.
Read the full abstract
Dynamical Systems
BiLipschitz and bounded displacement equivalence of Delone sets
We survey biLipschitz (BL) and bounded displacement (BD) equivalence of Delone sets, with an emphasis on examples arising in aperiodic order. After recalling the classical results of Burago-Kleiner, McMullen, and Laczkovich, we discuss criteria for rectifiability, uniform spreadness, and BD equivalence, and how these relate to discrepancy and point-counting estimates. We then focus on Delone sets associated with substitution tilings, where these questions can often be studied through the combinatorial and spectral properties of the underlying substitution rules. We also consider selected classes of cut-and-project sets and briefly discuss extensions beyond BL and BD equivalence.
Read the full abstract
Programming Languages
Synthesis of Compact and Expressive Quantum-Circuit Optimizations
Today's quantum devices are noisy, so reducing circuit size is critical for reliable execution. Existing rule-based optimizers often rely on large rule sets that are difficult to manage and still miss long-distance transformations. We present QSymb, a framework for synthesizing compact and expressive quantum-circuit rewrite rules with formal guarantees. We formalize symbolic rewrite rules in which a symbolic gate represents infinitely many subcircuits. We then define canonical symbolic rules of the form $L;S = S;R$ and prove that they constitute a compact generative core from which general symbolic rules can be derived. On top of this formal foundation, given a gate set, QSymb synthesizes (1) a small, non-derivable concrete rule set that is complete up to chosen size and qubit bounds, and (2) a small but expressive canonical symbolic rule set that captures transformations beyond finite or monomial-only patterns. We further present rule anchoring to derive optimization-effective rules from canonical symbolic rules. Together, these results provide both expressiveness and guarantees: soundness of synthesized rules via validation, non-derivability, and bounded completeness. On the IBM-Eagle gate set, QSymb strictly outperforms state-of-the-art rewrite-based optimizers (Qiskit, Guoq, Quartz, TKET, and Queso) in two-qubit-gate reduction on 90%, 67%, 82%, 85%, and 83% of standard quantum algorithm benchmarks, respectively; on Nam gate set, the corresponding rates are 88%, 74%, 81%, 86%, and 82.9%. It achieves final average two-qubit-gate reductions of 27.44% and 29.95%, respectively.
Read the full abstract
Machine Learning (Statistics)
Pooling and Drift in Delayed Bandits
A system often has to act long before it learns whether the act worked: a recommender sees a click in seconds and a purchase in days. With $K$ actions and a delay of $d$ rounds, the best rate known for this setting is $\widetilde{O}(\sqrt{(K+d)T})$ over $T$ rounds, so a longer menu is always more expensive to learn from. It need not be: if the outcome depends on the action only through the state it produced, then one late outcome informs every action that could have produced the observed state, and the price is set by how many genuinely different states the actions produce rather than by how many actions there are. We measure this using an effective dimension $v_t$ between $1$ and the number of states, and prove $\widetilde{O}(\sqrt{(d+1)V\log K})$ for a rotating algorithm and $\widetilde{O}(\sqrt{V^{-}}+\sqrt{dT})$ for the single-copy algorithm used in practice, for any budget fixed in advance; merging similar states lowers the price further, at an explicit bias. Even when given the exact losses from $d$ rounds ago, no algorithm escapes $\Omega(\sqrt{dE\min\{1+\log J,T/d\}})$, where $J$ counts the drifting directions and $E$ bounds how far losses move while the learner waits. On generated data, the state channel cuts regret by up to 79 percent against action-level weighting and, on the funnel family, by 32 to 68 percent against a tuned minimax-optimal method.