Search

In optical diffraction, the phase difference between sources in a grating or multi-slit mask is determined by the angle to the imaging screen, yielding the familiar multi-lobed diffraction image. Here, we realize a similar phenomenon in a superconductor-semiconductor hybrid circuit configured to allow Andreev scattering from multiple parallel scatterers. Phase differences between scatterers are set by tapping off of a remote superconducting meander. We investigate arrays with two, three, four, and ten Andreev scatterers, examining local and nonlocal diffraction patterns, finding good agreement with a theory of multiple Andreev scattering. Adding current-carrying taps to the meander allows individual phase control.

We investigate the effectiveness of Explainable AI (XAI) in verifying Machine Unlearning (MU) within the context of harbor front monitoring, focusing on data privacy and regulatory compliance. With the increasing need to adhere to privacy legislation such as the General Data Protection Regulation (GDPR), traditional methods of retraining ML models for data deletions prove impractical due to their complexity and resource demands. MU offers a solution by enabling models to selectively forget specific learned patterns without full retraining. We explore various removal techniques, including data relabeling, and model perturbation. Then, we leverage attribution-based XAI to discuss the effects of unlearning on model performance. Our proof-of-concept introduces feature importance as an innovative verification step for MU, expanding beyond traditional metrics and demonstrating techniques' ability to reduce reliance on undesired patterns. Additionally, we propose two novel XAI-based metrics, Heatmap Coverage (HC) and Attention Shift (AS), to evaluate the effectiveness of these methods. This approach not only highlights how XAI can complement MU by providing effective verification, but also sets the stage for future research to enhance their joint integration., Comment: ICPRW2024

In this paper, we provide the following simple equivalent condition for a nonsymmetric Algebraic Riccati Equation to admit a stabilizing cone-preserving solution: an associated coefficient matrix must be stable. The result holds under the assumption that said matrix be cross-positive on a proper cone, and it both extends and completes a corresponding sufficient condition for nonnegative matrices in the literature. Further, key to showing the above is the following result which we also provide: in order for a monotonically increasing sequence of cone-preserving matrices to converge, it is sufficient to be bounded above in a single vectorial direction.

A popular poster from Myanmar lists food pairings that should be avoided, sometimes at all costs. Coconut and honey taken together, for example, are believed to cause nausea, while pork and curdled milk will induce diarrhea. Worst of all, according to the poster, many seemingly innocuous combinations that include jelly and coffee, beef and star fruit, or pigeon and pumpkin, are likely to kill the unwary consumer. But why are these innocuous combinations considered dangerous, even fatal? The answer is relevant, not just to food beliefs, but to social beliefs of many kinds. Here we describe the prevalence of food combination superstitions, and an opinion formation model simulating their emergence and fixation. We find that such food norms are influenced, not just by actual risks, but also by strong forces of cultural learning that can drive and lock in arbitrary rules, even in the face of contrary evidence., Comment: A shortened version has been published as Chapter 30 in Food Rules and Rituals: Proceedings of the Oxford Symposium on Food and Cookery 2023, ed. Mark McWilliams, Equinox eBooks Publishing, United Kingdom. pp. 294-306

We report a fully differential study of ionization of the Ne L-shell by Compton scattering of 20 keV photons. We find two physical mechanisms which modify the Compton-electron emission. Firstly, we observe scattering of the Compton electrons at their parent nucleus. Secondly, we find a distinct maximum in the electron momentum distribution close-to-zero momentum which we attribute to a focusing of the electrons by the Coulomb potential., Comment: 5 pages, 4 figures

Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations. Using combinatorial species and sign-reversing involutions we derive counting formulas and generating functions for the Caylerian polynomials as well as for related refined polynomials., Comment: 23 pages, 3 tables

What ethical concerns, if any, do LLM researchers have? We introduce EthiCon, a corpus of 1,580 ethical concern statements extracted from scientific papers published in the ACL Anthology. We extract ethical concern keywords from the statements and show promising results in automating the concern identification process. Through a survey, we compare the ethical concerns of the corpus to the concerns listed by the general public and professionals in the field. Finally, we compare our retrieved ethical concerns with existing taxonomies pointing to gaps and future research directions.

The susceptibility of timestepping algorithms to numerical instabilities is an important consideration when simulating partial differential equations (PDEs). Here we identify and analyze a pernicious numerical instability arising in pseudospectral simulations of nonlinear wave propagation resulting in finite-time blow-up. The blow-up time scale is independent of the spatial resolution and spectral basis but sensitive to the timestepping scheme and the timestep size. The instability appears in multi-step and multi-stage implicit-explicit (IMEX) timestepping schemes of different orders of accuracy and has been found to manifest in simulations of soliton solutions of the Korteweg-de Vries (KdV) equation and traveling wave solutions of a nonlinear generalized Klein-Gordon equation. Focusing on the case of KdV solitons, we show that modal predictions from linear stability theory are unable to explain the instability because the spurious growth from linear dispersion is small and nonlinear sources of error growth converge too slowly in the limit of small timestep size. We then develop a novel multi-scale asymptotic framework that captures the slow, nonlinear accumulation of timestepping errors. The framework allows the solution to vary with respect to multiple time scales related to the timestep size and thus recovers the instability as a function of a slow time scale dictated by the order of accuracy of the timestepping scheme. We show that this approach correctly describes our simulations of solitons by making accurate predictions of the blow-up time scale and transient features of the instability. Our work demonstrates that studies of long-time simulations of nonlinear waves should exercise caution when validating their timestepping schemes., Comment: 26 pages, 13 figures, 3 tables

Exceptional are the instances where explicit solutions to optimal control problems are obtainable. Of particular interest are the explicit solutions derived for minimax problems, which provide a framework for tackling challenges characterized by adversarial conditions and uncertainties. This work builds on recent discrete-time research, extending it to a multi-disturbance minimax linear framework for linear time-invariant systems in continuous time. Disturbances are considered to be bounded by elementwise linear constraints, along with unconstrained positive disturbances. Dynamic programming theory is applied to derive explicit solutions to the Hamilton-Jacobi-Bellman (HJB) equation for both finite and infinite horizons. For the infinite horizon a fixed-point method is proposed to compute the solution of the HJB equation. Moreover, the Linear Regulator (LR) problem is introduced, which, analogous to the Linear-Quadratic Regulator (LQR) problem, can be utilized for the stabilization of positive systems. A linear program formulation for the LR problem is proposed which computes the associated stabilizing controller, it it exists. Additionally necessary and sufficient conditions for minimizing the $l_1$-induced gain of the system are derived and characterized through the disturbance penalty of the cost function of the minimax problem class. We motivate the prospective scalability properties of our framework with a large-scale water management network., Comment: 26 pages, 5 figures

Question answering is a natural language understanding task that involves reasoning over both explicit context and unstated, relevant domain knowledge. Large language models (LLMs), which underpin most contemporary question answering systems, struggle to induce how concepts relate in specialized domains such as medicine. Existing medical LLMs are also costly to train. In this work, we present MEG, a parameter-efficient approach for medical knowledge-augmented LLMs. MEG uses a lightweight mapping network to integrate graph embeddings into the LLM, enabling it to leverage external knowledge in a cost-effective way. We evaluate our method on four popular medical multiple-choice datasets and show that LLMs greatly benefit from the factual grounding provided by knowledge graph embeddings. MEG attains an average of +10.2% accuracy over the Mistral-Instruct baseline, and +6.7% over specialized models like BioMistral. We also show results based on Llama-3. Finally, we show that MEG's performance remains robust to the choice of graph encoder.

As a well-known open cluster, NGC 2323 (also called M50) has been widely investigated for over a hundred years and has always been considered a classical single cluster. In this work, with the help of Gaia DR3, we study the binary structure nature of this cluster. Although indistinguishable in the spatial space, the small but undeniable difference in the proper motion indicates that they may be two individual clusters. After investigating the properties of the two clusters, it is found that they have very close positions (three-dimensional $\Delta$pos = 12.3 pc, $\sigma_{\Delta \mathrm{pos}} = 3.4$ pc) and similar tangential velocities (two-dimensional $\Delta$V = 2.2 km s$^{-1}$, $\sigma_{\Delta \mathrm{V}} = 0.02$ km s$^{-1}$), indicating the existence of their physical association. Moreover, the best isochrone fitting ages of the two clusters are the same (158 Myr), further proving their possibly common origin. To comprehensively understand the formation and evolution of this binary cluster, we employ the PETAR $N$-body code to trace back their birthplace and deduce their dynamical evolutionary fate. With observational mean cluster properties, the simulations suggest that they may form together, and then orbit each other as a binary cluster for over 200 Myr. After that, because of their gradual mass loss, the two clusters will eventually separate and evolve into two independent clusters. Meanwhile, the numerical $N$-body simulation suggests that the less massive cluster is unlikely to be the cluster tidal tails created by the differential rotation of the Milky Way., Comment: 14 pages, 8 figures

We introduce NEOviz, an interactive visualization system designed to assist planetary defense experts in the visual analysis of the movements of near-Earth objects in the Solar System that might prove hazardous to Earth. Asteroids are often discovered using optical telescopes and their trajectories are calculated from images, resulting in an inherent asymmetric uncertainty in their position and velocity. Consequently, we typically cannot determine the exact trajectory of an asteroid, and an ensemble of trajectories must be generated to estimate an asteroid's movement over time. When propagating these ensembles over decades, it is challenging to visualize the varying paths and determine their potential impact on Earth, which could cause catastrophic damage. NEOviz equips experts with the necessary tools to effectively analyze the existing catalog of asteroid observations. In particular, we present a novel approach for visualizing the 3D uncertainty region through which an asteroid travels, while providing accurate spatial context in relation to system-critical infrastructure such as Earth, the Moon, and artificial satellites. Furthermore, we use NEOviz to visualize the divergence of asteroid trajectories, capturing high-variance events in an asteroid's orbital properties. For potential impactors, we combine the 3D visualization with an uncertainty-aware impact map to illustrate the potential risks to human populations. NEOviz was developed with continuous input from members of the planetary defense community through a participatory design process. It is exemplified in three real-world use cases and evaluated via expert feedback interviews.

We present supernova (SN) 2023ufx, a unique Type IIP SN with the shortest known plateau duration ($t_\mathrm{PT}$ $\sim$47 days), a luminous V-band peak ($M_{V}$ = $-$18.42 $\pm$ 0.08 mag), and a rapid early decline rate ($s1$ = 3.47 $\pm$ 0.09 mag (50 days)$^{-1}$). By comparing observed photometry to a hydrodynamic MESA+STELLA model grid, we constrain the progenitor to be a massive red supergiant with M$_\mathrm{ZAMS}$ $\simeq$19 - 25 M$_{\odot}$. Independent comparisons with nebular spectral models also suggest an initial He-core mass of $\sim$6 M$_{\odot}$, and thus a massive progenitor. For a Type IIP, SN 2023ufx produced an unusually high amount of nickel ($^{56}$Ni) $\sim$0.14 $\pm$ 0.02 M$_{\odot}$, during the explosion. We find that the short plateau duration in SN 2023ufx can be explained with the presence of a small hydrogen envelope (M$_\mathrm{H_\mathrm{env}}$ $\simeq$1.2 M$_{\odot}$), suggesting partial stripping of the progenitor. About $\simeq$0.09 M$_{\odot}$ of CSM through mass loss from late-time stellar evolution of the progenitor is needed to fit the early time ($\lesssim$10 days) pseudo-bolometric light curve. Nebular line diagnostics of broad and multi-peak components of [O I] $\lambda\lambda$6300, 6364, H$\alpha$, and [Ca II] $\lambda \lambda$7291, 7323 suggest that the explosion of SN 2023ufx could be inherently asymmetric, preferentially ejecting material along our line-of-sight., Comment: Submitted to ApJ, 30 pages, 19 figures

The structure tensor method is often used for 2D and 3D analysis of imaged structures, but its results are in many cases very dependent on the user's choice of method parameters. We simplify this parameter choice in first order structure tensor scale-space by directly connecting the width of the derivative filter to the size of image features. By introducing a ring-filter step, we substitute the Gaussian integration/smoothing with a method that more accurately shifts the derivative filter response from feature edges to their center. We further demonstrate how extracted structural measures can be used to correct known inaccuracies in the scale map, resulting in a reliable representation of the feature sizes both in 2D and 3D. Compared to the traditional first order structure tensor, or previous structure tensor scale-space approaches, our solution is much more accurate and can serve as an out-of-the-box method for extracting a wide range of structural parameters with minimal user input.

In the ever-evolving adversarial machine learning landscape, developing effective defenses against patch attacks has become a critical challenge, necessitating reliable solutions to safeguard real-world AI systems. Although diffusion models have shown remarkable capacity in image synthesis and have been recently utilized to counter $\ell_p$-norm bounded attacks, their potential in mitigating localized patch attacks remains largely underexplored. In this work, we propose DiffPAD, a novel framework that harnesses the power of diffusion models for adversarial patch decontamination. DiffPAD first performs super-resolution restoration on downsampled input images, then adopts binarization, dynamic thresholding scheme and sliding window for effective localization of adversarial patches. Such a design is inspired by the theoretically derived correlation between patch size and diffusion restoration error that is generalized across diverse patch attack scenarios. Finally, DiffPAD applies inpainting techniques to the original input images with the estimated patch region being masked. By integrating closed-form solutions for super-resolution restoration and image inpainting into the conditional reverse sampling process of a pre-trained diffusion model, DiffPAD obviates the need for text guidance or fine-tuning. Through comprehensive experiments, we demonstrate that DiffPAD not only achieves state-of-the-art adversarial robustness against patch attacks but also excels in recovering naturalistic images without patch remnants. The source code is available at https://github.com/JasonFu1998/DiffPAD., Comment: Accepted to 2025 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)

We study the density estimation problem defined as follows: given $k$ distributions $p_1, \ldots, p_k$ over a discrete domain $[n]$, as well as a collection of samples chosen from a ``query'' distribution $q$ over $[n]$, output $p_i$ that is ``close'' to $q$. Recently~\cite{aamand2023data} gave the first and only known result that achieves sublinear bounds in {\em both} the sampling complexity and the query time while preserving polynomial data structure space. However, their improvement over linear samples and time is only by subpolynomial factors. Our main result is a lower bound showing that, for a broad class of data structures, their bounds cannot be significantly improved. In particular, if an algorithm uses $O(n/\log^c k)$ samples for some constant $c>0$ and polynomial space, then the query time of the data structure must be at least $k^{1-O(1)/\log \log k}$, i.e., close to linear in the number of distributions $k$. This is a novel \emph{statistical-computational} trade-off for density estimation, demonstrating that any data structure must use close to a linear number of samples or take close to linear query time. The lower bound holds even in the realizable case where $q=p_i$ for some $i$, and when the distributions are flat (specifically, all distributions are uniform over half of the domain $[n]$). We also give a simple data structure for our lower bound instance with asymptotically matching upper bounds. Experiments show that the data structure is quite efficient in practice., Comment: To appear at NeurIPS 2024

We extend the controlled displacement interaction between a qubit and a harmonic oscillator to the multi-qubit (qudit) case. We define discrete quadratures of the qudit and show how the qudit state can be displaced in these quadratures controlled by an oscillator quadrature. Using this interaction, a periodic repetition of the state encoded in the qudit, can be deterministically mapped onto the oscillator, which is initialized in a squeezed state. Based on this controlled displacement interaction, we present a full circuit that encodes quantum information in a superposition of qudit quadrature states, and successively prepares the oscillator in the corresponding superposition of approximate Gottesman-Kitaev-Preskill (GKP) states. This preparation scheme is found to be similar to phase estimation, with the addition of a disentanglement gate. Our protocol for GKP state preparation is efficient in the sense, that the set of qubits need only interact with the oscillator through two time-independent interactions, and in the sense that the squeeze factor (in dB) of the produced GKP state grows linearly in the number of qubits used., Comment: 13 pages, 6 figures

A seemingly simple, yet widely applicable subroutine in automated train scheduling is the insertion of a new train path to a timetable in a railway network. We believe it to be the first step towards a new train-rerouting framework in case of large disturbances or maintenance works. Other applications include handling ad-hoc requests and modifying train paths upon request from railway undertakings. We propose a fast and scalable path-insertion algorithm based on dynamic programming that is able to output multiple suitable paths. Our algorithm uses macroscopic data and can run on railway networks with any number of tracks. We apply the algorithm on the line from G\"oteborg S\"aven\"as to the Norwegian border at Kornsj\"o. For a time window of seven hours, we obtain eight suitable paths for a freight train within 0.3 seconds after preprocessing.

The broad range of neural network training techniques that invoke optimization but rely on ad hoc modification for validity suggests that optimization-based training is misguided. Shortcomings of optimization-based training are brought to particularly strong relief by the problem of overfitting, where naive optimization produces spurious outcomes. The broad success of neural networks for modelling physical processes has prompted advances that are based on inverting the direction of investigation and treating neural networks as if they were physical systems in their own right These successes raise the question of whether broader, physical perspectives could motivate the construction of improved training algorithms. Here, we introduce simmering, a physics-based method that trains neural networks to generate weights and biases that are merely ``good enough'', but which, paradoxically, outperforms leading optimization-based approaches. Using classification and regression examples we show that simmering corrects neural networks that are overfit by Adam, and show that simmering avoids overfitting if deployed from the outset. Our results question optimization as a paradigm for neural network training, and leverage information-geometric arguments to point to the existence of classes of sufficient training algorithms that do not take optimization as their starting point.

This work considers infinite-horizon optimal control of positive linear systems applied to the case of network routing problems. We demonstrate the equivalence between Stochastic Shortest Path (SSP) problems and optimal control of a certain class of linear systems. This is used to construct a heuristic search framework for this class of linear systems inspired by existing methods for SSP. We propose a heuristics-based algorithm for finding local solutions to the analyzed class of optimal control problems with positive state and linear dynamics. More fundamentally, the results allow for analysis of the conditions for explicit solutions to the Bellman equation utilized by heuristic search methods., Comment: Preprint submitted to Automatica for review

Reliable stellar age estimates are fundamental for testing several problems in modern astrophysics, in particular since they set the time scales of Galactic dynamical and chemical evolution. In this study, we determine ages using only Gaia DR3 photometry and parallaxes, in combination with interstellar extinction maps, spectroscopic metallicities and $\alpha$ abundances from the latest data release (DR8) of the LAMOST survey. In contrast with previous age estimates, we do not use spectroscopic effective temperatures or surface gravities, thus relying on the excellent precision and accuracy of the Gaia photometry. We use a new version of the publicly available SPInS code with improved features, including the on-the-fly computation of the autocorrelation time and the automatic convergence evaluation. We determine reliable age estimates for 35,096 and 243,768 sub-giant and main-sequence turn-off stars in the LAMOST DR8 low- and medium-resolution surveys with typical uncertainties smaller than 10%. In addition, we successfully test our method on more than 4,000 stars of 14 well-studied open and globular star clusters covering a wide range of ages, confirming the reliability of our age and uncertainty estimates., Comment: Accepted for publication in A&A

Large Language Models (LLMs) store and retrieve vast amounts of factual knowledge acquired during pre-training. Prior research has localized and identified mechanisms behind knowledge recall; however, it has primarily focused on English monolingual models. The question of how these processes generalize to other languages and multilingual LLMs remains unexplored. In this paper, we address this gap by conducting a comprehensive analysis of two highly multilingual LLMs. We assess the extent to which previously identified components and mechanisms of factual recall in English apply to a multilingual context. Then, we examine when language plays a role in the recall process, uncovering evidence of language-independent and language-dependent mechanisms.

Stars presently identified in the bulge spheroid are probably very old, and their abundances can be interpreted as due to the fast chemical enrichment of the early Galactic bulge. The abundances of the iron-peak elements are important tracers of nucleosynthesis processes, in particular oxygen burning, silicon burning, the weak s-process, and alpha-rich freeze-out. Aims. The aim of this work is to derive the abundances of V, Cr, Mn, Co, Ni, and Cu in 58 bulge spheroid stars and to compare them with the results of a previous analysis of data from APOGEE. We selected the best lines for V, Cr, Mn, Co, Ni, and Cu located within the H-band of the spectrum, identifying the most suitable ones for abundance determination, and discarding severe blends. Using the stellar physical parameters available for our sample from the DR17 release of the APOGEE project, we derived the individual abundances through spectrum synthesis. We then complemented these measurements with similar results from different bulge field and globular cluster stars, in order to define the trends of the individual elements and compare with the results of chemical-evolution models. We verify that the H-band has useful lines for the derivation of the elements V, Cr, Mn, Co, Ni, and Cu in moderately metal-poor stars. The resulting abundances indicate that: V, Cr, and Ni vary in lockstep with Fe; Co tends to vary in lockstep with Fe, but could be showing a slight decrease with decreasing metallicity; and Mn and Cu decrease with decreasing metallicity. These behaviours are well reproduced by chemical-evolution models except for Cu, which appears to drop faster than the models predict for moderate metallicities. Finally, abundance indicators combined with kinematical and dynamical criteria appear to show that our 58 sample stars are likely to have originated in situ., Comment: 12 pages, Astronomy & Astrophysics, accepted on 9/October/2024

The increased brightness temperature of young rocky protoplanets during their magma ocean epoch makes them potentially amenable to atmospheric characterization to distances from the solar system far greater than thermally equilibrated terrestrial exoplanets, offering observational opportunities for unique insights into the origin of secondary atmospheres and the near surface conditions of prebiotic environments. The Large Interferometer For Exoplanets (LIFE) mission will employ a space-based mid-infrared nulling interferometer to directly measure the thermal emission of terrestrial exoplanets. Here, we seek to assess the capabilities of various instrumental design choices of the LIFE mission concept for the detection of cooling protoplanets with transient high-temperature magma ocean atmospheres, in young stellar associations in particular. Using the LIFE mission instrument simulator (LIFEsim) we assess how specific instrumental parameters and design choices, such as wavelength coverage, aperture diameter, and photon throughput, facilitate or disadvantage the detection of protoplanets. We focus on the observational sensitivities of distance to the observed planetary system, protoplanet brightness temperature using a blackbody assumption, and orbital distance of the potential protoplanets around both G- and M-dwarf stars. Our simulations suggest that LIFE will be able to detect (S/N $\geq$ 7) hot protoplanets in young stellar associations up to distances of $\approx$100 pc from the solar system for reasonable integration times (up to $\sim$hours). Detection of an Earth-sized protoplanet orbiting a solar-sized host star at 1 AU requires less than 30 minutes of integration time. M-dwarfs generally need shorter integration times. The contribution from wavelength regions $<$6 $\mu$m is important for decreasing the detection threshold and discriminating emission temperatures., Comment: 18 pages, 19 figures; accepted for publication in A&A

We present a method to compute real-time path integrals numerically, by Monte-Carlo sampling on near-Lefschetz thimbles. We present a collection of new tools, which together provide an alternative to existing methods such as the Generalised thimble. These involve a convenient coordinate parameterization of the thimble, direct numerical integration along a radial coordinate into an effective path integral weight and locally deforming the Lefschetz thimble using its Gaussian (non-interacting theory) counterpart in a region about the critical point. We apply this to quantum mechanics, identify possible pitfalls and benefits, and benchmark its efficiency., Comment: 24 pages, 10 figures

This paper introduces "Synthetic Interlocutors" for ethnographic research. Synthetic Interlocutors are chatbots ingested with ethnographic textual material (interviews and observations) by using Retrieval Augmented Generation (RAG). We integrated an open-source large language model with ethnographic data from three projects to explore two questions: Can RAG digest ethnographic material and act as ethnographic interlocutor? And, if so, can Synthetic Interlocutors prolong encounters with the field and extend our analysis? Through reflections on the process of building our Synthetic Interlocutors and an experimental collaborative workshop, we suggest that RAG can digest ethnographic materials, and it might lead to prolonged, yet uneasy ethnographic encounters that allowed us to partially recreate and re-visit fieldwork interactions while facilitating opportunities for novel analytic insights. Synthetic Interlocutors can produce collaborative, ambiguous and serendipitous moments.

The first FASER search for a light, long-lived particle decaying into a pair of photons is reported. The search uses LHC proton-proton collision data at $\sqrt{s}=13.6~\text{TeV}$ collected in 2022 and 2023, corresponding to an integrated luminosity of $57.7\text{fb}^{-1}$. A model with axion-like particles (ALPs) dominantly coupled to weak gauge bosons is the primary target. Signal events are characterised by high-energy deposits in the electromagnetic calorimeter and no signal in the veto scintillators. One event is observed, compared to a background expectation of $0.44 \pm 0.39$ events, which is entirely dominated by neutrino interactions. World-leading constraints on ALPs are obtained for masses up to $300~\text{MeV}$ and couplings to the Standard Model W gauge boson, $g_{aWW}$, around $10^{-4}$ GeV$^{-1}$, testing a previously unexplored region of parameter space. Other new particle models that lead to the same experimental signature, including ALPs coupled to gluons or photons, U(1)$_B$ gauge bosons, up-philic scalars, and a Type-I two-Higgs doublet model, are also considered for interpretation, and new constraints on previously viable parameter space are presented in this paper., Comment: 37 pages, 22 figures

Bayesian methods promise enhanced device performance and accelerated data collection. We demonstrate an adaptive Bayesian measurement strategy for atom number estimation in a quantum technology experiment, utilising a symmetry-informed loss function. Compared to a standard unoptimised strategy, our method yields a five-fold reduction in the fractional variance of the atom number estimate. Equivalently, it achieves the target precision with a third of the data points previously required. We provide general expressions for the optimal estimator and error for any quantity amenable to symmetry-informed strategies, facilitating the application of these strategies in quantum computing, communication, metrology, and the wider quantum technology sector., Comment: 6 + 5 pages, 3 + 2 figures, 1 + 1 tables. Updated references and minor revisions

Around 5-10\% of newborns need assistance to start breathing. Currently, there is a lack of evidence-based research, objective data collection, and opportunities for learning from real newborn resuscitation emergency events. Generating and evaluating automated newborn resuscitation algorithm activity timelines relative to the Time of Birth (ToB) offers a promising opportunity to enhance newborn care practices. Given the importance of prompt resuscitation interventions within the "golden minute" after birth, having an accurate ToB with second precision is essential for effective subsequent analysis of newborn resuscitation episodes. Instead, ToB is generally registered manually, often with minute precision, making the process inefficient and susceptible to error and imprecision. In this work, we explore the fusion of Artificial Intelligence (AI) and thermal imaging to develop the first AI-driven ToB detector. The use of temperature information offers a promising alternative to detect the newborn while respecting the privacy of healthcare providers and mothers. However, the frequent inconsistencies in thermal measurements, especially in a multi-camera setup, make normalization strategies critical. Our methodology involves a three-step process: first, we propose an adaptive normalization method based on Gaussian mixture models (GMM) to mitigate issues related to temperature variations; second, we implement and deploy an AI model to detect the presence of the newborn within the thermal video frames; and third, we evaluate and post-process the model's predictions to estimate the ToB. A precision of 88.1\% and a recall of 89.3\% are reported in the detection of the newborn within thermal frames during performance evaluation. Our approach achieves an absolute median deviation of 2.7 seconds in estimating the ToB relative to the manual annotations., Comment: Paper submitted to Computer in Biology and Medicine, ELSEVIER

We study dynamical optimal transport of discrete time systems (dDOT) with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting algorithm is proposed for numerical implementation. While solving partial differential equations is often required in the continuous time case, a salient feature of our algorithm is that it avoids equation solving entirely. Furthermore, it is typical to solve a convex optimization problem at each grid point in continuous time settings, the discrete case reduces this to a straightforward maximization. Additionally, the proposed algorithm is highly amenable to parallelization. For linear systems with Gaussian marginals, we provide a semi-definite programming formulation based on our theory. Finally, we validate the approach with a simulation example.

Understanding protein motion within the cell is crucial for predicting reaction rates and macromolecular transport in the cytoplasm. A key question is how crowded environments affect protein dynamics through hydrodynamic and direct interactions at molecular length scales. Using megahertz X-ray Photon Correlation Spectroscopy (MHz-XPCS) at the European X-ray Free Electron Laser (EuXFEL), we investigate ferritin diffusion at microsecond time scales. Our results reveal anomalous diffusion, indicated by the non-exponential decay of the intensity autocorrelation function $g_2(q,t)$ at high concentrations. This behavior is consistent with the presence of cage-trapping in between the short- and long-time protein diffusion regimes. Modeling with the $\delta\gamma$-theory of hydrodynamically interacting colloidal spheres successfully reproduces the experimental data by including a scaling factor linked to the protein direct interactions. These findings offer new insights into the complex molecular motion in crowded protein solutions, with potential applications for optimizing ferritin-based drug delivery, where protein diffusion is the rate-limiting step.

Precipitation nowcasting is crucial across various industries and plays a significant role in mitigating and adapting to climate change. We introduce an efficient deep learning model for precipitation nowcasting, capable of predicting rainfall up to 8 hours in advance with greater accuracy than existing operational physics-based and extrapolation-based models. Our model leverages multi-source meteorological data and physics-based forecasts to deliver high-resolution predictions in both time and space. It captures complex spatio-temporal dynamics through temporal attention networks and is optimized using data quality maps and dynamic thresholds. Experiments demonstrate that our model outperforms state-of-the-art, and highlight its potential for fast reliable responses to evolving weather conditions.

The streaming instability is a mechanism whereby pebble-sized particles in protoplanetary discs spontaneously come together in dense filaments, which collapse gravitationally to form planetesimals upon reaching the Roche density. The extent of the filaments along the orbital direction is nevertheless poorly characterised, due to a focus in the literature on small simulation domains where the behaviour of the streaming instability on large scales cannot be determined. We present here computer simulations of the streaming instability in boxes with side lengths up to 6.4 scale heights in the plane. This is 32 times larger than typically considered simulation domains and nearly a factor 1,000 times the volume. We show that the azimuthal extent of filaments in the non-linear state of the streaming instability is limited to approximately one gas scale height. The streaming instability will therefore not transform the pebble density field into axisymmetric rings; rather the non-linear state of the streaming instability appears as a complex structure of loosely connected filaments. Including the self-gravity of the pebbles, our simulations form up to 4,000 planetesimals. This allows us to probe the high-mass end of the initial mass function of planetesimals with much higher statistical confidence than previously. We find that this end is well-described by a steep exponential tapering. Since the resolution of our simulations is moderate -- a necessary trade-off given the large domains -- the mass distribution is incomplete at the low-mass end. When putting comparatively less weight on the numbers at low masses, at intermediate masses we nevertheless reproduce the power-law shape of the distribution established in previous studies., Comment: 15 pages, 14 figures, 2 tables; accepted for publication in A&A

Spin precession is a textbook example of dynamics of a quantum system that exactly mimics its classical counterpart. Here we challenge this view by certifying the quantumness of exotic states of a nuclear spin through its uniform precession. The key to this result is measuring the positivity, instead of the expectation value, of the $x$-projection of the precessing spin, and using a spin > 1/2 qudit, that is not restricted to semi-classical spin coherent states. The experiment is performed on a single spin-7/2 $^{123}$Sb nucleus, implanted in a silicon nanoelectronic device, amenable to high-fidelity preparation, control, and projective single-shot readout. Using Schr\"odinger cat states and other bespoke states of the nucleus, we violate the classical bound by 19 standard deviations, proving that no classical probability distribution can explain the statistic of this spin precession, and highlighting our ability to prepare quantum resource states with high fidelity in a single atomic-scale qudit., Comment: Main text: 11 pages, 5 figures. Supplementary information: 13 pages, 11 figures

Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates. Such operations can be readily implemented with scalable photonic hardware: resource states can be deterministically generated by quantum emitters and fusions require only shallow linear-optical circuits. Here, we propose fusion-based architectures tailored to the capabilities and noise models in quantum emitters. We show that high tolerance to dominant physical error mechanisms can be achieved, with fault-tolerance thresholds of 8% for photon loss, 4% for photon distinguishability between emitters, and spin noise thresholds well above memory-induced errors for typical spin-photon interfaces. Our construction and analysis provide guidelines for the development of photonic quantum hardware targeting fault-tolerant applications with quantum emitters., Comment: Added proofs in Supplementary

The next goalpost in precision calculations for physics beyond the Standard Model is determining the two-loop renormalization group (RG) equations in the Standard Model Effective Field Theory (SMEFT). We progress towards this goal by determining the RG equations for a simplified version of the SMEFT without any fermion fields. Our calculation relies on functional methods that are newly developed for multi-loop computations and adapted for the determination of RG equations here., Comment: 21 pages, 1 figure, 1 table, 1 ancillary file

Energy efficiency and information freshness are key requirements for sensor nodes serving Industrial Internet of Things (IIoT) applications, where a sink node collects informative and fresh data before a deadline, e.g., to control an external actuator. Content-based wake-up (CoWu) activates a subset of nodes that hold data relevant for the sink's goal, thereby offering an energy-efficient way to attain objectives related to information freshness. This paper focuses on a scenario where the sink collects fresh information on top-k values, defined as data from the nodes observing the k highest readings at the deadline. We introduce a new metric called top-k Query Age of Information (k-QAoI), which allows us to characterize the performance of CoWu by considering the characteristics of the physical process. Further, we show how to select the CoWu parameters, such as its timing and threshold, to attain both information freshness and energy efficiency. The numerical results reveal the effectiveness of the CoWu approach, which is able to collect top-k data with higher energy efficiency while reducing k-QAoI when compared to round-robin scheduling, especially when the number of nodes is large and the required size of k is small., Comment: Submitted for IEEE Transactions on Communications