Search

This document is comprised of a collection of updated preliminary parameters for the key parts of the muon collider. The updated preliminary parameters follow on from the October 2023 Tentative Parameters Report. Particular attention has been given to regions of the facility that are believed to hold greater technical uncertainty in their design and that have a strong impact on the cost and power consumption of the facility. The data is collected from a collaborative spreadsheet and transferred to overleaf.

Quantum detailed balance is formulated in terms of elementary transitions, in close analogy to detailed balance in a classical Markov chain on a finite set of points. An elementary transition is taken to be a pure state of two copies of the quantum system, as a quantum analogue of an ordered pair of classical points representing a classical transition from the first to the second point. This form of quantum detailed balance is shown to be equivalent to standard quantum detailed balance with respect to a reversing operation, thus providing a new conceptual foundation for the latter. Aspects of parity in quantum detailed balance are clarified in the process., Comment: 34 pages

We present the results of Phase I of an ongoing review of Monte Carlo tools relevant for low-energy hadronic cross sections. This includes a detailed comparison of Monte Carlo codes for electron-positron scattering into a muon pair, pion pair, and electron pair, for scan and radiative-return experiments. After discussing the various approaches that are used and effects that are included, we show differential cross sections obtained with AfkQed, BabaYaga@NLO, KKMC, MCGPJ, McMule, Phokhara, and Sherpa, for scenarios that are inspired by experiments providing input for the dispersive evaluation of the hadronic vacuum polarisation., Comment: RadioMonteCarLow 2 Working Group report Phase I, 67 pages, 34 figures

We consider the problem of testing whether an unknown and arbitrary set $S \subseteq \mathbb{R}^n$ (given as a black-box membership oracle) is convex, versus $\varepsilon$-far from every convex set, under the standard Gaussian distribution. The current state-of-the-art testing algorithms for this problem make $2^{\tilde{O}(\sqrt{n})\cdot \mathrm{poly}(1/\varepsilon)}$ non-adaptive queries, both for the standard testing problem and for tolerant testing. We give the first lower bounds for convexity testing in the black-box query model: - We show that any one-sided tester (which may be adaptive) must use at least $n^{\Omega(1)}$ queries in order to test to some constant accuracy $\varepsilon>0$. - We show that any non-adaptive tolerant tester (which may make two-sided errors) must use at least $2^{\Omega(n^{1/4})}$ queries to distinguish sets that are $\varepsilon_1$-close to convex versus $\varepsilon_2$-far from convex, for some absolute constants $0<\varepsilon_1<\varepsilon_2$. Finally, we also show that for any constant $c>0$, any non-adaptive tester (which may make two-sided errors) must use at least $n^{1/4 - c}$ queries in order to test to some constant accuracy $\varepsilon>0$., Comment: 52 pages, to appear in SODA 2025

Model-Driven Engineering (MDE) has seen significant advancements with the integration of Machine Learning (ML) and Deep Learning (DL) techniques. Building upon the groundwork of previous investigations, our study provides a concise overview of current Language Large Models (LLMs) applications in MDE, emphasizing their role in automating tasks like model repository classification and developing advanced recommender systems. The paper also outlines the technical considerations for seamlessly integrating LLMs in MDE, offering a practical guide for researchers and practitioners. Looking forward, the paper proposes a focused research agenda for the future interplay of LLMs and MDE, identifying key challenges and opportunities. This concise roadmap envisions the deployment of LLM techniques to enhance the management, exploration, and evolution of modeling ecosystems. By offering a compact exploration of LLMs in MDE, this paper contributes to the ongoing evolution of MDE practices, providing a forward-looking perspective on the transformative role of Language Large Models in software engineering and model-driven practices., Comment: A paper submitted to the Software Systems and Modeling Journal (Springer), and it has undergone the second revision

Virtual screening applications are highly parameterized to optimize the balance between quality and execution performance. While output quality is critical, the entire screening process must be completed within a reasonable time. In fact, a slight reduction in output accuracy may be acceptable when dealing with large datasets. Finding the optimal quality-throughput trade-off depends on the specific HPC system used and should be re-evaluated with each new deployment or significant code update. This paper presents two parallel autotuning techniques for constrained optimization in distributed High-Performance Computing (HPC) environments. These techniques extend sequential Bayesian Optimization (BO) with two parallel asynchronous approaches, and they integrate predictions from Machine Learning (ML) models to help comply with constraints. Our target application is LiGen, a real-world virtual screening software for drug discovery. The proposed methods address two relevant challenges: efficient exploration of the parameter space and performance measurement using domain-specific metrics and procedures. We conduct an experimental campaign comparing the two methods with a popular state-of-the-art autotuner. Results show that our methods find configurations that are, on average, up to 35-42% better than the ones found by the autotuner and the default expert-picked LiGen configuration., Comment: Submitted to the Journal of Parallel and Distributed Computing

The collaboration between humans and robots re-quires a paradigm shift not only in robot perception, reasoning, and action, but also in the design of the robotic cell. This paper proposes an optimization framework for designing collaborative robotics cells using a digital twin during the pre-deployment phase. This approach mitigates the limitations of experience-based sub-optimal designs by means of Bayesian optimization to find the optimal layout after a certain number of iterations. By integrating production KPIs into a black-box optimization frame-work, the digital twin supports data-driven decision-making, reduces the need for costly prototypes, and ensures continuous improvement thanks to the learning nature of the algorithm. The paper presents a case study with preliminary results that show how this methodology can be applied to obtain safer, more efficient, and adaptable human-robot collaborative environments.

The standard model of Boolean function property testing is not well suited for testing $\textit{sparse}$ functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the constant-0 function. In this work we propose and investigate a new model for property testing of Boolean functions, called $\textit{relative-error testing}$, which provides a natural framework for testing sparse functions. This new model defines the distance between two functions $f, g: \{0,1\}^n \to \{0,1\}$ to be $$\textsf{reldist}(f,g) := { \frac{|f^{-1}(1) \triangle g^{-1}(1)|} {|f^{-1}(1)|}}.$$ This is a more demanding distance measure than the usual Hamming distance ${ {|f^{-1}(1) \triangle g^{-1}(1)|}/{2^n}}$ when $|f^{-1}(1)| \ll 2^n$; to compensate for this, algorithms in the new model have access both to a black-box oracle for the function $f$ being tested and to a source of independent uniform satisfying assignments of $f$. In this paper we first give a few general results about the relative-error testing model; then, as our main technical contribution, we give a detailed study of algorithms and lower bounds for relative-error testing of $\textit{monotone}$ Boolean functions. We give upper and lower bounds which are parameterized by $N=|f^{-1}(1)|$, the sparsity of the function $f$ being tested. Our results show that there are interesting differences between relative-error monotonicity testing of sparse Boolean functions, and monotonicity testing in the standard model. These results motivate further study of the testability of Boolean function properties in the relative-error model.

With the increasing size of HPC computations, faults are becoming more and more relevant in the HPC field. The MPI standard does not define the application behaviour after a fault, leaving the burden of fault management to the user, who usually resorts to checkpoint and restart mechanisms. This trend is especially true in stencil applications, as their regular pattern simplifies the selection of checkpoint locations. However, checkpoint and restart mechanisms introduce non-negligible overhead, disk load, and scalability concerns. In this paper, we show an alternative through fault resilience, enabled by the features provided by the User Level Fault Mitigation extension and shipped within the Legio fault resilience framework. Through fault resilience, we continue executing only the non-failed processes, thus sacrificing result accuracy for faster fault recovery. Our experiments on a specimen stencil application show that, despite the fault impact visible in the result, we produced meaningful values usable for scientific research, proving the possibilities of a fault resilience approach in a stencil scenario.

The first very long baseline interferometry (VLBI) detections at 870$\mu$m wavelength (345$\,$GHz frequency) are reported, achieving the highest diffraction-limited angular resolution yet obtained from the surface of the Earth, and the highest-frequency example of the VLBI technique to date. These include strong detections for multiple sources observed on inter-continental baselines between telescopes in Chile, Hawaii, and Spain, obtained during observations in October 2018. The longest-baseline detections approach 11$\,$G$\lambda$ corresponding to an angular resolution, or fringe spacing, of 19$\mu$as. The Allan deviation of the visibility phase at 870$\mu$m is comparable to that at 1.3$\,$mm on the relevant integration time scales between 2 and 100$\,$s. The detections confirm that the sensitivity and signal chain stability of stations in the Event Horizon Telescope (EHT) array are suitable for VLBI observations at 870$\mu$m. Operation at this short wavelength, combined with anticipated enhancements of the EHT, will lead to a unique high angular resolution instrument for black hole studies, capable of resolving the event horizons of supermassive black holes in both space and time., Comment: Corresponding author: S. Doeleman

The isotopic compositions of samples returned from Cb-type asteroid Ryugu and Ivuna-type (CI) chondrites are distinct from other carbonaceous chondrites, which has led to the suggestion that Ryugu and CI chondrites formed in a different region of the accretion disk, possibly around the orbits of Uranus and Neptune. We show that, like for Fe, Ryugu and CI chondrites also have indistinguishable Ni isotope anomalies, which differ from those of other carbonaceous chondrites. We propose that this unique Fe and Ni isotopic composition reflects different accretion efficiencies of small FeNi metal grains among the carbonaceous chondrite parent bodies. The CI chondrites incorporated these grains more efficiently, possibly because they formed at the end of the disk's lifetime, when planetesimal formation was also triggered by photoevaporation of the disk. Isotopic variations among carbonaceous chondrites may thus reflect fractionation of distinct dust components from a common reservoir, implying CI chondrites and Ryugu may have formed in the same region of the accretion disk as other carbonaceous chondrites., Comment: Published open access in Science Advances

We construct a novel flux tube entanglement entropy (FTE$^2$), defined as the excess entanglement entropy relative to the vacuum of a region of color flux stretching between a heavy quark-anti-quark pair in pure gauge Yang-Mills theory. We show that FTE$^2$ can be expressed in terms of correlators of Polyakov loops, is manifestly gauge-invariant, and therefore free of the ambiguities in computations of the entanglement entropy in gauge theories related to the choice of the center algebra. Employing the replica trick, we compute FTE$^2$ for $SU(2)$ Yang-Mills theory in (2+1)D and demonstrate that it is finite in the continuum limit. We explore the properties of FTE$^2$ for a half-slab geometry, which allows us to vary the width and location of the slab, and the extent to which the slab cross-cuts the color flux tube. Following the intuition provided by computations of FTE$^2$ in (1+1)D, and in a thin string model, we examine the extent to which our FTE$^2$ results can be interpreted as the sum of an internal color entropy and a vibrational entropy corresponding to the transverse excitations of the string., Comment: 27 pages, 15 figures

A damped heat bath is a modification of the standard oscillator heat bath model, wherein each bath oscillator itself has a Markovian coupling to its own heat bath. We modify such a model as described in $\textit{Plyukhin (2019)}$ to one where the oscillators undergo linear rather than constant damping, and find that this generates a memory kernel which behaves like $k(t) \sim 1/t$ as $t\to \infty$ when the spectral density is Ohmic. This is a boundary case not considered in previous works. As the memory kernel does not have a finite integral, it is subdiffusive, and we numerically show the diffusion to go as $\langle\Delta Q^{2}(t)\rangle \sim t/\log(t)$ as $t\to \infty$. We also numerically calculate the velocity correlation function in the asymptotic regime and use it to confirm the aforementioned subdiffusion., Comment: 6 pages, 5 figures

Motivated by the Gottesman-Knill theorem, we present a detailed study of the quantum complexity of $p$-shell and $sd$-shell nuclei. Valence-space nuclear shell-model wavefunctions generated by the BIGSTICK code are mapped to qubit registers using the Jordan-Wigner mapping (12 qubits for the $p$-shell and 24 qubits for the $sd$-shell), from which measures of the many-body entanglement ($n$-tangles) and magic (non-stabilizerness) are determined. While exact evaluations of these measures are possible for nuclei with a modest number of active nucleons, Monte Carlo simulations are required for the more complex nuclei. The broadly-applicable Pauli-String $IZ$ exact (PSIZe-) MCMC technique is introduced to accelerate the evaluation of measures of magic in deformed nuclei (with hierarchical wavefunctions), by factors of $\sim 8$ for some nuclei. Significant multi-nucleon entanglement is found in the $sd$-shell, dominated by proton-neutron configurations, along with significant measures of magic. This is evident not only for the deformed states, but also for nuclei on the path to instability via regions of shape coexistence and level inversion. These results indicate that quantum-computing resources will accelerate precision simulations of such nuclei and beyond., Comment: 36 pages, 13 figures

GitHub provides developers with a practical way to distribute source code and collaboratively work on common projects. To enhance account security and privacy, GitHub allows its users to manage access permissions, review audit logs, and enable two-factor authentication. However, despite the endless effort, the platform still faces various issues related to the privacy of its users. This paper presents an empirical study delving into the GitHub ecosystem. Our focus is on investigating the utilization of privacy settings on the platform and identifying various types of sensitive information disclosed by users. Leveraging a dataset comprising 6,132 developers, we report and analyze their activities by means of comments on pull requests. Our findings indicate an active engagement by users with the available privacy settings on GitHub. Notably, we observe the disclosure of different forms of private information within pull request comments. This observation has prompted our exploration into sensitivity detection using a large language model and BERT, to pave the way for a personalized privacy assistant. Our work provides insights into the utilization of existing privacy protection tools, such as privacy settings, along with their inherent limitations. Essentially, we aim to advance research in this field by providing both the motivation for creating such privacy protection tools and a proposed methodology for personalizing them., Comment: The paper has been peer-reviewed and accepted for publication with the Empirical Software Engineering journal (https://link.springer.com/journal/10664)

The Stark effect provides a powerful method to shift the spectra of molecules, atoms and electronic transitions in general, becoming one of the simplest and most straightforward way to tune the frequency of quantum emitters by means of a static electric field. At the same time, in order to reduce the emitter sensitivity to charge noise, inversion symmetric systems are typically designed, providing a stable emission frequency, with a quadratic-only dependence on the applied field. However, such nonlinear behaviour might reflect in correlations between the tuning ability and unwanted spectral fluctuations. Here, we provide experimental evidence of this trend, using molecular quantum emitters in the solid state cooled down to liquid helium temperatures. We finally combine the electric field generated by electrodes, which results parallel to the molecule induced dipole, to optically excite long-lived charge states, acting in the perpendicular direction. Based on the anisotropy of the molecule's polarizability, our two-dimensional control of the local electric field allows not only to tune the emitter's frequency but also to sensibly suppress the spectral instabilities associated to field fluctuations.

We investigate the gravitational origin of the Tsallis entropy, characterized by the nonadditive index $\delta$. Utilizing Wald's formalism within the framework of $f(R)$ modified theories of gravity, we evaluate the entropy on the black hole horizon for constant curvature solutions to the spherically symmetric vacuum field equations. In so doing, we demonstrate that the Tsallis entropy can be effectively derived from a generalization of the Lagrangian $\mathcal{L}\propto R^{1+\epsilon}$, where $\epsilon=\delta-1$ quantifies small deviations from general relativity. In conclusion, we examine the physical implications of our findings in light of cosmological observations and elaborate on the possibility of solving the thermodynamic instability of Schwarzschild black holes., Comment: 8 pages. Accepted for publication in Physics Letters B

AI-generated synthetic media, also called Deepfakes, have significantly influenced so many domains, from entertainment to cybersecurity. Generative Adversarial Networks (GANs) and Diffusion Models (DMs) are the main frameworks used to create Deepfakes, producing highly realistic yet fabricated content. While these technologies open up new creative possibilities, they also bring substantial ethical and security risks due to their potential misuse. The rise of such advanced media has led to the development of a cognitive bias known as Impostor Bias, where individuals doubt the authenticity of multimedia due to the awareness of AI's capabilities. As a result, Deepfake detection has become a vital area of research, focusing on identifying subtle inconsistencies and artifacts with machine learning techniques, especially Convolutional Neural Networks (CNNs). Research in forensic Deepfake technology encompasses five main areas: detection, attribution and recognition, passive authentication, detection in realistic scenarios, and active authentication. This paper reviews the primary algorithms that address these challenges, examining their advantages, limitations, and future prospects.

By utilizing recently developed tools for constructing gradient flows on Wasserstein spaces, we extend an analysis technique commonly employed to understand alternating minimization algorithms on Euclidean space to the Expectation Maximization (EM) algorithm via its representation as coordinate-wise minimization on the product of a Euclidean space and a space of probability distributions due to Neal and Hinton (1998). In so doing we obtain finite sample error bounds and exponential convergence of the EM algorithm under a natural generalisation of a log-Sobolev inequality. We further demonstrate that the analysis technique is sufficiently flexible to allow also the analysis of several variants of the EM algorithm.

In the GitHub ecosystem, workflows are used as an effective means to automate development tasks and to set up a Continuous Integration and Delivery (CI/CD pipeline). GitHub Actions (GHA) have been conceived to provide developers with a practical tool to create and maintain workflows, avoiding reinventing the wheel and cluttering the workflow with shell commands. Properly leveraging the power of GitHub Actions can facilitate the development processes, enhance collaboration, and significantly impact project outcomes. To expose actions to search engines, GitHub allows developers to assign them to one or more categories manually. These are used as an effective means to group actions sharing similar functionality. Nevertheless, while providing a practical way to execute workflows, many actions have unclear purposes, and sometimes they are not categorized. In this work, we bridge such a gap by conceptualizing Gavel, a practical solution to increasing the visibility of actions in GitHub. By leveraging the content of README.MD files for each action, we use Transformer--a deep learning algorithm--to assign suitable categories to the action. We conducted an empirical investigation and compared Gavel with a state-of-the-art baseline. The experimental results show that our proposed approach can assign categories to GitHub actions effectively, thus outperforming the state-of-the-art baseline., Comment: The paper has been peer-reviewed and accepted for publication in the Proceedings of the 18th International Symposium on Empirical Software Engineering and Measurement (ESEM 2024)

The goal of trace reconstruction is to reconstruct an unknown $n$-bit string $x$ given only independent random traces of $x$, where a random trace of $x$ is obtained by passing $x$ through a deletion channel. A Statistical Query (SQ) algorithm for trace reconstruction is an algorithm which can only access statistical information about the distribution of random traces of $x$ rather than individual traces themselves. Such an algorithm is said to be $\ell$-local if each of its statistical queries corresponds to an $\ell$-junta function over some block of $\ell$ consecutive bits in the trace. Since several -- but not all -- known algorithms for trace reconstruction fall under the local statistical query paradigm, it is interesting to understand the abilities and limitations of local SQ algorithms for trace reconstruction. In this paper we establish nearly-matching upper and lower bounds on local Statistical Query algorithms for both worst-case and average-case trace reconstruction. For the worst-case problem, we show that there is an $\tilde{O}(n^{1/5})$-local SQ algorithm that makes all its queries with tolerance $\tau \geq 2^{-\tilde{O}(n^{1/5})}$, and also that any $\tilde{O}(n^{1/5})$-local SQ algorithm must make some query with tolerance $\tau \leq 2^{-\tilde{\Omega}(n^{1/5})}$. For the average-case problem, we show that there is an $O(\log n)$-local SQ algorithm that makes all its queries with tolerance $\tau \geq 1/\mathrm{poly}(n)$, and also that any $O(\log n)$-local SQ algorithm must make some query with tolerance $\tau \leq 1/\mathrm{poly}(n).$, Comment: RANDOM 2024

Graphene is a privileged 2D platform for hosting confined light-matter excitations known as surface plasmon-polaritons (SPPs), as it possesses low intrinsic losses with a high degree of optical confinement. However, the inherently isotropic optical properties of graphene limit its ability to guide and focus SPPs, making it less suitable than anisotropic elliptical and hyperbolic materials as a platform for polaritonic lensing and canalization. Here, we present the graphene/CrSBr heterostructure as an engineered 2D interface that hosts highly anisotropic SPP propagation over a wide range of frequencies in the mid-infrared and terahertz. Using a combination of scanning tunneling microscopy (STM), scattering-type scanning near-field optical microscopy (s-SNOM), and first-principles calculations, we demonstrate mutual doping in excess of 10$^{13}$ cm$^{-2}$ holes/electrons between the interfacial layers of graphene/CrSBr heterostructures. SPPs in graphene activated by charge transfer interact with charge-induced anisotropic intra- and interband transitions in the interfacial doped CrSBr, leading to preferential SPP propagation along the quasi-1D chains that compose each CrSBr layer. This multifaceted proximity effect both creates SPPs and endows them with anisotropic transport and propagation lengths that differ by an order-of-magnitude between the two in-plane crystallographic axes of CrSBr.

We introduce a new benchmark, TAPVid-3D, for evaluating the task of long-range Tracking Any Point in 3D (TAP-3D). While point tracking in two dimensions (TAP) has many benchmarks measuring performance on real-world videos, such as TAPVid-DAVIS, three-dimensional point tracking has none. To this end, leveraging existing footage, we build a new benchmark for 3D point tracking featuring 4,000+ real-world videos, composed of three different data sources spanning a variety of object types, motion patterns, and indoor and outdoor environments. To measure performance on the TAP-3D task, we formulate a collection of metrics that extend the Jaccard-based metric used in TAP to handle the complexities of ambiguous depth scales across models, occlusions, and multi-track spatio-temporal smoothness. We manually verify a large sample of trajectories to ensure correct video annotations, and assess the current state of the TAP-3D task by constructing competitive baselines using existing tracking models. We anticipate this benchmark will serve as a guidepost to improve our ability to understand precise 3D motion and surface deformation from monocular video. Code for dataset download, generation, and model evaluation is available at https://tapvid3d.github.io

In the realm of fundamental quantum science and technologies, non-classical states of light, such as single-photon Fock states, are widely studied. However, current standards and metrological procedures are not optimized for low light levels. Progress in this crucial scientific domain depends on innovative metrology approaches, utilizing reliable devices based on quantum effects. We present a new generation of molecule-based single photon sources, combining their integration in a polymeric micro-lens with pulsed excitation schemes, thereby realizing suitable resources in quantum radiometry. Our strategy enhances the efficiency of generated single photon pulses and improves stability, providing a portable source at 784.7 nm that maintains consistent performance even through a cooling and heating cycle. The calibration of a single photon avalanche detector is demonstrated using light sources with different photon statistics, and the advantages of the single-molecule device are discussed. A relative uncertainty on the intrinsic detection efficiency well below 1 % is attained, representing a new benchmark in the field.

The notion of Lyndon word and Lyndon factorization has shown to have unexpected applications in theory as well in developing novel algorithms on words. A counterpart to these notions are those of inverse Lyndon word and inverse Lyndon factorization. Differently from the Lyndon words, the inverse Lyndon words may be bordered. The relationship between the two factorizations is related to the inverse lexicographic ordering, and has only been recently explored. More precisely, a main open question is how to get an inverse Lyndon factorization from a classical Lyndon factorization under the inverse lexicographic ordering, named CFLin. In this paper we reveal a strong connection between these two factorizations where the border plays a relevant role. More precisely, we show two main results. We say that a factorization has the border property if a nonempty border of a factor cannot be a prefix of the next factor. First we show that there exists a unique inverse Lyndon factorization having the border property. Then we show that this unique factorization with the border property is the so-called canonical inverse Lyndon factorization, named ICFL. By showing that ICFL is obtained by compacting factors of the Lyndon factorization over the inverse lexicographic ordering, we provide a linear time algorithm for computing ICFL from CFLin., Comment: 11 pages, version submitted to MFCS2024. arXiv admin note: text overlap with arXiv:2404.17969, arXiv:1911.01851

Individuals with diverse motor abilities often benefit from intensive and specialized rehabilitation therapies aimed at enhancing their functional recovery. Nevertheless, the challenge lies in the restricted availability of neurorehabilitation professionals, hindering the effective delivery of the necessary level of care. Robotic devices hold great potential in reducing the dependence on medical personnel during therapy but, at the same time, they generally lack the crucial human interaction and motivation that traditional in-person sessions provide. To bridge this gap, we introduce an AI-based system aimed at delivering personalized, out-of-hospital assistance during neurorehabilitation training. This system includes a rehabilitation training device, affective signal classification models, training exercises, and a socially interactive agent as the user interface. With the assistance of a professional, the envisioned system is designed to be tailored to accommodate the unique rehabilitation requirements of an individual patient. Conceptually, after a preliminary setup and instruction phase, the patient is equipped to continue their rehabilitation regimen autonomously in the comfort of their home, facilitated by a socially interactive agent functioning as a virtual coaching assistant. Our approach involves the integration of an interactive socially-aware virtual agent into a neurorehabilitation robotic framework, with the primary objective of recreating the social aspects inherent to in-person rehabilitation sessions. We also conducted a feasibility study to test the framework with healthy patients. The results of our preliminary investigation indicate that participants demonstrated a propensity to adapt to the system. Notably, the presence of the interactive agent during the proposed exercises did not act as a source of distraction; instead, it positively impacted users' engagement.

Neutrino event generators make use of intranuclear cascade models (INCs), to predict the kinematics of hadrons produced in neutrino-nucleus interactions. We perform a consistent comparison of different INCs, by using the same set of events as input to the NEUT, NuWro, Achilles and INCL INCs. The inputs correspond to calculations of the fully differential single-proton knockout cross section, either in the distorted-wave impulse approximation (DWIA) or plane-wave impulse approximation (PWIA), both including realistic nuclear hole spectral functions. We compare the INC results to DWIA calculations with an optical potential, used extensively in the analysis of (e,e'p) experiments. We point out a systematic discrepancy between both approaches. We apply the INC results to recent MicroBooNE data. We assess the influence of the choice of spectral function, finding that large variations in realistic spectral functions are indistinguishable with present data. The data is underpredicted, with strength missing in the region where two-nucleon knockout and resonance production contribute. However, the data is underpredicted also in regions of low transverse missing momentum, where one-nucleon knockout dominates. The inclusion of the interference with two-body currents could lead to additional strength in this region., Comment: 26 pages including appendices, comments welcome

We introduce a Bayesian protocol based on artificial neural networks that is suitable for modeling inclusive electron-nucleus scattering on a variety of nuclear targets with quantified uncertainties. Unlike previous applications in the field, which directly parameterize the cross sections, our approach employs artificial neural networks to represent the longitudinal and transverse response functions. In contrast to cross sections, which depend on the incoming energy, scattering angle, and energy transfer, the response functions are determined solely by the energy and momentum transfer to the system, allowing the angular component to be treated analytically. We assess the accuracy and predictive power of our framework against the extensive data in the quasielastic inclusive electron-scattering database. Additionally, we present novel extractions of the longitudinal and transverse response functions and compare them with previous experimental analysis and nuclear ab-initio calculations., Comment: 9 pages, 6 figures

In this paper, we investigate scalar-induced gravitational waves (GWs) generated in the post-inflationary universe to infer new limits on warm inflation. We specifically examine the evolution of primordial GWs produced by scalar perturbations produced during the radiation-dominated epoch. For this purpose, we assume a weak regime of warm inflation under the slow-roll approximation, with a dissipation coefficient linearly dependent on the temperature of the radiation bath. We then derive analytical expressions for the curvature power spectrum and the scalar index, in the cases of chaotic and exponential potentials of the inflationary field. Subsequently, we compare the theoretical predictions regarding the relic energy density of GWs with the stochastic GW background signal recently detected by the NANOGrav collaboration through the use of pulsar timing array measurements. In so doing, we obtain numerical constraints on the free parameters of the inflationary models under study. Finally, we conduct a model selection analysis through the Bayesian inference method to measure the statistical performance of the different theoretical scenarios., Comment: 12 pages, 4 figures