@unpublished{21962, abstract = {The generation of faithful cell-type diversity and correct projection neuron numbers is essential for cerebral cortex development. Corticogenesis is however susceptible to genetic interference of critical signaling pathways, including mutations in Mtor/Rptor that lead to microcephaly. How the loss of Rptor/mTORC1 function affects cortical developmental programs, at single cell level, is still unknown. Here, we utilized Mosaic Analysis with Double Markers (MADM) technology to probe Rptor gene function upon sparse single cell- or global tissue-wide ablation. We found that tissue-wide effects drive the etiology of cortical microcephaly upon loss of Rptor, rather than deficits in projection neuron genesis. Conversely, Rptor function is cell-autonomously required for postnatal projection neuron survival in a highly cell-type-specific manner. Collectively, our results suggest that the fine balance of precise cell-type-specific cell-autonomous Rptor/mTORC1 function in concert with non-cell-autonomous tissue-wide effects is essential for the development of a properly-sized cerebral cortex with accurate projection neuron diversity.}, author = {Villalba Requena, Ana and Beattie, Robert J and Pauler, Florian and Streicher, Carmen and Miranda, Osvaldo and Krausgruber, Thomas and Senekowitsch, Martin and Farlik, Matthias and Bock, Christoph and Rülicke, Thomas and Hippenmeyer, Simon}, booktitle = {bioRxiv}, title = {{Mtor/Rptor function globally prevents cortical microcephaly and cell-autonomously promotes postnatal neuron survival in cell type specific manner}}, doi = {10.64898/2026.05.01.722172}, year = {2026}, } @unpublished{21963, abstract = {The cerebral cortex consists of immense numbers of neuronal and glial cell-types derived from radial glial progenitor (RGP) cells. How RGPs generate appropriate quantities of distinct cortical cell-types to safeguard a brain of correct size, is not well understood. However, genetic aberration in human, including mutations in PTEN, lead to cortical malformation such as macrocephaly, albeit with unknown etiology. Here we utilized Mosaic Analysis with Double Markers (MADM)-based clonal analysis and single cell phenotyping to decipher the role of Pten in neurogenic and gliogenic RGP lineage progression during cortical ontogeny. While neurogenic RGP lineage progression and projection neuron production was moderately altered in the absence of Pten, cortical astrocyte production was drastically increased. Through genetic epistasis experiments we show that the loss of Pten uncouples astrocyte generation from essential growth factor signaling hubs, funneling into MAPK. Collectively, our results suggest that Pten regulates RGP lineage progression with distinct sequential functions in cortical projection neurogenesis and astrocyte production to ensure the emergence of a correctly-sized cerebral cortex.}, author = {Miranda, Osvaldo and Contreras, Ximena and Pauler, Florian and Davaatseren, Amarbayasgalan and Amberg, Nicole and Streicher, Carmen and Villalba Requena, Ana and Heger, Anna-Magdalena and Marie, Corentine and Hassan, Bassem A. and Rülicke, Thomas and Hippenmeyer, Simon}, booktitle = {bioRxiv}, title = {{Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production}}, doi = {10.64898/2026.05.01.722191}, year = {2026}, } @unpublished{21968, abstract = {Balancing selection, a form of selection that maintains genetic diversity, is difficult to detect, and the importance of balancing selection for the maintenance of genetic variation may be larger than often assumed. We model the possibility that the diversity-promoting effects of balancing selection extend to other loci that show sign epistasis with a locus under balancing selection. Rather than focusing on overdominance, as was done in previous efforts, we explore the effects of negative frequency dependence and show that this has important effects on the conditions under which the diversity-promoting effect of epistasis can occur in diploids. Our results show that not only recombination rate but also the dominance of sign epistasis are key parameters that determine the maintenance of polymorphism beyond the locus under direct balancing selection. We suggest that the effect we explore may play a significant role, especially when balancing selection acts on major effect loci.}, author = {Khudiakova, Kseniia and Barton, Nicholas H and Arnqvist, Goran}, booktitle = {bioRxiv}, title = {{Sign epistasis extends the effects of balancing selection on genetic diversity}}, doi = {10.1101/2025.04.09.647826}, year = {2026}, } @misc{21971, abstract = {A Rust library for analyzing dendritic structures using quadric matrices. This project provides efficient tools for representing dendritic trees, computing quadric error metrics, and visualizing eigenvalue distributions on hexagonal plots. This library implements quadric-based geometric analysis of dendritic structures, commonly found in neuroscience applications. Key features include: Tree data structures: Hierarchical vertex and edge representations for dendritic trees Quadric matrices: Computation of quadric error metrics for edges and vertices Visualisation: Hexagonal plot generation using NormPolar transformations Interactive tools: Desktop application with plotting capabilities}, author = {Bleile, Yossi and Cortinovis, Emanuele}, keywords = {quadratics, mathematics, dendrites, geometry, topology}, publisher = {Institute of Science and Technology Austria}, title = {{Quadrix}}, doi = {10.15479/AT-ISTA-21971}, year = {2026}, } @article{21980, abstract = {Despite significant progress in the field of molecular electronics over the last two decades, the quantitative prediction of metal-molecule-metal junction conductance remains a challenge. The standard computational framework combines density functional theory (DFT) with nonequilibrium Green’s functions (NEGF) using low-rung exchange-correlation functionals such as PBE, which overestimate the conductances. More advanced correction methods exist but require complex workflows and high computational cost, limiting their accessibility. Here, we introduce a physically motivated approach that approximates results obtained with high-rung functionals. Our method fits the PBE-calculated transmission to a Breit-Wigner form and subsequently refines the fit parameters using molecular orbital energies and metal densities of states computed for the isolated subsystems with high-rung functionals. This approach is applicable to a broad range of molecular junctions yielding conductance values in quantitative agreement with experiments. Our approach is simple, low-cost, and accurate, making it well-suited for routine and large-scale prediction of single-molecule junction conductance.}, author = {Gulyaev, Artem and Hazarika, Jyotisman and Liu, Zhen-Fei and Venkataraman, Latha}, issn = {1530-6992}, journal = {Nano Letters}, number = {22}, pages = {7429–7434}, publisher = {American Chemical Society}, title = {{A computationally efficient and accurate method for predicting conductance of single-molecule junctions}}, doi = {10.1021/acs.nanolett.6c01462}, volume = {26}, year = {2026}, } @article{20328, abstract = {We consider the standard overlap (math formular) of any bi-orthogonal family of left and right eigenvectors of a large random matrix X with centred i.i.d. entries and we prove that it decays as an inverse second power of the distance between the corresponding eigenvalues. This extends similar results for the complex Gaussian ensemble from Bourgade and Dubach [15], as well as Benaych-Georges and Zeitouni [13], to any i.i.d. matrix ensemble in both symmetry classes. As a main tool, we prove a two-resolvent local law for the Hermitisation of X uniformly in the spectrum with optimal decay rate and optimal dependence on the density near the spectral edge.}, author = {Cipolloni, Giorgio and Erdös, László and Xu, Yuanyuan}, issn = {0022-1236}, journal = {Journal of Functional Analysis}, number = {1}, publisher = {Elsevier}, title = {{Optimal decay of eigenvector overlap for non-Hermitian random matrices}}, doi = {10.1016/j.jfa.2025.111180}, volume = {290}, year = {2026}, } @article{20422, abstract = {We show that if n is odd and p>=Clog n/n, then with high probability Hamilton cycles in G(n,p) span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties. The proof is based on a novel idea of parity-switchers, which can be thought of as analogues of absorbers in the context of cycle spaces. As another application of our method, we show that Hamilton cycles in a near-Dirac graph G, that is, a graph G with odd n vertices and minimum degree n/2+C for sufficiently large constant C, span its cycle space. }, author = {Christoph, Micha and Nenadov, Rajko and Petrova, Kalina H}, issn = {1096-0902}, journal = {Journal of Combinatorial Theory Series B}, pages = {254--267}, publisher = {Elsevier}, title = {{The Hamilton space of pseudorandom graphs}}, doi = {10.1016/j.jctb.2025.09.002}, volume = {176}, year = {2026}, } @article{20456, abstract = {Given a locally finite set A⊆Rd and a coloring χ:A→{0,1,…,s}, we introduce the chromatic Delaunay mosaic of χ, which is a Delaunay mosaic in Rs+d that represents how points of different colors mingle. Our main results are bounds on the size of the chromatic Delaunay mosaic, in which we assume that d and s are constants. For example, if A is finite with n=#A, and the coloring is random, then the chromatic Delaunay mosaic has O(n⌈d/2⌉) cells in expectation. In contrast, for Delone sets and Poisson point processes in Rd, the expected number of cells within a closed ball is only a constant times the number of points in this ball. Furthermore, in R2 all colorings of a dense set of n points have chromatic Delaunay mosaics of size O(n). This encourages the use of chromatic Delaunay mosaics in applications.}, author = {Biswas, Ranita and Cultrera di Montesano, Sebastiano and Draganov, Ondrej and Edelsbrunner, Herbert and Saghafian, Morteza}, issn = {1432-0444}, journal = {Discrete and Computational Geometry}, pages = {24--47}, publisher = {Springer Nature}, title = {{On the size of chromatic Delaunay mosaics}}, doi = {10.1007/s00454-025-00778-7}, volume = {75}, year = {2026}, } @article{20482, abstract = {In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs H in Kn, defined as the minimum number of colours needed to colour the edges of K so that every copy of a graph H E H intersects some colour class in an odd number of edges. In this paper, we focus on complete bipartite graphs. First, we completely resolve the problem when H is the family of all spanning complete bipartite graphs on n vertices. We then focus on its subfamilies, that is, {Kt,n-t : t E T} for a fixed set of integers T c [[n/2]]. We prove that the odd-Ramsey problem is equivalent to determining the maximum dimension of a linear binary code avoiding codewords of given weights, and leverage known results from coding theory to deduce asymptotically tight bounds in our setting. We conclude with bounds for the odd-Ramsey numbers of fixed (that is, non-spanning) complete bipartite subgraphs.}, author = {Boyadzhiyska, Simona and Das, Shagnik and Lesgourgues, Thomas and Petrova, Kalina H}, issn = {0195-6698}, journal = {European Journal of Combinatorics}, publisher = {Elsevier}, title = {{Odd-Ramsey numbers of complete bipartite graphs}}, doi = {10.1016/j.ejc.2025.104235}, volume = {131}, year = {2026}, } @article{21437, abstract = {Altermagnets are a class of collinear magnets that exhibit non-relativistic spin splitting (NRSS) of electronic bands in the absence of net magnetization. Their potential to generate large spin polarization without spin-orbit coupling has created strong interest in probes that access the underlying order parameter directly. In this Perspective, we show that linear magneto-birefringence (LMB) provides a natural and broadly applicable route to detecting altermagnetic order. Building on the correspondence between the momentum-space structure of NRSS and the ferroic ordering of magnetic multipoles in real space, we demonstrate how $d$-wave and $g$-wave NRSS textures yield distinct LMB responses. We present a symmetry-based framework that identifies the optical geometries and field configurations required to isolate specific multipole components, enabling domain imaging and providing benchmarks for theoretical models of LMB.}, author = {Sunko, Veronika and Orenstein, J.}, issn = {2397-4648}, journal = {npj Quantum Materials}, publisher = {Springer Nature}, title = {{Linear magneto-birefringence as a probe of altermagnetism}}, doi = {10.1038/s41535-026-00901-8}, year = {2026}, } @article{22101, abstract = {Evolutionary biology examines how the genetic and phenotypic composition of populations changes over time. An important goal is to determine the fixation probability of a single advantageous mutant that arises in a homogeneous population of N residents. Many real populations experience environmental gradients that cause mutations to be beneficial in some spatial regions but harmful in others. Here, we study the fixation probability of a mutant placed on a simple one-dimensional spatial structure that experiences such a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas the resident fitness is constant and equal to 1. The existing literature suggests that such heterogeneity in the mutant’s fitness should lead to a decrease in its fixation probability. However, in this work, we find that small, non-negligible gradients (s < 1=√N) substantially increase the fixation probability,while larger gradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the strength of this phenomenon analytically and we precisely delimit the range of the gradients for which it occurs. Our computer simulations closely match those findings. Altogether, our results indicate that subjecting a simple population structure to natural environmental conditions can produce strong counterintuitive effects.}, author = {Svoboda, Jakub and Nemati, Hossein and Tkadlec, Josef and Kaveh, Kamran and Chatterjee, Krishnendu}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{The effect of the fitness gradient on fixation probability}}, doi = {10.1038/s41467-026-71777-2}, volume = {17}, year = {2026}, } @inproceedings{22103, abstract = {Modern AI systems increasingly rely on opaque, highly complex models whose inner workings remain inaccessible even to experts. This opacity creates challenges for trust, accountability, and compliance with emerging regulatory expectations such as the “right to an explanation”. While traditional explainability methods—feature attributions, counterfactuals, surrogate models—and interpretable model classes provide valuable insights for engineers, they often fall short of delivering the contextual, conversational explanations that real users expect. Large Language Models (LLMs) offer a promising new avenue for explanation due to their ability to engage interactively, adapt to user needs, and translate technical outputs into more accessible reasoning. However, their tendencies toward hallucination, conflict avoidance, and oversimplification introduce serious risks when used as explanatory agents. This paper analyzes these opportunities and limitations, examines verification strategies for ensuring explanation fidelity, and situates LLM-generated explanations within broader concerns about public trust. The paper concludes by outlining best practices and future research directions for building robust, verifiable, and human-aligned explanation systems.}, author = {Cano Cordoba, Filip}, booktitle = {Proceedings of the 18th International Conference on Agents and Artificial Intelligence}, isbn = {9789897587962}, issn = {2184-433X}, keywords = {Explainable AI, Large Language Models, Trust in AI}, location = {Marbella, Spain}, pages = {4689--4696}, publisher = {Science and Technology Publications}, title = {{Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants}}, doi = {10.5220/0014483200004052}, volume = {5}, year = {2026}, } @article{22105, abstract = {Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein–protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope labelling with quantitative NMR methods. We show that rings in the core flip nearly a thousand times less frequently in crystals than in solution. Enhanced-sampling molecular dynamics simulations, based on a crystal structure of a GB1 variant reported in this work, reproduce these elevated barriers and reveal how the crystal restrains motions.}, author = {Becker, Lea Marie and Fu, Haohao and Tatman, Benjamin and Dreydoppel, Matthias and Kapitonova, Anna and Balazs, Daniel and Weininger, Ulrich and Engilberge, Sylvain and Chipot, Christophe and Schanda, Paul}, issn = {17554349}, journal = {Nature Chemistry}, publisher = {Springer Nature}, title = {{Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes}}, doi = {10.1038/s41557-026-02155-0}, year = {2026}, } @misc{21145, abstract = {Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein-protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope labeling with quantitative NMR methods. We show that rings in the core flip nearly a thousand times less frequently in crystals than in solution. Enhanced-sampling molecular dynamics simulations, based on a new crystal structure, reproduce these elevated barriers and reveal how the crystal restrains motions. }, author = {Becker, Lea Marie and Schanda, Paul and Chipot, Christophe}, publisher = {Institute of Science and Technology Austria}, title = {{Additional Data for "Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes"}}, doi = {10.15479/AT-ISTA-21145}, year = {2026}, } @inproceedings{22007, abstract = {Truncation of cryptographic outputs is a technique that was recently introduced in Baldimtsi et al. [Foteini Baldimtsi et al., 2022]. The general idea is to try out many inputs to some cryptographic algorithm until the output (e.g. a public-key or some hash value) falls into some sparse set and thus can be compressed: by trying out an expected 2^k different inputs one will find an output that starts with k zeros. Using such truncation one can for example save substantial gas fees on Blockchains where storing values is very expensive. While [Foteini Baldimtsi et al., 2022] show that truncation preserves the security of the underlying primitive, they only consider a setting without preprocessing. In this work we show that lower bounds on the time-space tradeoff for inverting random functions and permutations also hold with truncation, except for parameters ranges where the bound fails to hold for "trivial" reasons. Concretely, it’s known that any algorithm that inverts a random function or permutation with range N making T queries and using S bits of auxiliary input must satisfy S⋅ T ≥ Nlog N. This lower bound no longer holds in the truncated setting where one must only invert a challenge from a range of size N/2^k, as now one can simply save the replies to all N/2^k challenges, which requires S = log N⋅ N /2^k bits and allows to invert with T = 1 query. We show that with truncation, whenever S is somewhat smaller than the log N⋅ N /2^k bits required to store the entire truncated function table, the known S⋅ T ≥ Nlog N lower bound applies.}, author = {Pietrzak, Krzysztof Z and Wang, Pengxiang}, booktitle = {6th Conference on Information-Theoretic Cryptography}, isbn = {9783959773850}, issn = {1868-8969}, keywords = {Time-Space Lower Bounds, Blockchains}, location = {Santa Barbara, CA, United States}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Time-space tradeoffs of truncation with preprocessing}}, doi = {10.4230/LIPIcs.ITC.2025.4}, volume = {343}, year = {2025}, } @article{12311, abstract = {In this note, we prove a formula for the cancellation exponent kv,n between division polynomials ψn and ϕn associated with a sequence {nP}n∈N of points on an elliptic curve E defined over a discrete valuation field K. The formula greatly generalizes the previously known special cases and treats also the case of non-standard Kodaira types for non-perfect residue fields.}, author = {Naskręcki, Bartosz and Verzobio, Matteo}, issn = {1473-7124}, journal = {Proceedings of the Royal Society of Edinburgh Section A: Mathematics}, keywords = {Elliptic curves, Néron models, division polynomials, height functions, discrete valuation rings}, number = {5}, pages = {1646--1660}, publisher = {Cambridge University Press}, title = {{Common valuations of division polynomials}}, doi = {10.1017/prm.2024.7}, volume = {155}, year = {2025}, } @article{12662, abstract = {Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: We establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: All Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.}, author = {Súkeník, Peter and Lampert, Christoph}, issn = {1433-3058}, journal = {Neural Computing and Applications}, pages = {24669–24683}, publisher = {Springer Nature}, title = {{Generalization in multi-objective machine learning}}, doi = {10.1007/s00521-024-10616-1}, volume = {37}, year = {2025}, } @inproceedings{20820, abstract = {The high computational costs of large language models (LLMs) have led to a flurry of research on LLM compression, via methods such as quantization, sparsification, or structured pruning. A new frontier in this area is given by dynamic, non-uniform compression methods, which adjust the compression levels (e.g., sparsity) per-block or even per-layer in order to minimize accuracy loss, while guaranteeing a global compression threshold. Yet, current methods rely on estimating the "importance" of a given layer, implicitly assuming that layers contribute independently to the overall compression error. We begin from the motivating observation that this independence assumption does not generally hold for LLM compression: pruning a model further may even significantly recover performance. To address this, we propose EvoPress, a novel evolutionary framework for dynamic LLM compression. By formulating dynamic compression as a general optimization problem, EvoPress identifies optimal compression profiles in a highly efficient manner, and generalizes across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art performance for dynamic compression of Llama, Mistral, and Phi models, setting new benchmarks for structural pruning (block/layer dropping), unstructured sparsity, and quantization with dynamic bitwidths.}, author = {Sieberling, Oliver and Kuznedelev, Denis and Kurtic, Eldar and Alistarh, Dan-Adrian}, booktitle = {42nd International Conference on Machine Learning}, issn = {2640-3498}, location = {Vancouver, Canada}, pages = {55556--55590}, publisher = {ML Research Press}, title = {{EvoPress: Accurate dynamic model compression via evolutionary search}}, volume = {267}, year = {2025}, } @inproceedings{20821, abstract = {Modern deep neural networks exhibit heterogeneity across numerous layers of various types such as residuals, multi-head attention, etc., due to varying structures (dimensions, activation functions, etc.), distinct representation characteristics, which impact predictions. We develop a general layer-wise quantization framework with tight variance and code-length bounds, adapting to the heterogeneities over the course of training. We then apply a new layer-wise quantization technique within distributed variational inequalities (VIs), proposing a novel Quantized Optimistic Dual Averaging (QODA) algorithm with adaptive learning rates, which achieves competitive convergence rates for monotone VIs. We empirically show that QODA achieves up to a 150% speedup over the baselines in end-to-end training time for training Wasserstein GAN on 12+GPUs.}, author = {Nguyen, Anh Duc and Markov, Ilia and Wu, Frank Zhengqing and Ramezani-Kebrya, Ali and Antonakopoulos, Kimon and Alistarh, Dan-Adrian and Cevher, Volkan}, booktitle = {42nd International Conference on Machine Learning}, issn = {2640-3498}, location = {Vancouver, Canada}, pages = {46026--46072}, publisher = {ML Research Press}, title = {{Layer-wise quantization for quantized optimistic dual averaging}}, volume = {267}, year = {2025}, } @article{20839, abstract = {For every couple of Hausdorff functions ψ and φ verifying some mild assumptions, there exists a compact subset K of the Baire space such that the φ-Hausdorff measure and the ψ-packing measure on K are both finite and positive. Such examples are then embedded in any infinite dimensional Banach space to answer positively a question of Fan on the existence of metric spaces with arbitrary scales.}, author = {Helfter, Mathieu}, issn = {2308-1317}, journal = {Journal of Fractal Geometry}, publisher = {EMS Press}, title = {{Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces}}, doi = {10.4171/jfg/177}, year = {2025}, }