CAS I: A Geometric Coding Theorem
arXiv:2607. 13796v1 Announce Type: cross Abstract: This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups.
arXiv:2607. 13796v1 Announce Type: cross Abstract: This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups.
arXiv:2104. 11547v5 Announce Type: replace-cross Abstract: Statistical models contain variables that are not random: parameters, treatments, environments, design points.
arXiv:2507. 05972v3 Announce Type: replace-cross Abstract: Pseudoentropy characterizations give quantitatively precise formulations of the relationship between computational hardness and computational randomness.
arXiv:2409. 15600v3 Announce Type: replace Abstract: A representation of a molecule or material should be invariant to the symmetries of physics, unique, continuous, efficient and general.
arXiv:2605. 20440v2 Announce Type: replace Abstract: Symmetry is central to the physical sciences, yet machine learning usually captures it only approximately, leaving a residual per-step equivariance error $\varepsilon$ that compounds with depth $M$ as $M\varepsilon$, whereas exact equivariance holds at unbounded depth; we demonstrate this divergence at fourteen orders of magnitude.
arXiv:2608. 10420v1 Announce Type: new Abstract: Reasoning shortcuts are solutions of a neurosymbolic system's rules that produce correct predictions through unintended concepts.
arXiv:2608. 08118v1 Announce Type: new Abstract: There are several methods for searching for graphs with prescribed properties, such as SAT solvers and specialized generators.
arXiv:2607. 10194v1 Announce Type: cross Abstract: We present IsalHG, a method for representing the structure of any finite, connected hypergraph of bounded hyperedge arity as a string over a compact instruction alphabet $\Sigma_{\mathrm{HG}}$.
arXiv:2606. 17851v1 Announce Type: new Abstract: A wide range of neurosymbolic (NeSy) systems compute one functional: a belief-weighted sum of a logical quantity over a space of $\sigma$-structures, of which weighted model counting, fuzzy logic, and probabilistic logic are special cases.
arXiv:2607. 26344v1 Announce Type: new Abstract: A gradient-based GNN explainer given a molecule with two chemically equivalent nitro groups assigns them attribution scores that are equal to the last bit.
arXiv:2609.23094v1 Announce Type: cross Abstract: We study the number of prototypes needed to represent Boolean functions by nearest-neighbour classification. There are two distinct settings: the pro...
arXiv:2609.15083v1 Announce Type: new Abstract: Mixed-curvature representation learning seeks to capture rich geometric structures that cannot be adequately modeled by a single curvature regime. Exis...