Search

Analytical results are presented for the structure of networks that evolve via a preferential-attachment-random-deletion (PARD) model in the regime of overall network growth and in the regime of overall contraction. The phase transition between the two regimes is studied. At each time step a node addition and preferential attachment step takes place with probability $P_{\rm add}$, and a random node deletion step takes place with probability $P_{\rm del} = 1 - P_{\rm add}$. The balance between growth and contraction is captured by the parameter $\eta = P_{\rm add} - P_{\rm del}$, which in the regime of overall network growth satisfies $0 < \eta \le 1$ and in the regime of overall network contraction $-1 \le \eta < 0$. Using the master equation and computer simulations we show that for $-1 < \eta < 0$ the time-dependent degree distribution $P_t(k)$ converges towards a stationary form $P_{\rm st}(k)$ which exhibits an exponential tail. This is in contrast with the power-law tail of the stationary degree distribution obtained for $0 < \eta \le 1$. Thus, the PARD model has a phase transition at $\eta=0$, which separates between two structurally distinct phases. At the transition, for $\eta=0$, the degree distribution exhibits a stretched exponential tail. While the stationary degree distribution in the phase of overall growth represents an asymptotic state, in the phase of overall contraction $P_{\rm st}(k)$ represents an intermediate asymptotic state of a finite life span, which disappears when the network vanishes., Comment: 32 pages, 6 figures. arXiv admin note: text overlap with arXiv:2209.10027

We present analytical results for the distribution of first return (FR) times of non-backtracking random walks (NBWs) on undirected configuration model networks consisting of $N$ nodes with degree distribution $P(k)$. We focus on the case in which the network consists of a single connected component. Starting from a random initial node $i$ at time $t=0$, an NBW hops into a random neighbor of $i$ at time $t=1$ and at each subsequent step it continues to hop into a random neighbor of its current node, excluding the previous node. We calculate the tail distribution $P ( T_{\rm FR} > t )$ of first return times from a random node to itself. It is found that $P ( T_{\rm FR} > t )$ is given by a discrete Laplace transform of the degree distribution $P(k)$. This result exemplifies the relation between structural properties of a network, captured by the degree distribution, and properties of dynamical processes taking place on the network. Using the tail-sum formula, we calculate the mean first return time ${\mathbb E}[ T_{\rm FR} ]$. Surprisingly, ${\mathbb E}[ T_{\rm FR} ]$ coincides with the result obtained from the Kac's lemma that applies to classical random walks (RWs). We also calculate the variance ${\rm Var}(T_{\rm FR})$, which accounts for the variability of first return times between different NBW trajectories. We apply this formalism to random regular graphs, Erdos-R\'enyi networks and configuration model networks with exponential and power-law degree distributions and obtain closed-form expressions for $P ( T_{\rm FR} > t )$ as well as its mean and variance. These results provide useful insight on the advantages of NBWs over classical RWs in network exploration, sampling and search processes., Comment: 28 pages, 9 figures

Thanks to Integral Field Unit survey data it is possible to explore in detail the link between the formation of the stellar content in galaxies and the drivers of evolution. Traditionally, scaling relations have connected galaxy-wide parameters such as stellar mass (M$_s$), morphology or average velocity dispersion ($\sigma$) to the star formation histories (SFHs). We study a high quality sample of SDSS-MaNGA spectra to test the possibility that sub-galaxy ($\sim$2\,kpc) scales are dominant, instead of galaxy-wide parameters. We find a strong correlation between local velocity dispersion and key line strengths that depend on the SFHs, allowing us to make the ansatz that this indicator - that maps the local gravitational potential - is the major driver of star formation in galaxies, whereas larger scales play a role of a secondary nature. Galactocentric distance has a weaker correlation, suggesting that the observed radial gradients effectively reflect local variations of velocity dispersion. In our quest for a cause, instead of a correlation, we contrast $\sigma$ with local stellar mass, that appears less correlated with population properties. We conclude that the inherently higher uncertainty in M$_s$ may explain its lower correlation with respect to $\sigma$, but the extra uncertainty needed for $\sigma$ to have similar correlations as M$_s$ is rather high. Therefore we posit local velocity dispersion as the major driver of evolution, a result that should be reproduced by hydrodynamical models at the proper resolution., Comment: 14 pages, 8+2 figures. Submitted for publication in MNRAS. Comments welcome

Understanding how galaxies form and evolve is at the heart of modern astronomy. With the advent of large-scale surveys and simulations, remarkable progress has been made in the last few decades. Despite this, the physical processes behind the phenomena, and particularly their importance, remain far from known, as correlations have primarily been established rather than the underlying causality. We address this challenge by applying the causal inference framework. Specifically, we tackle the fundamental open question of whether galaxy formation and evolution depends more on nature (i.e., internal processes) or nurture (i.e., external processes), by estimating the causal effect of environment on star-formation rate in the IllustrisTNG simulations. To do so, we develop a comprehensive causal model and employ cutting-edge techniques from epidemiology to overcome the long-standing problem of disentangling nature and nurture. We find that the causal effect is negative and substantial, with environment suppressing the SFR by a maximal factor of $\sim100$. While the overall effect at $z=0$ is negative, in the early universe, environment is discovered to have a positive impact, boosting star formation by a factor of $\sim10$ at $z\sim1$ and by even greater amounts at higher redshifts. Furthermore, we show that: (i) nature also plays an important role, as ignoring it underestimates the causal effect in intermediate-density environments by a factor of $\sim2$, (ii) controlling for the stellar mass at a snapshot in time, as is common in the literature, is not only insufficient to disentangle nature and nurture but actually has an adverse effect, though (iii) stellar mass is an adequate proxy of the effects of nature. Finally, this work may prove a useful blueprint for extracting causal insights in other fields that deal with dynamical systems with closed feedback loops, such as the Earth's climate., Comment: 16 pages, 4 figures

Effective string theory describes the physics of long confining strings in theories, like Yang-Mills theory, where the mass gap $M_{gap}^2$ is of the same order as the string tension $T$. In $2+1$ dimensions, there is a class of confining theories, including massive QED$_3$ as first analyzed by Polyakov, for which $M_{gap}^2\ll T$. These theories are weakly coupled at low energies of order $M_{gap}$, and may be analyzed perturbatively. In this paper, we analyze the physics of strings in such theories, focusing on QED$_3$, at energies of order $M_{gap}$ (but still well below $\sqrt{T}$). We argue that the width of the string in these theories should be of order $1/M_{gap}$ independently of its length, as long as the string is not exponentially long. We also compute at leading order in perturbation theory the ground state energy of a confining string on a circle, and the scattering of Nambu-Goldstone bosons on the string worldsheet., Comment: 46 pages + appendices, 3 figures

Activity and autonomous motion are fundamental aspects of many living and engineering systems. Here, the scale of biological agents covers a wide range, from nanomotors, cytoskeleton, and cells, to insects, fish, birds, and people. Inspired by biological active systems, various types of autonomous synthetic nano- and micromachines have been designed, which provide the basis for multifunctional, highly responsive, intelligent active materials. A major challenge for understanding and designing active matter is their inherent non-equilibrium nature due to persistent energy consumption, which invalidates equilibrium concepts such as free energy, detailed balance, and time-reversal symmetry. Furthermore, interactions in ensembles of active agents are often non-additive and non-reciprocal. An important aspect of biological agents is their ability to sense the environment, process this information, and adjust their motion accordingly. It is an important goal for the engineering of micro-robotic systems to achieve similar functionality. With many fundamental properties of motile active matter now reasonably well understood and under control, the ground is prepared for the study of physical aspects and mechanisms of motion in complex environments, of the behavior of systems with new physical features like chirality, of the development of novel micromachines and microbots, of the emergent collective behavior and swarming of intelligent self-propelled particles, and of particular features of microbial systems. The vast complexity of phenomena and mechanisms involved in the self-organization and dynamics of motile active matter poses major challenges, which can only be addressed by a truly interdisciplinary effort involving scientists from biology, chemistry, ecology, engineering, mathematics, and physics.

We present analytical results for the joint probability distribution $P(T_{FR}=t,S=s)$ of first return (FR) times t and of the number of distinct sites s visited by a random walk (RW) on a one dimensional lattice before returning to the origin. The RW on a one dimensional lattice is recurrent, namely the probability to return to the origin is $P_{R}=1$. However the mean $\langle T_{FR}\rangle$ of the distribution $P(T_{FR}=t)$ of first return times diverges. Similarly, the mean $\langle S\rangle$ of the distribution $P(S=s)$ of the number of distinct sites visited before returning to the origin also diverges. The joint distribution $P(T_{FR}=t,S=s)$ provides a formulation that controls these divergences and accounts for the interplay between the kinetic and geometric properties of first return trajectories. We calculate the conditional distributions $P(T_{FR}=t|S=s)$ and $P(S=s|T_{FR}=t)$. We find that the conditional expectation value of first return times of trajectories that visit s distinct sites is ${\mathbb E}[T_{FR}|S=s]=\frac{2}{3}(s^2+s+1)$, and the variance is $Var(T_{FR}|S=s)=\frac{4}{45}(s-1)(s+2)(s^2+s-1)$. We also find that in the asymptotic limit, the conditional expectation value of the number of distinct sites visited by an RW that first returns to the origin at time $t=2n$ is ${\mathbb E}[S|T_{FR}=2n] \simeq \sqrt{\pi n}$, and the variance is $Var(S|T_{FR}=2n) \simeq \pi\left(\frac{\pi}{3}-1\right)n$. These results go beyond the important recent results of Klinger et al. [{\it Phys. Rev. E} {\bf 105}, 034116 (2022)], who derived a closed form expression for the generating function of the joint distribution, but did not go further to extract an explicit expression for the joint distribution itself. The joint distribution provides useful insight on the efficiency of random search processes, in which the aim is to cover as many sites as possible in a given number of steps., Comment: 27 pages, 9 figures

When human operators of cyber-physical systems encounter surprising behavior, they often consider multiple hypotheses that might explain it. In some cases, taking information-gathering actions such as additional measurements or control inputs given to the system can help resolve uncertainty and determine the most accurate hypothesis. The task of optimizing these actions can be formulated as a belief-space Markov decision process that we call a hypothesis-driven belief MDP. Unfortunately, this problem suffers from the curse of history similar to a partially observable Markov decision process (POMDP). To plan in continuous domains, an agent needs to reason over countlessly many possible action-observation histories, each resulting in a different belief over the unknown state. The problem is exacerbated in the hypothesis-driven context because each action-observation pair spawns a different belief for each hypothesis, leading to additional branching. This paper considers the case in which each hypothesis corresponds to a different dynamic model in an underlying POMDP. We present a new belief MDP formulation that: (i) enables reasoning over multiple hypotheses, (ii) balances the goals of determining the (most likely) correct hypothesis and performing well in the underlying POMDP, and (iii) can be solved with sparse tree search., Comment: 8 pages, 4 figures, submitted to AAMAS 2025

This paper introduces WARLearn, a novel framework designed for adaptive representation learning in challenging and adversarial weather conditions. Leveraging the in-variance principal used in Barlow Twins, we demonstrate the capability to port the existing models initially trained on clear weather data to effectively handle adverse weather conditions. With minimal additional training, our method exhibits remarkable performance gains in scenarios characterized by fog and low-light conditions. This adaptive framework extends its applicability beyond adverse weather settings, offering a versatile solution for domains exhibiting variations in data distributions. Furthermore, WARLearn is invaluable in scenarios where data distributions undergo significant shifts over time, enabling models to remain updated and accurate. Our experimental findings reveal a remarkable performance, with a mean average precision (mAP) of 52.6% on unseen real-world foggy dataset (RTTS). Similarly, in low light conditions, our framework achieves a mAP of 55.7% on unseen real-world low light dataset (ExDark). Notably, WARLearn surpasses the performance of state-of-the-art frameworks including FeatEnHancer, Image Adaptive YOLO, DENet, C2PNet, PairLIE and ZeroDCE, by a substantial margin in adverse weather, improving the baseline performance in both foggy and low light conditions. The WARLearn code is available at https://github.com/ShubhamAgarwal12/WARLearn, Comment: Accepted for publication in IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), 2025

We study automatic synthesis of systems that interact with their environment and maintain privacy against an observer to the interaction. The system and the environment interact via sets $I$ and $O$ of input and output signals. The input to the synthesis problem contains, in addition to a specification, also a list of secrets, a function $cost: I\cup O\rightarrow\mathbb{N}$, which maps each signal to the cost of hiding it, and a bound $b\in\mathbb{N}$ on the budget that the system may use for hiding of signals. The desired output is an $(I/O)$-transducer $T$ and a set $H\subseteq I\cup O$ of signals that respects the bound on the budget, thus $\sum_{s\in H} cost(s)\leq b$, such that for every possible interaction of $T$, the generated computation satisfies the specification, yet an observer, from whom the signals in $H$ are hidden, cannot evaluate the secrets. We first show that the problem's complexity is 2EXPTIME-complete for specifications and secrets in LTL, making it no harder than synthesis without privacy requirements. We then analyze the complexity further, isolating the two aspects that do not exist in traditional synthesis: the need to hide secret values and the need to choose the set $H$. We do this by studying settings in which traditional synthesis is solvable in polynomial time -- when the specification formalism is deterministic automata and when the system is closed -- and show that each of these aspects adds an exponential blow-up in complexity. We continue and study bounded synthesis with privacy, where the input includes a bound on the synthesized transducer size, as well as a variant of the problem in which the observer has knowledge, either about the specification or about the system, which can be helpful in evaluating the secrets. Additionally, we study certified privacy, where the synthesis algorithm provides certification that the secrets remain hidden.

An $(\alpha,\beta)$-spanner of a weighted graph $G=(V,E)$, is a subgraph $H$ such that for every $u,v\in V$, $d_G(u,v) \le d_H(u,v)\le\alpha\cdot d_G(u,v)+\beta$. The main parameters of interest for spanners are their size (number of edges) and their lightness (the ratio between the total weight of $H$ to the weight of a minimum spanning tree). In this paper we focus on near-additive spanners, where $\alpha=1+\varepsilon$ for arbitrarily small $\varepsilon>0$. We show the first construction of {\em light} spanners in this setting. Specifically, for any integer parameter $k\ge 1$, we obtain an $(1+\varepsilon,O(k/\varepsilon)^k\cdot W(\cdot,\cdot))$-spanner with lightness $\tilde{O}(n^{1/k})$ (where $W(\cdot,\cdot)$ indicates for every pair $u, v \in V$ the heaviest edge in some shortest path between $u,v$). In addition, we can also bound the number of edges in our spanner by $O(kn^{1+3/k})$., Comment: Appeared in WG24

Wire bending is a technique used in manufacturing to mass-produce items such as clips, mounts, and braces. Wire bending machines like the DIWire by Pensalabs have made this process accessible for personal fabrication. However, such machines are controlled using Computer Aided Manufacturing (CAM) software which is hard to use, making custom design challenging. We present Y-AR, a Computer Aided Design (CAD) interface for 3D wire bending. Y-AR uses mixed reality to let designers create structures that physically connect to objects in the environment. The interface incorporates springs as design primitives which (1) apply forces to hold objects, and (2) counter-act dimensional inaccuracies inherently caused by mid air modeling and measurement errors in AR. We demonstrate design workflows to design and fabricate a range of mechanisms designed in Y-AR as well as structures made using free-hand design tools. In our usability evaluation, all 12 participants successfully designed and fabricated a functional bottle holder with Y-AR. 10 out of 12 participants felt that the system aided their design process, rating it above 7 out of 10.

Model checking is an automatic formal verification technique that is widely used in hardware verification. The state-of-the-art complete model-checking techniques, based on IC3/PDR and its general variant CAR, are based on computing symbolically sets of under - and over-approximating state sets (called frames) with multiple calls to a SAT solver. The performance of those techniques is sensitive to the order of the assumptions with which the SAT solver is invoked, because it affects the unsatisfiable cores - which the solver emits when the formula is unsatisfiable - that crucially affect the search process. This observation was previously published in [15], where two partial assumption ordering strategies, intersection and rotation were suggested (partial in the sense that they determine the order of only a subset of the literals). In this paper we extend and improve these strategies based on an analysis of the reason for their effectiveness. We prove that intersection is effective because of what we call locality of the cores, and our improved strategy is based on this observation. We conclude our paper with an extensive empirical evaluation of the various ordering techniques. One of our strategies, Hybrid-CAR, which switches between strategies at runtime, not only outperforms other, fixed ordering strategies, but also outperforms other state-of-the-art bug-finding algorithms such as ABC-BMC.

Time-dependent Wannier functions were initially proposed as a means for calculating the polarization current in crystals driven by external fields. In this work, we present a simple gauge where Wannier states are defined based on the maximally localized functions at the initial time, and are propagated using the time-dependent Bloch states obtained from established first-principles calculations, avoiding the costly Wannierization at ech time step. We show that this basis efficiently describes the time-dependent polarization of the laser driven system through the analysis of the motion of Wannier centers. We use this technique to analyze highly nonlinear and non-perturbative responses such as high harmonic generation in solids, using the hexagonal boron nitride as an illustrative example, and we show how it provides an intuitive picture for the physical mechanisms.

Summarization is one of the most common tasks performed by large language models (LLMs), especially in applications like Retrieval-Augmented Generation (RAG). However, existing evaluations of hallucinations in LLM-generated summaries, and evaluations of hallucination detection models both suffer from a lack of diversity and recency in the LLM and LLM families considered. This paper introduces FaithBench, a summarization hallucination benchmark comprising challenging hallucinations made by 10 modern LLMs from 8 different families, with ground truth annotations by human experts. ``Challenging'' here means summaries on which popular, state-of-the-art hallucination detection models, including GPT-4o-as-a-judge, disagreed on. Our results show GPT-4o and GPT-3.5-Turbo produce the least hallucinations. However, even the best hallucination detection models have near 50\% accuracies on FaithBench, indicating lots of room for future improvement. The repo is https://github.com/vectara/FaithBench

Gravitational lensing magnification of Type Ia supernovae (SNe Ia) allows information to be obtained about the distribution of matter on small scales. In this paper, we derive limits on the fraction $\alpha$ of the total matter density in compact objects (which comprise stars, stellar remnants, small stellar groupings and primordial black holes) of mass $M > 0.03 M_{\odot}$ over cosmological distances. Using 1,532 SNe Ia from the Dark Energy Survey Year 5 sample (DES-SN5YR) combined with a Bayesian prior for the absolute magnitude $M$, we obtain $\alpha < 0.12$ at the 95\% confidence level after marginalisation over cosmological parameters, lensing due to large-scale structure, and intrinsic non-Gaussianity. Similar results are obtained using priors from the cosmic microwave background, baryon acoustic oscillations and galaxy weak lensing, indicating our results do not depend on the background cosmology. We argue our constraints are likely to be conservative (in the sense of the values we quote being higher than the truth), but discuss scenarios in which they could be weakened by systematics of the order of $\Delta \alpha \sim 0.04$, Comment: Accepted by MNRAS

Simulations of the dark matter distribution throughout the Universe are essential in order to analyse data from cosmological surveys. $N$-body simulations are computationally expensive, and many cheaper alternatives (such as lognormal random fields) fail to reproduce accurate statistics of the smaller, non-linear scales. In this work, we present Psi-GAN (Power-spectrum-informed generative adversarial network), a machine learning model which takes a two-dimensional lognormal dark matter density field and transforms it into a more realistic field. We construct Psi-GAN so that it is continuously conditional, and can therefore generate realistic realisations of the dark matter density field across a range of cosmologies and redshifts in $z \in [0, 3]$. We train Psi-GAN as a generative adversarial network on $2\,000$ simulation boxes from the Quijote simulation suite. We use a novel critic architecture that utilises the power spectrum as the basis for discrimination between real and generated samples. Psi-GAN shows agreement with $N$-body simulations over a range of redshifts and cosmologies, consistently outperforming the lognormal approximation on all tests of non-linear structure, such as being able to reproduce both the power spectrum up to wavenumbers of $1~h~\mathrm{Mpc}^{-1}$, and the bispectra of target $N$-body simulations to within ${\sim}5$ per cent. Our improved ability to model non-linear structure should allow more robust constraints on cosmological parameters when used in techniques such as simulation-based inference., Comment: 20 pages, 11 figures, 3 tables, 1 appendix. Submitted for publication by Monthly Notices of the Royal Astronomical Society

Field level statistics, such as the minimum spanning tree (MST), have been shown to be a promising tool for parameter inference in cosmology. However, applications to real galaxy surveys are challenging, due to the presence of small scale systematic effects and non-trivial survey selection functions. Since many field level statistics are 'hard-wired', the common practice is to forward model survey systematic effects to synthetic galaxy catalogues. However, this can be computationally demanding and produces results that are a product of cosmology and systematic effects, making it difficult to directly compare results from different experiments. We introduce a method for inverting survey systematic effects through a Monte Carlo subsampling technique where galaxies are assigned probabilities based on their galaxy weight and survey selection functions. Small scale systematic effects are mitigated through the addition of a point-process smoothing technique called jittering. The inversion technique removes the requirement for a computational and labour intensive forward modelling pipeline for parameter inference. We demonstrate that jittering can mask small scale theoretical uncertainties and survey systematic effects like fibre collisions and we show that Monte Carlo subsampling can remove the effects of survey selection functions. We outline how to measure field level statistics from future surveys., Comment: 15 pages, 11 figures, submitted to the Royal Astronomical Society Techniques & Instruments journal

Evaluation of policies in recommender systems typically involves A/B testing using live experiments on real users to assess a new policy's impact on relevant metrics. This ``gold standard'' comes at a high cost, however, in terms of cycle time, user cost, and potential user retention. In developing policies for ``onboarding'' new users, these costs can be especially problematic, since on-boarding occurs only once. In this work, we describe a simulation methodology used to augment (and reduce) the use of live experiments. We illustrate its deployment for the evaluation of ``preference elicitation'' algorithms used to onboard new users of the YouTube Music platform. By developing counterfactually robust user behavior models, and a simulation service that couples such models with production infrastructure, we are able to test new algorithms in a way that reliably predicts their performance on key metrics when deployed live. We describe our domain, our simulation models and platform, results of experiments and deployment, and suggest future steps needed to further realistic simulation as a powerful complement to live experiments.

High-harmonic generation (HHG) is a nonlinear process in which a material sample is irradiated by intense laser pulses, causing the emission of high harmonics of the incident light. HHG has historically been explained by theories employing a classical electromagnetic field, successfully capturing its spectral and temporal characteristics. However, recent research indicates that quantum-optical effects naturally exist, or can be artificially induced, in HHG. Even though the fundamental equations of motion for quantum electrodynamics (QED) are well-known, a unifying framework for solving them to explore HHG is missing. So far, numerical solutions employed a wide range of basis-sets and untested approximations. Based on methods originally developed for cavity polaritonics, here we formulate a numerically accurate QED model consisting of a single active electron and a single quantized photon mode. Our framework can in principle be extended to higher electronic dimensions and multiple photon modes to be employed in ab initio codes. We employ it as a model of an atom interacting with a photon mode and predict a characteristic minimum structure in the HHG yield vs. phase-squeezing. We find that this phenomenon, which can be used for novel ultrafast quantum spectroscopies, is partially captured by a multi-trajectory Ehrenfest dynamics approach, with the exact minima position sensitive to the level of theory. On the one hand, this motivates using multi-trajectory approaches as an alternative for costly exact calculations. On the other hand, it suggests an inherent limitation of the multi-trajectory formalism, indicating the presence of entanglement. Our work creates a road-map for a universal formalism of QED-HHG that can be employed for benchmarking approximate theories, predicting novel phenomena for advancing quantum applications, and for the measurements of entanglement and entropy., Comment: 10 pages, 7 figures

In this study, we developed an Evidence-based Ensemble Neural Network, namely EVENet, for anatomical brain parcellation using diffusion MRI. The key innovation of EVENet is the design of an evidential deep learning framework to quantify predictive uncertainty at each voxel during a single inference. Using EVENet, we obtained accurate parcellation and uncertainty estimates across different datasets from healthy and clinical populations and with different imaging acquisitions. The overall network includes five parallel subnetworks, where each is dedicated to learning the FreeSurfer parcellation for a certain diffusion MRI parameter. An evidence-based ensemble methodology is then proposed to fuse the individual outputs. We perform experimental evaluations on large-scale datasets from multiple imaging sources, including high-quality diffusion MRI data from healthy adults and clinically diffusion MRI data from participants with various brain diseases (schizophrenia, bipolar disorder, attention-deficit/hyperactivity disorder, Parkinson's disease, cerebral small vessel disease, and neurosurgical patients with brain tumors). Compared to several state-of-the-art methods, our experimental results demonstrate highly improved parcellation accuracy across the multiple testing datasets despite the differences in dMRI acquisition protocols and health conditions. Furthermore, thanks to the uncertainty estimation, our EVENet approach demonstrates a good ability to detect abnormal brain regions in patients with lesions, enhancing the interpretability and reliability of the segmentation results., Comment: 15 pages, 5 figures

The cores of stars are the cosmic furnaces where light elements are fused into heavier nuclei. The fusion of hydrogen to helium initially powers all stars. The ashes of the fusion reactions are then predicted to serve as fuel in a series of stages, eventually transforming massive stars into a structure of concentric shells. These are composed of natal hydrogen on the outside, and consecutively heavier compositions inside, predicted to be dominated by helium, carbon/oxygen, oxygen/neon/magnesium, and oxygen/silicon/sulphur. Silicon and sulphur are fused into inert iron, leading to the collapse of the core and either a supernova explosion or the direct formation of a black hole. Stripped stars, where the outer hydrogen layer has been removed and the internal He-rich layer (in Wolf-Rayet WN stars) or even the C/O layer below it (in Wolf-Rayet WC/WO stars) are exposed, provide evidence for this shell structure, and the cosmic element production mechanism it reflects. The types of supernova explosions that arise from stripped stars embedded in shells of circumstellar material (most notably Type Ibn supernovae from stars with outer He layers, and Type Icn supernovae from stars with outer C/O layers) confirm this scenario. However, direct evidence for the most interior shells, which are responsible for the production of elements heavier than oxygen, is lacking. Here, we report the discovery of the first-of-its-kind supernova arising from a star peculiarly stripped all the way to the silicon and sulphur-rich internal layer. Whereas the concentric shell structure of massive stars is not under debate, it is the first time that such a thick, massive silicon and sulphur-rich shell, expelled by the progenitor shortly before the SN explosion, has been directly revealed., Comment: 48 pages, 12 figures and 10 tables. Submitted to a high-impact journal. The reduced spectra and photometry will be made available via the journal webpage and the WISeREP archive after the acceptance of the paper

Accurate classification of weather conditions in images is essential for enhancing the performance of object detection and classification models under varying weather conditions. This paper presents a comprehensive study on classifying weather conditions in images into four categories: rainy, low light, haze, and clear. The motivation for this work stems from the need to improve the reliability and efficiency of automated systems, such as autonomous vehicles and surveillance, which must operate under diverse weather conditions. Misclassification of weather conditions can lead to significant performance degradation in these systems, making robust weather classification crucial. Utilizing the Support Vector Machine (SVM) algorithm, our approach leverages a robust set of features, including brightness, saturation, noise level, blur metric, edge strength, motion blur, Local Binary Patterns (LBP) mean and variance for radii 1, 2, and 3, edges mean and variance, and color histogram mean and variance for blue, green, and red channels. Our SVM-based method achieved a notable accuracy of 92.8%, surpassing typical benchmarks in the literature, which range from 80% to 90% for classical machine learning methods. While deep learning methods can achieve up to 94% accuracy, our approach offers a competitive advantage in terms of computational efficiency and real-time classification capabilities. Detailed analysis of each feature's contribution highlights the effectiveness of texture, color, and edge-related features in capturing the unique characteristics of different weather conditions. This research advances the state-of-the-art in weather image classification and provides insights into the critical features necessary for accurate weather condition differentiation, underscoring the potential of SVMs in practical applications where accuracy is paramount.

Let $(A_v)_{v\in \mathcal{T}}$ be the balanced Gaussian Branching Random Walk on a $d$-ary tree $\mathcal{T}$ and let $M^A$ be the multiplicative chaos with parameter $\gamma \in (0, \sqrt{2\log d})$ constructed from $A$. In this work we establish the precise first order asymptotics of negative exponential moment of $M^A$, i.e.\ we prove that for $t_k = \lambda p_\gamma^k$ with $\lambda>0$ and $p_\gamma$ an explicit constant depending only on $\gamma$, we have as $k \to \infty$, \begin{equation} -\frac{1}{d^k} \log \mathbb{E}[e^{-\lambda p_\gamma^k M^A } ] \to h(\lambda), \end{equation} where $h\colon (0,\infty)\to \mathbb{R}$ is a non-explicit positive continuous function. This result allows us to study the law of $A$ tilted by $e^{-t_k M^A}$ for particular values of $\lambda$, with $k\to \infty$. In this setting we prove that the normalized $L^1$ norm of $A$ in generation $k-a$ is bounded and converges to $0$ when first $k\to \infty$ and then $a\to 0$. As an application we prove that in this setting, under the tilt $e^{-t_k M^A}$ and with $k\to \infty$, the Branching Random Walk $A$ exhibits a weak decay of correlation, which is not present in the non-tilted model. Our methods also apply to the usual Branching Random Walk $(S_v)_{v\in \mathcal{T}}$ and with $M^A$ replaced by $\frac{1}{2}(M^+ + M^- )$, where $M^+$ and $M^-$ are the multiplicative chaoses with parameter $\gamma \in (0, \sqrt{2\log d})$ constructed from $S$ and $-S$. In that case we prove that, as $k\to \infty$, \begin{equation} -\frac{1}{d^k} \log \mathbb{E}[e^{- \frac{\lambda p_\gamma^k}{2}( M^+ + M^-) }] \to \tilde h(\lambda), \end{equation} where $\tilde h\colon (0,\infty)\to \mathbb{R}$ is again a non-explicit positive continuous function., Comment: 38 pages, 2 figures

We present the updated design of HighSpec, a high-resolution $\mathcal{R} \sim 20,000$ spectrograph designed for the Multi Aperture Spectroscopic Telescope (MAST). HighSpec offers three observing modes centered at the Ca II H&K, Mg b triplet, and H$\alpha$ lines. Each mode is supported by a highly optimized ion-etched grating, contributing to an exceptional instrument peak efficiency of $\gtrsim85\%$ for the two latter bands ($\gtrsim55\%$ for the Ca II H&K band). Optimizing throughput over wavelength coverage ($\Delta \lambda=10-17$ nm), HighSpec enables the precise measurement of spectral lines from faint targets. This approach is especially relevant for stellar object studies, specifically of WDs, which are intrinsically faint and have few spectroscopic lines. Each observing mode was tailored to target spectral features essential for WD research. Its integration with MAST, an array of 20 custom-designed telescopes that can function as a single large telescope (equivalent to a $2.7$ m telescope in collecting area) or multiplexing over the entire sky, provides unique adaptability for extensive and effective spectroscopic campaigns. Currently in its final assembly and testing stages, HighSpec's on-sky commissioning is scheduled for 2025., Comment: SPIE Conference "Space Telescopes and Instrumentation 2024: Ground-based and Airborne Instrumentation for Astronomy X", Yokahama, Japan

Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $\Lambda$ = 2.14 $\pm$ 0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% $\pm$ 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of 2.4 $\pm$ 0.3. We maintain below-threshold performance when decoding in real time, achieving an average decoder latency of 63 $\mu$s at distance-5 up to a million cycles, with a cycle time of 1.1 $\mu$s. To probe the limits of our error-correction performance, we run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 3 $\times$ 10$^9$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms., Comment: 10 pages, 4 figures, Supplementary Information

We introduce Josephson junction and inductor models in Keysight ADS that feature an auxiliary flux port, and facilitate the expression of flux quantization conditions in simulation of superconducting microwave circuits. We present several examples that illustrate our methodology for constructing flux-quantizing circuits, including dc- and rf-SQUIDs, tunable couplers, and parametric amplifiers using SNAIL and rf-SQUID arrays. We perform DC, S-parameter, and harmonic balance simulations to validate our models and methods against theory and published experimental results., Comment: 11 pages, 14 figures

Topological insulators offer unique opportunities for novel electronics and quantum phenomena. However, intrinsic material limitations often restrict their applications and practical implementation. Over a decade ago it was predicted that a time-periodic perturbation can generate out-of-equilibrium states known as Floquet topological insulators (FTIs), hosting topologically protected transport and anomalous Hall physics, and opening routes to optically tunable bandstructures and devices compatible with petahertz electronics. Although such states have not yet been directly observed, indirect signatures such as the light-induced anomalous Hall effect were recently measured. Thus far, much remained experimentally unclear and fundamentally unknown about solid-state FTI and whether they can be employed for electronics. Here we demonstrate coherent control of photocurrents in light-dressed graphene. Circularly-polarized laser pulses dress the graphene band structure to obtain an FTI, and phase-locked second harmonic pulses drive electrons in the FTI. This approach allows us to measure resulting all-optical anomalous Hall photocurrents, FTI-valley-polarized currents, and photocurrent circular dichroism, all phenomena that put FTIs on equal footing with equilibrium topological insulators. We further present an intuitive description for the sub-optical-cycle light-matter interaction, revealing dynamical symmetry selection rules for photocurrents. All measurements are supported by strong agreement with ab-initio and analytic theory. Remarkably, the photocurrents show a strong sub-cycle phase-sensitivity that can be employed for ultrafast control in topotronics and spectroscopy. Our work connects Floquet and topological physics with attoscience and valleytronics, and goes beyond band structure engineering by initiating lightwave-driven dynamics in FTI states., Comment: 14 pages, 8 figures

It is a fundamental behavior that different individuals see the world in a largely similar manner. This is an essential basis for humans' ability to cooperate and communicate. However, what are the neuronal properties that underlie these inter-subject commonalities of our visual world? Finding out what aspects of neuronal coding remain invariant across individuals' brains will shed light not only on this fundamental question but will also point to the neuronal coding scheme as the basis of visual perception. Here, we address this question by obtaining intracranial recordings from three cohorts of patients taking part in a different visual recognition task (overall 19 patients and 244 high-order visual contacts included in the analyses) and examining the neuronal coding scheme most consistent across individuals' visual cortex. Our results highlight relational coding - expressed by the set of similarity distances between profiles of pattern activations - as the most consistent representation across individuals. Alternative coding schemes, such as population vector coding or linear coding, failed to achieve similar inter-subject consistency. Our results thus support relational coding as the central neuronal code underlying individuals' shared perceptual content in the human brain.

ULTRASAT (ULtra-violet TRansient Astronomy SATellite) is a wide-angle space telescope that will perform a deep time-resolved all-sky survey in the near-ultraviolet (NUV) spectrum. The science objectives are the detection of counterparts to short-lived transient astronomical events such as gravitational wave sources and supernovae. The mission is led by the Weizmann Institute of Science and is planned for launch in 2026 in collaboration with the Israeli Space Agency and NASA. DESY will provide the UV camera, composed by the detector assembly located in the telescope focal plane and the remote electronics unit. The camera is composed out of four back-metallized CMOS Image Sensors (CIS) manufactured in the 4T, dual gain Tower process. As part of the radiation qualification of the camera, Single Event Effect (SEE) testing has been performed by irradiating the sensor with heavy ions at the RADEF, Jyvaskyla facility. Preliminary results of both Single Event Upset (SEU) and Single Event Latch-up (SEL) occurrence rate in the sensor are presented. Additionally, an in-orbit SEE rate simulation has been performed in order to gain preliminary knowledge about the expected effect of SEE on the mission.