@article{23238,
  abstract     = {The AM CVn class includes mass transferring, ultra-compact double white dwarf binaries with orbital periods on the timescale of minutes. A long-standing puzzle is that none of the roughly fifty ultra-compact, ‘verification binaries’ that are easily detectable in the millihertz gravitational wave regime reside in a triple star configuration. Much evidence has hinted at V407 Vul being an inspiraling, double white dwarf AM CVn with an orbital period of 569 s. Yet, a decisive confirmation has proved challenging since a main sequence star dominates its visible spectrum. We present a clear confirmation of the triple star nature of the source by detecting a significant astrometric wobble of the photocentre on the 569 s orbital period of the binary. The AM CVn and the main sequence components are gravitationally bound with a spatial separation of roughly 0.03–0.04″, equating to an orbital separation of approximately 120 AU. A total of 23 years of orbital timing constrained the orbital decay of the AM CVn as being precise to the 1% level, critical in understanding if this class of binary survives through a period minimum or coalesce. New Hubble Space Telescope ultraviolet imaging and spectroscopic data allowed the isolated detection of the AM CVn at shorter wavelengths, revealing an approximately 58 000 K accretor white dwarf, while placing a firm distance constraint of 3510+140−110 pc. At this distance, we predict that the Laser Interferometer Space Antenna (LISA) will detect V407 Vul with a 28.4 ± 9.2 signal-to-noise ratio in a 4 yr mission time, making it the first verification binary with an outer tertiary, or ‘verification triple’, detectable for millihertz gravitational wave observatories.},
  author       = {Munday, James and Rodriguez, Antonio C. and Reindl, Nicole and Mackensen, Nina and Sunny Wong, Tin Long and Littlefair, S. P. and Pelisoli, Ingrid and Brown, Alex and Castro Segura, N. and Chakraborty, Joheen and Dawson, Harry and Dhillon, V. S. and Dorsch, Matti and Dyer, Martin and Garbutt, James A. and Geier, Stephan and Green, Matthew and Jarvis, Dan and Kennedy, Mark R. and Kerry, Paul and Mccormac, James and Parsons, Steven G. and van Roestel, Joannes C and Sahman, Dave and Tremblay, P. E. and Yates, Amalie},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{V407 Vul: A triple star system with an AM CVn detectable by gravitational wave observatories}},
  doi          = {10.1051/0004-6361/202661518},
  volume       = {714},
  year         = {2026},
}

@article{23234,
  abstract     = {Lattices and periodic point sets are well-known objects from discrete geometry. They are also used in crystallography as one of the models of atomic structure of periodic crystals. In this paper we study the embedding properties of spaces of lattices and periodic point sets equipped with optimal bijection metrics (i.e., bottleneck and Euclidean bottleneck metrics). We focus our treatment on embeddings into Hilbert space. On one hand this is motivated by modern data analysis, which is mostly based on statistical approaches developed on Euclidean or Hilbert spaces, hence such embeddings play a major role in applied pipelines. On the other hand there is a well-established methodology related to such questions in coarse geometry, arising from the work on the Novikov conjecture. The main results of this paper provide different conditions, under which the spaces of lattices or periodic point sets are Lipschitz or coarsely (non)embeddable into Hilbert space. The various conditions are phrased in terms of density, packing radius, covering radius, the cardinality of the motif, and the diameter of the unit cell.},
  author       = {Garber, Alexey and Virk, Iga and Zava, Nicolò},
  issn         = {2367-1734},
  journal      = {Journal of Applied and Computational Topology},
  number       = {4},
  publisher    = {Springer},
  title        = {{On the metric spaces of lattices and periodic point sets}},
  doi          = {10.1007/s41468-026-00258-8},
  volume       = {10},
  year         = {2026},
}

@article{23233,
  abstract     = {In recent years, hybrid semiconductor–superconductor qubits have emerged as a compelling alternative to more traditional qubit platforms, owing to their unique combination of material properties and device-level tunability. A key feature of these systems is their gate-tunable Josephson coupling, which enables the realization of superconducting qubit architectures with full electric field control and which offers a promising route toward scalable and low-crosstalk quantum processors. One of the central motivations behind this approach is the possibility of unifying the advantages of superconducting and spin-based qubits. This approach to creating hybrid qubits can be achieved, for example, by encoding quantum information in the spin degree of freedom of a quasiparticle occupying an Andreev bound state, thereby combining long coherence times with fast and flexible control. Recent progress has been further accelerated by the bottom-up engineering of Andreev bound states into coupled quantum dot arrays, leading to the realization of novel device architectures such as minimal Kitaev chains hosting (poor man’s) Majorana states, precursors of topologically protected Majorana zero modes, and, very recently, to the first coherent control of a Majorana parity qubit. In parallel, alternative strategies have focused on the design of Hamiltonian-protected hybrid qubits, including Cooper pair parity qubits and fluxon parity qubits, which aim to enhance robustness against local noise and decoherence. These approaches leverage the interplay between superconducting phase dynamics and the discrete charge or flux degrees of freedom in hybrid junctions. In this article, we review recent theoretical and experimental advances in the development of semiconductor–superconductor hybrid qubits. We provide a comprehensive overview of the underlying physical mechanisms, device implementations, and emerging architectures, with particular emphasis on their potential to enable (topologically) protected quantum information processing. While many of these qubit designs remain at the proof-of-concept stage, the rapid pace of progress suggests that practical demonstrations may be within reach in the near future.},
  author       = {Pita-Vidal, Marta and Seoane Souto, Rubén and Goswami, Srijit and Andersen, Christian Kraglund and Katsaros, Georgios and Shabani, Javad and Aguado, Ramón},
  issn         = {0370-1573},
  journal      = {Physics Reports},
  pages        = {1--112},
  publisher    = {Elsevier},
  title        = {{Novel qubits in hybrid semiconductor–superconductor nanostructures}},
  doi          = {10.1016/j.physrep.2026.10.002},
  volume       = {1218},
  year         = {2026},
}

@article{22720,
  abstract     = {Circadian clocks underlie daily rhythms in physiology by coordinating temporal patterns of gene expression and protein function throughout the body. At the core of this system in mammals is CLOCK/BMAL1, a ubiquitously expressed heterodimeric transcription factor complex that orchestrates tissue-specific circadian gene expression. The basis for this specificity remains unclear, but tissue-specific interactions at chromatin could provide one. Here we used chromatin immunoprecipitation coupled to mass spectrometry to map CLOCK/BMAL1-associated protein complexes on chromatin in mouse liver, kidney and lung. We detected 1,510 associated proteins, most of which were tissue-specific and not explained by protein abundance. Among these, we identified the homeodomain transcription factors PROX1, HNF1B and HOXA5 as tissue-enriched interactors that bind BMAL1, co-occupy most BMAL1 genomic sites and establish organ-restricted circadian transcription. Our findings demonstrate that tissue-specific transcription factors confer cellular identity on the core clock, thereby contributing to organ-specific patterns of rhythmic gene expression.},
  author       = {Aygenli, Fatih and Huschet, Lukas A. and Popp, Tanja and Ribeiro, Andrea and Barkhatova, Darina and Jouffe, Céline and Trozzo, Ricardo and Menet, Jerome S. and Rad, Roland and Dyar, Kenneth A. and Lech, Maciej and Straub, Tobias and Michael, Alicia and Robles, Maria S.},
  issn         = {1476-4679},
  journal      = {Nature Cell Biology},
  publisher    = {Springer Nature},
  title        = {{CLOCK/BMAL1 interactome uncovers homeodomain factors as tissue regulators}},
  doi          = {10.1038/s41556-026-02041-4},
  year         = {2026},
}

@article{21894,
  abstract     = {The Dean–Kawasaki equation—one of the most fundamental SPDEs of
fluctuating hydrodynamics—has been proposed as a model for density fluctuations in weakly interacting particle systems. In its original form, it is highly
singular and fails to be renormalizable, even by approaches such as regularity structures and paracontrolled distributions, hindering mathematical approaches to its rigorous justification. It has been understood recently that it is
natural to introduce a suitable regularization, for example, by applying a formal spatial discretization or by truncating high-frequency noise: This yields
well-posed equations that should still precisely approximate the law of the
particle density fluctuations.
In the present work, we prove that a regularization in the form of a formal
discretization of the Dean–Kawasaki equation indeed accurately describes
density fluctuations in systems of weakly interacting diffusing particles: We
show that, in suitable weak metrics, the law of fluctuations as predicted by
the discretized Dean–Kawasaki SPDE approximates the law of fluctuations
of the original particle system, up to an error that is of arbitrarily high order in
the inverse particle number and a discretization error. In particular, the Dean–
Kawasaki equation provides a means for efficient and accurate simulations of
density fluctuations in weakly interacting particle systems.},
  author       = {Cornalba, Federico and Fischer, Julian L and Ingmanns, Jonas and Raithel, Claudia},
  issn         = {2168-894X},
  journal      = {The Annals of Probability},
  keywords     = {Weakly interacting particle systems, fluctuating hydrodynamics, Dean-Kawasaki equation, stochastic PDEs, numerical approximation},
  number       = {1},
  pages        = {155--215},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Density fluctuations in weakly interacting particle systems via the Dean–Kawasaki equation}},
  doi          = {10.1214/25-aop1763},
  volume       = {54},
  year         = {2026},
}

@unpublished{23261,
  abstract     = {We establish a quantitative homogenization result for an interface moving through a field of sufficiently sparse but possibly impenetrable random obstacles. From a physical viewpoint, such problems arise e.g. in the context of the motion of dislocations or magnetic domain walls in a material with impurities.
 More precisely, given an interface moving by forced mean curvature flow -- with a positive global driving force plus a spatially fluctuating (negative) driving force modeling the obstacles -- , we prove that the effective large-scale behavior of the forward front is governed by a constant-speed effective motion. For typical values of the global forcing, on large scales of the order $\varepsilon^{-1}$ we obtain a (relative) error estimate for arrival times of the front of the order $\varepsilon^{1/9-}$.
 Previous stochastic homogenization results for forced mean curvature motion in the literature have required a positive pointwise lower bound on the combined forcing, which implies the absence of any actual obstacles capable of locally blocking the interface motion. In contrast, our results are valid even in the presence of islands with locally negative forcing, potentially allowing for locally pinned interfaces and eventually enclosures left behind the main front. Thus, our homogenization result applies to settings closer to (but still strictly away from) the pinning-depinning transition.},
  author       = {Fischer, Julian L and Ingmanns, Jonas},
  booktitle    = {arXiv},
  keywords     = {Analysis of PDEs (math.AP), Probability (math.PR), FOS: Mathematics, FOS: Mathematics, 35B27, 60K35, 53E10, 35R60, 35F21},
  title        = {{Quantitative homogenization of forced geometric motions through random fields of obstacles}},
  doi          = {10.48550/ARXIV.2603.12179},
  year         = {2026},
}

@misc{23221,
  abstract     = {This Research Data contains supplemental videos for Section 5.3 "Modeling three-state molecular machines walking along a track" of my PhD Thesis "Biological functionality without biochemistry: designing nanomachines for target behavior". Supplemental videos 1-3: Visualization of results of Langevin dynamics simulations of the machine walking along a track for parameters epsilon = 11 and a = [6, 8, 10] using periodic boundary conditions. The first video (a = 8) demonstrates a significant net motion of the machine to the right. The second video (a = 6) demonstrates fast movement in both directions without relevant net motion. The third video (a = 10) demonstrates targeted yet short and slow net motion to the right.},
  author       = {Ehrmann, Andreas},
  keywords     = {Molecular machines, Langevin dynamics},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Supplemental videos for: Modeling three-state molecular machines walking along a track}},
  doi          = {10.15479/AT-ISTA-23221},
  year         = {2026},
}

@misc{22968,
  author       = {Tatman, Benjamin},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Supplementary Material for "Enabling low-power Bloch-McConnell Relaxation Dispersion in solid-state NMR"}},
  doi          = {10.15479/AT-ISTA-22968},
  year         = {2026},
}

@article{18706,
  abstract     = {We prove discrete-to-continuum convergence for dynamical optimal transport on  Zd
 -periodic graphs with cost functional having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer, Maas, and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the convergence behaviour of discrete boundary-value dynamical transport problems is proved under the stronger assumption of superlinear growth. Our result extends the known literature to some important classes of examples, such as scaling limits of  1 -Wasserstein transport problems. Similarly to what happens in the quadratic case, the geometry of the graph plays a crucial role in the structure of the limit cost function, as we discuss in the final part of this work, which includes some visual representations.},
  author       = {Portinale, Lorenzo and Quattrocchi, Filippo},
  issn         = {1469-4425},
  journal      = {European Journal of Applied Mathematics},
  keywords     = {optimal transport, discrete-to-continuum, homogenisation, linear growth, gamma-convergence},
  number       = {3},
  pages        = {614--642},
  publisher    = {Cambridge University Press},
  title        = {{Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs}},
  doi          = {10.1017/s0956792524000810},
  volume       = {37},
  year         = {2026},
}

@phdthesis{21423,
  abstract     = {Biological systems, such as cytoskeletal filaments and multicellular collectives, exhibit rich 
self-organization driven by their intrinsic activity and physical constraints. Across scales, 
geometry plays a central role: the shape of active units and the structure of their environment 
strongly influence how order emerges in these far-from-equilibrium systems. In this thesis, 
we combine minimal active-matter models with bottom-up in vitro experiments to identify 
the principles by which geometry and activity shape collective behavior in biological matter. 
At the subcellular scale, we investigate how the physical properties of chiral FtsZ filaments 
govern their large-scale organization. Using a mesoscopic model validated by reconstituted 
filament assays, we show that filament shape, intrinsic curvature, and flexibility, together with 
activity-driven straightening, determine whether filaments form chiral rings, polar bands, or 
nematic-like states. Our model shows that small changes in filament mechanics produce large 
shifts in collective structures, revealing how the geometry of individual filaments amplifies 
through activity to control patterns relevant for bacterial cytokinesis. 
At the cellular scale, we examine how geometry of the external environment influences 
collective cancer cell migration. Experiments in controlled microfabricated obstacle 
environments demonstrate that geometric disorder alone can induce a transition from 
collective to single-cell invasion. A minimal model of active particles in disordered geometries 
reproduces these effects, demonstrating that cell dissemination results both from local 
geometrical constraints and a global integration of spatial disorder over time. Surprisingly, 
this transition is accompanied by a change in the universality class of interface dynamics, 
revealing that cell-environment interactions can shift the collective behavior of an invasive 
front purely through mechanics.  
In the last system, we study how cell-intrinsic geometry and chirality affect collective motion 
in confined and unconfined settings. Using a minimal model inspired by in vitro experiments, 
we analyze motile cells that exhibit persistent rotation due to intrinsic left-right asymmetry. 
In circular confinement, this simplified chiral model reproduces several experimentally 
observed features within specific parameter regimes. At high densities in unconfined 
environments, however, intrinsic chirality becomes masked even before the onset of the 
jamming transition. These results show that single-cell geometric asymmetry does not 
necessarily translate into large-scale chiral flows, offering new insight into how forces and 
symmetries shape collective motion in dense cellular systems. 
Overall, this work uncovers how geometric constraints – embedded in the intrinsic 
architecture of an active filament or encoded in the complexity of a microenvironment 
couple to active forces to generate different classes of complex behaviors. },
  author       = {Dunajova, Zuzana},
  isbn         = {978-3-99078-076-3},
  issn         = {2663-337X},
  pages        = {110},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Geometry-driven self-organization of migrating cells and chiral filaments}},
  doi          = {10.15479/AT-ISTA-21423},
  year         = {2026},
}

@misc{21439,
  abstract     = {These files contain supplementary movies accompanying the PhD thesis “Geometry-driven self-organization of migrating cells and chiral filaments” by Zuzana Dunajova (2026). The videos provide additional visual material supporting the experiments and results described in the thesis.},
  author       = {Dunajova, Zuzana},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Supplementary movies to PhD thesis “Geometry-driven self-organization of migrating cells and chiral filaments”}},
  doi          = {10.15479/AT-ISTA-21439},
  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{22032,
  abstract     = {We prove that the focusing and defocusing continuum Calogero–Moser models are well-posed in the scaling-critical space L^2+(R). In the focusing case, this requires solutions to have mass less than that of the soliton.},
  author       = {Killip, Rowan and Laurens, Thierry and Visan, Monica},
  issn         = {2692-3688},
  journal      = {Communications of the American Mathematical Society},
  number       = {7},
  pages        = {284--320},
  publisher    = {American Mathematical Society},
  title        = {{Scaling-critical well-posedness for continuum Calogero–Moser models on the line}},
  doi          = {10.1090/cams/48},
  volume       = {5},
  year         = {2025},
}

@article{22036,
  abstract     = {We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3.},
  author       = {Fan, Chenjie and Killip, Rowan and Visan, Monica and Zhao, Zehua},
  issn         = {1432-1823},
  journal      = {Mathematische Zeitschrift},
  publisher    = {Springer Nature},
  title        = {{Dispersive decay for the mass-critical nonlinear Schrödinger equation}},
  doi          = {10.1007/s00209-025-03821-8},
  volume       = {311},
  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},
}

@misc{20842,
  abstract     = {Probing the possibility of entanglement generation through gravity offers a path to tackle the question of whether gravitational fields possess a quantum mechanical nature. A potential realization necessitates systems with low-frequency dynamics at an optimal mass scale, for which the microgram-to-milligram range is a strong contender. Here, after refining a figure-of-merit for the problem, we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate laser cooling its motion from room temperature to 240~microkelvins, surpassing by over 20-fold the coldest motions attained for oscillators ranging from micrograms to kilograms. We quantify and contrast the utility of the current approach with other platforms. The achieved performance and large improvement potential highlight milligram-scale torsional pendulums as a powerful platform for precision measurements relevant to future studies at the quantum-gravity interface.},
  author       = {Agafonova, Sofya},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Research Data for: 'One-milligram torsional pendulum toward experiments at the quantum-gravity interface'}},
  doi          = {10.15479/AT-ISTA-20842},
  year         = {2025},
}

@inproceedings{20845,
  abstract     = {We develop new attacks against the Evasive LWE family of assumptions, in both the public and private-coin regime. To the best of our knowledge, ours are the first attacks against Evasive LWE in the public-coin regime, for any instantiation from the family. Our attacks are summarized below.

Public-Coin Attacks.
1.The recent work by Hseih, Lin and Luo [17] constructed the first Attribute Based Encryption (ABE) for unbounded depth circuits by relying on the “circular” evasive LWE assumption. This assumption has been popularly considered as a safe, public-coin instance of Evasive LWE in contrast to its “private-coin” cousins (for instance, see [10, 11]).
We provide the first attack against this assumption, challenging the widely held belief that this is a public-coin assumption.
2. We demonstrate a counter-example against vanilla public-coin evasive LWE by Wee [26] in an unnatural parameter regime. Our attack crucially relies on the error in the pre-condition being larger than the error in the post-condition, necessitating a refinement of the assumption.

Private-Coin Attacks.
1. The recent work by Agrawal, Kumari and Yamada [2] constructed the first functional encryption scheme for pseudorandom functionalities (PRFE) and extended this to obfuscation for pseudorandom functionalities (PRIO) [4] by relying on private-coin evasive LWE. We provide a new attack against the assumption stated in the first posting of their work (subsequently refined to avoid these attacks).
2. The recent work by Branco et al. [8] (concurrently to [4]) provides a construction of obfuscation for pseudorandom functionalities by relying on private-coin evasive LWE. We provide a new attack against their stated assumption.
3. Branco et al. [8] showed that there exist contrived, “self-referential” classes of pseudorandom functionalities for which pseudorandom obfuscation cannot exist. We extend their techniques to develop an analogous result for pseudorandom functional encryption.

While Evasive LWE was developed to specifically avoid “zeroizing attacks”, our work shows that in certain settings, such attacks can still apply.},
  author       = {Agrawal, Shweta and Modi, Anuja and Yadav, Anshu and Yamada, Shota},
  booktitle    = {23rd International Conference on Theory of Cryptography},
  isbn         = {9783032122926},
  issn         = {1611-3349},
  location     = {Aarhus, Denmark},
  pages        = {259--290},
  publisher    = {Springer Nature},
  title        = {{Zeroizing attacks against evasive and circular evasive LWE}},
  doi          = {10.1007/978-3-032-12293-3_9},
  volume       = {16269},
  year         = {2025},
}

@inproceedings{20846,
  abstract     = {CVRFs are PRFs that unify the properties of verifiable and constrained PRFs. Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy in 2014, it has been an open problem to construct CVRFs without using heavy machinery such as multilinear maps, obfuscation or functional encryption.
We solve this problem by constructing a prefix-constrained verifiable PRF that does not rely on the aforementioned assumptions. Essentially, our construction is a verifiable version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group elements. These outputs can be verified using pairings since the underlying PRG is of degree 2.
We prove the selective security of our construction under the Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which we dub recursive Decisional Diffie-Hellman (recursive DDH).
We prove the soundness of recursive DDH in the generic group model assuming the hardness of the Multivariate Quadratic (MQ) problem and a new variant thereof, which we call MQ+.
Last, in terms of applications, we observe that our CVRF is also an exponent (C)VRF in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25) with various applications to threshold cryptography in mind. In addition to that, we give further applications for prefix-CVRFs in the blockchain setting, namely, stake-pooling and compressible randomness beacons.},
  author       = {Brandt, Nicholas and Cueto Noval, Miguel and Günther, Christoph Ullrich and Ünal, Akin and Wohnig, Stella},
  booktitle    = {23rd International Conference on Theory of Cryptography},
  isbn         = {9783032122896},
  issn         = {1611-3349},
  location     = {Aarhus, Denmark},
  pages        = {478--511},
  publisher    = {Springer Nature},
  title        = {{Constrained verifiable random functions without obfuscation and friends}},
  doi          = {10.1007/978-3-032-12290-2_16},
  volume       = {16271},
  year         = {2025},
}