Biological evolution provides a creative fount of complex and subtle adaptations, often surprising the scientists who discover them. However, because evolution is an algorithmic process that transcends the substrate in which it occurs, evolution's creativity is not limited to nature. Indeed, many researchers in the field of digital evolution have observed their evolving algorithms and organisms subverting their intentions, exposing unrecognized bugs in their code, producing unexpected adaptations, or exhibiting outcomes uncannily convergent with ones in nature. Such stories routinely reveal creativity by evolution in these digital worlds, but they rarely fit into the standard scientific narrative. Instead they are often treated as mere obstacles to be overcome, rather than results that warrant study in their own right. The stories themselves are traded among researchers through oral tradition, but that mode of information transmission is inefficient and prone to error and outright loss. Moreover, the fact that these stories tend to be shared only among practitioners means that many natural scientists do not realize how interesting and lifelike digital organisms are and how natural their evolution can be. To our knowledge, no collection of such anecdotes has been published before. This paper is the crowd-sourced product of researchers in the fields of artificial life and evolutionary computation who have provided first-hand accounts of such cases. It thus serves as a written, fact-checked collection of scientifically important and even entertaining stories. In doing so we also present here substantial evidence that the existence and importance of evolutionary surprises extends beyond the natural world, and may indeed be a universal property of all complex evolving systems.

Tail risk protection is in the focus of the financial industry and requires solid mathematical and statistical tools, especially when a trading strategy is derived. Recent hype driven by machine learning (ML) mechanisms has raised the necessity to display and understand the functionality of ML tools. In this paper, we present a dynamic tail risk protection strategy that targets a maximum predefined level of risk measured by Value-At-Risk while controlling for participation in bull market regimes. We propose different weak classifiers, parametric and non-parametric, that estimate the exceedance probability of the risk level from which we derive trading signals in order to hedge tail events. We then compare the different approaches both with statistical and trading strategy performance, finally we propose an ensemble classifier that produces a meta tail risk protection strategy improving both generalization and trading performance.

AI artificial intelligence brings about new quantitative techniques to assess the state of an economy. Here we describe a new measure for systemic risk: the Financial Risk Meter (FRM). This measure is based on the penalization parameter (lambda) of a linear quantile lasso regression. The FRM is calculated by taking the average of the penalization parameters over the 100 largest US publicly traded financial institutions. We demonstrate the suitability of this AI based risk measure by comparing the proposed FRM to other measures for systemic risk, such as VIX, SRISK and Google Trends. We find that mutual Granger causality exists between the FRM and these measures, which indicates the validity of the FRM as a systemic risk measure. The implementation of this project is carried out using parallel computing, the codes are published on www.quantlet.de with keyword FRM. The R package RiskAnalytics is another tool with the purpose of integrating and facilitating the research, calculation and analysis methods around the FRM project. The visualization and the up-to-date FRM can be found on hu.berlin/frm.

Proving super-polynomial lower bounds on the size of proofs of unsatisfiability of Boolean formulas using resolution over parities is an outstanding problem that has received a lot of attention after its introduction by Raz and Tzamaret [Ann. Pure Appl. Log.'08]. Very recently, Efremenko, Garlík and Itsykson [ECCC'23] proved the first exponential lower bounds on the size of ResLin proofs that were additionally restricted to be bottom-regular. We show that there are formulas for which such regular ResLin proofs of unsatisfiability continue to have exponential size even though there exists short proofs of their unsatisfiability in ordinary, non-regular resolution. This is the first super-polynomial separation between the power of general ResLin and and that of regular ResLin for any natural notion of regularity. Our argument, while building upon the work of Efremenko et al., uses additional ideas from the literature on lifting theorems.

We study semidefinite relaxations of $\Pi_1$ combinatorial statements. By relaxing the pigeonhole principle, we obtain a new "quantum" pigeonhole principle which is a stronger statement. By relaxing statements of the form "the communication complexity of $f$ is $> k$", we obtain new communication models, which we call "$\gamma_2$ communication" and "quantum-lab protocols". We prove, via an argument from proof complexity, that any natural model obtained by such a relaxation must solve all Karchmer--Wigderson games efficiently. However, the argument is not constructive, so we work to explicitly construct such protocols in these two models.

We report our efforts in identifying a set of previous human evaluations in NLP that would be suitable for a coordinated study examining what makes human evaluations in NLP more/less reproducible. We present our results and findings, which include that just 13\% of papers had (i) sufficiently low barriers to reproduction, and (ii) enough obtainable information, to be considered for reproduction, and that all but one of the experiments we selected for reproduction was discovered to have flaws that made the meaningfulness of conducting a reproduction questionable. As a result, we had to change our coordinated study design from a reproduce approach to a standardise-then-reproduce-twice approach. Our overall (negative) finding that the great majority of human evaluations in NLP is not repeatable and/or not reproducible and/or too flawed to justify reproduction, paints a dire picture, but presents an opportunity for a rethink about how to design and report human evaluations in NLP.

Cryptocurrency, the most controversial and simultaneously the most interesting asset, has attracted many investors and speculators in recent years. The visibly significant market capitalization of cryptos also motivates modern financial instruments such as futures and options. Those will depend on the dynamics, volatility, or even the jumps of cryptos. We provide a comprehensive investigation of the risk dynamics of the Bitcoin Market from a realized volatility perspective. The Bitcoin market is extremely risky in the sense of volatility, entangled jumps, and extensive consecutive jumps, which reflect the major incidents worldwide. Empirical study shows that the lagged realized variance increases the future realized variance, while the jumps, especially positive ones, significantly reduce future realized variance. The out-of-sample forecasting model reveals that, in terms of forecasting accuracy and utility gain, investors interested in the long-term realized variance benefit from explicitly modelling the jumps and signed estimators, which is unnecessary for the short-term realized variance forecast.

We measure the energy emitted by extensive air showers in the form of radio emission in the frequency range from 30 to 80 MHz. Exploiting the accurate energy scale of the Pierre Auger Observatory, we obtain a radiation energy of 15.8 \pm 0.7 (stat) \pm 6.7 (sys) MeV for cosmic rays with an energy of 1 EeV arriving perpendicularly to a geomagnetic field of 0.24 G, scaling quadratically with the cosmic-ray energy. A comparison with predictions from state-of-the-art first-principle calculations shows agreement with our measurement. The radiation energy provides direct access to the calorimetric energy in the electromagnetic cascade of extensive air showers. Comparison with our result thus allows the direct calibration of any cosmic-ray radio detector against the well-established energy scale of the Pierre Auger Observatory.

New ground-based and space-based photometric data have been obtained and archival spectroscopic measurements were used in this study of three detached early-type and southern-hemisphere eccentric eclipsing binaries GM Nor (P = 1.88 d, e = 0.05), V397 Pup (3.00, 0.30), and PT Vel (1.80, 0.12). Their TESS observations in several sectors have also been included and the corresponding light curves were solved using the Phoebe code. As a result, new accurate photoelectric times of minimum light have been obtained. The newly completed O-C diagrams were analyzed using all reliable timings found in the literature and calculated using the TESS light curves. New or improved values for the elements of apsidal motion were obtained. Using ESO archive spectroscopy, for V397 Pup, the precise absolute parameters were newly derived: M1 = 3.076(35) M$\odot$, M2 = 2.306(35) M$\odot$, and R1 = 2.711(55) R$\odot$, R2 = 1.680(55) R$\odot$. For PT Vel the absolute dimensions were improved: M1 = 2.204(25) M$\odot$, M2 = 1.638(25) M$\odot$, and R1 = 2.108(30) R$\odot$, R2 = 1.605(30) R$\odot$. For GM Nor, the less accurate absolute parameters based on the light curve analysis were evaluated: M1 = 1.94(15) M$\odot$, M2 = 1.84(14) M$\odot$, and R1 = 2.27(20) R$\odot$, R2 = 2.25(20) R$\odot$. We found more precise and relatively short periods of apsidal motion of about 80, 335, and 160 years, along with the corresponding internal structure constants, log k2, -2.524, -2.361, and -2.563, for GM Nor, V397 Pup, and PT Vel, respectively. Relativistic effects are small but not negligible, making up to 10\% of the total apsidal motion rate in all systems. No marks of the presence of the third body were revealed in the light curves, on the O-C diagrams, or in the reduced spectra of the eccentric systems studied here.

We report on a new general relativistic computational model enhancing, in various respects, the capability of presently available tools for fitting spectra of X-ray sources. The new model is intended for spectral analysis of black-hole accretion discs. Our approach is flexible enough to allow easy modifications of intrinsic emissivity profiles. Axial symmetry is not assumed, although it can be imposed in order to reduce computational cost of data fitting. The main current application of our code is within the XSPEC data-fitting package, however, its applicability goes beyond that: the code can be compiled in a stand-alone mode, capable of examining time-variable spectral features and doing polarimetry of sources in the strong-gravity regime. Basic features of our approach are described in a separate paper (Dovciak, Karas & Yaqoob 2004). Here we illustrate some of its applications in more detail. We concentrate ourselves on various aspects of line emission and Compton reflection, including the current implementation of the lamp-post model as an example of a more complicated form of intrinsic emissivity.

In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices. This problem is NP-hard (even $\exists\mathbb{R}$-complete [Schaefer, 2010]) in the general case [Kratochv\'il & Ne\^setril, 1992] and remains so if we restrict the segments to be axis-aligned, i.e., horizontal and vertical [Kratochv\'il, 1994]. A long standing open question for the latter variant is its complexity when the order of segments along one axis (say the vertical order of horizontal segments) is already given [Kratochv\'il & Ne\^setril, 1992; Kratochv\'il, 1994]. We resolve this question by giving efficient solutions using two very different approaches that are interesting on their own. First, using a graph-drawing perspective, we relate the problem to a variant of the well-known Level Planarity problem, where vertices have to lie on pre-assigned horizontal levels. In our case, each level also carries consecutivity constraints on its vertices; this Level Planarity variant is known to have a quadratic solution. Second, we use an entirely combinatorial approach, and show that both problems can equivalently be formulated as a linear ordering problem subject to certain consecutivity constraints. While the complexity of such problems varies greatly, we show that in this case the constraints are well-structured in a way that allows a direct quadratic solution. Thus, we obtain three different-but-equivalent perspectives on this problem: the initial geometric one, one from planar graph drawing and a purely combinatorial one.

Contact binaries are found throughout the solar system. The recent discovery of Selam, the satellite of MBA (152830) Dinkinesh, by the NASA LUCY mission has made it clear that the term `contact binary' covers a variety of different types of bi-modal mass distributions and formation mechanisms. Only by modelling more contact binaries can this population be properly understood. We determined a spin state and shape model for the Apollo group contact binary asteroid (388188) 2006 DP14 using ground-based optical and radar observations collected between 2014 and 2023. Radar delay-Doppler images and continuous wave spectra were collected over two days in February 2014, while 16 lightcurves in the Cousins R and SDSS-r filters were collected in 2014, 2022 and 2023. We modelled the spin state using convex inversion before using the SHAPE modelling software to include the radar observations in modelling concavities and the distinctive neck structure connecting the two lobes. We find a spin state with a period of $(5.7860\pm0.0001)$ hours and pole solution of $\lambda = (180\pm121)^\circ$and$\beta = (-80\pm7)^\circ$ with morphology indicating a 520 m long bi-lobed shape. The model's asymmetrical bi-modal mass distribution resembles other small NEA contact binaries such as (85990) 1999 JV6 or (8567) 1996 HW1, which also feature a smaller `head' attached to a larger `body'. The final model features a crater on the larger lobe, similar to several other modelled contact binaries. The model's resolution is 25 m, comparable to that of the radar images used.

We characterize several properties of core quandles in terms of the properties of their underlying groups. Specifically, we characterize connected cores providing an answer to an open question in \cite{saito} and present a standard homogeneous representation for them, which allows us to prove that simple core quandles are primitive.

We compute the partition function for the $N=1$ spinning particle, including pictures and the large Hilbert space, and show that it counts the dimension of the BRST cohomology in two- and four-dimensional target space. We also construct a quadratic action in the target space. Furthermore, we find a consistent interaction as a derived bracket based on the associative product of world line fields, leading to an interacting theory of multiforms in space-time. Finally, we comment on the equivalence of the multiform theory with a Dirac fermion. We also identify the chiral anomaly of the latter with a Hodge anomaly for the multiform theory, which manifests itself as a deformation of the gauge fixing.

The class $NP$ can be defined by the means of Monadic Second-Order logic going back to Fagin and Feder-Vardi, and also by forbidden expanded substructures (cf. lifts and shadows of Kun and Ne\v{s}et\v{r}il). Consequently, for such problems there is no dichotomy, unlike for $CSP$'s. We prove that ordering problems for graphs defined by finitely many forbidden ordered subgraphs still capture the class $NP$. In particular, we refute a conjecture of Hell, Mohar and Rafiey that dichotomy holds for this class. On the positive side, we confirm the conjecture of Duffus, Ginn and R\"odl that ordering problems defined by one single biconnected ordered graph are $NP$-complete but for the ordered complete graph. An interesting feature appeared and was noticed several times. For finite sets of biconnected patterns (which may be colored structures or ordered structures) complexity dichotomy holds. A principal tool for obtaining this result is known as the Sparse Incomparability Lemma, a classical result in the theory of homomorphisms of graphs and structures. We prove it here in the setting of ordered graphs as a Temporal Sparse Incomparability Lemma for orderings. Interestingly, our proof involves the Lov\'asz Local Lemma.

We formulate the BCOV theory of deformations of complex structures as a pull-back to the super moduli space of the worldline of a spinning particle. In this approach the appearance of a non-local kinetic term in the target space action has the same origin as the mismatch of pictures in the Ramond sector of super string field theory and is resolved by the same type of auxiliary fields in shifted pictures. The BV-extension is manifest in this description. A compensator for the holomorphic 3-form can be included by resorting to a description in the large Hilbert space.

The energy dependence of the cross section of the (n,p) and (n,d) reactions on $^\text{nat}$C has been studied for the first time at the n_TOF facility at CERN, from the particle detection threshold up to 25 MeV. The measurement was performed with two telescopes made of position-sensitive silicon $\Delta E$-$E$ detectors, covering the angular range from 20° to 140°. A detector efficiency has been determined by means of Monte Carlo simulations of the experimental setup. Various assumptions on the angular distributions and branching ratios of the excited levels of the residual $^{11}$B, $^{12}$B, $^{13}$B nuclei were considered. In particular, theoretical calculations based on the TALYS-2.0 code were used and the systematic uncertainties in the analysis results were determined from the variations in these distributions. The n_TOF data on the (n,p) and (n,d) reaction on carbon are characterized by a higher accuracy and wider energy range than currently available in literature. A comparison with current evaluations from different libraries reveals a rather significant disagreement with the n_TOF results, while a remarkable agreement is observed with the prediction of TALYS-2.0 for this light element.

Through their respective sigma models, a bosonic string and a superstring can be coupled to (super)gravity fields. These are subsequently forced to satisfy their right classical equation of motions, as a consequence of quantization of the string. There are indications that particle models with extended supersymmetry can replicate this behavior. The bosonic sector of supergravity, comprising the metric, the Kalb-Ramond 2-form and the dilaton scalar field, was already shown to derive from Becchi-Rouet-Stora-Tyutin quantization of the $N=4$ spinning particle. Expanding on these results, here we discuss how to retrieve other Supergravity fields in the background.

We find an orientation of a tree with 20 vertices such that the corresponding fixed-template constraint satisfaction problem (CSP) is NP-complete, and prove that for every orientation of a tree with fewer vertices the corresponding CSP can be solved in polynomial time. We also compute the smallest tree that is NL-hard (assuming L is not NL), the smallest tree that cannot be solved by arc consistency, and the smallest tree that cannot be solved by Datalog. Our experimental results also support a conjecture of Bulin concerning a question of Hell, Nesetril and Zhu, namely that "easy trees lack the ability to count". Most proofs are computer-based and make use of the most recent universal-algebraic theory about the complexity of finite-domain CSPs. However, further ideas are required because of the huge number of orientations of trees. In particular, we use the well-known fact that it suffices to study orientations of trees that are cores and show how to efficiently decide whether a given orientation of a tree is a core using the arc-consistency procedure. Moreover, we present a method to generate orientations of trees that are cores that works well in practice. In this way we found interesting examples for the open research problem to classify finite-domain CSPs in NL.

Twin-peak quasi-periodic oscillations (QPOs) are observed in the X-ray power-density spectra of several accreting low-mass neutron star (NS) binaries. In our previous work we have considered several QPO models. We have identified and explored mass-angular-momentum relations implied by individual QPO models for the atoll source 4U 1636-53. In this paper we extend our study and confront QPO models with various NS equations of state (EoS). We start with simplified calculations assuming Kerr background geometry and then present results of detailed calculations considering the influence of NS quadrupole moment (related to rotationally induced NS oblateness) assuming Hartle-Thorne spacetimes. We show that the application of concrete EoS together with a particular QPO model yields a specific mass-angular-momentum relation. However, we demonstrate that the degeneracy in mass and angular momentum can be removed when the NS spin frequency inferred from the X-ray burst observations is considered. We inspect a large set of EoS and discuss their compatibility with the considered QPO models. We conclude that when the NS spin frequency in 4U 1636-53 is close to 580Hz we can exclude 51 from 90 of the considered combinations of EoS and QPO models. We also discuss additional restrictions that may exclude even more combinations. Namely, there are 13 EOS compatible with the observed twin peak QPOs and the relativistic precession model. However, when considering the low frequency QPOs and Lense-Thirring precession, only 5 EOS are compatible with the model.