@article{23114, author = {Pieber, Bartholomäus and Nijs, Anne}, issn = {1099-0690}, journal = {European Journal of Organic Chemistry}, publisher = {Wiley}, title = {{The EuChemS division of organic chemistry and EurJOC - partners in advancing organic chemistry}}, doi = {10.1002/ejoc.70847}, year = {2026}, } @article{23123, abstract = {How many points can be placed in an 𝑛 × 𝑛 grid sothat every (affine) line contains at most 𝑘 points? Weprove that for 𝑛 ⩾ 𝑘 ⩾ 1037 the maximum number ofpoints is exactly 𝑘𝑛. Our proof builds on the recent workof Kovács, Nagy and Szabó (who proved an analogousresult when 𝑘 is at least about √𝑛 log 𝑛), incorporat-ing ideas of Jain and Pham. Using the same approach,we also obtain new bounds for higher-dimensionalextensions of this problem}, author = {Grebennikov, Aleksandr and Kwan, Matthew Alan}, issn = {1469-2120}, journal = {Bulletin of the London Mathematical Society}, number = {10}, publisher = {Wiley}, title = {{No‐(k+1)‐in‐line problem for large constant k}}, doi = {10.1112/blms.70510}, volume = {58}, year = {2026}, } @article{23121, abstract = {A widespread observation in molecular evolution is that X-linked genes evolve faster—and often adapt faster—than autosomal genes. Three main ideas have been put forward to explain “faster-X” adaptation. The first is that new beneficial mutations are typically partially recessive with respect to fitness, leading to more efficient selection in hemizygous males. The second is that sex differences in recombination, or sex differences in variance in reproductive success, enhance the effective population size on the X chromosome relative to autosomes. Both ideas have limitations: the first conflicts with theories of dominance, in which beneficial mutations are proposed to be partially dominant, while the second only applies to some taxa. Here we tested a third, newly-proposed theory, in which mutations with large “scaled phenotypic effects” (i.e., large effects relative to the distance to a phenotypic optimum) experience more positive selection on the X. Specifically, we used three proxies for scaled phenotypic effects—amino-acid dissimilarity, amino-acid conservation, and gene age—and estimated X and autosomal rates of adaptation of nonsynonymous mutations across effect-size classes. We did this in three lineages with a well-documented faster-X: Drosophila melanogaster, Mus musculus, and Homo sapiens. As expected, we found that large-effect mutations were more likely to be under purifying selection and less likely to be under positive selection than small-effect mutations. However, contrary to the new theory, faster-X adaptation was not enriched among large-effect mutations. Overall, our results highlight an unresolved gap between patterns of sex chromosome evolution and theories of dominance for fitness.}, author = {Ruzicka, Filip and Vicoso, Beatriz}, issn = {1759-6653}, journal = {Genome Biology and Evolution}, keywords = {evolutionary biology, population genetics, sex chromosomes, adaptation, genetic divergence, McDonald-Kreitman test, Fisher’s geometric model}, publisher = {Oxford University Press}, title = {{Is faster-X adaptation due to large-effect mutations? An empirical test of a new theory}}, doi = {10.1093/gbe/evag259}, year = {2026}, } @article{23128, abstract = {Carbon fixed in source leaves is partitioned between local use and long-distance transport through the phloem to heterotrophic sinks such as roots. Here, we investigated how mild defects in sink phloem differentiation influence whole-plant growth using two Arabidopsis mutants: ops, which exhibits short roots with protophloem differentiation defects, and ops opl2, which displays even shorter roots with combined proto- and metaphloem differentiation defects. Carbon partitioning and phloem transport velocity were compromised in both mutants, with ops opl2 exhibiting stronger effects. Root growth responses to exogenous sucrose highlighted functional differences: only ops opl2 root growth was partially rescued, indicating additional limitations from compromised metaphloem function. Reciprocal grafting confirmed that root growth defects in both mutants are root autonomous. In contrast, source-limited starch mutants with short roots were rescued by sucrose supplementation or by grafting wild-type scions, highlighting that the growth limitation in the roots of phloem mutants is not solely due to carbon shortage. Impaired root phloem also restricted wild-type scion growth, revealing feedback from sink phloem integrity on source activity. Together, these findings show that sink phloem development supports sink function and mediates systemic feedback shaping whole-plant growth. Targeted modulation of sink phloem development could help optimize source–sink relations and improve crop performance.}, author = {Bartusch, Kai and Schreier, Tina B and Fischer-Stettler, Michaela and Zeeman, Samuel C and Truernit, Elisabeth}, issn = {1460-2431}, journal = {Journal of Experimental Botany}, number = {8}, pages = {2418--2428}, publisher = {Oxford University Press}, title = {{Grafting reveals organ-autonomous and feedback roles of root phloem development in source–sink dynamics}}, doi = {10.1093/jxb/erag042}, volume = {77}, year = {2026}, } @inbook{23126, abstract = {Plant grafting is a powerful tool in research and agriculture, enabling the study of long-distance signaling and improving crop performance. Hypocotyl grafting in Arabidopsis thaliana has become a key method for investigating inter-tissue communication, root-to-shoot transport, and vascular regeneration. Here, we describe a high-throughput hypocotyl grafting protocol that consistently achieves success rates above 90% while minimizing complications, such as adventitious root formation, through an optimized hypocotyl cutting position. Our streamlined approach eliminates the need for silicone tubes and fine forceps, requiring only a standard scalpel for the cutting and joining procedure. With proper training, an experienced user can graft up to 1000 plants per day, facilitating large-scale experiments. Additionally, we present vascular connectivity assays using fluorescent dyes and the adjuvant Adigor to enable phloem and xylem transport analysis across the graft junction without the need for wounding. By simplifying the grafting process while maintaining high efficiency, our protocol makes Arabidopsis grafting more accessible and scalable, facilitating research on long-distance molecular transport, vascular development, and plant biotechnology applications.}, author = {Bartusch, Kai and Truernit, Elisabeth}, booktitle = {Phloem}, editor = {Liesche, Johannes and Sevanto, Sanna}, isbn = {9781071654873}, issn = {1940-6029}, pages = {431--448}, publisher = {Springer}, title = {{High-Throughput Hypocotyl Grafting and Vascular Reconnection Assessment in Arabidopsis Seedlings}}, doi = {10.1007/978-1-0716-5488-0_33}, year = {2026}, } @article{23124, abstract = {Among the set of hypersurfaces of degree d and dimension defined by the vanishing of a homogeneous polynomial with coefficients in the set {−1, +1}, we investigate the probability that a hypersurface contains a rational point as d and tend to ∞.}, author = {Browning, Timothy D and Sawin, Will}, issn = {1464-3847}, journal = {The Quarterly Journal of Mathematics}, publisher = {Oxford University Press}, title = {{Random diophantine equations of large degree}}, doi = {10.1093/qmath/haag037}, year = {2026}, } @phdthesis{23127, author = {Bartusch, Kai}, publisher = {ETH Zürich}, title = {{New molecular insights into phloem development and its role in plant growth}}, doi = {10.3929/ETHZ-C-000797253}, year = {2026}, } @phdthesis{22984, author = {Teplova, Anastasiia}, isbn = {978-3-99078-093-0}, issn = {2663-337X }, pages = {190}, publisher = {Institute of Science and Technology Austria}, title = {{Chasing the elusive: Investigating nucleotide cyclase activity in gibberellin and strigolactone signalling; Cellular mechanisms of gravity sensing and response in roots}}, doi = {10.15479/AT-ISTA-22984}, year = {2026}, } @phdthesis{23079, abstract = {We study the computational aspects of the two central solution concepts of stochastic games played on finite graphs for an infinite number of steps: the value in two-player zero-sum games, and Nash equilibria in multi-player games. In both settings, exact solutions are in tractable. Fortwo-playerzero-sumconcurrentstochasticgames,valuescanbeirrational,and the associated decision problem is SQRT-SUM hard. For multi-player turn-based stochastic games,theequilibriumprobabilitiescanbeirrational,anddecidingtheconstrainedexistence of a Nash equilibrium is undecidable in the presence of memory, and ∃R-complete when the players are restricted to stationary strategies. Hence, in both settings, the natural computational problem is the approximation of the solution within an arbitrary additive error. In this thesis, we present improved complexity results and algorithms for such approximation problems. The first part of the thesis considers two-player zero-sum concurrent stochastic games with two classic objectives: (a) stateful-discounted objectives, which are similar to the classic discounted-sum objectives, but states are associated with different discount factors rather than a single discount factor; and (b) parity objectives, which are a canonical representation for ω-regular objectives. For stateful-discounted objectives, given an ordering of the discount factors, the limit value is the limit of the value of the stateful-discounted objectives, as the discount factors approach zero according to the given order. The value-approximation problem is known to be in EXPSPACE for the limit value of stateful-discounted objectives and in PSPACEforparityobjectives,andthebest-knownalgorithmsforbothproblemsareatleast exponential time, with an exponential dependence on the number of states and actions. Our main results for the value-approximation problem for the limit value of stateful-discounted objectives and parity objectives areas follows: (a)we establish TFNPNP complexity; and (b)we present algorithms that improve the dependency on the number of actions in the exponent from linear to logarithmic. In particular, if the number of states is constant, our algorithms run in polynomial time. The second part of the thesis considers multi-player turn-based stochastic games with terminal payoffs, where the players are restricted to stationary strategies. We study the approximate constrained existence problem of Nash equilibria: given a game that has a Nash equilibrium in which the payoff of every player lies in a given interval, compute a strategy profile that is an ε-Nash equilibrium and that satisfies the same constraints up to an additive error ε. Our main results are as follows: (a) we present an FNPNP algorithm for the problem; and(b)we establish that its decision version is NP-hard, already with two players. For the upperbound,weshowthatifaconstrainedNashequilibriumexists,thenthereexists one in which the non-zero probabilities are at least an inverse of a double-exponential in the i input size, and that such a strategy profile can be represented, up to an additive error ε, with floating-point numbers of polynomial size. We complement the upper bound with a lower bound on this approach: we present a game with only five players in which every constrained Nash equilibrium requires double-exponentially small probabilities. The two parts share a common technical toolkit: bounds on solutions of systems of polynomial inequalities that arise from real algebraic geometry, the floating-point representation of doubly-exponentially small numbers, and guess-and-verify procedures that resolve single-player games with an NP oracle.}, author = {Asadi, Ali}, issn = {2791-4585}, pages = {83}, publisher = {Institute of Science and Technology Austria}, title = {{Approximation of values and equilibria in stochastic games: Complexity and algorithms}}, doi = {10.15479/AT-ISTA-23079}, year = {2026}, } @phdthesis{22626, author = {Fiedler, Christine}, isbn = {978-3-99078-086-2}, issn = {2663-337X}, pages = {141}, publisher = {Institute of Science and Technology Austria}, title = {{Mechanistic insight into solution-processed p-type tin chalcogenides as a basis for designing their n-type analogs}}, doi = {10.15479/AT-ISTA-22626}, year = {2026}, } @phdthesis{22017, author = {Kleinhanns, Tobias}, isbn = {978-3-99078-081-7}, issn = {2663-337X}, pages = {59}, publisher = {Institute of Science and Technology Austria}, title = {{Unraveling the origin and evolution of defects to enable advanced thermoelectric performance}}, doi = {10.15479/AT-ISTA-22017}, year = {2026}, } @phdthesis{22664, abstract = {The widespread adoption of apps like Whatsapp and Signal has translated into billions of people all around the world communicating on a regular basis by making use of services that offer end-to-end encryption and even provide security guarantees when a user's device is compromised. This was made possible by the introduction of the Double Ratchet Algorithm~\cite{double_ratchet}, which was designed for a setting where communication takes place between two parties. However, in practice, many apps offer the possibility of creating groups. The protocols they use to secure communication are inefficient for large group which has the undesireable consequence that the aforementioned apps have established limits on the group size of roughly 1000 users. This has motivated the introduction of the Messaging Layer Security (MLS) standard~\cite{rfc9420} by the IETF which is based on a primitive called Continuous Group Key Agreement (CGKA)~\cite{C:ACDT20}. This primitive allows a group of users to maintain a shared secret key that is frequently rotated by the group members in order to change group membership, achieve forward secrecy (FS) and post compromise security (PCS). Most protocols are based on binary trees where the nodes are associated to a pair formed by public key and a secret key. Each leaf corresponds to one of the group members and a user knows the secret keys associated to nodes along the path from their leaf to the root. When a user wants to update their key material they have to change $ \log(N) $ many keys. This requires uploading $ \log(N) $ many ciphertexts to communicate the new keys to the rest of the group members in a way that respects the tree structure. In this thesis we study how much communication between group members is required in order to add and remove users from a group as well as in order to provide PCS when we consider CGKAs built using standard cryptographic primitives like pseudo-random functions and public-key encryption. Furthermore, we also consider the case of MLS and provide the first lower bound showing that its communication complexity is much worse than previously believed, i.e., it is very far from $ \log(N) $. Finally, we also propose a variant of MLS which provably achieves the same security properties with a much lower communication cost.}, author = {Cueto Noval, Miguel}, isbn = { 978-3-99078-087-9}, issn = {2663-337X}, pages = {187}, publisher = {Institute of Science and Technology Austria}, title = {{Towards efficient secure group messaging}}, doi = {10.15479/AT-ISTA-22664}, year = {2026}, } @phdthesis{22857, abstract = {Artificial intelligence and machine learning have undergone an unprecedented evolution in the past decade, motivating a research effort toward a theory able to capture the qualitative behavior of large-scale neural systems. A central puzzle has been the clear benefit of scaling architecture size and overfitting the training set in supervised learning tasks. This evidence, in apparent contradiction with classical statistical learning theory, pushed researchers to develop a new theory capturing the interplay between the algorithmic and architectural bias of training and the specific target function, differently from previous methods rooted in uniform stability. This approach has enabled a grounded understanding of novel learning regimes, typically through formal limits where the number of training samples $n$, data dimensions $d$, and model parameters $p$ grow to infinity at different rates. \\ In this thesis, we follow this approach, focusing on the trustworthiness of high-dimensional models: properties that are difficult to control during training or deployment and often emerge under unpredictable or adversarial conditions. In such settings, it is crucial to formally ensure a priori the reliability of machine learning systems. First, we study data memorization, both as label fitting and as the storage of private information about training samples in trained parameters. We prove that $p = \Omega(n)$ parameters are sufficient for a deep neural network to memorize a generic set of labels, and for a model to memorize spurious features across training data. We then give evidence that $p = \Omega(dn)$ parameters are instead necessary for an adversary to reconstruct the full training set from the trained parameters. Second, we study robustness, both to adversarial perturbations and to distribution shift. We first prove that $p = \Omega(dn)$ parameters can be sufficient for a class of neural networks to overfit the training data while guaranteeing robustness to adversarial perturbations. Then, we focus on spurious correlations learning in high-dimensional regression, studying the effect of the ridge regularization parameter in the proportional regime $n = \Theta(d)$, and connecting it via an equivalence argument to the role of over-parameterization $p = \Omega(n)$ in neural networks. We also investigate the architectural bias of attention-based networks, showing that they are sensitive to the replacement of individual words in an embedded sentence, allowing them to generalize on sentences where the contextual meaning depends on one or few words. Finally, we study differentially private optimization in high-dimensional regimes. We prove that standard private gradient methods do not suffer in the over-parameterized regime $p = \Omega(n)$, challenging the current wisdom based on stability-derived generalization bounds. We then consider linear regression in the proportional regime $n = \Theta(d)$, showing that standard private gradient descent can achieve optimal rates under appropriate hyper-parameter scaling, such as sufficiently small gradient clipping constants, whose role is still debated in practice.}, author = {Bombari, Simone}, isbn = {978-3-99078-091-6}, issn = {2663-337X}, keywords = {machine learning, high-dimensional statistics, deep learning theory, privacy, memorization, robustness}, pages = {446}, publisher = {Institute of Science and Technology Austria}, title = {{Trustworthy machine learning in high dimensions}}, doi = {10.15479/AT-ISTA-22857}, year = {2026}, } @article{23043, abstract = {Mendelian randomization, the standard instrument variable causal-inference approach for genomics, can be severely biased by inadequate selection of appropriate instrument variables and horizontal pleiotropy. We introduce Causal Inference GWAS, a graphical approach that selects genetic instruments from summary statistics controlling for linkage and pleiotropy, accommodates rare variants and binary outcomes, distinguishes direct from indirect risk factors in high dimensions, and flags latent confounding. Applied to 9 risk factors, 4 metabolic disease outcomes, and 8.4M variants across 458,747 UK Biobank individuals, our method runs in 20 minutes, identifying only 696 genome-wide valid instruments. We replicate nearly all previously reported risk factor-outcome paths, but find that most are indistinguishable from unmeasured confounding. This suggests robust biobank causal inference will require longitudinal and family data to resolve temporal precedence from reverse causation. Our approach offers a principled first step toward screening genuine causal signal from phenotypic correlation in biobank data.}, author = {Machnik, Nick N and Mahmoudi, Seyed Mahdi and Borczyk, Malgorzata and Krätschmer, Ilse and Bauer, Markus J. and Robinson, Matthew Richard}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Causal inference for multiple risk factors and diseases from genomics data}}, doi = {10.1038/s41467-026-76877-7}, volume = {17}, year = {2026}, } @article{23152, abstract = {We present a panchromatic optical-millimeter characterization of GNz7q, a recently identified X-ray-weak, rapidly growing red quasar embedded within a dusty starburst galaxy at z = 7.1899, using the full suite of JWST/ NIRCam, NIRSpec, Mid-Infrared Instrument (MIRI), and archival NOEMA observations. Our deep NIRSpec/ G395M spectroscopy reveals unambiguous broad Balmer emission (FWHM = 2221 ± 20 km s −1 ), confirming a super-Eddington accreting black hole (BH) (λEdd = 2.7 ± 0.4) with a mass of log(MBH/M ) = 7.55 ± 0.34, using accretion-rate-corrected BH mass estimators. After subtracting the point source, we robustly detect stellar emission from the host galaxy across multiple NIRCam and MIRI filters. Our joint morphological-spectral analysis yields a stellar mass of = ± * log(M /M ) 10.5 0.4 and an intense star formation rate of SFR = 330 ± 97 M⊙ yr−1 , confirming the host as a massive, dusty starburst galaxy. We find that GNz7q lies on the local MBH–M* relation (MBH/M* ≃ 0.001) and is well positioned to evolve into the locus of massive Sloan Digital Sky Survey (SDSS) quasars with log(MBH/M ) 9 and M* ≈ 1011 M⊙ at z ∼ 6, owing to its remarkably rapid growth in both the BH and its host galaxy. This stands in stark contrast to many recently reported JWST active galactic nucleus populations at similar redshifts, including the little red dots, whose weak or undetected star formation makes it difficult for them to grow into the massive galaxies hosting SDSS-like quasars. These results suggest that GNz7q marks a rare, pivotal phase of early BH–galaxy coevolution, plausibly providing a crucial direct pathway to the supermassive BH systems within the first billion years of the Universe.}, author = {Fei, Qinyue and Fujimoto, Seiji and Brammer, Gabriel and Li, Ruancun and Ho, Luis C. and Bromm, Volker and Álvarez-Márquez, Javier and Asada, Yoshihisa and Barro, Guillermo and Colina, Luis and Dayal, Pratika and Finkelstein, Steven L. and Fynbo, Johan P.U. and Ginolfi, Michele and Inayoshi, Kohei and Kokorev, Vasily and Leung, Gene C.K. and Matthee, Jorryt J and Meyer, Romain A. and Naidu, Rohan P. and Onoue, Masafusa and Pérez-González, Pablo G. and Steinhardt, Charles L. and Valentino, Francesco and Walter, Fabian and Xiao, Mengyuan and Zhang, Haowen}, issn = {1538-4357}, journal = {The Astrophysical Journal}, number = {1}, publisher = {IOP Publishing}, title = {{Direct pathway to the early supermassive Black Holes: A red super-Eddington quasar in a massive starburst host at z = 7.2}}, doi = {10.3847/1538-4357/aea07b}, volume = {1010}, year = {2026}, } @article{23148, abstract = {Presenilin-1 (PS1) is an endoplasmic reticulum protein, most known for its role in pathogenesis of familial Alzheimer’s Disease (AD). PS1 has been attributed roles in intracellular calcium homeostasis in the brain, as well as in the pancreatic beta cells, where it has been shown to be fundamental for the initial phase of glucose-induced insulin secretion. To gain mechanistic insight into beta cell autonomous function of PS1, we have examined various beta cell models and found that PS1 controls glycolytic flux of pancreatic beta cells by regulating sub-mitochondrial Ca2+ homeostasis. Transient knock down of PS1 yielded a glycolytic bottleneck at the step catalyzed by glyceraldehyde-3-phosphate dehydrogenase, resulting in defective glucose responsiveness. Moreover, we show that PS1 is needed for the preservation of beta cell identity, likely due to its role in glycolysis. Finally, we show that mouse islets from an in vivo model of AD mimic the defective glucose responsiveness seen in beta cells with transient PS1 knock down, while the identity loss and whole-body glucose homeostasis are not severely impacted, suggesting an adaptive response. Thus, the current work highlights beta cell autonomous role of PS1 and adds a layer of complexity in its impact on whole body metabolism.}, author = {Koshenov, Zhanat and Postic, Sandra and Schoiswohl, Gabriela and Van Amsterdam, Savina and Hois-Zelinka, Victoria and Oflaz, Furkan E. and Rost, Rene and Tiapko, Oleksandra and Gottschalk, Benjamin and Hirtl, Martin and Bachkoenig, Olaf G. and Koshenova, Aigerim and Erdogan, Yusuf C. and Sagintayev, Adlet and Krnjic, Anita and Pfabe, Johannes U. and Sarikas, Srdjan and Hochreiter, Bernhard and Gindlhuber, Juergen and Schittmayer, Matthias and Tadic, Jelena and Ehall, Barbara and Madeo, Frank and Madl, Tobias and Malli, Roland and Birner-Gruenberger, Ruth and Pieber, Thomas and Eisenberg, Tobias and Slak Rupnik, Marjan and Graier, Wolfgang F.}, issn = {2399-3642}, journal = {Communications Biology}, publisher = {Springer Nature}, title = {{Presenilin-1 controls glycolysis and identity of pancreatic beta cells}}, doi = {10.1038/s42003-026-10581-6}, volume = {9}, year = {2026}, } @article{23150, abstract = {High-redshift supermassive black holes (SMBHs) have challenged our understanding of black hole formation and growth. The ‘heavy-seed’ pathway eases the problem with the progenitors of these SMBHs having birth masses up to∼105 M. Here, we investigate the possibility that a local dwarf galaxy, Leo I, harbours a heavy-seed descendant. Using Monte Carlo merger trees to generate the merger histories of 1000 dark matter haloes similar to the Milky Way (MW), we search for Leo- like satellite haloes and investigate the probability that the progenitors of these satellites formed a heavy seed. We derive the likelihood of such ‘heavy-seed survivors’ (HSSs) across various formation and survival criteria as well as Leo-similarity criteria. We find that the virial temperature for the onset of atomic cooling and rapid gas infall that yields heavy seeds, Tact , has the largest impact on HSS frequency. We find HSSs in a fraction 0.7 per cent, 18.1 per cent, and 96.5 per cent of MW-like haloes when Tact is set to 9000, 7000, and 5000 K, respectively. For the canonical atomic-cooling threshold ( Tact  8000 K), the HSS fraction is 1per cent , indicating that Leo I hosting a heavy-seed descendant is unlikely under well-motivated physical assumptions. Higher HSS fractions occur only under optimistic and currently unsubstantiated assumptions on Tact . Nevertheless, these results motivate future work that clarifies the possibility of heavy-seed BH formation in pristine haloes with nominal virial temperatures below 8000 K. This may motivate Leo I as a target for disentangling heavy seeds from other SMBH formation mechanisms.}, author = {Scoggins, Matthew T. and Haiman, Zoltán and Pacucci, Fabio}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, number = {3}, publisher = {Oxford University Press}, title = {{Heavy black hole seed survivors in dwarf galaxies: A case study of Leo I}}, doi = {10.1093/mnras/stag1839}, volume = {552}, year = {2026}, } @article{23151, abstract = {We present deep, narrowband Gemini North/GMOS images of the Pa 30 nebula that reveal rich small-scale structure in the ejecta filaments. In [S II], the number of detected filaments increases by about an order of magnitude compared to previous studies. The imaging further reveals that the filaments are not smooth radial streaks, but instead are composed of cascades of knots or clumps. The images in [O III] yield the first confirmation that previously detected diffuse [O III] emission in fact originates from the same [S II] filaments. We measure a nebula center consistent with the position of the central star, indicating that the remnant has not received a large transverse kick. The 3σ upper limit on the velocity of the stellar kick is ≲100 km s −1 . Cross-sectional profiles of the filaments in [S II] and [O III] show a central peak on top of a nebula background, the latter being likely due to diffuse emission or unresolved filaments. The median [S II] width of 0.7 is slightly broader than the 0.50 seeing, providing some evidence of partially resolved filaments and implying a characteristic knot diameter of ∼1016 cm. The ≈1″ widths measured in [O III] are consistent with the poorer seeing of the oxygen images. The discovery of this clumpy substructure provides a new observational constraint on models for the origin and evolution of the remarkable filamentary ejecta of Pa 30.}, author = {Cunningham, Tim and Caiazzo, Ilaria and Raymond, John C. and Kenyon, Scott J.}, issn = {1538-4357}, journal = {The Astrophysical Journal}, number = {1}, publisher = {IOP Publishing}, title = {{Detection of knots in the type Iax supernova remnant Pa 30}}, doi = {10.3847/1538-4357/ae9cb2}, volume = {1010}, year = {2026}, } @article{23149, abstract = {We prove an asymptotic formula for the number of integral points of bounded log anticanonical height on a singular quartic del Pezzo surface over arbitrary number fields, with respect to the largest admissible boundary divisor. The resulting Clemens complex is more complicated than usual, and leads to particularly interesting effective cone constants, associated with exponentially many polytopes whose volumes appear in the expected formula. Like a jigsaw puzzle, these polytopes fit together to one large polytope. The volume of this polytope appears in the asymptotic formula that we obtain using the universal torsor method via o-minimal structures.}, author = {Bernert, Christian and Derenthal, Ulrich and Ortmann, Judith and Wilsch, Florian Alexander}, issn = {1432-1823}, journal = {Mathematische Zeitschrift}, number = {3}, publisher = {Springer}, title = {{Integral points over number fields: a Clemens complex jigsaw puzzle}}, doi = {10.1007/s00209-026-04140-2}, volume = {314}, year = {2026}, } @article{23156, abstract = {Extracting the current-phase relationship (CPR) of a single superconducting junction is challenging in practice and traditionally involves embedding the junction in a larger superconducting circuit containing SQUIDs and/or resonators. Applying ac driving to the junction has proven to be a viable and less invasive way to extract information about the few lowest harmonics of the CPR, by locating the integer and fractional Shapiro steps in the 𝐼⁢𝑉-curve of the driven junction. Here, we present an alternative driving-based method that allows to extract the full harmonic content of a CPR in a relatively noninvasive way, by fitting the measured critical currents of the driven junction as a function of driving power. We test our method, both using numerical simulations and in experiments, and we show that it works accurately.}, author = {Tjøtta, Maxim and Shah, Devashish C and Modi, Kanishk and Valentini, Marco and Seoane Souto, Rubén and Katsaros, Georgios and Danon, Jeroen}, issn = {2331-7019}, journal = {Physical Review Applied}, number = {4}, publisher = {American Physical Society}, title = {{Fast-driving spectroscopy of current-phase relationships of individual Josephson elements}}, doi = {10.1103/d3gl-qntm}, volume = {26}, year = {2026}, }