337 results
Relevance Newest Most Cited
HLXiON δ Ω Intent Σ Logic Ψ Synth Π Reason Γ Memory Processing: stat.CO
iON AI Synthesis
The search results on "stat.CO" cover a diverse range of studies, including the observation of a near-threshold structure in e⁺e⁻ annihilation processes with the BESIII detector, and pressure-induced superconductivity in Bi₂Te₃. Other highlighted works involve the development of Flow Q-Learning for offline reinforcement learning, the GPQA dataset designed to challenge experts in biology, physics, and chemistry, and the covariant quantization of electromagnetic fields to address inconsistencies in Lorentz gauge commutations. These studies represent significant advancements in their respective fields, contributing to both theoretical and practical understanding.
Ask iON more → 📚 Find Papers
semanticscholar.org
Observation of a Near-Threshold Structure in the K^{+} Recoil-Mass Spectra in e^{+}e^{-}→K^{+}(D_{s}^{-}D^{*0}+D_{s}^{*-}D^{0}).

We report a study of the processes of e^{+}e^{-}→K^{+}D_{s}^{-}D^{*0} and K^{+}D_{s}^{*-}D^{0} based on e^{+}e^{-} annihilation samples collected with the BESIII detector operating at BEPCII at five center-of-mass energies ranging from 4.628 to 4.698 GeV with a total integrated luminosity of 3.7?…

semanticscholar.org
Pressure-induced superconductivity in topological parent compound Bi2Te3

We report a successful observation of pressure-induced superconductivity in a topological compound Bi2Te3 with Tc of ∼3 K between 3 to 6 GPa. The combined high-pressure structure investigations with synchrotron radiation indicated that the superconductivity occurred at the ambient phase without cr…

semanticscholar.org
Flow Q-Learning

We present flow Q-learning (FQL), a simple and performant offline reinforcement learning (RL) method that leverages an expressive flow-matching policy to model arbitrarily complex action distributions in data. Training a flow policy with RL is a tricky problem, due to the iterative nature of the act…

semanticscholar.org
GPQA: A Graduate-Level Google-Proof Q&A Benchmark

We present GPQA, a challenging dataset of 448 multiple-choice questions written by domain experts in biology, physics, and chemistry. We ensure that the questions are high-quality and extremely difficult: experts who have or are pursuing PhDs in the corresponding domains reach 65% accuracy (74% when…

arxiv.org
Consideration of Covariant Quantization of Electromagnetic Field

We examine a covariant quantization of electromagnetic fields by using an operator derived from a constant scalar that can be called extended Lorentz gauge. The quantization can avoid an inconsistency between Lorentz gauge and a commutation relation, which can eliminate the need for introduction of …

physics.gen-ph
arxiv.org
Instrument for Measuring the Earth's Time-Retarded Transverse Gravitational Vector Potential

Here within the basic design for a ground-based instrument for measuring the magnitude of the Earth's time-retarded transverse gravitational vector potential is described. The formula for the Earth's transverse vector potential is derived from the known formula for the neoclassical time-retarded tra…

physics.gen-ph
arxiv.org
On the behaviours produced by instruction sequences under execution

We study several aspects of the behaviours produced by instruction sequences under execution in the setting of the algebraic theory of processes known as ACP. We use ACP to describe the behaviours produced by instruction sequences under execution and to describe two protocols implementing these beha…

cs.PL cs.DC cs.LO
arxiv.org
Virtual Garbage Collector (VGC): A Zone-Based Garbage Collection Architecture for Python's Parallel Runtime

The Virtual Garbage Collector (VGC) proposes a zone-based memory management architecture aimed at improving execution predictability and memory behavior in Python runtimes. The design explores a dual-layer model consisting of an Active VGC, responsible for managing runtime object lifecycles, and a P…

cs.PL cs.DC
arxiv.org
An Improved Non-Termination Criterion for Binary Constraint Logic Programs

On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches: dynamic …

cs.PL
arxiv.org
Combining Propagation Information and Search Tree Visualization using ILOG OPL Studio

In this paper we give an overview of the current state of the graphical features provided by ILOG OPL Studio for debugging and performance tuning of OPL programs or external ILOG Solver based applications. This paper focuses on combining propagation and search information using the Search Tree view …

cs.PL cs.SE