Search

Malicious Python packages make software supply chains vulnerable by exploiting trust in open-source repositories like Python Package Index (PyPI). Lack of real-time behavioral monitoring makes metadata inspection and static code analysis inadequate against advanced attack strategies such as typosquatting, covert remote access activation, and dynamic payload generation. To address these challenges, we introduce DySec, a machine learning (ML)-based dynamic analysis framework for PyPI that uses eBPF kernel and user-level probes to monitor behaviors during package installation. By capturing 36 real-time features-including system calls, network traffic, resource usage, directory access, and installation patterns-DySec detects threats like typosquatting, covert remote access activation, dynamic payload generation, and multiphase attack malware. We developed a comprehensive dataset of 14,271 Python packages, including 7,127 malicious sample traces, by executing them in a controlled isolated environment. Experimental results demonstrate that DySec achieves a 95.99\% detection accuracy with a latency of <0.5s, reducing false negatives by 78.65\% compared to static analysis and 82.24\% compared to metadata analysis. During the evaluation, DySec flagged 11 packages that PyPI classified as benign. A manual analysis, including installation behavior inspection, confirmed six of them as malicious. These findings were reported to PyPI maintainers, resulting in the removal of four packages. DySec bridges the gap between reactive traditional methods and proactive, scalable threat mitigation in open-source ecosystems by uniquely detecting malicious install-time behaviors.

Trapped-ion systems are a leading platform for quantum computing. The M{\o}lmer-S{\o}rensen (MS) gate is a widely used method for implementing controlled interactions in multipartite systems. However, due to unavoidable interactions with the environment, quantum states undergo non-unitary evolution, leading to significant deviations from ideal dynamics. Common techniques such as Quantum Process Tomography (QPT) and Bell State Tomography (BST) are typically employed to evaluate MS gate performance and to characterize noise in the system. In this letter, we propose leveraging the geometric phase as a tool for performance assessment and noise identification in the MS gate. Our findings indicate that the geometric phase is particularly sensitive to environmental noise occurring around twice the clock pulse time. Given that geometric phase measurements do not require full-state tomography, this approach offers a practical and experimentally feasible method to detect entanglement and classify the nature of noise affecting the system., Comment: Comments are welcome

Knowledge distillation is used, in generative language modeling, to train a smaller student model using the help of a larger teacher model, resulting in improved capabilities for the student model. In this paper, we formulate a more general framework for knowledge distillation where the student learns from the teacher during training, and also learns to ask for the teacher's help at test-time following rules specifying test-time restrictions. Towards this, we first formulate knowledge distillation as an entropy-regularized value optimization problem. Adopting Path Consistency Learning to solve this, leads to a new knowledge distillation algorithm using on-policy and off-policy demonstrations. We extend this using constrained reinforcement learning to a framework that incorporates the use of the teacher model as a test-time reference, within constraints. In this situation, akin to a human learner, the model needs to learn not only the learning material, but also the relative difficulty of different sections to prioritize for seeking teacher help. We examine the efficacy of our method through experiments in translation and summarization tasks, observing trends in accuracy and teacher use, noting that our approach unlocks operating points not available to the popular Speculative Decoding approach.

The blue supergiant (BSG) domain contains a large variety of stars whose past and future evolutionary paths are still highly uncertain. Since binary interaction plays a crucial role in the fate of massive stars, investigating the multiplicity among BSGs helps shed light on the fate of such objects. We aim to estimate the binary fraction of a large sample of BSGs in the Small Magellanic Cloud within the Binarity at LOw Metallicity (BLOeM) survey. In total, we selected 262 targets with spectral types B0-B3 and luminosity classes I-II. This work is based on spectroscopic data collected by the GIRAFFE instrument, mounted on the Very Large Telescope, which gathered nine epochs over three months. Our spectroscopic analysis for each target includes the individual and peak-to-peak radial velocity measurements, an investigation of the line profile variability, and a periodogram analysis to search for possible short- and long-period binaries. By applying a 20 km s$^{-1}$ threshold on the peak-to-peak radial velocities above which we would consider the star to be binary, the resulting observed spectroscopic binary fraction for our BSG sample is 23 $\pm$ 3$\%$. In addition, we derived reliable orbital periods for 41 spectroscopic binaries and potential binary candidates, among which there are 17 eclipsing binaries, including 20 SB1 and SB2 systems with periods of less than 10 days. We reported a significant drop in the binary fraction of BSGs with spectral types later than B2 and effective temperatures less than 18 kK, which could indicate the end of the main sequence phase in this temperature regime. We found no metallicity dependence in the binary fraction of BSGs, compared to existing spectroscopic surveys of the Galaxy and Large Magellanic Cloud., Comment: 18 pages, 14 figures, accepted for publication in Astronomy & Astrophysics

Genetic data collection has become ubiquitous today. The ability to meaningfully interpret genetic data has motivated its widespread use, providing crucial insights into human health and ancestry while driving important public health initiatives. Easy access to genetic testing has fueled a rapid expansion of recreational direct-to-consumer offerings. However, the growth of genetic datasets and their applications has created significant privacy and discrimination risks, as our understanding of the scientific basis for genetic traits continues to evolve. In this paper, we organize the uses of genetic data along four distinct "pillars": clinical practice, research, forensic and government use, and recreational use. Using our scientific understanding of genetics, genetic inference methods and their associated risks, and current public protections, we build a risk assessment framework that identifies key values that any governance system must preserve. We analyze case studies using this framework to assess how well existing regulatory frameworks preserve desired values. Our investigation reveals critical gaps in these frameworks and identifies specific threats to privacy and personal liberties, particularly through genetic discrimination. We propose comprehensive policy reforms to: (1) update the legal definition of genetic data to protect against modern technological capabilities, (2) expand the Genetic Information Nondiscrimination Act (GINA) to cover currently unprotected domains, and (3) establish a unified regulatory framework under a single governing body to oversee all applications of genetic data. We conclude with three open questions about genetic data: the challenges posed by its relational nature, including consent for relatives and minors; the complexities of international data transfer; and its potential integration into large language models., Comment: Submitted to FACCT 2025

Global leaders and policymakers are unified in their unequivocal commitment to decarbonization efforts in support of Net-Zero agreements. District Heating Systems (DHS), while contributing to carbon emissions due to the continued reliance on fossil fuels for heat production, are embracing more sustainable practices albeit with some sense of vulnerability as it could constrain their ability to adapt to dynamic demand and production scenarios. As demographic demands grow and renewables become the central strategy in decarbonizing the heating sector, the need for accurate demand forecasting has intensified. Advances in digitization have paved the way for Machine Learning (ML) based solutions to become the industry standard for modeling complex time series patterns. In this paper, we focus on building a Deep Learning (DL) model that uses deconstructed components of independent and dependent variables that affect heat demand as features to perform multi-step ahead forecasting of head demand. The model represents the input features in a time-frequency space and uses an attention mechanism to generate accurate forecasts. The proposed method is evaluated on a real-world dataset and the forecasting performance is assessed against LSTM and CNN-based forecasting models. Across different supply zones, the attention-based models outperforms the baselines quantitatively and qualitatively, with an Mean Absolute Error (MAE) of 0.105 with a standard deviation of 0.06kW h and a Mean Absolute Percentage Error (MAPE) of 5.4% with a standard deviation of 2.8%, in comparison the second best model with a MAE of 0.10 with a standard deviation of 0.06kW h and a MAPE of 5.6% with a standard deviation of 3%.

Rapidly rotating classical OBe stars have been proposed as the products of binary interactions, and the fraction of Be stars with compact companions implies that at least some are. However, to constrain the interaction physics spinning up the OBe stars, a large sample of homogeneously analysed OBe stars with well-determined binary characteristics and orbital parameters are required. We investigate the multiplicity properties of a sample of 18 Oe, 62 Be, and two Of?p stars observed within the BLOeM survey in the Small Magellanic Cloud. We analyse the first nine epochs of spectroscopic observations obtained over approximately three months in 2023. Radial velocities (RVs) of all stars are measured. Applying commonly-used binarity criteria we classify objects as binaries, binary candidates, and apparently single (RV stable) objects. We further inspect the spectra for double-lined spectroscopic binaries and cross-match with catalogues of X-ray sources and photometric binaries. We classify 14 OBe stars as binaries, and an additional 11 as binary candidates. The two Of?p stars are apparently single. Two more objects are most likely currently interacting binaries. Without those, the observed binary fraction for the OBe sample (78 stars) is f_OBe_obs=0.18+/-0.04 (f_obs_cand=0.32+/-0.05 including candidates). This fraction is less than half of that measured for OB stars in BLOeM. Combined with the lower fraction of SB2s, this suggests that OBe stars have indeed fundamentally different binary properties than OB stars. We find no evidence for OBe binaries with massive compact companions, in contrast to expectations from binary population synthesis. Our results support the binary scenario as an important formation channel for OBe stars, as post-interaction binaries may have been disrupted or the stripped companions of OBe stars are harder to detect., Comment: 12 pages (+appendix), 7 figures, accepted for publication in A&A

A major challenge in aligning large language models (LLMs) with human preferences is the issue of distribution shift. LLM alignment algorithms rely on static preference datasets, assuming that they accurately represent real-world user preferences. However, user preferences vary significantly across geographical regions, demographics, linguistic patterns, and evolving cultural trends. This preference distribution shift leads to catastrophic alignment failures in many real-world applications. We address this problem using the principled framework of distributionally robust optimization, and develop two novel distributionally robust direct preference optimization (DPO) algorithms, namely, Wasserstein DPO (WDPO) and Kullback-Leibler DPO (KLDPO). We characterize the sample complexity of learning the optimal policy parameters for WDPO and KLDPO. Moreover, we propose scalable gradient descent-style learning algorithms by developing suitable approximations for the challenging minimax loss functions of WDPO and KLDPO. Our empirical experiments demonstrate the superior performance of WDPO and KLDPO in substantially improving the alignment when there is a preference distribution shift.

Recent advances in generative AI have led to large multi-modal models (LMMs) capable of simultaneously processing inputs of various modalities such as text, images, video, and audio. While these models demonstrate impressive capabilities, efficiently serving them in production environments poses significant challenges due to their complex architectures and heterogeneous resource requirements. We present the first comprehensive systems analysis of two prominent LMM architectures, decoder-only and cross-attention, on six representative open-source models. We investigate their multi-stage inference pipelines and resource utilization patterns that lead to unique systems design implications. We also present an in-depth analysis of production LMM inference traces, uncovering unique workload characteristics, including variable, heavy-tailed request distributions, diverse modal combinations, and bursty traffic patterns. Our key findings reveal that different LMM inference stages exhibit highly heterogeneous performance characteristics and resource demands, while concurrent requests across modalities lead to significant performance interference. To address these challenges, we propose a decoupled serving architecture that enables independent resource allocation and adaptive scaling for each stage. We further propose optimizations such as stage colocation to maximize throughput and resource utilization while meeting the latency objectives.

Text-to-SQL systems have unlocked easier access to critical data insights by enabling natural language queries over structured databases. However, deploying such systems in enterprise environments remains challenging due to factors such as large, complex schemas (> 3000 columns), diverse SQL dialects (e.g., BigQuery, Snowflake) and sophisticated query requirements (e.g., transformation, analytics). Current state-of-the-art performance on the Spider 2.0 dataset -- a benchmark built to mimic such complex environments -- remains limited at 20%. Key limitations include inadequate instruction-following, poor long-context comprehension, weak self-refinement, and insufficient dialect-specific knowledge. To address these gaps, we propose ReFoRCE (Self-Refinement Agent with Format Restriction and Column Exploration) which introduces (1) table compression to mitigate long-context limitations (2) format restriction to ensure accurate answer format, and (3) iterative column exploration for enhanced schema understanding. Additionally, it employs self-refinement pipeline consisting of (1) parallelized workflows with voting mechanisms and (2) a Common Table Expression (CTE) based refinement approach to handle unresolved cases. ReFoRCE achieves state-of-the-art results scoring 31.26 on the Spider 2.0-Snow and scoring 30.35 on the Spider 2.0-Lite tasks., Comment: 13 pages, 1 figure

Training a neural network for pixel based classification task using low resolution Landsat images is difficult as the size of the training data is usually small due to less number of available pixels that represent a single class without any mixing with other classes. Due to this scarcity of training data, neural network may not be able to attain expected level of accuracy. This limitation could be overcome using a generative network that aims to generate synthetic data having the same distribution as the sample data with which it is trained. In this work, we have proposed a methodology for improving the performance of ANN classifier to identify built-up pixels in the Landsat$7$ image with the help of developing a simple GAN architecture that could generate synthetic training pixels when trained using original set of sample built-up pixels. To ensure that the marginal and joint distributions of all the bands corresponding to the generated and original set of pixels are indistinguishable, non-parametric Kolmogorov Smirnov Test and Ball Divergence based Equality of Distributions Test have been performed respectively. It has been observed that the overall accuracy and kappa coefficient of the ANN model for built-up classification have continuously improved from $0.9331$ to $0.9983$ and $0.8277$ to $0.9958$ respectively, with the inclusion of generated sets of built-up pixels to the original one.

We address the problem of best policy identification in preference-based reinforcement learning (PbRL), where learning occurs from noisy binary preferences over trajectory pairs rather than explicit numerical rewards. This approach is useful for post-training optimization of generative AI models during multi-turn user interactions, where preference feedback is more robust than handcrafted reward models. In this setting, learning is driven by both an offline preference dataset -- collected from a rater of unknown 'competence' -- and online data collected with pure exploration. Since offline datasets may exhibit out-of-distribution (OOD) biases, principled online data collection is necessary. To address this, we propose Posterior Sampling for Preference Learning ($\mathsf{PSPL}$), a novel algorithm inspired by Top-Two Thompson Sampling, that maintains independent posteriors over the true reward model and transition dynamics. We provide the first theoretical guarantees for PbRL in this setting, establishing an upper bound on the simple Bayesian regret of $\mathsf{PSPL}$. Since the exact algorithm can be computationally impractical, we also provide an approximate version that outperforms existing baselines.

A vast amount of medical knowledge is available for public use through online health forums, and question-answering platforms on social media. The majority of the population in the United States doesn't have the right amount of health literacy to make the best use of that information. Health literacy means the ability to obtain and comprehend the basic health information to make appropriate health decisions. To build the bridge between this gap, organizations advocate adapting this medical knowledge into plain language. Building robust systems to automate the adaptations helps both medical and non-medical professionals best leverage the available information online. The goal of the Plain Language Adaptation of Biomedical Abstracts (PLABA) track is to adapt the biomedical abstracts in English language extracted from PubMed based on the questions asked in MedlinePlus for the general public using plain language at the sentence level. As part of this track, we leveraged the best open-source Large Language Models suitable and fine-tuned for dialog use cases. We compare and present the results for all of our systems and our ranking among the other participants' submissions. Our top performing GPT-4 based model ranked first in the avg. simplicity measure and 3rd on the avg. accuracy measure., Comment: 8 pages, 2 figures, 4 tables

We investigate the problem of strong coordination over a multiple-access channel (MAC) with cribbing encoders. In this configuration, two encoders observe independent and identically distributed (i.i.d.) samples of a source random variable each and encode the inputs to the MAC. The decoder which observes the output of the MAC together with side-information, must generate approximately i.i.d. samples of another random variable which is jointly distributed with the two sources and the side information. We also allow for possible encoder cooperation, where one of the encoders can non-causally crib from the other encoders input. Independent pairwise shared randomness is assumed between each encoder and the decoder at limited rates. Firstly, in the presence of cribbing, we derive an achievable region based on joint source-channel coding. We also prove that in the absence of cribbing, our inner bound is tight for the special case when the MAC is composed of deterministic links, and the sources are conditionally independent given the side information. We then explicitly compute the regions for an example both with and without cribbing between the encoders, and demonstrate that cribbing strictly improves upon the achievable region., Comment: 7 pages, 1 figure. arXiv admin note: substantial text overlap with arXiv:2411.14123

Design space exploration (DSE) plays a crucial role in enabling custom hardware architectures, particularly for emerging applications like AI, where optimized and specialized designs are essential. With the growing complexity of deep neural networks (DNNs) and the introduction of advanced foundational models (FMs), the design space for DNN accelerators is expanding at an exponential rate. Additionally, this space is highly non-uniform and non-convex, making it increasingly difficult to navigate and optimize. Traditional DSE techniques rely on search-based methods, which involve iterative sampling of the design space to find the optimal solution. However, this process is both time-consuming and often fails to converge to the global optima for such design spaces. Recently, AIrchitect v1, the first attempt to address the limitations of search-based techniques, transformed DSE into a constant-time classification problem using recommendation networks. In this work, we propose AIrchitect v2, a more accurate and generalizable learning-based DSE technique applicable to large-scale design spaces that overcomes the shortcomings of earlier approaches. Specifically, we devise an encoder-decoder transformer model that (a) encodes the complex design space into a uniform intermediate representation using contrastive learning and (b) leverages a novel unified representation blending the advantages of classification and regression to effectively explore the large DSE space without sacrificing accuracy. Experimental results evaluated on 10^5 real DNN workloads demonstrate that, on average, AIrchitect v2 outperforms existing techniques by 15% in identifying optimal design points. Furthermore, to demonstrate the generalizability of our method, we evaluate performance on unseen model workloads (LLMs) and attain a 1.7x improvement in inference latency on the identified hardware architecture., Comment: Accepted to DATE 2025

Concept erasure techniques have recently gained significant attention for their potential to remove unwanted concepts from text-to-image models. While these methods often demonstrate success in controlled scenarios, their robustness in real-world applications and readiness for deployment remain uncertain. In this work, we identify a critical gap in evaluating sanitized models, particularly in terms of their performance across various concept dimensions. We systematically investigate the failure modes of current concept erasure techniques, with a focus on visually similar, binomial, and semantically related concepts. We propose that these interconnected relationships give rise to a phenomenon of concept entanglement resulting in ripple effects and degradation in image quality. To facilitate more comprehensive evaluation, we introduce EraseBENCH, a multi-dimensional benchmark designed to assess concept erasure methods with greater depth. Our dataset includes over 100 diverse concepts and more than 1,000 tailored prompts, paired with a comprehensive suite of metrics that together offer a holistic view of erasure efficacy. Our findings reveal that even state-of-the-art techniques struggle with maintaining quality post-erasure, indicating that these approaches are not yet ready for real-world deployment. This highlights the gap in reliability of the concept erasure techniques., Comment: 11 pages main; 9 pages supplemental material

Text-to-image (T2I) generation has made significant advances in recent years, but challenges still remain in the generation of perceptual artifacts, misalignment with complex prompts, and safety. The prevailing approach to address these issues involves collecting human feedback on generated images, training reward models to estimate human feedback, and then fine-tuning T2I models based on the reward models to align them with human preferences. However, while existing reward fine-tuning methods can produce images with higher rewards, they may change model behavior in unexpected ways. For example, fine-tuning for one quality aspect (e.g., safety) may degrade other aspects (e.g., prompt alignment), or may lead to reward hacking (e.g., finding a way to increase rewards without having the intended effect). In this paper, we propose Focus-N-Fix, a region-aware fine-tuning method that trains models to correct only previously problematic image regions. The resulting fine-tuned model generates images with the same high-level structure as the original model but shows significant improvements in regions where the original model was deficient in safety (over-sexualization and violence), plausibility, or other criteria. Our experiments demonstrate that Focus-N-Fix improves these localized quality aspects with little or no degradation to others and typically imperceptible changes in the rest of the image. Disclaimer: This paper contains images that may be overly sexual, violent, offensive, or harmful.

To accelerate ultra-relativistic charged particles, such as electrons, using an electromagnetic pulse along a hollow-core waveguide, the pulse needs to have a longitudinal electric field component and a phase velocity of $c$, the speed of light in vacuum. We derive an approximate closed-form expression for the wavelength at which the phase velocity of the TM$_{01}$ mode in a metal-clad hollow-core fiber with a dielectric layer is $c$. The expression is then used to derive conditions for material dispersion required of the dielectric in order to simultaneously have $c$ phase and group velocity. It is shown that the dispersion would need to be so heavily anomalous that the losses in the anomalously dispersive regime would render such a particle accelerator useless. We then propose the utilization of gain in the form of two spectral peaks in the dielectric to circumvent the otherwise fundamental limits and allow for TM$_{01}$ pulses with $c$ phase and group velocity and thus arbitrary length-scaling of fiber-based electron accelerators. In theory, the group velocity dispersion could also be made zero with further gain-assisted dispersion engineering, allowing for the co-propagation of dispersionless electromagnetic pulses with relativistic particles.

In this work, we develop a method to identify continuous-time nonlinear networked dynamics via the Koopman operator framework. The proposed technique consists of two steps: the first step identifies the neighbors of each node, and the second step identifies the local dynamics at each node from a predefined set of dictionary functions. The technique can be used to either identify the Boolean network of interactions (first step) or to solve the complete network identification problem that amounts to estimating the local node dynamics and the nature of the node interactions (first and second steps). Under a sparsity assumption, the data required to identify the complete network dynamics is significantly less than the total number of dictionary functions describing the dynamics. This makes the proposed approach attractive for identifying large dimensional networks with sparse interconnections. The accuracy and performance of the proposed identification technique are demonstrated with several examples., Comment: 29 pages, 9 figures

Despite their elegance and widespread use, the current Geometric Measures (GMs) of entanglement exhibit a significant limitation: they fail to effectively distinguish Local Unitary (LU) inequivalent states due to the inherent nature of their definition. We illustrate the impact of this limitation using the fidelity of the teleportation protocol as an example. To address this issue, we introduce the Sharp Geometric Measure (SGM) by modifying the standard definition of the Geometric Measure. We show that the closed-form expression of the SGM can be equivalently derived using the Riemannian structure of both the composite state space and the reduced density operator space. Furthermore, we define a measure of Genuine Multipartite Entanglement (GME) derived from the SGM, which we term GMS. We demonstrate that GMS resolves two key limitations of some existing GME measures, thereby establishing its utility and effectiveness in quantifying GME., Comment: Comments are welcome

A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of $\Lambda_{35,\text{hex}} = 2.15(2)$, $\Lambda_{35,\text{walk}} = 1.69(6)$, and $\Lambda_{35,\text{iSWAP}} = 1.56(2)$, achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design., Comment: 11 pages, 5 figures, Supplementary Information

Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors have focused primarily on the surface code, which offers a high error threshold but poses limitations for logical operations. In contrast, the color code enables much more efficient logic, although it requires more complex stabilizer measurements and decoding techniques. Measuring these stabilizers in planar architectures such as superconducting qubits is challenging, and so far, realizations of color codes have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations. Scaling the code distance from three to five suppresses logical errors by a factor of $\Lambda_{3/5}$ = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and furthermore that the color code may be more efficient than the surface code with modest device improvements. Using logical randomized benchmarking, we find that transversal Clifford gates add an error of only 0.0027(3), which is substantially less than the error of an idling error correction cycle. We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection (retaining about 75% of the data). Finally, we successfully teleport logical states between distance-three color codes using lattice surgery, with teleported state fidelities between 86.5(1)% and 90.7(1)%. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

We introduce an entanglement measure, the Modified Bloch Norm ($MBN$), for finite-dimensional bipartite mixed states, based on the improved Bloch matrix criteria. $MBN$ is demonstrated to be effective in analyzing the dynamics of bound entanglement--a valuable resource for quantum protocols where free entanglement may not be available. Through examples, we illustrate the applications of $MBN$ in accurately estimating the Entanglement Sudden Death (ESD) time and detecting behaviour such as the freezing of bound entanglement. Additionally, we show that the error rate for entanglement measured using state estimation from a limited number of measurement copies is significantly lower when using $MBN$ compared to negativity. This demonstrates the robustness of $MBN$ under practical constraints., Comment: Comments are welcome

NGC 346 is a young cluster with numerous hot OB stars. It is part of the Small Magellanic Cloud (SMC), and has an average metallicity that is one-seventh of the Milky Way's. A detailed study of its stellar content provides a unique opportunity to understand the stellar and wind properties of massive stars in low-metallicity environments, and enables us to improve our understanding of star formation and stellar evolution. The fundamental stellar parameters defining a star's spectral appearance are its effective surface temperature, surface gravity, and projected rotational velocity. Unfortunately, these parameters cannot be obtained independently from only H and He spectral features as they are partially degenerate. With this work we aim to overcome this degeneracy by applying a newly developed Bayesian statistic technique that can fit these three parameters simultaneously. Multi-epoch optical spectra are used in combination with a Bayesian statistic technique to fit stellar properties based on a publicly available grid of synthetic spectra of stellar atmospheres. The use of all of the multi-epoch observations simultaneously allows the identification of binaries. The stellar parameters for 34 OB stars within the core of NGC 346 are derived and presented here. By the use of both $\mathrm{He}\textsc{i}$ and $\mathrm{He}\textsc{ii}$ lines, the partial degeneracy between the stellar parameters of effective surface temperature, surface gravity, and projected rotational velocity is overcome. A lower limit to the binary fraction of the sample of stars is found to be at least 46%. Based on comparisons with analysis conducted on an overlapping sample of stars within NGC 346, the Bayesian statistic technique approach is shown to be a viable method to measure stellar parameters for hot massive stars in low-metallicity environments even when only low-resolution spectra are available.}, Comment: 14 pages. 11 figures. Additional figures available, see https://doi.org/10.5281/zenodo.13991997

We address the problem of personalized, interactive text-to-image (T2I) generation, designing a reinforcement learning (RL) agent which iteratively improves a set of generated images for a user through a sequence of prompt expansions. Using human raters, we create a novel dataset of sequential preferences, which we leverage, together with large-scale open-source (non-sequential) datasets. We construct user-preference and user-choice models using an EM strategy and identify varying user preference types. We then leverage a large multimodal language model (LMM) and a value-based RL approach to suggest a personalized and diverse slate of prompt expansions to the user. Our Personalized And Sequential Text-to-image Agent (PASTA) extends T2I models with personalized multi-turn capabilities, fostering collaborative co-creation and addressing uncertainty or underspecification in a user's intent. We evaluate PASTA using human raters, showing significant improvement compared to baseline methods. We also release our sequential rater dataset and simulated user-rater interactions to support future research in personalized, multi-turn T2I generation., Comment: Link to PASTA dataset: https://www.kaggle.com/datasets/googleai/pasta-data

In the current fast-paced digital environment, enterprises are striving to offer a seamless and integrated customer experience across multiple touchpoints. This improved experience often leads to higher conversion rates and increased customer loyalty. To deliver such an experience, enterprises must think beyond the traditional boundaries of their architecture. The architecture of the digital ecosystem is expanding and becoming more complex, achieved either by developing advanced features in-house or by integrating with third-party solutions, thus extending the boundaries of the enterprise architecture. This complexity poses significant challenges for both observability and security in a digital ecosystem, both of which are essential for maintaining robust and resilient systems. Observability entails monitoring and understanding the internal state of a system through logging, tracing, and metrics collection, allowing organizations to diagnose performance issues and detect anomalies in real time. Meanwhile, security is focused on protecting sensitive data and ensuring service integrity by defending against threats and vulnerabilities. The data collected through these observability practices can be analyzed to identify patterns and detect potential security threats or data leaks. This paper examines the interconnections between observability and security within digital ecosystem architectures, emphasizing how improved observability can strengthen security measures. The paper also discusses studies conducted in the AI/ML field aimed at enhancing security through the use of observability. These studies explore how advanced machine learning techniques can be applied to observability data to improve security measures and detect anomalies more effectively.

High-quality machine learning (ML)-ready datasets play a foundational role in developing new artificial intelligence (AI) models or fine-tuning existing models for scientific applications such as weather and climate analysis. Unfortunately, despite the growing development of new deep learning models for weather and climate, there is a scarcity of curated, pre-processed machine learning (ML)-ready datasets. Curating such high-quality datasets for developing new models is challenging particularly because the modality of the input data varies significantly for different downstream tasks addressing different atmospheric scales (spatial and temporal). Here we introduce WxC-Bench (Weather and Climate Bench), a multi-modal dataset designed to support the development of generalizable AI models for downstream use-cases in weather and climate research. WxC-Bench is designed as a dataset of datasets for developing ML-models for a complex weather and climate system, addressing selected downstream tasks as machine learning phenomenon. WxC-Bench encompasses several atmospheric processes from meso-$\beta$ (20 - 200 km) scale to synoptic scales (2500 km), such as aviation turbulence, hurricane intensity and track monitoring, weather analog search, gravity wave parameterization, and natural language report generation. We provide a comprehensive description of the dataset and also present a technical validation for baseline analysis. The dataset and code to prepare the ML-ready data have been made publicly available on Hugging Face -- https://huggingface.co/datasets/nasa-impact/WxC-Bench

This technical report presents Prithvi-EO-2.0, a new geospatial foundation model that offers significant improvements over its predecessor, Prithvi-EO-1.0. Trained on 4.2M global time series samples from NASA's Harmonized Landsat and Sentinel-2 data archive at 30m resolution, the new 300M and 600M parameter models incorporate temporal and location embeddings for enhanced performance across various geospatial tasks. Through extensive benchmarking with GEO-Bench, the 600M version outperforms the previous Prithvi-EO model by 8\% across a range of tasks. It also outperforms six other geospatial foundation models when benchmarked on remote sensing tasks from different domains and resolutions (i.e. from 0.1m to 15m). The results demonstrate the versatility of the model in both classical earth observation and high-resolution applications. Early involvement of end-users and subject matter experts (SMEs) are among the key factors that contributed to the project's success. In particular, SME involvement allowed for constant feedback on model and dataset design, as well as successful customization for diverse SME-led applications in disaster response, land use and crop mapping, and ecosystem dynamics monitoring. Prithvi-EO-2.0 is available on Hugging Face and IBM terratorch, with additional resources on GitHub. The project exemplifies the Trusted Open Science approach embraced by all involved organizations.

Modern distributed applications in healthcare, supply chain, and the Internet of Things handle a large amount of data in a diverse application setting with multiple stakeholders. Such applications leverage advanced artificial intelligence (AI) and machine learning algorithms to automate business processes. The proliferation of modern AI technologies increases the data demand. However, real-world networks often include private and sensitive information of businesses, users, and other organizations. Emerging data-protection regulations such as the General Data Protection Regulation (GDPR) and the California Consumer Privacy Act (CCPA) introduce policies around collecting, storing, and managing digital data. While Blockchain technology offers transparency, auditability, and immutability for multi-stakeholder applications, it lacks inherent support for privacy. Typically, privacy support is added to a blockchain-based application by incorporating cryptographic schemes, consent mechanisms, and self-sovereign identity. This article surveys the literature on blockchain-based privacy-preserving systems and identifies the tools for protecting privacy. Besides, consent mechanisms and identity management in the context of blockchain-based systems are also analyzed. The article concludes by highlighting the list of open challenges and further research opportunities.

Calibration is crucial as large language models (LLMs) are increasingly deployed to convert natural language queries into SQL for commercial databases. In this work, we investigate calibration techniques for assigning confidence to generated SQL queries. We show that a straightforward baseline -- deriving confidence from the model's full-sequence probability -- outperforms recent methods that rely on follow-up prompts for self-checking and confidence verbalization. Our comprehensive evaluation, conducted across two widely-used Text-to-SQL benchmarks and multiple LLM architectures, provides valuable insights into the effectiveness of various calibration strategies.

Massive stars lead the ionization and mechanical feedback within young star-forming regions. The Large Magellanic Cloud (LMC) is an ideal galaxy for studying individual massive stars and quantifying their feedback contribution to the environment. We analyze eight exemplary targets in LMC N11 B from the Hubble UV Legacy Library of Young Stars as Essential Standards (ULLYSES) program, using novel spectra from HST (COS and STIS) in the UV, and from VLT (X-shooter) in the optical. We model the spectra of early to late O-type stars by using state-of-the-art PoWR atmosphere models. We determine the stellar and wind parameters (e.g., $T_\star$, $\log g$, $L_{\star}$, $\dot{M}$, $v_\infty$) of the analyzed objects, chemical abundances (C, N, O), ionizing and mechanical feedback ($Q_\mathrm{H}$, $Q_\mathrm{He{\small{I}}}$, $Q_\mathrm{He{\small{II}}}$, $L_\mathrm{mec}$) and X-rays. We report ages of $2-4.5$ Myr and masses of $30-60$ $M_\odot$ for the analyzed stars in N11 B, consistent with a scenario of sequential star formation. We note that the observed wind-momentum luminosity relation is consistent with theoretical predictions. We detect nitrogen enrichment in most of the stars, up to a factor of seven. However, we do not find a correlation between nitrogen enrichment and projected rotational velocity. Finally, based on their spectral type, we estimate the total ionizing photons injected from the O-type stars in N11 B into its environment. We report $\log$ ($\sum$ $Q_\mathrm{H}$)$=50.5$ ph s$^{-1}$, $\log$ ($\sum$ $Q_\mathrm{He{\small{I}}}$)$=49.6$ ph s$^{-1}$ and $\log$ ($\sum$ $Q_\mathrm{He{\small{II}}}$)$=44.4$ ph s$^{-1}$, consistent with the total ionizing budget in N11., Comment: Accepted in Astronomy and Astrophysics

A fundamental problem in decentralized networked systems is to coordinate actions of different agents so that they reach a state of agreement. In such applications, it is additionally desirable that the actions at various nodes may not be anticipated by malicious eavesdroppers. Motivated by this, we investigate the problem of secure multi-terminal strong coordination aided by a multiple-access wiretap channel. In this setup, independent and identically distributed copies of correlated sources are observed by two transmitters who encode the channel inputs to the MAC-WT. The legitimate receiver observing the channel output and side information correlated with the sources must produce approximately i.i.d. copies of an output variable jointly distributed with the sources. Furthermore, we demand that an external eavesdropper learns essentially nothin g about the sources and the simulated output sequence by observing its own MAC-WT output. This setting is aided by the presence of independent pairwise shared randomness between each encoder and the legitimate decoder, that is unavailable to the eavesdropper. We derive an achievable rate region based on a combination of coordination coding and wiretap coding, along with an outer bound. The inner bound is shown to be tight and a complete characterization is derived for the special case when the sources are conditionally independent given the decoder side information and the legitimate channel is composed of deterministic links. Further, we also analyze a more general scenario with possible encoder cooperation, where one of the encoders can non-causally crib from the other encoders input, for which an achievable rate region is proposed. We then explicitly compute the rate regions for an example both with and without cribbing between the encoders, and demonstrate that cribbing strictly improves upon the achievable rate region., Comment: Extended version of ISIT 2024 paper

We present results for the distance sensitivity oracle (DSO) problem, where one needs to preprocess a given directed weighted graph $G=(V,E)$ in order to answer queries about the shortest path distance from $s$ to $t$ in $G$ that avoids edge $e$, for any $s,t \in V, e \in E$. No non-trivial results are known for DSO in the distributed CONGEST model even though it is of importance to maintain efficient communication under an edge failure. Let $n=|V|$, and let $D$ be the undirected diameter of $G$. Our first DSO algorithm optimizes query response rounds and can answer a batch of any $k\geq 1$ queries in $O(k+D)$ rounds after taking $\tilde{O}(n^{3/2})$ rounds to preprocess $G$. Our second algorithm takes $\tilde{O}(n)$ rounds for preprocessing, and then it can answer any batch of $k\geq 1$ queries in $\tilde{O}(k\sqrt{n}+D)$ rounds. We complement these algorithms with some unconditional CONGEST lower bounds that give trade-offs between preprocessing rounds and rounds needed to answer queries. Additionally, we present almost-optimal upper and lower bounds for the related all pairs second simple shortest path (2-APSiSP) problem, where for all pairs of vertices $x,y \in V$, we need to compute the minimum weight of a simple $x$-$y$ path that differs from the precomputed $x$-$y$ shortest path by at least one edge.

The rapid development in large language models (LLMs) has transformed the landscape of natural language processing and understanding (NLP/NLU), offering significant benefits across various domains. However, when applied to scientific research, these powerful models exhibit critical failure modes related to scientific integrity and trustworthiness. Existing general-purpose LLM guardrails are insufficient to address these unique challenges in the scientific domain. We provide comprehensive guidelines for deploying LLM guardrails in the scientific domain. We identify specific challenges -- including time sensitivity, knowledge contextualization, conflict resolution, and intellectual property concerns -- and propose a guideline framework for the guardrails that can align with scientific needs. These guardrail dimensions include trustworthiness, ethics & bias, safety, and legal aspects. We also outline in detail the implementation strategies that employ white-box, black-box, and gray-box methodologies that can be enforced within scientific contexts.

Mass loss through a stellar wind is an important physical process that steers the evolution of massive stars and controls the properties of their end-of-life products, such as the supernova type and the mass of compact remnants. For an accurate mass loss determination, the inhomogeneities in the wind, known as clumping, needs to be taking into account. We aim to improve empirical estimates of mass loss and wind clumping for hot main-sequence massive stars, study the dependence of both properties on the metallicity, and compare the theoretical predictions to our findings. We analyzed the optical and UV spectra of 13 O-type stars in the Small Magellanic Cloud galaxy, which has a metallicity of $\sim 0.2\,Z_\odot$. We quantified the stellar atmosphere, outflow, and wind-clumping properties. To probe the role of metallicity, we compared our findings to studies of Galactic and Large Magellanic Cloud samples that were analyzed with similar methods. We find significant variations in the wind-clumping properties of the target stars, with clumping starting at flow velocities $0.01 - 0.23$ of the terminal wind velocity and reaching clumping factors $f_{\rm cl} = 2 - 30$. In the luminosity ($\log L / L_{\odot} = 5.0 - 6.0$) and metallicity ($Z/Z_{\odot} = 0.2 - 1$) range we considered, we find that the scaling of the mass loss $\dot{M}$ with metallicity $Z$ varies with luminosity. At $\log L/L_{\odot} = 5.75$, we find $\dot{M} \propto Z^m$ with $m = 1.02 \pm 0.30$, in agreement with pioneering work in the field. For lower luminosities, however, we obtain a significantly steeper scaling of $m > 2$. The monotonically decreasing $m(L)$ behavior adds a complexity to the functional description of the mass-loss rate of hot massive stars. Although the trend is present in the predictions, it is much weaker than we found here., Comment: 37 pages, 29 figures. Accepted for publication in Astronomy and Astrophysics

Quantization of foundational models (FMs) is significantly more challenging than traditional DNNs due to the emergence of large magnitude features called outliers. Existing outlier-aware algorithm/architecture co-design techniques either use mixed-precision, retaining outliers at high precision but compromise hardware efficiency, or quantize inliers and outliers at the same precision, improving hardware efficiency at the cost of accuracy. To address this mutual exclusivity, in this paper, we propose MicroScopiQ, a novel co-design technique that leverages pruning to complement outlier-aware quantization. MicroScopiQ retains outliers at higher precision while pruning a certain fraction of least important weights to distribute the additional outlier bits; ensuring high accuracy, aligned memory and hardware efficiency. We design a high-throughput, low overhead accelerator architecture composed of simple multi-precision INT processing elements and a novel network-on-chip called ReCoN that efficiently abstracts the complexity of supporting high-precision outliers. Additionally, unlike existing alternatives, MicroScopiQ does not assume any locality of outlier weights, enabling applicability to a broad range of FMs. Extensive experiments across various quantization settings show that MicroScopiQ achieves SoTA quantization performance while simultaneously improving inference performance by 3x and reducing energy by 2x over existing alternatives., Comment: Preprint under review

Large language models (LLMs) such as ChatGPT are fine-tuned on large and diverse instruction-following corpora, and can generalize to new tasks. However, those instruction-tuned LLMs often perform poorly in specialized medical natural language understanding (NLU) tasks that require domain knowledge, granular text comprehension, and structured data extraction. To bridge the gap, we: (1) propose a unified prompting format for 7 important NLU tasks, % through span extraction and multi-choice question-answering (QA), (2) curate an instruction-tuning dataset, MNLU-Instruct, utilizing diverse existing open-source medical NLU corpora, and (3) develop BioMistral-NLU, a generalizable medical NLU model, through fine-tuning BioMistral on MNLU-Instruct. We evaluate BioMistral-NLU in a zero-shot setting, across 6 important NLU tasks, from two widely adopted medical NLU benchmarks: Biomedical Language Understanding Evaluation (BLUE) and Biomedical Language Understanding and Reasoning Benchmark (BLURB). Our experiments show that our BioMistral-NLU outperforms the original BioMistral, as well as the proprietary LLMs - ChatGPT and GPT-4. Our dataset-agnostic prompting strategy and instruction tuning step over diverse NLU tasks enhance LLMs' generalizability across diverse medical NLU tasks. Our ablation experiments show that instruction-tuning on a wider variety of tasks, even when the total number of training instances remains constant, enhances downstream zero-shot generalization., Comment: 3 figures an 5 tables

Each request in LLM inference goes through two phases: compute-bound prefill and memory-bandwidth-bound decode. To improve GPU utilization, recent systems use hybrid batching that combines the prefill and decode phases of different requests into the same batch. This approach optimizes linear operations but remains inefficient for attention computation because existing attention kernels specialize execution independently for the prefill and decode phases. In this paper, we present POD-Attention - the first GPU kernel that efficiently computes attention for hybrid batches. POD-Attention aims to maximize the utilization of both compute and memory bandwidth by carefully allocating the GPU's resources such that prefill and decode operations happen concurrently on the same multiprocessor. POD-Attention speeds up attention computation by up to $59\%$ (mean $28\%$), enabling higher throughput and lower latency LLM inference compared to the use of independently optimized prefill and decode attention kernels., Comment: Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2 (ASPLOS '25), March 30 - April 3, 2025, Rotterdam, Netherlands

Field-induced assembly of colloidal particles into structures of desired configurations is extremely relevant from the viewpoint of producing field-assembled micro-swimmers and reconfigurable smart materials. However, the behaviour of colloidal particles under the influence of alternating current (AC) electric fields remains a topic of ongoing investigation due to the complex effects of various control parameters. Here we examine the role of several factors including particle size, zeta potential, voltage and frequency of the applied field in the formation of different structural configurations ranging from crystals to glasses, and observe interesting and unexpected behaviours in the structure formation. Additionally, we investigate the dynamics of structure formation; the nature of diffusion and active motion in these out-of-equilibrium systems, and show how that leads to the formation of close-packed or open structures. Lastly, we investigate the frequency-driven disorder-order-disorder phase transition in colloidal crystals, which is a starting point for building reconfigurable systems. Our findings contribute to a deeper understanding of the significant roles of various factors in electric field-induced assembly of colloidal particles, as well as pave the way for potential applications in micro-robotics and next-generation materials., Comment: 10 pages, 7 figures

In the current digital landscape, supply chains have transformed into complex networks driven by the Internet of Things (IoT), necessitating enhanced data sharing and processing capabilities to ensure traceability and transparency. Leveraging Blockchain technology in IoT applications advances reliability and transparency in near-real-time insight extraction processes. However, it raises significant concerns regarding data privacy. Existing privacy-preserving approaches often rely on Smart Contracts for automation and Zero Knowledge Proofs (ZKP) for privacy. However, apart from being inflexible in adopting system changes while effectively protecting data confidentiality, these approaches introduce significant computational expenses and overheads that make them impractical for dynamic supply chain environments. To address these challenges, we propose ZK-DPPS, a framework that ensures zero-knowledge communications without the need for traditional ZKPs. In ZK-DPPS, privacy is preserved through a combination of Fully Homomorphic Encryption (FHE) for computations and Secure Multi-Party Computations (SMPC) for key reconstruction. To ensure that the raw data remains private throughout the entire process, we use FHE to execute computations directly on encrypted data. The "zero-knowledge" aspect of ZK-DPPS refers to the system's ability to process and share data insights without exposing sensitive information, thus offering a practical and efficient alternative to ZKP-based methods. We demonstrate the efficacy of ZK-DPPS through a simulated supply chain scenario, showcasing its ability to tackle the dual challenges of privacy preservation and computational trust in decentralised environments.

Let $X$ be a smooth projective variety defined over a number field $k$ that has Brauer-Manin obstruction to the existence of rational points. We study the orders of the Brauer classes which capture the obstruction. We prove that one may require elements of arbitrarily large order to capture the obstruction. In other words, the exponent of the group which captures the obstruction has no upper bound., Comment: 8 pages. Comments are welcome

The precision measurement of the tritium $\beta$-decay spectrum performed by the KATRIN experiment provides a unique way to search for general neutrino interactions (GNI). All theoretical allowed GNI terms involving neutrinos are incorporated into a low-energy effective field theory, and can be identified by specific signatures in the measured tritium $\beta$-spectrum. In this paper an effective description of the impact of GNI on the $\beta$-spectrum is formulated and the first constraints on the effective GNI parameters are derived based on the 4 million electrons collected in the second measurement campaign of KATRIN in 2019. In addition, constraints on selected types of interactions are investigated, thereby exploring the potential of KATRIN to search for more specific new physics cases, including a right-handed W boson, a charged Higgs or leptoquarks.

A wide family of two dimensional (2D) systems, including stripe-phase superconductors, sliding Luttinger liquids, and anisotropic 2D materials, can be modeled by an array of coupled one-dimensional (1D) electron channels or nanowire arrays. Here we report experiments in arrays of conducting nanowires with gate and field tunable interwire coupling, that are programmed at the LaAlO$_3$/SrTiO$_3$ interface. We find a magnetically-tuned metal-to-insulator transition in which the transverse resistance of the nanowire array increases by up to four orders of magnitude. To explain this behavior, we develop a minimal model of a coupled two-wire system which agrees well with observed phenomena. These nanowire arrays can serve as a model systems to understand the origin of exotic behavior in correlated materials via analog quantum simulation.

Coupled quasi-one-dimensional (quasi-1D) electron systems host rich emergent physics that cannot be accounted for by understanding isolated 1D electron systems alone. Open questions remain about how transport in these arrays can be manipulated by the application of external electric and magnetic fields. In this theoretical study, we consider a pair of coupled nanowires with non-interacting electrons. We find that a metal-insulator transition is induced by an out-of-plane magnetic field and a transverse potential bias on an array of such coupled wires. We demonstrate the existence of distinct conductance features and highlight the crucial role played by the field dependence of the interwire potential barrier on transport properties. These predictions agree well with transport experiments performed on coupled nanowires sketched on an LaAlO3/SrTiO3 interface. Since our model makes minimal assumptions, we expect our predictions to hold for a wide class of coupled 1D systems.

The Fermi polaron problem, which describes a mobile impurity that interacts with a spin-polarized Fermi sea, is a paradigmatic system in quantum many-body physics and has been challenging to address quantitatively in its strong coupling regime. We present the first controlled thermodynamic calculations for the Fermi polaron at strong coupling using finite-temperature auxiliary-field quantum Monte Carlo (AFMC) methods in the framework of the canonical ensemble. Modeled as a spin-imbalanced system, the Fermi polaron has a Monte Carlo sign problem, but we show that it is moderate over a wide range of temperatures and coupling strengths beyond the unitary limit of the BCS-BEC crossover. We calculate the contact, a quantity which measures the strength of the short-range correlations, as a function of temperature at unitarity and as a function of the coupling strength at fixed temperature and find good agreement with a variational approach based on one particle-hole excitation of the Fermi sea. We compare our results for the contact with recent experiments and find good agreement at unitarity (within error bars) but discrepancies away from unitarity on the BEC side of the crossover. We also calculate the thermal energy gap at unitarity as a function of temperature., Comment: 8 pages, 7 figures