Search

Lattice gauge theories (LGTs) can be employed to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials. Studying dynamical properties of emergent phases can be challenging as it requires solving many-body problems that are generally beyond perturbative limits. We investigate the dynamics of local excitations in a $\mathbb{Z}_2$ LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit which prepares low-energy states that have a large overlap with the ground state; then we create particles with local gates and simulate their quantum dynamics via a discretized time evolution. As the effective magnetic field is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the magnetic field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT from which we uncover two distinct regimes inside the confining phase: for weak confinement the string fluctuates strongly in the transverse direction, while for strong confinement transverse fluctuations are effectively frozen. In addition, we demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a novel set of techniques for investigating emergent particle and string dynamics.

We prove that the norm of $X\widehat{\otimes}_\pi Y$ is SSD if either $X=\ell_p(I)$ for $p>2$ and $Y$ is a finite-dimensional Banach space such that the modulus of convexity is of power type $q

Automatic detection of online hate speech serves as a crucial step in the detoxification of the online discourse. Moreover, accurate classification can promote a better understanding of the proliferation of hate as a social phenomenon. While most prior work focus on the detection of hateful utterances, we argue that focusing on the user level is as important, albeit challenging. In this paper we consider a multimodal aggregative approach for the detection of hate-mongers, taking into account the potentially hateful texts, user activity, and the user network. We evaluate our methods on three unique datasets X (Twitter), Gab, and Parler showing that a processing a user's texts in her social context significantly improves the detection of hate mongers, compared to previously used text and graph-based methods. Our method can be then used to improve the classification of coded messages, dog-whistling, and racial gas-lighting, as well as inform intervention measures. Moreover, our approach is highly efficient even for very large datasets and networks.

Real-life applications of deferred-acceptance (DA) matching algorithms sometimes exhibit errors or changes to the matching inputs that are discovered only after the algorithm has been run and the results are announced to participants. Mitigating the effects of these errors is a different problem than the original match since the decision makers are often constrained by the offers they already sent out. We propose models for this new problem, along with mitigation strategies to go with these models. We explore three different error scenarios: resource reduction, additive errors, and subtractive errors. For each error type, we compute the expected number of students directly harmed, or helped, by the error, the number indirectly harmed or helped, and the number of students with justified envy due to the errors. Error mitigation strategies need to be selected based on the goals of the administrator, which include restoring stability, avoiding direct harm to any participant, and focusing the extra burden on the schools that made the error. We provide empirical simulations of the errors and the mitigation strategies.

We compute the nuclear dimension of extensions of C*-algebras involving commutative unital quotients and stable Kirchberg ideals. We identify the finite directed graphs whose C*-algebras are covered by this theorem., Comment: 30 pages

Feeding the growing human population sustainably amidst climate change is one of the most important challenges in the 21st century. Current practices often lead to the overuse of agronomic inputs, such as synthetic fertilizers and water, resulting in environmental contamination and diminishing returns on crop productivity. The complexity of agricultural systems, involving plant-environment interactions and human management, presents significant scientific and technical challenges for developing sustainable practices. Addressing these challenges necessitates transdisciplinary research, involving intense collaboration among fields such as plant science, engineering, computer science, and social sciences. Here, we present five case studies from two research centers demonstrating successful transdisciplinary approaches toward more sustainable water and fertilizer use. These case studies span multiple scales. Starting from whole-plant signaling, we explore how reporter plants can transform our understanding of plant communication and enable efficient application of water and fertilizers. We then show how new fertilizer technologies could increase the availability of phosphorus in the soil. To accelerate advancements in breeding new cultivars, we discuss robotic technologies for high-throughput plant screening in different environments at a population scale. At the ecosystem scale, we investigate phosphorus recovery from aquatic systems and methods to minimize phosphorus leaching. Finally, as agricultural outputs affect all people, we show how to integrate stakeholder perspectives and needs into the research. With these case studies, we hope to encourage the scientific community to adopt transdisciplinary research and promote cross-training among biologists, engineers, and social scientists to drive discovery and innovation in advancing sustainable agricultural systems.

As robotic systems become increasingly integrated into complex real-world environments, there is a growing need for approaches that enable robots to understand and act upon natural language instructions without relying on extensive pre-programmed knowledge of their surroundings. This paper presents PLATO, an innovative system that addresses this challenge by leveraging specialized large language model agents to process natural language inputs, understand the environment, predict tool affordances, and generate executable actions for robotic systems. Unlike traditional systems that depend on hard-coded environmental information, PLATO employs a modular architecture of specialized agents to operate without any initial knowledge of the environment. These agents identify objects and their locations within the scene, generate a comprehensive high-level plan, translate this plan into a series of low-level actions, and verify the completion of each step. The system is particularly tested on challenging tool-use tasks, which involve handling diverse objects and require long-horizon planning. PLATO's design allows it to adapt to dynamic and unstructured settings, significantly enhancing its flexibility and robustness. By evaluating the system across various complex scenarios, we demonstrate its capability to tackle a diverse range of tasks and offer a novel solution to integrate LLMs with robotic platforms, advancing the state-of-the-art in autonomous robotic task execution. For videos and prompt details, please see our project website: https://sites.google.com/andrew.cmu.edu/plato, Comment: 7 pages, 4 figures, submitted to ICRA 2025

We examine a century of radial velocity, visual magnitude, and astrometric observations of the nearest red supergiant, Betelgeuse, in order to reexamine the century-old assertion that Betelgeuse might be a spectroscopic binary. These data reveal Betelgeuse varying stochastically over years and decades due to its boiling, convective envelope, periodically with a $ 5.78$~yr long secondary period, and quasi-periodically from pulsations with periods of several hundred days. We show that the long secondary period is consistent between astrometric and RV datasets, and argue that it indicates a low-mass companion to Betelgeuse, less than a solar mass, orbiting in a 2,110 day period at a separation of just over twice Betelgeuse's radius. The companion star would be nearly twenty times less massive and a million times fainter than Betelgeuse, with similar effective temperature, effectively hiding it in plain sight near one of the best-studied stars in the night sky. The astrometric data favor an edge-on binary with orbital plane aligned with Betelgeuse's measured spin axis. Tidal spin-orbit interaction drains angular momentum from the orbit and spins up Betelgeuse, explaining the spin--orbit alignment and Betelgeuse's anomalously rapid spin. In the future, the orbit will decay until the companion is swallowed by Betelgeuse in the next 10,000 years., Comment: Submitted to AAS Journals, comments welcome

Autonomous robotic search has important applications in robotics, such as the search for signs of life after a disaster. When \emph{a priori} information is available, for example in the form of a distribution, a planner can use that distribution to guide the search. Ergodic search is one method that uses the information distribution to generate a trajectory that minimizes the ergodic metric, in that it encourages the robot to spend more time in regions with high information and proportionally less time in the remaining regions. Unfortunately, prior works in ergodic search do not perform well in complex environments with obstacles such as a building's interior or a maze. To address this, our work presents a modified ergodic metric using the Laplace-Beltrami eigenfunctions to capture map geometry and obstacle locations within the ergodic metric. Further, we introduce an approach to generate trajectories that minimize the ergodic metric while guaranteeing obstacle avoidance using measure-preserving vector fields. Finally, we leverage the divergence-free nature of these vector fields to generate collision-free trajectories for multiple agents. We demonstrate our approach via simulations with single and multi-agent systems on maps representing interior hallways and long corridors with non-uniform information distribution. In particular, we illustrate the generation of feasible trajectories in complex environments where prior methods fail., Comment: 15 pages, accepted to DARS 2024

Studying and building datasets for dialogue tasks is both expensive and time-consuming due to the need to recruit, train, and collect data from study participants. In response, much recent work has sought to use large language models (LLMs) to simulate both human-human and human-LLM interactions, as they have been shown to generate convincingly human-like text in many settings. However, to what extent do LLM-based simulations \textit{actually} reflect human dialogues? In this work, we answer this question by generating a large-scale dataset of 100,000 paired LLM-LLM and human-LLM dialogues from the WildChat dataset and quantifying how well the LLM simulations align with their human counterparts. Overall, we find relatively low alignment between simulations and human interactions, demonstrating a systematic divergence along the multiple textual properties, including style and content. Further, in comparisons of English, Chinese, and Russian dialogues, we find that models perform similarly. Our results suggest that LLMs generally perform better when the human themself writes in a way that is more similar to the LLM's own style.

The Schwarzschild radii of primordial black holes (PBHs) in the mass range of 6x10^{14}g to 4x10^{19}g match the sizes of nuclei to atoms. I discuss the resulting quantum-mechanical suppression in the accretion of matter by PBHs within astrophysical environments., Comment: Submitted for publication in The Astrophysical Journal Letters, 6 pages

In the Quantum-Train (QT) framework, mapping quantum state measurements to classical neural network weights is a critical challenge that affects the scalability and efficiency of hybrid quantum-classical models. The traditional QT framework employs a multi-layer perceptron (MLP) for this task, but it struggles with scalability and interpretability. To address these issues, we propose replacing the MLP with a tensor network-based model and introducing a distributed circuit ansatz designed for large-scale quantum machine learning with multiple small quantum processing unit nodes. This approach enhances scalability, efficiently represents high-dimensional data, and maintains a compact model structure. Our enhanced QT framework retains the benefits of reduced parameter count and independence from quantum resources during inference. Experimental results on benchmark datasets demonstrate that the tensor network-based QT framework achieves competitive performance with improved efficiency and generalization, offering a practical solution for scalable hybrid quantum-classical machine learning., Comment: 4 pages, 3 figures

We present \textsc{Mathpop}, a novel method to infer the globular cluster (GC) counts in ultra-diffuse galaxies (UDGs) and low-surface brightness galaxies (LSBGs). Many known UDGs have a surprisingly high ratio of GC number to surface brightness. However, standard methods to infer GC counts in UDGs face various challenges, such as photometric measurement uncertainties, GC membership uncertainties, and assumptions about the GC luminosity functions (GCLFs). \textsc{Mathpop} tackles these challenges using the mark-dependent thinned point process, enabling joint inference of the spatial and magnitude distributions of GCs. In doing so, \textsc{Mathpop} allows us to infer and quantify the uncertainties in both GC counts and GCLFs with minimal assumptions. As a precursor to \textsc{Mathpop}, we also address the data uncertainties coming from the selection process of GC candidates: we obtain probabilistic GC candidates instead of the traditional binary classification based on the color--magnitude diagram. We apply \textsc{Mathpop} to 40 LSBGs in the Perseus cluster using GC catalogs from a \textit{Hubble Space Telescope} imaging program. We then compare our results to those from an independent study using the standard method. We further calibrate and validate our approach through extensive simulations. Our approach reveals two LSBGs having GCLF turnover points much brighter than the canonical value with Bayes' factor being $\sim4.5$ and $\sim2.5$, respectively. An additional crude maximum-likelihood estimation shows that their GCLF TO points are approximately $0.9$~mag and $1.1$~mag brighter than the canonical value, with $p$-value $\sim 10^{-8}$ and $\sim 10^{-5}$, respectively., Comment: 8 figures, 5 tables; submitted to ApJ, comments are welcomed

Expected points is a value function fundamental to player evaluation and strategic in-game decision-making across sports analytics, particularly in American football. To estimate expected points, football analysts use machine learning tools, which are not equipped to handle certain challenges. They suffer from selection bias, display counter-intuitive artifacts of overfitting, do not quantify uncertainty in point estimates, and do not account for the strong dependence structure of observational football data. These issues are not unique to American football or even sports analytics; they are general problems analysts encounter across various statistical applications, particularly when using machine learning in lieu of traditional statistical models. We explore these issues in detail and devise expected points models that account for them. We also introduce a widely applicable novel methodological approach to mitigate overfitting, using a catalytic prior to smooth our machine learning models., Comment: version 0; still have editing to do in the body

Colloidoscope is a deep learning pipeline employing a 3D residual Unet architecture, designed to enhance the tracking of dense colloidal suspensions through confocal microscopy. This methodology uses a simulated training dataset that reflects a wide array of real-world imaging conditions, specifically targeting high colloid volume fraction and low-contrast scenarios where traditional detection methods struggle. Central to our approach is the use of experimental signal-to-noise ratio (SNR), contrast-to-noise ratio (CNR), and point-spread-functions (PSFs) to accurately quantify and simulate the experimental data. Our findings reveal that Colloidoscope achieves superior recall in particle detection (finds more particles) compared to conventional heuristic methods. Simultaneously, high precision is maintained (high fraction of true positives.) The model demonstrates a notable robustness to photobleached samples, thereby prolonging the imaging time and number of frames than may be acquired. Furthermore, Colloidoscope maintains small scale resolution sufficient to classify local structural motifs. Evaluated across both simulated and experimental datasets, Colloidoscope brings the advancements in computer vision offered by deep learning to particle tracking at high volume fractions. We offer a promising tool for researchers in the soft matter community, this model is deployed and available to use pretrained: https://github.com/wahabk/colloidoscope., Comment: 20 pages

The structure of extended affine Weyl symmetry group of higher Painlev\'e equations of $N$ periodicity depends on whether $N$ is even or odd. We find that for even $N$, the symmetry group ${\widehat A}^{(1)}_{N-1}$ contains the conventional B\"acklund transformations $s_j, j=1,{\ldots},N$, the group of automorphisms consisting of cycling permutations but also reflections on a periodic circle of $N$ points, which is a novel feature uncovered in this paper. The presence of reflection automorphisms is connected to existence of degenerated solutions and for $N=4$ we explicitly show how the reflection automorphisms around even points cause degeneracy of a class of rational solutions obtained on the orbit of translation operators of ${\widehat A}^{(1)}_{3}$. We obtain the closed expressions for solutions and their degenerated counterparts in terms of determinants of Kummer polynomials., Comment: 26 pages

Proton-proton collisions at energy-frontier facilities produce an intense flux of high-energy light particles, including neutrinos, in the forward direction. At the LHC, these particles are currently being studied with the far-forward experiments FASER/FASER$\nu$ and SND@LHC, while new dedicated experiments have been proposed in the context of a Forward Physics Facility (FPF) operating at the HL-LHC. Here we present a first quantitative exploration of the reach for neutrino, QCD, and BSM physics of far-forward experiments integrated within the proposed Future Circular Collider (FCC) project as part of its proton-proton collision program (FCC-hh) at $\sqrt{s} \simeq 100$ TeV. We find that $10^9$ electron/muon neutrinos and $10^7$ tau neutrinos could be detected, an increase of several orders of magnitude compared to (HL-)LHC yields. We study the impact of neutrino DIS measurements at the FPF@FCC to constrain the unpolarised and spin partonic structure of the nucleon and assess their sensitivity to nuclear dynamics down to $x \sim 10^{-9}$ with neutrinos produced in proton-lead collisions. We demonstrate that the FPF@FCC could measure the neutrino charge radius for $\nu_{e}$ and $\nu_\mu$ and reach down to five times the SM value for $\nu_\tau$. We fingerprint the BSM sensitivity of the FPF@FCC for a variety of models, including dark Higgs bosons, relaxion-type scenarios, quirks, and millicharged particles, finding that these experiments would be able to discover LLPs with masses as large as 50 GeV and couplings as small as $10^{-8}$, and quirks with masses up to 10 TeV. Our study highlights the remarkable opportunities made possible by integrating far-forward experiments into the FCC project, and it provides new motivation for the FPF at the HL-LHC as an essential precedent to optimize the forward physics experiments that will enable the FCC to achieve its full physics potential.

In rare earth nickelates (RENiO$_3$), electron-lattice coupling drives a concurrent metal-to-insulator and bond disproportionation phase transition whose microscopic origin has long been the subject of active debate. Of several proposed mechanisms, here we test the hypothesis that pairs of self-doped ligand holes spatially condense to provide local spin moments that are antiferromagnetically coupled to Ni spins. These singlet-like states provide a basis for long-range bond and spiral spin order. Using magnetic resonant X-ray scattering on NdNiO$_3$ thin films, we observe the chiral nature of the spin-disproportionated state, with spin spirals propagating along the crystallographic (101)$_\mathrm{ortho}$ direction. These spin spirals are found to preferentially couple to X-ray helicity, establishing the presence of a hitherto-unobserved macroscopic chirality. The presence of this chiral magnetic configuration suggests a potential multiferroic coupling between the noncollinear magnetic arrangement and improper ferroelectric behavior as observed in prior studies on NdNiO$_3$ (101)$_\mathrm{ortho}$ films and RENiO$_3$ single crystals. Experimentally constrained theoretical double-cluster calculations confirm the presence of an energetically stable spin-disproportionated state with Zhang-Rice singlet-like combinations of Ni and ligand moments., Comment: 6 pages, 4 figures

One of the main obstacles for the signal extraction of the three point correlation function using photometric surveys, such as the Rubin Observatory Legacy Survey of Space and Time (LSST), will be the prohibitive computation time required for dealing with a vast quantity of sources. Brute force algorithms, which naively scales as $\mathcal{O}(N^3)$ with the number of objects, can be further improved with tree methods but not enough to deal with large scale correlations of Rubin's data. However, a harmonic basis decomposition of these higher order statistics reduces the time dramatically, to scale as a two-point correlation function with the number of objects, so that the signal can be extracted in a reasonable amount of time. In this work, we aim to develop the framework to use these expansions within the Limber approximation for scalar (or spin-0) fields, such as galaxy counts, weak lensing convergence or aperture masses. We develop an estimator to extract the signal from catalogs and different phenomenological and theoretical models for its description. The latter includes halo model and standard perturbation theory, to which we add a simple effective field theory prescription based on the short range of non-locality of cosmic fields, significantly improving the agreement with simulated data. In parallel to the modeling of the signal, we develop a code that can efficiently calculate three points correlations of more than 200 million data points (a full sky simulation with Nside=4096) in $\sim$40 minutes on a single high-performance computing node, enabling a feasible analysis for the upcoming LSST data., Comment: 31 pages, 10 figures

We use the inferred evolution of Lyman-$\alpha$ luminosities of galaxies in the redshift range of $z \sim 9-16$ from the $James \ Webb \ Space \ Telescope$ (JWST) data to predict the power spectrum of Loeb-Rybicki haloes formed by scattered Lyman-$\alpha$ radiation in the diffuse intergalactic hydrogen before reionization. We find excellent prospects for a statistical detection of the intensity mapping signal with current and future experiments such as the JWST, SPHEREx and CDIM. We also describe the detectability of the signal in cross-correlation with the 21-cm emission from atomic hydrogen in the intergalactic medium at these redshifts. We find that the cross-correlation signal should be detectable at a significance of a few tens of standard deviations out to $z \sim 16$ using the above experiments in combination with the Square Kilometre Array (SKA)-LOW and its pathfinder, the Murchison Widefield Array (MWA)., Comment: 8 pages, 5 figures, 2 tables

Long-range Rydberg molecules are typically bound in wells formed in their oscillatory potential energy curves. In alkaline Rydberg molecules, bound vibrational states exist even when these potential wells are disrupted by level repulsion from the steep butterfly potential energy curve induced by a scattering shape resonance. The binding in this case is attributed to quantum reflection. However, the rapidly varying regions of the potential energy landscape where quantum reflection occurs often coincide with regions where non-adiabatic coupling becomes significant. By comparing the molecular states calculated within the Born-Oppenheimer approximation, where quantum reflection is the only binding mechanism, with those obtained from the full set of coupled channel equations, we can assess the effects of non-adiabatic coupling on vibrational energies and lifetimes. Our findings show that these couplings can stabilize the molecule by providing an additional barrier which protects the vibrational states from predissociation and non-radiative transitions. There can also be extreme cases where non-adiabatic coupling completely dominates the binding and the molecular lifetimes saturate at the atomic Rydberg lifetime.

The dynamics of domain walls in a square of permalloy (Ni$_{81}$Fe$_{19}$; Py) upon excitation with an oscillating magnetic field of 4 mT amplitude were recorded by pump-probe ptychography with X-ray magnetic circular dichroism (XMCD) at the Ni L$_3$-edge. The 2.5 $\mu$m Py square of 160 nm thickness forms a vortex flux-closure pattern with domain walls that fall into alternating out-of-plane magnetization states due to the interplay of in-plane shape and growth-induced perpendicular anisotropies. Dynamic modes of the domain wall structure were excitable along with the vortex core gyration with frequencies of 500 MHz and 1 GHz. Micromagnetic simulations served to corroborate the imaged domain wall motion.

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

Today's mainstream network timing models for distributed computing are synchrony, partial synchrony, and asynchrony. These models are coarse-grained and often make either too strong or too weak assumptions about the network. This paper introduces a new timing model called granular synchrony that models the network as a mixture of synchronous, partially synchronous, and asynchronous communication links. The new model is not only theoretically interesting but also more representative of real-world networks. It also serves as a unifying framework where current mainstream models are its special cases. We present necessary and sufficient conditions for solving crash and Byzantine fault-tolerant consensus in granular synchrony. Interestingly, consensus among $n$ parties can be achieved against $f \geq n/2$ crash faults or $f \geq n/3$ Byzantine faults without resorting to full synchrony.

Object detectors are vulnerable to backdoor attacks. In contrast to classifiers, detectors possess unique characteristics, architecturally and in task execution; often operating in challenging conditions, for instance, detecting traffic signs in autonomous cars. But, our knowledge dominates attacks against classifiers and tests in the "digital domain". To address this critical gap, we conducted an extensive empirical study targeting multiple detector architectures and two challenging detection tasks in real-world settings: traffic signs and vehicles. Using the diverse, methodically collected videos captured from driving cars and flying drones, incorporating physical object trigger deployments in authentic scenes, we investigated the viability of physical object-triggered backdoor attacks in application settings. Our findings revealed 8 key insights. Importantly, the prevalent "digital" data poisoning method for injecting backdoors into models does not lead to effective attacks against detectors in the real world, although proven effective in classification tasks. We construct a new, cost-efficient attack method, dubbed MORPHING, incorporating the unique nature of detection tasks; ours is remarkably successful in injecting physical object-triggered backdoors, even capable of poisoning triggers with clean label annotations or invisible triggers without diminishing the success of physical object triggered backdoors. We discovered that the defenses curated are ill-equipped to safeguard detectors against such attacks. To underscore the severity of the threat and foster further research, we, for the first time, release an extensive video test set of real-world backdoor attacks. Our study not only establishes the credibility and seriousness of this threat but also serves as a clarion call to the research community to advance backdoor defenses in the context of object detection., Comment: Accepted to appear at the 40th Annual Computer Security Applications Conference (ACSAC 2024)

Current cosmological constraints allow primordial black holes (PBHs) to constitute dark matter in the mass range of $10^{18}$-$10^{22}$g. We show that a major portion of this logarithmic window can be ruled-out based on the Solar System ephemeris, given that the external mass enclosed within 50 au from the Sun did not change by more than $\sim 5\times 10^{-14}$ solar masses per year in recent decades., Comment: Accepted for publication in Research Notes of the American Astronomical Society (August 2024), 4 pages

We show that black holes can be made of light by adding gravity to the discussion of Alvarez-Dominguez et al., arXiv:2405.02389 [PRL 130, 041401 (2024)]., Comment: Comment on arXiv:2405.02389 [PRL 130, 041401 (2024)], 2 pages; submitted for publication as a comment to Physical Review Letters, with added references

Decentralized Health Intelligence Network (DHIN) extends the Decentralized Intelligence Network (DIN) framework to address challenges in healthcare data sovereignty and AI utilization. Building upon DIN's core principles, DHIN introduces healthcare-specific components to tackle data fragmentation across providers and institutions, establishing a sovereign architecture for healthcare provision. It facilitates effective AI utilization by overcoming barriers to accessing diverse health data sources. This comprehensive framework leverages: 1) self-sovereign identity architecture coupled with a personal health record (PHR), extending DIN's personal data stores concept to ensure health data sovereignty; 2) a scalable federated learning (FL) protocol implemented on a public blockchain for decentralized AI training in healthcare, tailored for medical data; and 3) a scalable, trustless rewards mechanism adapted from DIN to incentivize participation in healthcare AI development. DHIN operates on a public blockchain with an immutable record, ensuring that no entity can control access to health data or determine financial benefits. It supports effective AI training while allowing patients to maintain control over their health data, benefit financially, and contribute to a decentralized ecosystem. Unique to DHIN, patients receive rewards in digital wallets as an incentive to opt into the FL protocol, with a long-term roadmap to fund decentralized insurance solutions. This approach introduces a novel, self-financed healthcare model that adapts to individual needs, complements existing systems, and redefines universal coverage, showcasing how DIN principles can transform healthcare data management and AI utilization while empowering patients., Comment: 13 pages, 6 figures

In this paper, we study the mechanical system associated with rolling a Lorentzian manifold $(M,g)$ of dimension $n+1\geq2$ on flat Lorentzian space $\widehat{M}={\mathbb R}^{n,1}$, without slipping or twisting. Using previous results, it is known that there exists a distribution $\mathcal{D}_R$ of rank $(n+1)$ defined on the configuration space $Q(M,\widehat{M})$ of the rolling system, encoding the no-slip and no-twist conditions. Our objective is to study the problem of complete controllability of the control system associated with $\mathcal{D}_R$. The key lies in examining the holonomy group of the distribution $\mathcal{D}_R$ and, following the approach of \cite{ChKok}, establishing that the rolling problem is completely controllable if and only if the holonomy group of $(M,g)$ equals $SO_0(n,1)$., Comment: 13 pages

In recent years, the threat facing airports from growing and increasingly sophisticated cyberattacks has become evident. Airports are considered a strategic national asset, so protecting them from attacks, specifically cyberattacks, is a crucial mission. One way to increase airports' security is by using Digital Twins (DTs). This paper shows and demonstrates how DTs can enhance the security mission. The integration of DTs with Generative AI (GenAI) algorithms can lead to synergy and new frontiers in fighting cyberattacks. The paper exemplifies ways to model cyberattack scenarios using simulations and generate synthetic data for testing defenses. It also discusses how DTs can be used as a crucial tool for vulnerability assessment by identifying weaknesses, prioritizing, and accelerating remediations in case of cyberattacks. Moreover, the paper demonstrates approaches for anomaly detection and threat hunting using Machine Learning (ML) and GenAI algorithms. Additionally, the paper provides impact prediction and recovery coordination methods that can be used by DT operators and stakeholders. It also introduces ways to harness the human factor by integrating training and simulation algorithms with Explainable AI (XAI) into the DT platforms. Lastly, the paper offers future applications and technologies that can be utilized in DT environments.

Classical T Tauri Stars (CTTSs) are highly variable stars that possess gas- and dust-rich disks from which planets form. Much of their variability is driven by mass accretion from the surrounding disk, a process that is still not entirely understood. A multi-epoch optical spectral monitoring campaign of four CTTSs (TW Hya, RU Lup, BP Tau, and GM Aur) was conducted along with contemporaneous HST UV spectra and ground-based photometry in an effort to determine accretion characteristics and gauge variability in this sample. Using an accretion flow model, we find that the magnetospheric truncation radius varies between 2.5-5 R* across all of our observations. There is also significant variability in all emission lines studied, particularly Halpha, Hbeta, and Hgamma. Using previously established relationships between line luminosity and accretion, we find that, on average, most lines reproduce accretion rates consistent with accretion shock modeling of HST spectra to within 0.5 dex. Looking at individual contemporaneous observations, however, these relationships are less accurate, suggesting that variability trends differ from the trends of the population and that these empirical relationships should be used with caution in studies of variability., Comment: 39 pages, 10 figures, 12 tables

Koopman operator theory offers a rigorous treatment of dynamics and has been emerging as a powerful modeling and learning-based control method enabling significant advancements across various domains of robotics. Due to its ability to represent nonlinear dynamics as a linear operator, Koopman theory offers a fresh lens through which to understand and tackle the modeling and control of complex robotic systems. Moreover, it enables incremental updates and is computationally inexpensive making it particularly appealing for real-time applications and online active learning. This review comprehensively presents recent research results on advancing Koopman operator theory across diverse domains of robotics, encompassing aerial, legged, wheeled, underwater, soft, and manipulator robotics. Furthermore, it offers practical tutorials to help new users get started as well as a treatise of more advanced topics leading to an outlook on future directions and open research questions. Taken together, these provide insights into the potential evolution of Koopman theory as applied to the field of robotics.

In this work, we show that exploiting additional variables in a mixed finite element formulation of deformation leads to an efficient physics-based character skinning algorithm. Taking as input, a user-defined rig, we show how to efficiently compute deformations of the character mesh which respect artist-supplied handle positions and orientations, but without requiring complicated constraints on the physics solver, which can cause poor performance. Rather we demonstrate an efficient, user controllable skinning pipeline that can generate compelling character deformations, using a variety of physics material models.

Context. The first interstellar objects, such as 'Oumuamua, Borisov and IM1, were discovered over the past decade. Aims. We follow the trajectories of known interstellar objects in the gravitational potential of the Milky Way galaxy to constrain their possible origin. Methods. We initiate the trajectories based on the measured velocities of the interstellar objects relative to the Local Standard of Rest. Since the scale-height of stars in the Milky-Way disk increases with age, we use the vertical excursion of each interstellar object from the Milky-Way disk mid-plane to constrain their likely age. Results. The small vertical extent of 'Oumuamua's past trajectory suggests that it originated near the mid-plane of the thin disk, implying a likely age younger than 1-2 Gyr. The maximal excursion of the comet Borisov is similar to that of the Sun, suggesting a similar age. The meteor IM1 exhibits yet larger vertical excursions, suggesting an older source. Finally, we show that human-made interstellar probes, like Voyager 1 or Pioneer 10 will arrive at the opposite side of the Milky Way disk relative to the Sun in $\sim$ 2 Gyr and return to the vicinity of the Sun before it becomes a red giant., Comment: 6 pages and 18 figures

The gas-phase velocity dispersions in disk galaxies, which trace turbulence in the interstellar medium, are observed to increase with lookback time. However, the mechanisms that set this rise in turbulence are observationally poorly constrained. To address this, we combine kiloparsec-scale ALMA observations of CO(3-2) and CO(4-3) with HST observations of H$\alpha$ to characterize the molecular gas and star formation properties of seven local analogues of main sequence galaxies at $z \sim 1-2$, drawn from the DYNAMO sample. Investigating the ''molecular gas main sequence'' on kpc-scales, we find that galaxies in our sample are more gas-rich than local star-forming galaxies at all disk positions. We measure beam smearing corrected molecular gas velocity dispersions and relate them to the molecular gas and star formation rate surface densities. Despite being relatively nearby ($z \sim 0.1$), DYNAMO galaxies exhibit high velocity dispersions and gas and star formation rate surface densities throughout their disks, when compared to local star forming samples. Comparing these measurements to predictions from star formation theory, we find very good agreements with the latest feedback-regulated star formation models. However, we find that theories which combine gravitational energy dissipation from radial gas transport with feedback over-estimate the observed molecular gas velocity dispersions., Comment: 24 pages, 12 figures, 2 tables, accepted for publication in The Astrophysical Journal

We obtain new progresses about the diameter two property and the Daugavet property in tensor product spaces. Namely, the main results of the paper are: -If $X^*$ has the WODP, then $X\widehat{\otimes}_\varepsilon Y$ has the DD2P for any Banach space $Y$. -If $X$ has the WODP, then $X\widehat{\otimes}_\pi Y$ has the DD2P for any Banach space $Y$. -If $X^*$ and $Y^*$ have the WODP then $X\widehat{\otimes}_\varepsilon Y$ has the Daugavet property. The above improve many results in the literature and establish progresses on some open questions., Comment: 17 pages

Intelligent instruction-following robots capable of improving from autonomously collected experience have the potential to transform robot learning: instead of collecting costly teleoperated demonstration data, large-scale deployment of fleets of robots can quickly collect larger quantities of autonomous data that can collectively improve their performance. However, autonomous improvement requires solving two key problems: (i) fully automating a scalable data collection procedure that can collect diverse and semantically meaningful robot data and (ii) learning from non-optimal, autonomous data with no human annotations. To this end, we propose a novel approach that addresses these challenges, allowing instruction-following policies to improve from autonomously collected data without human supervision. Our framework leverages vision-language models to collect and evaluate semantically meaningful experiences in new environments, and then utilizes a decomposition of instruction following tasks into (semantic) language-conditioned image generation and (non-semantic) goal reaching, which makes it significantly more practical to improve from this autonomously collected data without any human annotations. We carry out extensive experiments in the real world to demonstrate the effectiveness of our approach, and find that in a suite of unseen environments, the robot policy can be improved significantly with autonomously collected data. We open-source the code for our semantic autonomous improvement pipeline, as well as our autonomous dataset of 30.5K trajectories collected across five tabletop environments.