Abstract: The dark matter sector remains completely unknown. It is therefore crucial to keep an open mind regarding its nature and possible interactions. Focusing on the case of Weakly Interacting Massive Particles, in this work we make this general philosophy more concrete by applying modern machine learning techniques to dark matter direct detection. We do this by encoding and decoding the graphical representation of background events in the XENONnT experiment with a convolutional variational autoencoder. We describe a methodology that utilizes the `anomaly score' derived from the reconstruction loss of the convolutional variational autoencoder as well as a pre-trained standard convolutional neural network, in a semi-supervised fashion. Indeed, we observe that optimum results are obtained only when both unsupervised and supervised anomaly scores are considered together. A data set that has a higher proportion of anomaly score is deemed anomalous and deserves further investigation. Contrary to classical analyses, in principle all information about the events is used, preventing unnecessary information loss. Lastly, we demonstrate the reach of learning-focused anomaly detection in this context by comparing results with classical inference, observing that, if tuned properly, these techniques have the potential to outperform likelihood-based methods.

Abstract: We study the impact of large lepton flavor asymmetries on the cosmic QCD transition. Scenarios of unequal lepton flavor asymmetries are observationally almost unconstrained and therefore open up a whole new parameter space for the cosmic QCD transition. We find that for large asymmetries, the formation of a Bose-Einstein condensate of pions can occur and identify the corresponding parameter space. In the vicinity of the QCD transition scale, we express the pressure in terms of a Taylor expansion with respect to the complete set of chemical potentials. The Taylor coefficients rely on input from lattice QCD calculations from the literature. The domain of applicability of this method is discussed.

Abstract: Picking arrival times of P and S phases is a fundamental and time‐consuming task for the routine processing of seismic data acquired by permanent and temporary networks. A large number of automatic pickers have been developed, but to perform well they often require the tuning of multiple parameters to adapt them to each dataset. Despite the great advance in techniques, some problems remain, such as the difficulty to accurately pick S waves and earthquake recordings with a low signal‐to‐noise ratio. Recently, phase pickers based on deep learning (DL) have shown great potential for event identification and arrival‐time picking. However, the general adoption of these methods for the routine processing of monitoring networks has been held back by factors such as the availability of well‐documented software, computational resources, and a gap in knowledge of these methods. In this study, we evaluate recent available DL pickers for earthquake data, comparing the performance of several neural network architectures. We test the selected pickers using three datasets with different characteristics. We found that the analyzed DL pickers (generalized phase detection, PhaseNet, and EQTransformer) perform well in the three tested cases. They are very efficient at ignoring large‐amplitude transient noise and at picking S waves, a task that is often difficult even for experienced analysts. Nevertheless, the performance of the analyzed DL pickers varies widely in terms of sensitivity and false discovery rate, with some pickers missing a significant percentage of true picks and others producing a large number of false positives. There are also variations in run time between DL pickers, with some of them requiring significant resources to process large datasets. In spite of these drawbacks, we show that DL pickers can be used efficiently to process large seismic datasets and obtain results comparable or better than current standard procedures.

Abstract: This paper presents the main features of a new and updated version of the program PArthENoPE, which the community has been using for many years for computing the abundances of light elements produced during Big Bang Nucleosynthesis. This is the third release of the PArthENoPE code, after the 2008 and the 2018 ones, and will be distributed from the code's website, http://parthenope.na.infn.it. Apart from minor changes, the main improvements in this new version include a revisited implementation of the nuclear rates for the most important reactions of deuterium destruction, H-2(p,gamma) He-3, H-2(d, n)He-3 and H-2(d, p)H-3, and a re-designed GUI, which extends the functionality of the previous one. The new GUI, in particular, supersedes the previous tools for running over grids of parameters with a better management of parallel runs, and it offers a brand-new set of functions for plotting the results. Program summary Program title: PArthENoPE 3.0 CPC Library link to program files: https://doi.org/10.17632/wygr7d8yt9.2 Developer's repository link: http://parthenope.na.infn.it Licensing provisions: GPLv3 Programming language: Fortran 77 and Python Nature of problem: Computation of yields of light elements synthesized in the primordial universe Solution method: Livermore Solver for Ordinary Differential Equations (LSODE) for stiff and nonstiff systems, Python GUI for running and plotting Journal reference of previous version: Comput. Phys. Commun. 233 (2018) 237-242 Does the new version supersede the previous version?: Yes Reasons for the new version: Update of the physics and improvements in the GUI Summary of revisions: Update of the physics implemented in the Fortran code and improvements in the GUI functionalities, in particular new plotting functions.

Abstract: During LHC Run 2 (2015-2018) the ATLAS Level-1 topological trigger allowed efficient data-taking by the ATLAS experiment at luminosities up to 2.1 x10(34) cm(-2) s(-1), which exceeds the design value by a factor of two. The system was installed in 2016 and operated in 2017 and 2018. It uses Field Programmable Gate Array processors to select interesting events by placing kinematic and angular requirements on electromagnetic clusters, jets, tau-leptons, muons and the missing transverse energy. It allowed to significantly improve the background event rejection and signal event acceptance, in particular for Higgs and B-physics processes.