Gaussian processes are widely used for surrogate modeling in computer experiments, which often produce numerous intermediate variables that are not explicitly used in standard calibration frameworks. Calibration of imperfect models can be challenging without leveraging these variables, while fitting the emulator and the discrepancy models separately also poses identifiability issues. In this work, we propose a robust Gaussian process calibration framework that leverages intermediate variables for discrepancy modeling. The framework integrates a structured intermediate variable selection process, a discretized scaled Gaussian stochastic process (S-GaSP) to constrain the discrepancy term, and a space-filling design strategy for selecting constraint points. This enables joint modeling of the emulator and discrepancy, improving predictive performance, providing principled uncertainty quantification, and alleviating identifiability risks. We demonstrate its efficacy on a nuclear physics application involving binding energies, where it outperforms baseline approaches.

Recurrent event data frequently arise in biomedical studies, where individuals may experience multiple recurrences of the same type of events, such as recurrent hospitalizations. This article introduces a nonparametric method for recurrent events under a Bayesian ensemble learning framework, called Soft Bayesian Additive Regression Trees (SBART), which combines multiple soft decision trees to achieve high predictive accuracy and a smooth estimator of the underlying intensity of the recurrent events. The proposed model represents the conditional intensity function of the non-homogeneous Poisson process as the product of a time-constant baseline, a subject-specific frailty random effect, and a nonparametric component capturing potentially nonlinear covariate effects and unknown interactions among covariates and time. A two-layer data augmentation scheme is employed to efficiently incorporate the SBART component within our computational algorithm. Simulation studies demonstrate that our method, called RecSBART in short, achieves superior accuracy in estimating cumulative intensity compared to existing approaches, even when our modeling assumptions are not true. With the Bayesian analysis of a study of recurrent hospitalizations of colorectal cancer patients, we further demonstrate our RecSBART method's ability to reveal and interpret the underlying complex relationships among covariates in a recurrent events study.

When modeling health events in small areas, the conditional autoregressive (CAR) framework of Besag, York, and Mollié (BYM) is widely used. For multiple outcomes, the multivariate CAR (MCAR) extension accommodates dependence among diseases that share risk factors, in addition to spatial dependence, and can also jointly model demographic subgroups for a single disease, allowing information to be borrowed across related populations. However, recent studies have shown that the BYM CAR model can be overly informative, leading to excessively precise estimates. While the MCAR model is expected to be more informative due to additional information shared across subgroups, its level of informativeness has not been previously quantified. We propose a framework to measure MCAR model informativeness as an extension of prior work and introduce a method to control it, ensuring the model contributes comparably to each subgroup. We achieve this through a reparameterization of the MCAR model within a computationally efficient framework. We demonstrate how the MCAR model compares with the BYM CAR model in terms of informativeness and oversmoothing and highlight the advantages of the restricted MCAR model using county-level heart disease death data stratified by race and sex.

We extend the Prais-Winsten AR(k) generalized least squares (GLS) transformation to panel data within the Beck-Katz panel-corrected standard error (PCSE) framework and implement the method in the community-contributed Stata package xtpraisk. As the panel extension of Prais-Winsten, xtpraisk is the natural comparator to xtscc, the panel extension of Newey-West and implementation of the Driscoll-Kraay estimator. We conduct a Monte Carlo simulation to validate the statistical properties of xtpraisk and compare its finite-sample performance with xtscc. The simulation spans autoregressive orders 1-3, three autocorrelation scenarios, three panel sizes, six series lengths, and five effect sizes, with 2,000 replications per condition. Across all conditions, xtpraisk achieved higher power than xtscc while maintaining near-nominal Type I error rates, confidence interval coverage, and standard error calibration. In contrast, xtscc exhibited systematic standard error underestimation and inflated Type I error at short series lengths, with both deficiencies worsening as autoregressive order increased. Both estimators were essentially unbiased. Misspecification of the autoregressive order did not degrade xtpraisk's inferential performance, and cross-panel correlation and panel size had negligible effects on the relative performance of either estimator. The results indicate that xtpraisk is preferable when both statistical efficiency and valid inference are priorities, particularly under persistent higher-order autocorrelation and short to moderate series lengths.

Habitat selection and space use are fundamental to understanding animal distribution. Traditional methods for quantifying habitat preferences from telemetry data assume regular sampling and negligible measurement error. However, these assumptions are routinely violated in marine systems. Practitioners typically regularize and filter the data before fitting models, but these two-step procedures do not propagate uncertainty from the filtering stage and can yield biased estimates. Habitat-driven Langevin diffusion models offer an elegant alternative, naturally accommodating irregular sampling. However, incorporating measurement error via a state-space formulation is challenging because habitat covariates depend on the latent true locations. We address this using the Laplace approximation to simultaneously integrate over true locations and account for habitat covariates along latent paths, yielding a single-stage framework efficiently implemented in Template Model Builder (TMB). By doing so, we provide the first TMB implementation capable of handling covariates that depend on latent variables, allowing inference via fast and efficient maximum likelihood estimation. Simulations show that our approach outperforms the two-step method, recovering habitat-selection parameters even under substantial measurement error and missing data, with more accurate utilization distributions and trajectory reconstructions. Applied to narwhal (Monodon monoceros) telemetry data, the two-step method substantially shrinks the habitat selection coefficient towards zero, while our unified approach recovers a much stronger signal. Our framework offers a computationally efficient solution to long-standing challenges of measurement error and temporal irregularity in habitat selection inference, applicable across a wide range of taxa and environments.

We propose a framework for designing Target-Date Funds (TDFs) around an explicit return objective while controlling risk directly at the portfolio level through a declining Conditional Value-at-Risk (CVaR) constraint. In this approach, the regulator or sponsor specifies a CVaR glidepath that gives the portfolio manager enough flexibility to reach a target return with a reasonably high probability. The target return is determined exogenously from pension-design inputs such as retirement age, contribution rate, working years, life expectancy, and replacement-rate goals. This differs from conventional TDF design, where age-dependent asset-class limits are set without an explicit link to a required return. A key feature of the method is that it does not assume the manager selects an optimal portfolio each period. Instead, each month the manager draws an allocation from the set of portfolios satisfying the CVaR constraint. This yields a conservative evaluation of each glidepath: success probabilities are averages over admissible allocations, rather than best-case outcomes. We introduce two figures of merit: the probability of meeting the target return and the cumulative risk assumed over the life of the TDF. As a proof of concept, we apply the framework to Chile's 2025 pension reform using nine Chilean and global asset classes and a 40-year accumulation horizon. The results show that the transition age at which risk starts to decline is the most consequential design parameter, and that contribution density acts as a hard constraint: below a critical threshold, portfolio design alone cannot compensate for structurally low contributions. The framework is general and can be applied to any TDF designed around an explicit return objective.

This paper analyses the distinction between educational and skill types of labour mismatch and their association with earnings. Drawing on cross-sectional data for 26 countries from the 1st Cycle of the OECD (2012) Survey of Adult Skills (PIAAC), I examine educational and skill mismatch using a comprehensive set of education- and skill-based indicators, explore heterogeneity across worker characteristics, and investigate the sources of conflicting country-level correlations with earnings through an error components model. The results show that country-level unobserved heterogeneity induces endogeneity bias, with both its direction and magnitude varying across mismatch measures. Once unobserved heterogeneity is controlled for, over-education and over-skilling are associated with wage penalties, whereas under-education and under-skilling are linked to wage premiums. These findings highlight both conceptual and empirical distinctions between educational and skill mismatch and demonstrate the importance of indicator choice in the analysis.

An important question for an algo trader working an order is to understand if their actions are moving the market against them -- i.e., causing market impact. The conventional answer usually is one of two: (i) monitor price slippage in real-time, potentially reducing adverse activity with increased slippage, or (ii) do away with dynamic trading adjustments and rely on semi-static rules based on ex-post estimates of slippage over a large sample of events. Realtime monitoring fails because reliably estimating slippage is statistically expensive -- it requires hundreds of fills before it can be told apart from background volatility. More fundamentally however, it does not establish causality. Observed adverse price moves may be caused by the trader's own actions, or by an unrelated participant competing for the same liquidity and capturing the same alpha. The optimal response (say, slow down vs.\ speed up) is opposite in the two cases. We propose a method that detects price impact, on a per-action basis, by measuring the timing synchronicity between a trader's actions and subsequent adverse market events. The method at heart is a test for statistical \emph{surprise} in the timing of adverse events post trader action. We must be clear in that we do make a leap of faith here and assume that surprisingly fast adverse market events are evidence of causation and that the action triggered them -- a direct signature of impact and information leakage. Validating it requires real execution data; we set out the empirical tests that would do so.

Who is exposed to generative AI in a developing-country labour market? We map three occupational AI-exposure indices to India's redesigned Periodic Labour Force Survey (2025) and document a steep caste gradient among 83,000 employed graduates: graduates from the Scheduled Castes and the Scheduled Tribes are 0.24--0.37 standard deviations less exposed than upper-caste graduates within the same district. Two channels drive the gap: one in four SC and one in three ST graduates work in farm or elementary occupations untouched by AI, and those in white-collar work are underrepresented in managerial, software, and finance occupations. Because exposure commands a wage premium of up to 20 per cent, generative AI stands to widen, not narrow, India's caste earnings gap.

In the fall of 2020, neural-network methods produced a large improvement in chess engines that became freely and widely available. By the end of 2021, the monthly draw rate in classical chess had risen by about four percentage points, but the distribution of player ratings, which are commonly read as measures of playing strength, had changed little. Ratings, however, are a relative measure, built from results against other rated players rather than from an absolute scale of play quality, so an improvement shared broadly across players need not change their ratings. Using 3.9 million rated classical games from March 2015 to November 2023, we document that the increased draw rate remains after conditioning on both players' ratings, holds within repeated same-color matchups, is not a continuation of a pre-existing trend, and persists through the end of the sample. A linear transformation that maps post-Covid ratings to higher pre-Covid equivalents, with a larger gap at lower ratings, accounts for more than 90 percent of the post-minus-pre shift in the fitted draw, White-win, and Black-win probabilities. Players' ratings and ranks, by contrast, show no additional rank reshuffling and no general widening of within-group dispersion relative to the pre-Covid benchmark. We interpret these findings as consistent with adoption across rating levels, with larger rating-equivalent gains for lower-rated players.

Practitioners allocate capital with forecast-light rules such as equal weight, inverse volatility, risk parity, HRP, and return-adjusted HRP (RA-HRP). This paper develops \emph{Heuristic Portfolio Optimization} (HPO): an information-restricted projection of the Markowitz/tangency solution onto a stable rule class. The implied-return principle, $\mathbf{w}$ is maximum-Sharpe iff $\mathbfμ_e \propto \mathbfΣ\mathbf{w}$, gives closed-form optimality sets for leading heuristics and exposes the Schur-complement substitutions behind HRP. For RA-HRP, we introduce fixed-tree cluster-Sharpe recursion, unit-free HRP--RA-HRP interpolation, tangency conditions, conditional-risk splits, and pathwise/KL decompositions of weight distortion. First-order Sharpe calculus expresses the marginal value of return information as nodewise alphas against HRP and yields a linear KL trust budget. We formalize generic HPO maps, define the implied-return defect, prove that it equals squared Sharpe inefficiency, characterize tree-HPO coincidence by nodewise mass ratios, and give a bias--variance decomposition for estimated rules. Finally, HPO is embedded into Reinforcement Learning Portfolio Optimization (RLPO): every HPO map induces a deterministic stationary policy; static HPO is the $γ=0$ no-friction face of the Bellman problem; RA-HRP supplies a hierarchical policy prior; and dynamic improvement is warranted when continuation value exceeds myopic HPO defect plus frictions. A performance-difference identity prices the myopic value gap, gives an $\varepsilon/(1-γ)$ myopia bound, and identifies nodewise alphas as policy-gradient coordinates of the hierarchical actor. Thus HPO is the static optimality layer and RLPO the dynamic control layer. The conditions are GRS-testable, extend to mean--CVaR and expected utility under ellipticity, and become Kelly-growth conditions in diffusion limits.

Lipid metabolism is a central biological process that is commonly studied using destructive mass-spectrometry experiments. A recently proposed strategy, uses multiple labels to extract temporal information about lipid metabolism from a single destructive measurement. However, the computational complexity of the model-based data analysis increases rapidly with the number of labels, creating a fundamental trade-off between the information content of the measurements and the cost of analysis. Here, we examine how the number of modelled labels affects parameter estimation accuracy, trajectory recovery, and computational cost, and whether modelling fewer labels than are experimentally available can mitigate this trade-off. Using synthetic data from a five-label experiment, we find that modelling three of the five labels provides a practical balance between experimental feasibility, inferential power, and computational tractability. In an application to hepatocyte triglyceride cycling, we further show that the most cost-efficient, single-label model can yield biologically implausible predictions for unobserved species, whereas models that resolve more labels better constrain these latent dynamics. These results provide practical guidance for selecting model resolution in multi-label experiments and establish a quantitative basis for balancing inferential power against computational cost.

In recent years, neural ordinary differential equation frameworks such as Biologically-Informed Neural Networks (BINNs) have shown promise for learning mechanistic laws from sparse data. However, most existing approaches implicitly assume homoscedastic Gaussian noise, and therefore do not account for potentially meaningful structure in biological variability. Here, we present an extension to the existing BINNs framework that includes a learnable noise model, allowing discovery of the noise model directly from data. Using population growth as an example, we demonstrate that the framework accurately recovers the underlying noise structure and improves predictions of the underlying growth laws compared to existing approaches. As such, this work establishes a general likelihood-based framework for jointly learning dynamics and heteroscedastic noise within mechanistic neural network approaches.

Intentional communication has been studied extensively in primates, yet evidence from free-ranging non-ape species remains limited. Human-directed food-solicitation gestures in Hanuman langurs (Semnopithecus entellus) have recently been described, but whether these behaviours exhibit behavioural hallmarks associated with first-order intentionality remains unknown. Here, we experimentally investigated the presence of these hallmarks in free-ranging Hanuman langurs across six anthropogenic sites in southern West Bengal, India. We conducted 360 experimental and control trials and quantified behavioural markers commonly used to operationalize intentional communication. Experimental trials elicited audience checking, recipient-directed orientation, rapid approach responses, food-solicitation gestures and gestural flexibility, whereas these behaviours were rare or absent in control trials. Differences between experimental and control conditions were significant across all six study sites. Signalling also ceased following food acquisition, consistent with the stopping rule associated with an Apparently Satisfactory Outcome. Our findings demonstrate the presence of multiple behavioural hallmarks linked to first-order intentionality in the human-directed gestural communication of free-ranging Hanuman langurs. These results extend the study of intentionality beyond apes and provide new insights into the evolutionary distribution of intentionality-related traits across primates.

AI decision-support systems can benefit from anticipating biases in human decision-making. Many such biases may arise from human cognitive limitations. The policy compression framework models decision-making as a trade-off between reward maximization and the cognitive cost of encoding state-dependent action policies, formalized as the mutual information between states and actions (policy complexity). We argue that this account is incomplete because it treats conditional entropy--the irreducible uncertainty about which action should be selected given a state--as costless, even though empirical evidence suggests that it modulates reaction times. We therefore extend the framework by defining cognitive cost as the sum of policy complexity and a weighted conditional-entropy term, governed by a new parameter, $η$. The resulting optimal policy retains the standard exponential form but becomes sharper as $η$ increases, allowing policy precision to vary more independently of reward sensitivity. This modification implies that the standard policy compression framework may underestimate the cognitive cost of action selection, and it has the potential to better account for biases in human decision-making. At the same time, it introduces additional complexity for fitting the model to human data, which future work will need to address.

Low-frequency, low intensity ultrasound (LIUS) has emerged as a promising physical modality capable of inducing selective apoptosis of cancer cells, while sparing healthy epithelial cells and fibroblasts. Hitherto, the mechanism underlying this selectivity has been unclear, but we now propose and develop a theoretical framework linking the distinct mechanical behaviours of cancer versus healthy cells to their differential responses to LIUS. We point out that cancer cells exhibit inhomogeneous ventral stress-fiber networks, which can produce irregular focal adhesion geometry and inward membrane curvature near focal adhesions under low-intensity ultrasound (LIUS). These curvature irregularities can favor loose packing of Piezo1 channels, thereby preserving their activity. In contrast, healthy epithelial cells and fibroblasts display more homogeneous cytoskeletal organization, which can result in more regular curvature profiles adjacent to focal adhesions. This leads to curvature-driven cholesterol redistribution, resulting in altered spatial organization of Piezo1 clusters and reduced coordinated channel activity and allowing cells to remain in their active, proliferative state when exposed to LIUS. Based on theoretical modeling and previous experimental findings, we propose that differences in cytoskeletal organization and membrane curvature can contribute to distinct Piezo1 activation patterns between healthy and cancerous cells. Our analysis identifies curvature-mediated Piezo1 redistribution as a potential physical basis for LIUS selectivity and provides a mechanistic foundation for designing ultrasound-based therapies to exploit the intrinsic cytoskeletal vulnerabilities of cancer cells.

Computational design of nanobodies that bind user-specified protein epitopes could transform therapeutic development, but current methods either rely on stochastic sampling requiring days of GPU computation or inverse folding approaches unable to target epitopes directly. Here we present EasyNano, a practical pipeline for rapid, epitope-targeted nanobody complementarity-determining region (CDR) design that operates in approximately 10-20 minutes on a high-end personal workstation. EasyNano optimizes CDR residue logits via gradient descent through the ESMFold2 pairwise distance distogram, using the lightweight ESMFold2-Fast model (721M) as a differentiable oracle guided by a composite loss including a dedicated epitope proximity term. A full ESMFold2 (1.3B) CA-coordinate structure prior prevents framework pose drift. The wild-type logit initialization bias emerges as a critical practical parameter controlling CDR mutability. Across six target-framework pairs spanning self-recovery and de novo design scenarios, EasyNano improves ipTM by up to +0.559 -- from 0.143 to 0.702 (Ty1/RBD) -- and achieves a 4.6-fold improvement (ipTM 0.117 to 0.538) on a manually docked AQP4-targeting framework, while preserving ipTM on already-strong binders. Random CDR baselines (n=30 per target) confirm statistical significance (5.7 sigma above random mean for Ty1). Multi-seed analysis reveals diverse local minima, underscoring the importance of replicate runs. Kabsch cross-validation against crystal structures confirms that designed CDRs preserve the framework pose basin. EasyNano demonstrates that ESMFold2-based differentiable optimization provides a fast, practical, and epitope-specific approach to nanobody CDR design.

A key question in theoretical biology is how effectively biological systems preserve information about their inputs while operating under physical and functional constraints. We examine that question at the neuromuscular junction (NMJ) by studying how neurotransmitter concentration is transformed into current at both cholinergic and glutamatergic NMJs. An information maximization analysis was used to derive a theoretical distribution over neurotransmitter concentrations based on biological understandings of dose-response relationships. These theoretical distributions were compared to an experimentally derived distribution obtained from a Drosophila NMJ. The theoretical and experimental distributions showed very little agreement, indicating that the Drosophila NMJ does not shape its distribution of synaptic vesicle release probabilities in order to maximize information transmission from nervous system to muscle. Predictions for cholinergic systems are provided.

Evolutionary accumulation models (EvAMs), also known as cancer progression models (CPMs), infer dependencies in the order of accumulation of mutations during tumor progression from cross-sectional data. It has been suggested that EvAMs could be used to identify therapeutic targets, but there is no procedure in the literature for how to extract predictions under intervention from these models. A simple approach of conditioning on the absence of a mutation gives incorrect predictions. We address this gap by formalizing what ``intervene'' means for all currently available EvAM methods (OT, OncoBN, CBN, H-ESBCN, MHN, HyperHMM, HyperTraPS), using Pearl's do operator and conditional interventions. For each model, we show how to implement the intervention (in most cases as specific parameter modifications), identify equivalent implementation procedures, and analyze whether the modularity assumption -- required for the intervention to be well-defined -- is justified. Drawing on individual-level causal DAGs that make fitness an explicit variable, we distinguish two types of intervention (killing and inactivating) that are conflated in standard EvAM representations. Since the goal is to prioritize intervention candidates, we recast the problem as one of ranking: we define three intervention objectives and provide a protocol for evaluating how well EvAMs rank targets. Our framework is not specific to cancer or EvAMs; it applies wherever fitted computational models can be interpreted as structural causal models. Code available from https://github.com/rdiaz02/scm-interv-evams.

Learning and memory require a balance between plasticity and stability: synaptic connections must encode new information without collapsing, saturating, or erasing previously useful structure. Associative-memory models can appear to learn successfully when fixed background connectivity already carries part of the task, making it difficult to distinguish genuine recall dynamics from structural assistance. We test this issue using an order-sensitive adaptive-plasticity benchmark for staged associative recall. The benchmark compares a quantum-like associative-memory model with matched real-valued no-phase and Markov-rate controls under the same task schedule, perturbation profiles, weak-support conditions, and plasticity settings. Here, "quantum-like" refers to the modeling formalism, not to a biological claim about quantum computation. We first screen weak structural support and then fix a conservative operating point for factorial comparisons across model families and plasticity mechanisms. The useful weak-support regime is narrow and non-monotonic. Weak structure alone does not rescue recall in the no-plasticity ablation, whereas most useful recall gains arise from adaptive plasticity, especially homeostatic stabilization. The Markov-rate control often achieves stronger raw recall, but the quantum-like model more consistently preserves order sensitivity and stage-dependent organization. These results do not support a universal quantum-like advantage. Instead, they show that model classes are better distinguished by a multi-objective profile combining recall, temporal organization, and context sensitivity than by any single recall score. The benchmark therefore provides a controlled framework for studying context-sensitive memory dynamics under weak support, regulated plasticity, and matched classical comparison.

Artificial intelligence (AI) systems increasingly assist human experts, but the consequences of AI assistance on productivity can be heterogeneous. Caplin, Deming, S. Li, Martin, Marx, Weidmann, and Ye (2025b) provide evidence that two characteristics, ability and belief calibration, help to determine the returns to AI assistance. This note shows that their results replicate to a setting where professional radiologists analyze chest X-rays with access to state-of-the-art machine learning predictions. I leverage the public Collab-CXR data repository described by Moehring, Kutwal, Huang, Banerjee, Jacobi, Eber, Mendoza, Chung, Dayan, Gupta, Bui, Truong, Pareek, Langlotz, Lungren, Agarwal, Rajpurkar, and Salz (2025) and first analyzed for human-AI collaboration by Agarwal, Moehring, Rajpurkar, and Salz (2023). To faithfully reproduce the analysis in Caplin, Deming, S. Li, Martin, Marx, Weidmann, and Ye (2025b), I use the radiologist assessments from the repeated-case designs, which include 68 radiologists and 11,420 paired radiologist-patient-pathology observations. The results of this replication support the external validity of their core findings: lower baseline ability and higher calibration predict larger incremental value from AI.

To test and debug hardware modules, it is common to write two programs: a driver, which translates high-level transactions into interactions on the module's input and output signals, and a monitor, which analyzes a signal-level execution trace and recognizes a transaction. These two programs are commonly implemented separately for each hardware protocol, but this separation entails manual effort and risks inconsistencies. We advocate an alternative approach. We present a DSL in which users specify hardware communication protocols as succinct imperative programs. Crucially, the same specification can be used to both drive designs and monitor transactions. We present the design of a tool, which given a specification in our DSL and a waveform, automatically infers a transaction-level trace consistent with the waveform. We discuss plans to evaluate our DSL on real-world interconnects such as Wishbone and AXI-Stream.

Recent growth in compute power has made it increasingly feasible to use large-scale agent-based models to simulate complex adaptive systems. A central difficulty is that such models contain many local rules and parameters, where small changes can lead to runaway behaviour, population collapse, or saturation at artificial bounds. We study this problem in a continuous predator-prey system where sheep and wolves are active agents with local sensing, internal energy, and recurrent neural network-based controllers. We ask whether environmental and demographic parameters can be tuned so that the resulting population dynamics resemble classical Lotka-Volterra cycles. We optimise these parameters with a feature-based loss that rewards sustained oscillations, phase lag, bounded populations, and long-term persistence, first for random controllers and then for evolved controllers in a more naturalistic setting. The model is implemented in ABMax, a JAX-based agent-based modelling framework that enables efficient batched simulation on hardware accelerators.

In network calculus, a fundamental result is the classical delay bound given by the horizontal deviation between the arrival and service curves. While widely used, the classical bound is derived from the notion of virtual delay. In this work, we first show that the maximum packet delay is always upper-bounded by the maximum virtual delay, revealing inherent conservatism when applying the virtual-delay-based bound to packet delay. Motivated by this insight, we revisit packet delay analysis and derive a new packet delay bound that requires no assumptions beyond the arrival and service curves. Specializing the new bound to a system with leaky-bucket arrival curve and rate-latency service curve shows strict improvement over the classical bound, which is further demonstrated through a case study in time-sensitive networking (TSN).

The border determinantal complexity $\dcb(f)$ of a polynomial $f$ is the least $m$ such that $f$ is a limit of determinants of $m\times m$ matrices of affine-linear forms. We prove that for every $n\ge3$, over $\CC$, \[ \dcb\Big(\sum_{i=1}^n x_i^n\Big)\ \ge\ \frac{(n-1)^2}{4e}, \qquad \sdcb\Big(\sum_{i=1}^n x_i^n\Big)\ \ge\ \frac{(n-1)^2}{2e} \] in the ordinary and symmetric models respectively; both match the known $O(n^2)$ upper bounds up to the constant. To our knowledge these are the first border determinantal lower bounds for an explicit family that are superlinear in the number of variables: the known quadratic border bound for the permanent reads the \emph{dimension} of the dual variety and is linear in its number of variables, whereas we transfer the dual \emph{degree}. The proof has two ingredients. The first is an unconditional bound on the slot-$(n-2)$ conormal multidegree of the multiplicity-one Gauss-graph cycle of an arbitrary affine-linear determinant -- singular, reducible, and non-reduced fibers allowed -- by a multihomogeneous Bézout count of a lifted kernel incidence. The second is a specialization argument: along any degeneration $\det A_c\to\sum_ix_i^n$, the flat limit of these Gauss-graph cycles contains the conormal variety of the Fermat cone with positive coefficient. A cone-shift identity converts that conormal multidegree into the classical dual degree $n(n-1)^{n-2}$ of the smooth Fermat hypersurface, and an $(n-1)$-st root yields the quadratic bound. The exact lower bounds of the author's companion manuscripts follow as corollaries.

As parallel workloads grow in complexity, managing fine-grained data dependencies becomes a critical challenge. Futures offer a promising model for handling these dependencies, particularly in irregular algorithms, but they also come with the restriction of value-immutability. This immutability limits the ability to perform in-place memory updates, a necessity for high-performance linear algebra where memory recycling is paramount. In this paper, we address these limitations by introducing a new construct, await_delete, which extends traditional future semantics to allow safe value reuse once consumers are finished. Building on this extension, we present a novel future-based algorithm for the block-wise inversion of dense, symmetric matrices, motivated by a recent algorithm for finding conservation laws of dynamical systems. We implement our approach in an extended version of Taskflow and evaluate it through strong-scaling experiments. Our results demonstrate that while futures incur significant overhead on smaller problem sizes, they achieve nearly linear scaling on large matrices. We analyze the amortization threshold and show that futures are a viable high-performance tool for large-scale linear algebra.

Current U.S. cyber policy, centered on security, often treats documentation of controls and incident reports as a proxy for safety in the built environment. This paper argues that such an approach is inadequate for cyber-physical systems, where digital failures can produce kinetic harm. We construct and code a corpus of critical infrastructure policy documents (N=292, 2000-2025) to examine how "reasonable care" is operationalized across the NIST SP 800-160 Vol.~2 resilience lifecycle. The resulting maps show that obligations are concentrated in the Anticipate phase and emphasize administrative compliance, while Withstand and Recover phases rely heavily on delegated references to IT-focused control catalogs that are poorly aligned with physics-based hazards. We identify three major disconnects: miscalibrated delegated standards, recovery defined as notification rather than engineered navigation, and uneven adaptation requirements across sectors. We then propose a modernized standard of care anchored in hazard-specific traceability, structured assurance cases, and cyber resiliency engineering. Finally, we recommend that federal policy pair these engineering obligations with targeted incentives so that resilient architectures for critical infrastructure become a viable business decision rather than an unfunded expectation.

Multi-agent systems communicate mostly through text, paying a lossy and expensive decode and re-encode cost. KV-cache communication is a promising alternative, yet most prior work is homogeneous, using duplicate copies of the same model, and avoids the central challenge of cross-model latent alignment; existing heterogeneous methods are also restrictive, typically assuming shared input and using transferred caches mainly for steering. We study a more fundamental question: can heterogeneous agents be aligned well enough to perform real "mind reading" and transfer both what one agent sees and how it thinks? Our information-structure analysis reveals a duality: context-aware transfer is driven by sparse reasoning signals, while context-unaware transfer, where the receiver sees no input, requires dense contextual knowledge preservation. Motivated by this, we propose dense alignment for heterogeneous KV-cache communication via a lightweight cross-model cache transformation and two-phase training: reconstruction followed by generation. Across all six directions of {Qwen3-4B, 8B, 14B} and six in-domain and out-of-domain benchmarks, our method outperforms prior heterogeneous baselines, matches or exceeds text communication in context-aware settings at roughly 2 to 3 times lower compute, and remains effective in context-unaware transfer where prior methods collapse.

The seminal work of Goldreich and Ron (\textit{Combinatorica, 1999}) showed that bipartiteness of bounded-degree graphs can be tested using $O(\sqrt{n\log n})$ random walks of length $O(\log^{6} n)$. In this work, we improve their result by showing that $O(\sqrt{n})$ random walks of length $O(\log n)$ suffice. As a corollary, we obtain an $O(\log n)$-pass, $O(\sqrt{n}\log n)$-space streaming algorithm for testing bipartiteness, whose pass complexity is optimal in light of a recent lower bound of Fei, Minzer, and Wang (\textit{arXiv, 2026}). Our proof takes a different approach from that of Goldreich and Ron, using the semidefinite programming relaxation for Max-Cut introduced by Goemans and Williamson (\textit{J. ACM, 1995}).

The task of finding _Hierarchical_ Heavy Hitters (HHH) was introduced by Cormode et al. [VLDB 2003] as a generalisation of the heavy hitter problem. While finding HHH in data streams has been studied extensively, the question of releasing HHH when the underlying data is private remains unexplored. In this paper, we study differentially private HHH release in both the streaming and non-streaming setting. In the non-streaming setting, we show the surprising result that the relative error in estimating the residual count for any prefix is independent of the height of the hierarchy and the number of heavy hitters in the stream. Meanwhile, in the streaming setting, although the exact version of HHH has low global sensitivity (as counting queries are 1-sensitive), the approximation functions due to streaming have high global sensitivity, linear in the available space. Despite this obstacle, we show that the absolute error for estimating frequencies in the steaming setting is independent of the available space.