Search

HeH$^+$ was the first heteronuclear molecule to form in the metal-free Universe after the Big Bang. The molecule gained significant attention following its first circumstellar detection in the young and dense planetary nebula NGC 7027. We target some hydride ions associated with the noble gases (HeH$^+$, ArH$^+$, and NeH$^+$) to investigate their formation in harsh environments like the nova outburst region. We use a photoionization modeling (based on previously published best-fit physical parameters) of the moderately fast ONe type nova, QU Vulpeculae 1984, and the CO type novae, RS Ophiuchi and V1716 Scorpii. Our steady-state modeling reveals a convincing amount of HeH$^+$, especially in the dense clump of RS Ophiuchi and V1716 Scorpii. The calculated upper limit on the surface brightness of HeH$^+$ transitions suggests that the James Webb Space Telescope (JWST) could detect some of them, particularly in sources like RS Ophiuchi and V1716 Scorpii, which have similar physical and chemical conditions and evolution. It must be clearly noted that the sources studied are used as templates, and not as targets for observations. The detection of these lines could be useful for determining the physical conditions in similar types of systems and for validating our predictions based on new electron-impact ro-vibrational collisional data at temperatures of up to 20,000 K., Comment: 15 pages, 12 figures, published in Astronomy & Astrophysics (A&A) Journal

We establish a logarithmic version of the classical result of Artin-Furw{\"a}ngler on the principalization ofideal classes in the Hilbert class-field by applying the group theoretic description of the transfert map to logarithmic class-groups of degree 0., Comment: in French language

In this communication, we propose a tentative to set the fundamental problem of measuring process done by a large structure on a microsopic one. We consider the example of voting when an entire society tries to measure globally opinions of all social actors in order to elect a delegate. We present a quantum model to interpret an operational voting system and propose a quantum approach for grading step of Range Voting, developed by M. Balinski and R. Laraki in 2007.

Misinformation is a complex societal issue, and mitigating solutions are difficult to create due to data deficiencies. To address this problem, we have curated the largest collection of (mis)information datasets in the literature, totaling 75. From these, we evaluated the quality of all of the 36 datasets that consist of statements or claims. We assess these datasets to identify those with solid foundations for empirical work and those with flaws that could result in misleading and non-generalizable results, such as insufficient label quality, spurious correlations, or political bias. We further provide state-of-the-art baselines on all these datasets, but show that regardless of label quality, categorical labels may no longer give an accurate evaluation of detection model performance. We discuss alternatives to mitigate this problem. Overall, this guide aims to provide a roadmap for obtaining higher quality data and conducting more effective evaluations, ultimately improving research in misinformation detection. All datasets and other artifacts are available at https://misinfo-datasets.complexdatalab.com/.

The Bradley-Terry (BT) model is a common and successful practice in reward modeling for Large Language Model (LLM) alignment. However, it remains unclear why this model -- originally developed for multi-player stochastic game matching -- can be adopted to convert pairwise response comparisons to reward values and make predictions. Especially given the fact that only a limited number of prompt-response pairs are sparsely compared with others. In this paper, we first revisit the foundations of using BT models in reward modeling, and establish the convergence rate of BT reward models based on deep neural networks using embeddings, providing a theoretical foundation for their use. Despite theoretically sound, we argue that the BT model is not a necessary choice from the perspective of downstream optimization. This is because a reward model only needs to preserve the correct ranking predictions through a monotonic transformation of the true reward. We highlight the critical concept of order consistency in reward modeling and demonstrate that the BT model possesses this property. Consequently, we propose a simple and straightforward upper-bound algorithm, compatible with off-the-shelf binary classifiers, as an alternative order-consistent reward modeling objective. To offer practical insights, we empirically evaluate the performance of these different reward modeling approaches across more than 12,000 experimental setups, using $6$ base LLMs, $2$ datasets, and diverse annotation designs that vary in quantity, quality, and pairing choices in preference annotations.

PDS 453 is a rare highly inclined disk where the stellar photosphere is seen at grazing incidence on the disk surface. Our goal is take advantage of this geometry to constrain the structure and composition of this disk, in particular the fact that it shows a 3.1 $\mu$m water ice band in absorption that can be related uniquely to the disk. We observed the system in polarized intensity with the VLT/SPHERE instrument, as well as in polarized light and total intensity using the HST/NICMOS camera. Infrared archival photometry and a spectrum showing the water ice band are used to model the spectral energy distribution under Mie scattering theory. Based on these data, we fit a model using the radiative transfer code MCFOST to retrieve the geometry and dust and ice content of the disk. PDS 453 has the typical morphology of a highly inclined system with two reflection nebulae where the disk partially attenuates the stellar light. The upper nebula is brighter than the lower nebula and shows a curved surface brightness profile in polarized intensity, indicating a ring-like structure. With an inclination of 80{\deg} estimated from models, the line-of-sight crosses the disk surface and a combination of absorption and scattering by ice-rich dust grains produces the water ice band. PDS 453 is seen highly inclined and is composed of a mixture of silicate dust and water ice. The radial structure of the disk includes a significant jump in density and scale height at a radius of 70 au in order to produce a ring-like image. The depth of the 3.1 $\mu$m water ice band depends on the amount of water ice, until it saturates when the optical thickness along the line-of-sight becomes too large. Therefore, quantifying the exact amount of water from absorption bands in edge-on disks requires a detailed analysis of the disk structure and tailored radiative transfer modeling., Comment: 11 pages, 11 figures

We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial graph problem with an inherently global definition [Le Gall et al. 2019]. We present a problem that we call iterated GHZ, which is defined using only local constraints. Formally, it is a family of locally checkable labeling problems [Naor and Stockmeyer 1995]; in particular, solutions can be verified with a constant-round distributed algorithm. We show that in graphs of maximum degree $\Delta$, any classical (deterministic or randomized) LOCAL model algorithm will require $\Omega(\Delta)$ rounds to solve the iterated GHZ problem, while the problem can be solved in $1$ round in quantum-LOCAL. We use the round elimination technique to prove that the iterated GHZ problem requires $\Omega(\Delta)$ rounds for classical algorithms. This is the first work that shows that round elimination is indeed able to separate the two models, and this also demonstrates that round elimination cannot be used to prove lower bounds for quantum-LOCAL. To apply round elimination, we introduce a new technique that allows us to discover appropriate problem relaxations in a mechanical way; it turns out that this new technique extends beyond the scope of the iterated GHZ problem and can be used to e.g. reproduce prior results on maximal matchings [FOCS 2019, PODC 2020] in a systematic manner., Comment: 64 pages, 9 figures

Gatemons are superconducting qubits resembling transmons, with a gate-tunable semiconducting weak link as the Josephson element. Here, we report a gatemon device featuring an aluminum microwave circuit on a Ge/SiGe heterostructure embedding a Ge quantum well. Owing to the superconducting proximity effect, the high-mobility two-dimensional hole gas confined in this well provides a gate-tunable superconducting weak link between two Al contacts. We perform Rabi oscillation and Ramsey interference measurements, demonstrate the gate-voltage dependence of the qubit frequency, and measure the qubit anharmonicity. We find relaxation times T$_{1}$ up to 119 ns, and Ramsey coherence times T$^{*}_{2}$ up to 70 ns, and a qubit frequency gate-tunable over 3.5 GHz. The reported proof-of-concept reproduces the results of a very recent work [Sagi et al., Nat. Commun. 15, 6400 (2024)] using similar Ge/SiGe heterostructures thereby validating a novel platform for the development of gatemons and parity-protected cos(2$\phi$) qubits.

As tools for designing and manufacturing hardware become more accessible, smaller producers can develop and distribute novel hardware. However, there aren't established tools to support end-user hardware troubleshooting or routine maintenance. As a result, technical support for hardware remains ad-hoc and challenging to scale. Inspired by software troubleshooting workflows like StackOverflow, we propose a workflow for asynchronous hardware troubleshooting: SplatOverflow. SplatOverflow creates a novel boundary object, the SplatOverflow scene, that users reference to communicate about hardware. The scene comprises a 3D Gaussian Splat of the user's hardware registered onto the hardware's CAD model. The splat captures the current state of the hardware, and the registered CAD model acts as a referential anchor for troubleshooting instructions. With SplatOverflow, maintainers can directly address issues and author instructions in the user's workspace. The instructions define workflows that can easily be shared between users and recontextualized in new environments. In this paper, we describe the design of SplatOverflow, detail the workflows it enables, and illustrate its utility to different kinds of users. We also validate that non-experts can use SplatOverflow to troubleshoot common problems with a 3D printer in a user study., Comment: Our accompanying video figure is available at: https://youtu.be/m4TKeBDuZkU

This work addresses the question of regularity of solutions to evolutionary (quasi-static and dynamic) perfect plasticity models. Under the assumption that the elasticity set is a compact convex subset of deviatoric matrices, with $C^2$ boundary and positive definite second fundamental form, it is proved that the Cauchy stress admits spatial partial derivatives that are locally square integrable. In the dynamic case, a similar regularity result is established for the velocity as well. In the latter case, one-dimensional counterexamples show that, although solutions are Sobolev in the interior of the domain, singularities may appear at the boundary and the Dirichlet condition may fail to be attained., Comment: 41 pages, 1 figure

Deep learning models, in particular \textit{image} models, have recently gained generalisability and robustness. %are becoming more general and robust by the day. In this work, we propose to exploit such advances in the realm of \textit{video} classification. Video foundation models suffer from the requirement of extensive pretraining and a large training time. Towards mitigating such limitations, we propose "\textit{Attention Map (AM) Flow}" for image models, a method for identifying pixels relevant to motion in each input video frame. In this context, we propose two methods to compute AM flow, depending on camera motion. AM flow allows the separation of spatial and temporal processing, while providing improved results over combined spatio-temporal processing (as in video models). Adapters, one of the popular techniques in parameter efficient transfer learning, facilitate the incorporation of AM flow into pretrained image models, mitigating the need for full-finetuning. We extend adapters to "\textit{temporal processing adapters}" by incorporating a temporal processing unit into the adapters. Our work achieves faster convergence, therefore reducing the number of epochs needed for training. Moreover, we endow an image model with the ability to achieve state-of-the-art results on popular action recognition datasets. This reduces training time and simplifies pretraining. We present experiments on Kinetics-400, Something-Something v2, and Toyota Smarthome datasets, showcasing state-of-the-art or comparable results.

Choices in the semantics and the signature of a theory are integral in determining how the theory is used and how challenging it is to reason over it. Our interest in this paper lies in the SMT theory of sequences. Various versions of it exist in the literature and in state-of-the-art SMT solvers, but it has not yet been standardized in the SMT-LIB. We reflect on its existing variants, and we define a set of theory design criteria to help determine what makes one variant of a theory better than another. The criteria we define can be used to appraise theory proposals for other theories as well. Based on these criteria, we propose a series of changes to the SMT theory of sequences as a contribution to the discussion regarding its standardization.

The impact of vacancies on spin-resolved electronic properties of quantum dots (QDs) in phosphorene-based junctions, are investigated numerically. Regardless of the crystal orientation, a phosphorene nanoribbon (PNR) containing a monovacancy is found to exhibit a topological quasi-flat band that emerges within the band gap. The electronic properties of QDs, including spatial confinement and energy level distribution, can be strongly tuned by controlling the topological structure of the QDs and by applying electric fields. Additionally, these QDs exhibit remarkable spin-selective properties under a ferromagnetic exchange field, enabling the manipulation of QD features. This opens up the potential for novel applications such as quantum computing, magnetic sensing, spin-based light emission., Comment: 15 pages,6 figures

We consider the generating series of special cycles on $\mathcal{A}_1(N)\times \mathcal{A}_g(N)$, with full level $N$ structure, valued in the cohomology of degree $2g$. The modularity theorem of Kudla-Millson for locally symmetric spaces implies that these series are modular. When $N=1$, the images of these loci in $\mathcal{A}_g$ are the $d$-elliptic Noether-Lefschetz loci, which are conjectured to be modular. In the appendix, it is shown that the resulting modular forms are nonzero for $g=2$ when $N\geq 11$ and $N\neq 12$., Comment: minor changes, comments still welcome

We generalize quantum-classical PCPs, first introduced by Weggemans, Folkertsma and Cade (TQC 2024), to allow for $q$ quantum queries to a polynomially-sized classical proof ($\mathsf{QCPCP}_{Q,c,s}[q]$). Exploiting a connection with the polynomial method, we prove that for any constant $q$, promise gap $c-s = \Omega(1/\text{poly}(n))$ and $\delta>0$, we have $\mathsf{QCPCP}_{Q,c,s}[q] \subseteq \mathsf{QCPCP}_{1-\delta,1/2+\delta}[3] \subseteq \mathsf{BQ} \cdot \mathsf{NP}$, where $\mathsf{BQ} \cdot \mathsf{NP}$ is the class of promise problems with quantum reductions to an $\mathsf{NP}$-complete problem. Surprisingly, this shows that we can amplify the promise gap from inverse polynomial to constant for constant query quantum-classical PCPs, and that any quantum-classical PCP making any constant number of quantum queries can be simulated by one that makes only three classical queries. Nevertheless, even though we can achieve promise gap amplification, our result also gives strong evidence that there exists no constant query quantum-classical PCP for $\mathsf{QCMA}$, as it is unlikely that $\mathsf{QCMA} \subseteq \mathsf{BQ} \cdot \mathsf{NP}$, which we support by giving oracular evidence. In the (poly-)logarithmic query regime, we show for any positive integer $c$, there exists an oracle relative to which $\mathsf{QCPCP}[\mathcal{O}(\log^c n)] \subsetneq \mathsf{QCPCP}_Q[\mathcal{O}(\log^c n)]$, contrasting the constant query case where the equivalence of both query models holds relative to any oracle. Finally, we connect our results to more general quantum-classical interactive proof systems., Comment: 31 pages

We introduce PatternBoost, a flexible method for finding interesting constructions in mathematics. Our algorithm alternates between two phases. In the first ``local'' phase, a classical search algorithm is used to produce many desirable constructions. In the second ``global'' phase, a transformer neural network is trained on the best such constructions. Samples from the trained transformer are then used as seeds for the first phase, and the process is repeated. We give a detailed introduction to this technique, and discuss the results of its application to several problems in extremal combinatorics. The performance of PatternBoost varies across different problems, but there are many situations where its performance is quite impressive. Using our technique, we find the best known solutions to several long-standing problems, including the construction of a counterexample to a conjecture that had remained open for 30 years., Comment: 32 pages

Virtual Production (VP) technologies have continued to improve the flexibility of on-set filming and enhance the live concert experience. The core technology of VP relies on high-resolution, high-brightness LED panels to playback/render video content. There are a number of technical challenges to effective deployment e.g. image tile synchronisation across the panels, cross panel colour balancing and compensating for colour fluctuations due to changes in camera angles. Given the complexity and potential quality degradation, the industry prefers "pristine" or lossless compressed source material for displays, which requires significant storage and bandwidth. Modern lossy compression standards like AV1 or H.265 could maintain the same quality at significantly lower bitrates and resource demands. There is yet no agreed methodology for assessing the impact of these standards on quality when the VP scene is recorded in-camera. We present a methodology to assess this impact by comparing lossless and lossy compressed footage displayed through VP screens and recorded in-camera. We assess the quality impact of HAP/NotchLC/Daniel2 and AV1/HEVC/H.264 compression bitrates from 2 Mb/s to 2000 Mb/s with various GOP sizes. Several perceptual quality metrics are then used to automatically evaluate in-camera picture quality, referencing the original uncompressed source content through the LED wall. Our results show that we can achieve the same quality with hybrid codecs as with intermediate encoders at orders of magnitude less bitrate and storage requirements., Comment: SMPTE Media Summit Paper on use of Compression in Virtual Production from TCD and Disguise

Context. Transient sky astronomy is entering a new era with the advent of the SVOM mission (Space Variable Objects Monitor), which was successfully launched on the 26th of June, 2024. The primary goal of SVOM is to monitor the hard X-ray sky searching for gamma-ray bursts (GRBs). On top of its on-board follow-up capabilities, SVOM will be backed by its ground segment composed of several facilities, of which the near-infrared imager CAGIRE. Mounted on the robotic telescope COLIBRI, it will be a unique instrument, able to perform fast follow-up of GRB afterglows in J and H bands, an ideal combination to catch high-redshift (z>6) and/or obscured GRBs. Aims. This paper aims at estimating the performances of CAGIRE for GRB near-infrared afterglow detection based on the characteristics of the detector and the specificities of the COLIBRI telescope. Quickly fading GRB afterglows pose challenges that should be addressed by adapting observing strategies to the capabilities of CAGIRE. Methods. We use an end-to-end image simulator to produce realistic CAGIRE images, taking into account results from the characterization of the ALFA detector used by CAGIRE. We implemented a GRB afterglow generator that simulates infrared lightcurves and spectra based on published observation of distant GRBs (z>6). Results. We retrieved the photometry of 9 GRB afterglows in various scenarios covered by CAGIRE. Catching afterglows as early as two minutes after burst allows the identification of a nIR counterpart in the brightest 4 events. When artificially redshifted even further away, these events remain detectable by CAGIRE up to z=9.6 in J band, and z=13.3 in H band, indicating the potential of CAGIRE to be a pioneer in the identification of the most distant GRBs to date., Comment: 8 pages, 5 figures, 3 tables, accepted for publication in A&A

The notion of double depth associated with quasi-Jacobi forms allows distinguishing, within the algebra of quasi-Jacobi singular forms of index zero, certain significant subalgebras (modular-type forms, elliptic-type forms, Jacobi forms). We study the stability of these subalgebras under the derivations of this algebra and through certain sequences of bidifferential operators constituting analogs of Rankin-Cohen brackets or transvectants

A dual-operation mode SNSPD is demonstrated. In the conventional Geiger SNSPD mode the sensor operates at temperatures well below the critical temperature, Tc, working as an event counter without sensitivity to the number of photons impinging the sensor. In the calorimetric mode, the detector is operated at temperatures just below Tc and displays photon-number sensitivity for wavelengths in the optical spectrum. In this energy sensitive mode, photon absorption causes Joule heating of the SNSPD that becomes partially resistive without the presence of latching. Depending on the application, by tuning the sample temperature and bias current using the same readout system, the SNSPD can readily switch between the two modes. In the calorimetric mode, SNSPD recovery times shorter than the ones in the Geiger mode are observed, reaching values as low as 580ps. Dual-mode SNSPD's may provide significant advancements in spectroscopy and calorimetry, where precise timing, photon counting and energy resolution are required., Comment: Manuscript prepared for APL

This study introduces a novel frequency-based data-driven controller for adaptive optics, using power spectral density for optimization while ensuring stability criteria. It addresses disturbance rejection, command amplitude constraints and system transfer functions through convex optimization to obtain an optimal control in an infinite input response filter form. Evaluated within the SAXO+ project, it demonstrates efficacy under diverse atmospheric conditions and operational scenarios. The proposed controller is tested in both standard and disentangled adaptive optics schemes, showcasing its adaptability and performance. Experimental validation is conducted using the COMPASS simulation tool, affirming the controller's promise for enhancing adaptive optics systems in real-world applications.

Recent experimental and theoretical results have demonstrated the possibility of accelerating electrons in the MeV range by focusing tightly a few-cycle laser beam in ambient air. Using Particle-In-Cell (PIC) simulations, this configuration is revisited within a more accurate modelling approach to analyze and optimize the mechanism responsible for electron acceleration. In particular, an analytical model for a linearly polarized tightly-focused ultrashort laser field is derived and coupled to a PIC code, allowing us to model the interaction of laser beams reflected by high-numerical aperture mirrors with laser-induced plasmas. A set of 3D PIC simulations is performed where the laser wavelength is varied from 800 nm to 7.0 $\mu$m while the normalized amplitude of the electric field is varied from $a_{0} = 3.6$ to $a_{0} = 7.0$. The preferential forward acceleration of electrons, as well as the analysis of the laser intensity evolution in the plasma and data on electron number density, confirm that the relativistic ponderomotive force is responsible for the acceleration. We also demonstrate that the electron kinetic energy reaches a maximum of $\approx1.6$ MeV when the central wavelength is of 2.5 $\mu$m., Comment: 16 pages, 17 figures

Several attempts have been made to handle multiple source separation tasks such as speech enhancement, speech separation, sound event separation, music source separation (MSS), or cinematic audio source separation (CASS) with a single model. These models are trained on large-scale data including speech, instruments, or sound events and can often successfully separate a wide range of sources. However, it is still challenging for such models to cover all separation tasks because some of them are contradictory (e.g., musical instruments are separated in MSS while they have to be grouped in CASS). To overcome this issue and support all the major separation tasks, we propose a task-aware unified source separation (TUSS) model. The model uses a variable number of learnable prompts to specify which source to separate, and changes its behavior depending on the given prompts, enabling it to handle all the major separation tasks including contradictory ones. Experimental results demonstrate that the proposed TUSS model successfully handles the five major separation tasks mentioned earlier. We also provide some audio examples, including both synthetic mixtures and real recordings, to demonstrate how flexibly the TUSS model changes its behavior at inference depending on the prompts., Comment: Submitted to ICASSP 2025

We introduce two models of space-bounded quantum interactive proof systems, ${\sf QIPL}$ and ${\sf QIP_{\rm U}L}$. The ${\sf QIP_{\rm U}L}$ model, a space-bounded variant of quantum interactive proofs (${\sf QIP}$) introduced by Watrous (CC 2003) and Kitaev and Watrous (STOC 2000), restricts verifier actions to unitary circuits. In contrast, ${\sf QIPL}$ allows logarithmically many intermediate measurements per verifier action (with a high-concentration condition on yes instances), making it the weakest model that encompasses the classical model of Condon and Ladner (JCSS 1995). We characterize the computational power of ${\sf QIPL}$ and ${\sf QIP_{\rm U}L}$. When the message number $m$ is polynomially bounded, ${\sf QIP_{\rm U}L} \subsetneq {\sf QIPL}$ unless ${\sf P} = {\sf NP}$: - ${\sf QIPL}$ exactly characterizes ${\sf NP}$. - ${\sf QIP_{\rm U}L}$ is contained in ${\sf P}$ and contains ${\sf SAC}^1 \cup {\sf BQL}$, where ${\sf SAC}^1$ denotes problems solvable by classical logarithmic-depth, semi-unbounded fan-in circuits. However, this distinction vanishes when $m$ is constant. Our results further indicate that intermediate measurements uniquely impact space-bounded quantum interactive proofs, unlike in space-bounded quantum computation, where ${\sf BQL}={\sf BQ_{\rm U}L}$. We also introduce space-bounded unitary quantum statistical zero-knowledge (${\sf QSZK_{\rm U}L}$), a specific form of ${\sf QIP_{\rm U}L}$ proof systems with statistical zero-knowledge against any verifier. This class is a space-bounded variant of quantum statistical zero-knowledge (${\sf QSZK}$) defined by Watrous (SICOMP 2009). We prove that ${\sf QSZK_{\rm U}L} = {\sf BQL}$, implying that the statistical zero-knowledge property negates the computational advantage typically gained from the interaction., Comment: 50 pages, 4 figures

The need for large text corpora has increased with the advent of pretrained language models and, in particular, the discovery of scaling laws for these models. Most available corpora have sufficient data only for languages with large dominant communities. However, there is no corpus available that (i) covers a wide range of minority languages; (ii) is generated by an open-source reproducible pipeline; and (iii) is rigorously cleaned from noise, making it trustworthy to use. We present GlotCC, a clean, document-level, 2TB general domain corpus derived from CommonCrawl, covering more than 1000 languages. We make GlotCC and the system used to generate it - including the pipeline, language identification model, and filters - available to the research community. Corpus v. 1.0 https://huggingface.co/datasets/cis-lmu/GlotCC-v1, Pipeline v. 3.0 https://github.com/cisnlp/GlotCC., Comment: NeurIPS 2024

3D Object Detection from LiDAR data has achieved industry-ready performance in controlled environments through advanced deep learning methods. However, these neural network models are limited by a finite set of inlier object categories. Our work redefines the open-set 3D Object Detection problem in LiDAR data as an Out-Of-Distribution (OOD) problem to detect outlier objects. This approach brings additional information in comparison with traditional object detection. We establish a comparative benchmark and show that two-stage OOD methods, notably autolabelling, show promising results for 3D OOD Object Detection. Our contributions include setting a rigorous evaluation protocol by examining the evaluation of hyperparameters and evaluating strategies for generating additional data to train an OOD-aware 3D object detector. This comprehensive analysis is essential for developing robust 3D object detection systems that can perform reliably in diverse and unpredictable real-world scenarios.

Large language models (LLMs) have demonstrated a remarkable ability to serve as general-purpose tools for various language-based tasks. Recent works have demonstrated that the efficacy of such models can be improved through iterative dialog between multiple models, frequently referred to as multi-agent debate (MAD). While debate shows promise as a means of improving model efficacy, most works in this area treat debate as an emergent behavior, rather than a learned behavior. In doing so, current debate frameworks rely on collaborative behaviors to have been sufficiently trained into off-the-shelf models. To address this limitation, we propose ACC-Debate, an Actor-Critic based learning framework to produce a two-agent team specialized in debate. We demonstrate that ACC-Debate outperforms SotA debate techniques on a wide array of benchmarks.

We continue our study of the perfect kernel of the space of transitive actions of Baumslag-Solitar groups by investigating high transitivity. We show that actions of finite phenotype are never highly transitive, except when the phenotype is 1, in which case high transitivity is actually generic. In infinite phenotype, high transitivity is generic, except when |m|=|n| where it is empty. We also reinforce the dynamical properties of the action by conjugation on the perfect kernel that we had established in our first paper, replacing topological transitivity by high topological transitivity., Comment: A continuation of "On the space of subgroups of Baumslag-Solitar groups I: perfect kernel and phenotype", by Alessandro Carderi, Damien Gaboriau, Fran\c{c}ois Le Ma\^itre, Yves Stalder (arXiv:2210.14990). 44 pages, 1 figure

We study the ground state energy of trapped two-dimensional Bose gases with mean-field type interactions. We prove the stability of second kind of the many-body system and the convergence of the ground state energy per particle to that of a non-linear Schr\"odinger (NLS) energy functional. Notably, we can take the scaling of the interaction to be arbitrarily close to the Gross-Pitaevskii scaling, which is a drastic improvement on the best-known result for systems with attractive interactions. As a consequence of the stability of second kind we also obtain Bose-Einstein condensation for the many-body ground states and dynamics for a much improved range of the diluteness parameter., Comment: 16 pages

Among many-body instabilities in correlated quantum systems, electronic nematicity, defined by the spontaneous breaking of rotational symmetry, has emerged as a critical phenomenon, particularly within high-temperature superconductors. Recently, this behavior has been identified in CsTi$_3$Bi$_5$, a member of the AV$_3$Sb$_5$ (A = K, Rb, Cs) kagome family, recognized for its intricate and unconventional quantum phases. Despite accumulating indirect evidence, the fundamental mechanisms driving nematicity in CsTi$_3$Bi$_5$ remain inadequately understood, sparking ongoing debates. In this study, we employ polarization-dependent angle-resolved photoemission spectroscopy to reveal definitive signatures of an orbital-selective nematic deformation in the electronic structure of CsTi$_3$Bi$_5$. This direct experimental evidence underscores the pivotal role of orbital degrees of freedom in symmetry breaking, providing new insights into the complex electronic environment. By applying the functional renormalization group technique to a fully interacting ab initio model, we demonstrate the emergence of a finite angular momentum ($d$-wave) Pomeranchuk instability in CsTi$_3$Bi$_5$, driven by the concomitant action of electronic correlations within specific orbital channels and chemical potential detuning away from Van Hove singularities. By elucidating the connection between orbital correlations and symmetry-breaking instabilities, this work lays a crucial foundation for future investigations into the broader role of orbital selectivity in quantum materials, with far-reaching implications for the design and manipulation of novel electronic phases.

We address in this article the the quality of the WikiNER corpus, a multilingual Named Entity Recognition corpus, and provide a consolidated version of it. The annotation of WikiNER was produced in a semi-supervised manner i.e. no manual verification has been carried out a posteriori. Such corpus is called silver-standard. In this paper we propose WikiNER-fr-gold which is a revised version of the French proportion of WikiNER. Our corpus consists of randomly sampled 20% of the original French sub-corpus (26,818 sentences with 700k tokens). We start by summarizing the entity types included in each category in order to define an annotation guideline, and then we proceed to revise the corpus. Finally we present an analysis of errors and inconsistency observed in the WikiNER-fr corpus, and we discuss potential future work directions.

We construct classical algorithms computing an approximation of the ground state energy of an arbitrary $k$-local Hamiltonian acting on $n$ qubits. We first consider the setting where a good ``guiding state'' is available, which is the main setting where quantum algorithms are expected to achieve an exponential speedup over classical methods. We show that a constant approximation of the ground state energy can be computed classically in $\mathrm{poly}\left(1/\chi,n\right)$ time and $\mathrm{poly}(n)$ space, where $\chi$ denotes the overlap between the guiding state and the ground state (as in prior works in dequantization, we assume sample-and-query access to the guiding state). This gives a significant improvement over the recent classical algorithm by Gharibian and Le Gall (SICOMP 2023), and matches (up a to polynomial overhead) both the time and space complexities of quantum algorithms for constant approximation of the ground state energy. We also obtain classical algorithms for higher-precision approximation. For the setting where no guided state is given (i.e., the standard version of the local Hamiltonian problem), we obtain a classical algorithm computing a constant approximation of the ground state energy in $2^{O(n)}$ time and $\mathrm{poly}(n)$ space. To our knowledge, before this work it was unknown how to classically achieve these bounds simultaneously, even for constant approximation. We also discuss complexity-theoretic aspects of our results and their implications for the quantum PCP conjecture., Comment: 27 pages

In recent years, there has been a renewed interest in complex coacervation, driven by concerted efforts to offer novel experimental and theoretical insights into electrostatic charge-induced association. While previous studies have primarily focused on polyelectrolytes, proteins or surfactants, our work explores the potential of using cerium (CeO2) and iron ({\gamma}-Fe2O3) oxide nanoparticles (NPs) to develop innovative nanomaterials. By combining various charged species, such as polyelectrolytes, charged neutral block copolymers and coated NPs, we study a wide variety of complexation patterns and compare them using isothermal titration calorimetry, light scattering and microscopy. These techniques confirm that the titration of oppositely charged species occurs in two steps: the formation of polyelectrolyte complexes and subsequent phase (or microphase) separation, depending on the system studied. Across all examined cases, the entropic contribution to the total free energy surpasses the enthalpic contribution, in agreement with counterion release mechanisms. Furthermore, our investigation reveals a consistent asymmetry in the reaction enthalpy associated with the secondary process, with exothermic profiles observed upon the addition of cationic species to anionic ones and endothermic profiles in the reverse case.

Assessing employees' well-being has become central to fostering an environment where employees can thrive and contribute to companies' adaptability and competitiveness in the market. Traditional methods for assessing well-being often face significant challenges, with a major issue being the lack of trust and confidence employees may have in these processes. Employees may hesitate to provide honest feedback due to concerns not only about data integrity and confidentiality, but also about power imbalances among stakeholders. In this context, blockchain-based decentralised surveys, leveraging the immutability, transparency, and pseudo-anonymity of blockchain technology, offer significant improvements in aligning responsive actions with employees' feedback securely and transparently. Nevertheless, their implementation raises complex issues regarding the balance between trust and confidence. While blockchain can function as a confidence machine for data processing and management, it does not inherently address the equally important cultural element of trust. To effectively integrate blockchain technology into well-being assessments, decentralised well-being surveys must be supported by cultural practices that build and sustain trust. Drawing on blockchain technology management and relational cultural theory, we explain how trust-building can be achieved through the co-production of decentralised well-being surveys, which helps address power imbalances between the implementation team and stakeholders. Our goal is to provide a dual cultural-technological framework along with conceptual clarity on how the technological implementation of confidence can connect with the cultural development of trust, ensuring that blockchain-based decentralised well-being surveys are not only secure and reliable but also perceived as trustworthy vector to improve workplace conditions., Comment: 12 pages, 1 figure, 1 table

Vision-based object detectors are a crucial basis for robotics applications as they provide valuable information about object localisation in the environment. These need to ensure high reliability in different lighting conditions, occlusions, and visual artifacts, all while running in real-time. Collecting and annotating real-world data for these networks is prohibitively time consuming and costly, especially for custom assets, such as industrial objects, making it untenable for generalization to in-the-wild scenarios. To this end, we present Synthetica, a method for large-scale synthetic data generation for training robust state estimators. This paper focuses on the task of object detection, an important problem which can serve as the front-end for most state estimation problems, such as pose estimation. Leveraging data from a photorealistic ray-tracing renderer, we scale up data generation, generating 2.7 million images, to train highly accurate real-time detection transformers. We present a collection of rendering randomization and training-time data augmentation techniques conducive to robust sim-to-real performance for vision tasks. We demonstrate state-of-the-art performance on the task of object detection while having detectors that run at 50-100Hz which is 9 times faster than the prior SOTA. We further demonstrate the usefulness of our training methodology for robotics applications by showcasing a pipeline for use in the real world with custom objects for which there do not exist prior datasets. Our work highlights the importance of scaling synthetic data generation for robust sim-to-real transfer while achieving the fastest real-time inference speeds. Videos and supplementary information can be found at this URL: https://sites.google.com/view/synthetica-vision., Comment: 21 pages, 11 figures, 5 tables

We investigate the influence of inelastic neutrino microphysics in general-relativistic magnetohydrodynamics simulations of a hypermassive neutron star. In particular, we include species/energy groups coupled neutrino-matter interactions, such as inelastic neutrino-electron scattering and electron-positron annihilation kernels, into simulations up to 50 ms. Neutrino-electron inelastic scattering is known to have effective neutrino-matter energy exchange. We show that, with neutrino-electron inelastic scattering, simulations predict 75% higher disc mass with slightly different mass-averaged compositions, and 18% more ejected mass with similar distributions. The enhancement of the mass of the disc and the ejecta results in stronger baryon pollution, leading to less favourable jet launching environments. Furthermore, neutrino luminosities are about 50, 40, and 30% higher for electron neutrino, electron anti-neutrino, and heavy-lepton neutrinos. In contrast, we do not see any significant impacts due to electron-positron annihilation.

The Frequentist, Assisted by Bayes (FAB) framework aims to construct confidence regions that leverage information about parameter values in the form of a prior distribution. FAB confidence regions (FAB-CRs) have smaller volume for values of the parameter that are likely under the prior, while maintaining exact frequentist coverage. This work introduces several methodological and theoretical contributions to the FAB framework. For Gaussian likelihoods, we show that the posterior mean of the parameter of interest is always contained in the FAB-CR. As such, the posterior mean constitutes a natural notion of FAB estimator to be reported alongside the FAB-CR. More generally, we show that for a likelihood in the natural exponential family, a transformation of the posterior mean of the natural parameter is always contained in the FAB-CR. For Gaussian likelihoods, we show that power law tails conditions on the marginal likelihood induce robust FAB-CRs, that are uniformly bounded and revert to the standard frequentist confidence intervals for extreme observations. We translate this result into practice by proposing a class of shrinkage priors for the FAB framework that satisfy this condition without sacrificing analytical tractability. The resulting FAB estimators are equal to prominent Bayesian shrinkage estimators, including the horseshoe estimator, thereby establishing insightful connections between robust FAB-CRs and Bayesian shrinkage methods.

Let $F$ and $G$ be generalized H\'enon maps. We show that the Kato surfaces associated to the germs of $F$ and $G$ near infinity are biholomorphic if and only if $F$ and $G$ are conjugate in $\text{Aut}(\mathbb{C}^2)$. This answers a question raised by Favre in X\'enelkis de H\'enon's survey. We also show that two generalized H\'enon maps are conjugate near infinity, if and only if they are affinely conjugate.

We introduce a new class of automata (which we coin EU-automata) running on infininte trees of arbitrary (finite) arity. We develop and study several algorithms to perform classical operations (union, intersection, complement, projection, alternation removal) for those automata, and precisely characterise their complexities. We also develop algorithms for solving membership and emptiness for the languages of trees accepted by EU-automata. We then use EU-automata to obtain several algorithmic and expressiveness results for the temporal logic QCTL (which extends CTL with quantification over atomic propositions) and for MSO. On the one hand, we obtain decision procedures with optimal complexity for QCTL satisfiability and model checking; on the other hand, we obtain an algorithm for translating any QCTL formula with k quantifier alternations to formulas with at most one quantifier alternation, at the expense of a $(k + 1)$-exponential blow-up in the size of the formulas. Using the same techniques, we prove that any MSO formula can be translated into a formula with at most four quantifier alternations (and only two second-order-quantifier alternations), again with a $(k + 1)$-exponential blow-up in the size of the formula.

We show that there are infinitely many homeomorphism types of atoroidal surface bundles over surfaces which have signature zero.

In order to exploit the complete scientific potential of user-oriented accelerator facilities, it is necessary to provide adequate pump sources to enable pump-probe science. The users of the European XFEL have requested a THz pump source matching the X-ray repetition rate (10 Hz burst mode with up to 2700 bunches per burst) with a wide range of properties. The quest for suitable THz sources is thus a major development goal. The EuXFEL R\&D project STERN is exploring beam-based radiation generation methods using Cherenkov waveguides to satisfy these user requirements. In this work, custom waveguide geometries are designed to generate a THz pulse with arbitrary spectral content. The layer-thickness or inner radius of a wakefield structure is tapered to generate flattop or Gaussian pulses up to $1 \ \mathrm{THz}$, which can be scaled to higher frequencies.

We present a renormalization lemma for certain maps defined on the unit disc of C and taking values in some metric space. We show that the classical renormalization lemmas of Zalcman and Miniowitz can be deduced from our lemma. We also use it to establish a general normality statement for the Pinchuk's scaling method in C^2 and, incidentally, reprove the Catlin's estimates for the Kobayashi metric in finite type domains.