Systematic errors in the parameter estimation (PE) of gravitational wave (GW) mergers can arise from various sources, including waveform systematics, noise mischaracterization, data analysis artifacts, and other unknown factors. In this study, we analyze selected events from the first three observing runs of the LIGO-Virgo-KAGRA (LVK) collaboration. We choose events that have been flagged in various studies as potentially affected by systematic errors. Here, we reanalyze these events using a couple of parametric models developed in previous work that incorporate uncertainties in both the phase and amplitude of the GW waveform. In this data-driven approach, we apply sufficiently broad priors on the uncertainty parameters to account for potential systematic errors. Our findings show that the proposed method effectively reduces systematic errors, even those arising from data artifacts, such as glitches occurring near a signal and the deglitching process in GW frame files. Similarly, inconsistent results from different waveform models become much more consistent in our framework. One noteworthy event we examine is GW191109\_010717, which is particularly interesting due to its anti-aligned spin properties. We report that, within our framework, the event still exhibits anti-aligned spin characteristics, but the inference results become consistent across raw and deglitched frame files, as well as across the waveform models used for this event (IMRPhenomXPHM, IMRPhenomXO4a, and NRSur7dq4). A similar trend is observed for the event GW200129\_065458, which previously yielded a high, but inconsistent precession parameter among different waveform models. In contrast, we observe a non-zero and consistent value of $χ_{p}=0.60^{+0.31}_{-0.33}, 0.58^{+0.30}_{-0.29}$ and $0.56^{+0.31}_{-0.28}$ for the IMRPhenomXPHM, IMRPhenomXO4a, and NRSur7dq4 waveform models, respectively.

We report the closed-form expression for Hill's surfaces in the circular restricted three-body problem. The solution $ϕ(r,θ)$, derived in the primary-centric spherical coordinate system, is deduced from a cubic equation delivering at most two roots on each side of a separatrix. The famous patterns (tadpole, horseshoe and peanut shapes, Roche lobes and Hill's quasi-spheres) are exactly produced.

Most Active Galactic Nuclei (AGN) are Radio Quiet, with radio emission that may arise from star-formation activity, AGN-driven winds, weak jets, and coronal activity. Disentangling these mechanisms is challenging and requires detailed multi-wavelength investigation, but it is crucial for quantifying AGN feedback in galaxy evolution. We present a detailed radio investigation of 21 X-ray selected AGN in the Supermassive Black Hole Winds in X-Rays (SUBWAYS) sample (log Lbol = 44.9-46.3 erg/s, z=0.1-0.5), selected to systematically search for Ultra-Fast Outflows (UFOs). UFOs are detected in 30% of the targets, making the sample particularly well-suited for investigating the role and signatures of multi-scale outflows at different frequencies. We build the radio SED of the sources complementing our proprietary data, collected with the JVLA at 1.5 and 6 GHz, with images from LoTSS and other publicly available radio surveys between 150 and 1400 MHz. We investigate the role and occurrence of the aforementioned mechanisms, with particular interest in outflows and their possible relation with UFOs. We combined information on spectral indices, luminosities, and morphologies of the radio emission with properties derived in other wavebands, such as Star Formation Rate, X-ray luminosity, Eddington ratio or the UFO kinetic luminosity. All the sources are detected and are mostly consistent with RQ AGN. For 80% of the sources the data suggest the presence of an outflow (wind or weak jet). Interestingly, our results indicate that AGN with UFOs tend to have larger radio extension and a steep radio spectrum consistent with outflows. Moreover, the radio emission of the 6 UFO hosts is consistent with predictions from wind-driven shock models, possibly indicating a direct connection between the two phases. Alternatively, this may reflect physical conditions favouring the rise of both phenomena.

The unprecedented predictive success of deep generative models in complex many-body systems, such as AlphaFold3, raises an epistemological question: do these networks merely memorize data distributions via high-dimensional interpolation, or do they autonomously deduce the underlying physical laws? To address this, we introduce a rigorous algebraic framework to extract the implicit physical interactions learned by generative models. By establishing an exact equivalence between the zero-noise limit of a Riemannian diffusion score field and the thermodynamic restoring force, we utilize the trained neural network as a direct force estimator. Applying this framework to a sequence-dependent, frustrated 1D $O(3)$ spin glass, we probe the latent representations of an $O(3)$-equivariant attention architecture trained solely on thermal equilibrium snapshots. Without incorporating any energetic priors, an overdetermined linear inversion successfully recovers the microscopic Hamiltonian parameters of the spin system. The inferred Hamiltonian parameters exhibit a $99.7\%$ cosine similarity with the ground-truth interaction parameters. Furthermore, these sparse local parameters alone are sufficient to explain $87\%$ of the variance in the continuous force field predicted by the network. Our results provide quantitative, falsifiable evidence that deep generative architectures do not merely perform statistical pattern matching, but autonomously discover and internalize the underlying physical rules.

We introduce a novel class of defects, termed crosscap defects, in conformal field theory (CFT) in general dimensions. These arise from quotienting the spacetime by a $Z_2$ automorphism, and provide higher-codimension generalisations of CFT on real projective space ($RP^{d}$). Crosscap defects extend along a $p$-dimensional fixed locus of the $Z_2$ action and preserve an $SO(p+1,1)\times PO(d-p)$ subgroup of the conformal group. The two-point functions of operators in this setup exhibit three operator product expansion channels: bulk, image, and defect. These lead to several crosscap crossing equations, which we present. We analyse conformal block decompositions and show that the blocks are identical to defect CFT blocks up to a redefinition of cross ratios. As concrete examples, we study crosscap defects in the $O(N)$ model at the Gaussian and Wilson--Fisher fixed points in the $\varepsilon$-expansion. We compute explicitly the associated CFT data as a function of $p$ and find that, unlike standard defects, displacement and tilt operators are absent for generic $p$. They provide examples of defect conformal manifolds without exactly marginal operators.

The paper deals with the Camassa--Holm equation with variable coefficients (vcCH equation) that is a direct generalization of the well known Camassa--Holm equation. We focus on the mathematical description of particular solutions of the vcCH equation with a small dispersion that exhibit properties analogous to those of classical soliton and peakon solutions, and consider the construction of soliton- and peakon-like solutions in the form of asymptotic expansions, including both one-phase and two-phase cases. The solution is expressed as the sum of a regular background common to all soliton- and peakon-like solutions and a singular component that captures their distinctive features, with the precise definition of the main singular term playing a central role. In the one-phase case, this term is determined, and the solvability of higher-order singular corrections is established in suitable functional spaces, enabling the construction of asymptotic solutions to arbitrary accuracy in a small parameter. The study also addresses the construction of two-phase soliton- and peakon-like solutions. Theorems on the asymptotic accuracy of the constructed asymptotic solutions have been proved. Each of the considered cases is illustrated by nontrivial examples for which, in accordance with the obtained general results, approximate solutions are derived in explicit form and their graphs are presented.

We investigate the properties of charged black hole geometries in nonlinear electrodynamics. We focus on the recently reported analytic charged black hole solutions to illustrate the consequences of a non-monotonic lapse function that exists for a wide range of black hole solutions. The spacetime admits stable light-rings, static near-horizon observers, and trapped near horizon photon orbits. We also show that although these modifications near the horizon are screened from afar, they nonetheless lead to additional branches of quasinormal modes for the black hole that are longer lived than the canonical Einstein branches.

Superconducting qubit fabrication innovations continue to be explored to achieve higher performance. Despite improvements to base layer fabrication and processing, resist-based Josephson junction (JJ) schemes have largely remained unchanged. The polymer mask during deposition causes chemical contamination and limits in situ and ex situ surface preparation, junction materials, and scalability. Here, we demonstrate a resist-free approach to junction fabrication based on etched silicon trenches that is CMOS compatible and easily integrated into existing innovations in qubit base layer fabrication and chemical processing. We fabricate Al-AlOx-Al JJs and qubits using this method, measuring median energy relaxation times up to 184 microseconds. We find minimal contamination at the substrate-metal interface and fluctuations of energy relaxation on a 35 hour timescale that are narrow and normally distributed. The method widens the process window for substrate preparation and new materials platforms.

Pólya's shire theorem identifies the final set of zeros of successive derivatives of an arbitrary meromorphic function with at least one pole with the Voronoi diagram of its finite poles. We prove a fixed-scale zero-counting law for hyperexponential functions $f=(P/Q)\exp(S/T)$, allowing ordinary poles and finite essential singularities of arbitrary order and position, thus extending Pólya's picture beyond the rational, polynomial-exponential, and one-dimensional finite-essential-singularity settings. After the forced singular factors are removed from the numerator of $f^{(n)}$, the normalized zero-counting measures converge in the original $z$-plane to the classical Voronoi edge measure generated by all finite singular sites, augmented by explicitly weighted atoms at the finite essential singularities, which thereby enter Pólya's picture both as Voronoi sites and as sources of linear-size zero clusters. If $S/T$ has a nonconstant polynomial part, the complementary mass escapes to infinity. We determine the microscopic laws of these clusters, obtaining the reciprocal Marchenko--Pastur law for simple poles of $S/T$ and higher-order multiple-Laguerre, equivalently Laguerre Muttalib--Borodin, limits for higher-order poles. Finally, inside essential Voronoi cells we identify the first sublinear zero layer, including its Stokes geometry, densities, and final-set consequences away from transition loci.

Managing large-scale vector datasets with disk-resident graph approximate nearest neighbor search (ANNS) systems incurs substantial storage overhead due to the co-location of vector data and auxiliary index metadata, which prevents the storage layer from exploiting their distinct compressibility. We present COMPASS, a component-aware compressed storage framework for disk-resident graph vector search. Leveraging data-index decoupling as a foundation, COMPASS losslessly compresses each component according to its distinct compressibility characteristics, thereby significantly reducing storage space. It further adapts the search and update paths to preserve their performance under compressed storage layouts. Evaluation on real-world public and proprietary billion-scale datasets shows that COMPASS reduces storage space by up to 58.7%, while delivering improved or competitive search and update performance compared to state-of-the-art disk-resident graph ANNS systems.

The Kerr-Schild double copy (KSDC) is well-known for relating exact classical solutions between Yang-Mills theory and theories of gravity. However, whether this correspondence provides a more fundamental mapping between the underlying symmetries of gauge theory and gravity remains an underdeveloped area of research in the contemporary double copy program. In this paper, we demonstrate that the KSDC correspondence does not provide a mapping between the residual symmetry structures of the Kerr-Schild ansatz in Yang-Mills theory and gravity. On the gauge theory side, residual symmetries form an infinite-dimensional algebra of functions along null directions. On the gravitational side, residual diffeomorphisms preserving the Kerr-Schild form of the Schwarzschild metric generate a conformal algebra on $S^2$, which decomposes into Killing vectors and proper conformal Killing vectors (CKVs). While the Killing sector reproduces the expected global isometries, the CKV sector yields an infinite-dimensional algebra after imposing asymptotic flatness and horizon regularity. This appears to contradict the fact that the Schwarzschild solution admits no proper conformal symmetries. We resolve this apparent contradiction by constructing a Weyl-compensated BRST complex, showing that the CKV sector is BRST-exact and therefore trivial in cohomology, so that the physical symmetry algebra reduces to the global isometries of Schwarzschild. This demonstrates that the KSDC introduces an enlarged symmetry structure at the level of the ansatz, but preserves physical symmetries after a cohomological reduction, revealing a fundamental mismatch between Yang-Mills and gravity at the level of residual symmetries.

Burgers vectors (b) of threading dislocations (TDs) in an acidic ammonothermal-grown GaN substrate were investigated using synchrotron radiation x-ray topography (SR-XRT) by combining both reflection and transmission modes. Reflection XRT images recorded with six equivalent g vectors of 11-24 revealed spot-like contrasts corresponding to TDs. Based on the contrast conditions, the possible Burgers vectors were constrained, and the c-axis component of b for mixed-type TDs was estimated from the contrast size. Using transmission XRT images recorded under several two-beam diffraction conditions, the (0001) in-plane direction of b was evaluated based on the gb invisibility criterion. Furthermore, by analyzing the linewidths of dislocation images observed under kinematical diffraction contrast, the magnitude of the a-axis component of b was determined. By combining these analyses, the Burgers vectors of individual TDs, including edge- and mixed-type dislocations, were determined. In addition, a pair of screw-type TDs with opposite Burgers vectors, +1c, -1c, was observed in the transmission SR-XRT. These results demonstrate that the combined use of reflection and transmission SR-XRT provides a practical approach for complete determination of Burgers vectors in GaN substrates.

(N, M)-clusters are partitions of $\mathbb{R}^d$ into N+M regions, where N chambers have prescribed finite measure and M chambers have infinite measure. Locally minimizing clusters are the configurations which minimize the perimeter among all competitors with compact support satisfying the same measure constraints. The characterization of these partitions has been widely studied for the standard (isotropic) perimeter. In the present paper, we investigate the corresponding problem for anisotropic perimeters, considering a general anisotropy. More specifically, we focus on (1,2)-clusters and (1,3)-clusters in $\mathbb{R}^2$. Our main results provide a geometric characterization of these local minimizers: for regular (smooth, symmetric, and uniformly convex) anisotropies, we prove that a cluster is a local minimizer if and only if, up to translations, it is a standard anisotropic lens cluster in the (1,2)-cluster case, or a standard anisotropic triod cluster in the (1,3)-cluster case. In addition, using an approximation argument, we extend the minimizing property of these configurations to general anisotropies.

Proteins can combine into functional elements in living cells or self-assemble into unwanted structures in a number of diseases. The resulting aggregates often display filamentous morphologies across a large range of protein shapes and molecular interactions. This has led to the suggestion that filament formation could be a generic outcome of the aggregation of geometrically complex, ill-fitting objects, although such a mechanism has not been demonstrated in three dimensions. To address this problem, we theoretically study the self-assembly of three-dimensional identical, ill-fitting deformable subunits mimicking globular proteins in solution. In our model, self-assembling subunits incur deformations that accumulate as the aggregate size increases and can eventually hamper further assembly. We analytically predict the ground state morphologies of the resulting aggregates as a function of the subunit adhesivity and elasticity by mapping their mechanics onto those of two incompatible, interconnected networks. We find that zero-dimensional clusters, three-dimensional bulks as well as symmetry-broken one-dimensional filaments and two-dimensional layers can all form depending on assembly parameters. Poorly compressible, moderately adhesive subunits favor filaments. These findings hint at a generic pathway to control self-assembly in three dimensions and suggests that such mechanisms could be investigated in more realistic protein models.

We use cubic reciprocity to prove that the equation $7x^3+2y^3=3z^2+1$ has no integer solutions. Prior to this work, it was the shortest cubic equation for which the existence of integer solutions remained open. We conclude with a list of the new shortest open cubic equations.

We aim to clarify the experimentally observed near-degeneracy and decay patterns of the isospin, $I=1$, hidden-bottom tetraquarks $Z_b(10610)$ and $Z_b(10650)$ with quantum numbers $J^{P}=1^{+}$.We refer to them as $Z_b$ and $Z_b^{'}$, respectively. In particular, we find first evidence that the suppression of the decay of $Z_b^{'}$ to $B\bar{B^*}$ can be understood in the context of the Born-Oppenheimer Effective Field Theory (BOEFT). BOEFT enables writing both $Z_b$ and $Z_b^{'}$ as superpositions of $Z_1$ and $Z_2$ tetraquark configurations. This decomposition naturally relates the decay patterns of $Z_b$ and $Z_b^{'}$ to the degeneracy of the light degrees of freedom associated with $Z_1$ and $Z_2$ tetraquarks, {\it i.e.,} $1^{--}$and $0^{-+}$ adjoint mesons, respectively. By calculating the adjoint meson correlators within the framework of lattice QCD, we get good indications that these adjoint mesons are degenerate.

Valley photonics has emerged as a promising platform in topological photonic systems, yet the topological nature of valley-dependent phenomena remains unsettled. Theoretically, inter-valley scattering may occur with structural imperfections, and global Chern numbers vanish due to time-reversal symmetry. As a result, valley-dependent topology is locally defined around K(K') points in the half-Brillouin zone (HBZ). While half-integer valley Chern numbers have been widely assumed, their quantization and topological validity remain controversial. Here, we systematically investigate a continuous spectrum of valley photonic crystal designs by evaluating their Berry curvatures, valley Chern numbers, and angular momenta. We show that valley Chern numbers are generically unquan-tized and instead form a continuous spectrum varying with structural parameters. We further reveal previously unexplored fine structures in the Berry curvature distribution in momentum space. The unquantized valley Chern numbers are attributed to inter- and intra-valley cancellation of Berry curvature, highlighting the absence of a protecting mechanism for quantization. Our results call for a reassessment of valley-dependent topology and provide a more rigorous framework for interpreting valley-related photonic phenomena.

Interleaved ADCs are critical for applications requiring multi-gigasample per second (GS/s) rates, but their performance is often limited by offset, gain, and timing skew mismatches across the sub-ADCs. We propose exact but compact expressions that describe the impact of each of those non-idealities on the output spectrum. We derive the distribution of the power of the induced spurs and replicas, critical for yield-oriented derivation of sub-ADC specifications. Finally, we provide a practical example in which calibration step sizes are derived under the constraint of a target production yield.

We propose a mechanism for baryogenesis in which the baryon asymmetry is generated as an equilibrium response of weak sphalerons in a region where electroweak sphaleron transitions remain unsuppressed, $h/T\lesssim 1$. A nonzero equilibrium baryon density arises in the presence of an approximately conserved global charge, carried either by new states with nonzero hypercharge, or by Standard Model fields themselves. The required global charge asymmetry is generated during a phase transition that changes the strength of electroweak symmetry breaking, but need not coincide with the final electroweak phase transition. In particular, the mechanism can operate during an inverse electroweak phase transition, where baryon number is produced behind the advancing wall, in contrast to conventional electroweak baryogenesis. Because baryon production is decoupled from a direct first-order electroweak phase transition, the scenario can be realized at parametrically higher temperatures than standard electroweak baryogenesis, thereby weakening current experimental constraints. This framework provides a qualitatively distinct route to electroweak baryogenesis, with different parametric dependence, phase-transition dynamics, and phenomenological signatures.

A triangulation of a surface is k-irreducible if every non-contractible curve has length at least k and any edge contraction breaks this property. Equivalently, every edge belongs to a non-contractible curve of length k and there are no shorter non-contractible curves. We prove that a k-irreducible triangulation of an orientable surface of genus g has $O(k^2g)$ triangles, which is optimal. This is an improvement over the previous best bound $k^{O(k)} g^2$ of Gao, Richter and Seymour [Journal of Combinatorial Theory, Series B, 1996].

Automated prompt optimization (APO) aims to improve large language model performance by refining prompt instructions. However, existing methods are largely constrained by fixed prompt templates, limited search spaces, or single-sided optimization that treats user questions as immutable inputs. In practice, question formulation and prompt design are inherently interdependent: clearer question structures facilitate focused reasoning and task understanding, while effective prompts reveal better ways to organize and restate queries. Ignoring this coupling fundamentally limits the effectiveness and adaptability of current APO approaches. We propose a unified multi-agent system (Helix) that jointly optimizes question reformulation and prompt instructions through a structured three-stage co-evolutionary framework. Helix integrates (1) planner-guided decomposition that breaks optimization into coupled question-prompt objectives, (2) dual-track co-evolution where specialized agents iteratively refine and critique each other to produce complementary improvements, and (3) strategy-driven question generation that instantiates high-quality reformulations for robust inference. Extensive experiments on 12 benchmarks against 6 strong baselines demonstrate the effectiveness of Helix, achieving up to 3.95% performance improvements across tasks with favorable optimization efficiency.

We study the scalar perturbations of asymptotically flat extremal Reissner-Nordström black holes via the quantum Seiberg-Witten geometry of $\mathcal{N}=2$ SU(2) gauge theory with $N_f=2$ flavors. The radial master equation, governed by a double confluent Heun equation, is exactly mapped to the quantum Seiberg-Witten curve, providing an exact quantization condition derived from the non-perturbative Nekrasov-Shatashvili free energy. Analytically, this exact dictionary unveils precise gauge-theoretic interpretations for critical physical thresholds, demonstrating that the superradiance and mass decoupling limits naturally reduce the master equation to the Whittaker equation and the reduced doubly confluent Heun equation (the latter corresponds to the SW geometry of the $\mathcal{N}=2$ SU(2) gauge theory with $N_f=1$), respectively. At the strict extremal limit, the coalescence of horizons induces a topological singularity that complicates the spectral analysis. By accommodating this irregular singularity, our geometric framework resolves the singularity coalescence and enables the extraction of the discrete global quasinormal mode. As our main contribution, we provide the first non-perturbative evaluation of the quasinormal modes spectrum for simultaneously charged and massive scalar fields directly at strict extremity. Furthermore, our analytical results reproduce numerical benchmarks for both neutral and charged massless probes, and naturally capture quasi-resonance behaviors.

The concept of matrix D-stability plays an important role in applications, ranging from economic and biological system models to decentralized control. Here we provide necessary and sufficient Lyapunov-type conditions for the robust (block) D-stability property. We leverage this characterization as part of a novel Lyapunov analysis of decentralized integral control for MIMO LTI systems, providing sufficient conditions guaranteeing stability under low-gain and under arbitrary connection and disconnection of individual control loops.

Bipartite networks, which encode interactions between two distinct types of entities, arise widely in applications and exhibit inherent asymmetry across node sets. Despite a growing literature on bipartite community detection, estimating community numbers $(K_1, K_2)$, a critical issue for bipartite network analysis, remains theoretically underdeveloped without any model selection consistency established, to our knowledge. Indeed, the inherent asymmetry and the two-dimensional parameter space with possibly drastically different $K_1$ and $K_2$ pose unique challenges that differ from unipartite cases. In particular, the candidate models may simultaneously overfit one node set while underfitting the other. To address these challenges, we propose Bipartite Cross-Validation (BCV), a penalized cross-validation framework that jointly selects $(K_1,K_2)$ in a fully data-driven manner. We establish the first model selection consistency for bipartite networks, notably accommodating the regime where the numbers of communities scale with the network size, revealing the intricate interplay between sparsity and model complexity. Simulations and real-data applications demonstrate strong finite-sample performance of BCV.

Rare nonadiabatic events play a central role in photochemistry but remain difficult to simulate because excited-state dynamics is computationally demanding and often stochastic. Here we introduce a deterministic and time-reversible implementation of nonadiabatic dynamics that enables the application of transition path sampling (TPS) to excited-state processes. Our approach builds on the Mapping Approach to Surface Hopping (MASH) and establishes the conditions required for path ensemble sampling, in particular time reversibility and detailed balance. Combining this dynamics with the TPS framework yields a new method, termed nonadiabatic transition path sampling (NATPS). Using a model system of electronically coupled potential energy surfaces, we demonstrate that NATPS efficiently generates ensembles of reactive trajectories and provides mechanistic insight into nonadiabatic pathways. Compared with brute-force trajectory simulations and forward-flux sampling approaches, NATPS substantially reduces the computational effort required to obtain reactive trajectories.

We apply the $\texttt{unimpeded}$ framework to perform a fully Bayesian reanalysis of the DESI DR2 data, using nested sampling with $\texttt{PolyChord}$ to compute evidences for $Λ$CDM and seven extensions across combinations of DESI DR1/DR2, Planck CMB, supernovae (Pantheon+, Union3, DES-SN5YR, DES-Dovekie), and DES-Y1 weak lensing. The Bayesian Ockham's razor penalises extended models, yielding weaker or opposite preferences compared to $Δχ^2$-based analyses. For DESI DR2 BAO combined with Planck CMB alone, the DESI collaboration's $3.1σ$ frequentist preference for $w_0w_a$CDM is eliminated entirely: we obtain ${\ln B = -0.57{\scriptstyle\pm0.26}}$, modestly favouring $Λ$CDM. Adding DES-Dovekie, the recalibration of DES-SN5YR, maintains this concordance (${\ln B = -0.30{\scriptstyle\pm0.19}}$). However, when the earlier DES-SN5YR calibration is included instead, the DESI collaboration's $4.2σ$ result survives the Bayesian Ockham penalty as a $3.07{\scriptstyle\pm0.10},σ$ preference (${\ln B = +3.32{\scriptstyle\pm0.27}}$). That this signal persists despite the Ockham penalty makes the role of tension quantification essential: our analysis traced the preference to the earlier DES-SN5YR calibration, which introduced a $2.95{\scriptstyle\pm 0.04},σ$ conflict with DESI DR2 within $Λ$CDM -- a tension that stands out from the grid -- reduced to $1.96{\scriptstyle\pm 0.04},σ$ with the DES-Dovekie recalibration. With DES-Dovekie, the Bayesian evidence for dynamical dark energy vanishes.

Evidence on the effectiveness of Man-At-The-End (MATE) software protections, such as code obfuscation, has mainly come from limited empirical research. Recently, however, an automatable method was proposed to obtain statistical models of the required effort to attack (protected) software. The proposed method was sketched for a number of attack strategies but not instantiated, evaluated, or validated for those that require human interaction with the attacked software. In this paper, we present a full instantiation of the method to obtain statistical effort models for game resource localisation attacks, which represent a major step towards creating game cheats, a prime example of MATE attacks. We discuss in detail all relevant aspects of our instantiation and the results obtained for two game use cases. Our results confirm the feasibility of the proposed method and its utility for decision support for users of software protection tools. These results open up a new avenue for obtaining models of the impact of software protections on reverse engineering attacks, which will scale much better than empirical research involving human participants.

We extend the study of the 2-Solo Chess problem which was first introduced by Aravind, Misra, and Mittal in 2022. 2-Solo Chess is a single-player variant of chess in which the player must clear the board via captures such that only one piece remains, with each piece capturing at most twice. It is known that the problem is solvable in polynomial time for instances containing only pawns, while it becomes NP-complete for instances restricted to rooks, bishops, or queens. In this work, we complete the complexity classification by proving that 2-Solo Chess is NP-complete if the instance contains only knights or only kings.

Fully Probabilistic design (FPD) is a powerful framework offering an elegant and unifying account of stochastic control, learning and decision-making. Here we introduce a generalized FPD framework, which we term as Tsallis FPD. Tsallis FPD uses Tsallis divergence in place of the Kullback-Leibler divergence that defines the standard FPD cost term. Tsallis divergence is a natural generalization of the KL divergence, rooted in non-extensive statistical mechanics and providing flexibility towards modeling stochastic processes with non-Gaussian tail behavior. After formulating Tsallis FPD, we develop a constructive proof of convergence by formulating a fixed point iteration. The construction takes the form of a double iteration scheme that performs a sequence of backwards inductions, rather than a single pass down the stages that constitutes the proven approach for classical FPD. We prove that this construction asymptotically converges to a fixed point and that this fixed point is an optimal solution to Tsallis FPD.

The generalized egg dropping problem is a classic challenge in sequential decision-making. Standard dynamic programming evaluates the minimax minimum number of tests in $\mathcal{O}(K \cdot N^2)$ time. A known approach formulates the testable thresholds as a partial sum of binomial coefficients and applies binary search to reduce the time complexity to $\mathcal{O}(K \log N)$. In this paper, we demonstrate that binary search over the complete sequential test domain is suboptimal. By restricting a binary search over multiples of $K$, we isolate a dynamic structural envelope that guarantees convergence. We prove that this boundary balances the search depth against the combinatorial evaluation cost, cancelling the $K$ variable to strictly bound the search phase to $\mathcal{O}(\log N)$. Combined with an incremental traversal, our algorithm eliminates the standard bottlenecks. Furthermore, we formulate an explicit $\mathcal{O}(1)$ space policy to dynamically reconstruct the optimal decision tree.