@article{13970, author = {Madani, Amiera and Sletten, Eric T. and Cavedon, Cristian and Seeberger, Peter H. and Pieber, Bartholomäus}, issn = {2333-3553}, journal = {Organic Syntheses}, pages = {271--286}, publisher = {Organic Syntheses}, title = {{Visible-light-mediated oxidative debenzylation of 3-O-Benzyl-1,2:5,6-di-O-isopropylidene-α-D-glucofuranose}}, doi = {10.15227/orgsyn.100.0271}, volume = {100}, year = {2023}, } @article{13127, abstract = {Cooperative disease defense emerges as group-level collective behavior, yet how group members make the underlying individual decisions is poorly understood. Using garden ants and fungal pathogens as an experimental model, we derive the rules governing individual ant grooming choices and show how they produce colony-level hygiene. Time-resolved behavioral analysis, pathogen quantification, and probabilistic modeling reveal that ants increase grooming and preferentially target highly-infectious individuals when perceiving high pathogen load, but transiently suppress grooming after having been groomed by nestmates. Ants thus react to both, the infectivity of others and the social feedback they receive on their own contagiousness. While inferred solely from momentary ant decisions, these behavioral rules quantitatively predict hour-long experimental dynamics, and synergistically combine into efficient colony-wide pathogen removal. Our analyses show that noisy individual decisions based on only local, incomplete, yet dynamically-updated information on pathogen threat and social feedback can lead to potent collective disease defense.}, author = {Casillas Perez, Barbara E and Bod'Ová, Katarína and Grasse, Anna V and Tkačik, Gašper and Cremer, Sylvia}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Dynamic pathogen detection and social feedback shape collective hygiene in ants}}, doi = {10.1038/s41467-023-38947-y}, volume = {14}, year = {2023}, } @misc{12945, abstract = {basic data for use in code for experimental data analysis for manuscript under revision: Dynamic pathogen detection and social feedback shape collective hygiene in ants Casillas-Pérez B, Boďová K, Grasse AV, Tkačik G, Cremer S}, author = {Cremer, Sylvia}, keywords = {collective behavior, host-pathogen interactions, social immunity, epidemiology, social insects, probabilistic modeling}, publisher = {Institute of Science and Technology Austria}, title = {{Data from: "Dynamic pathogen detection and social feedback shape collective hygiene in ants" }}, doi = {10.15479/AT:ISTA:12945}, year = {2023}, } @phdthesis{12885, abstract = {High-performance semiconductors rely upon precise control of heat and charge transport. This can be achieved by precisely engineering defects in polycrystalline solids. There are multiple approaches to preparing such polycrystalline semiconductors, and the transformation of solution-processed colloidal nanoparticles is appealing because colloidal nanoparticles combine low cost with structural and compositional tunability along with rich surface chemistry. However, the multiple processes from nanoparticle synthesis to the final bulk nanocomposites are very complex. They involve nanoparticle purification, post-synthetic modifications, and finally consolidation (thermal treatments and densification). All these properties dictate the final material’s composition and microstructure, ultimately affecting its functional properties. This thesis explores the synthesis, surface chemistry and consolidation of colloidal semiconductor nanoparticles into dense solids. In particular, the transformations that take place during these processes, and their effect on the material’s transport properties are evaluated. }, author = {Calcabrini, Mariano}, isbn = {978-3-99078-028-2}, issn = {2663-337X}, pages = {82}, publisher = {Institute of Science and Technology Austria}, title = {{Nanoparticle-based semiconductor solids: From synthesis to consolidation}}, doi = {10.15479/at:ista:12885}, year = {2023}, } @article{12087, abstract = {Following up on the recent work on lower Ricci curvature bounds for quantum systems, we introduce two noncommutative versions of curvature-dimension bounds for symmetric quantum Markov semigroups over matrix algebras. Under suitable such curvature-dimension conditions, we prove a family of dimension-dependent functional inequalities, a version of the Bonnet–Myers theorem and concavity of entropy power in the noncommutative setting. We also provide examples satisfying certain curvature-dimension conditions, including Schur multipliers over matrix algebras, Herz–Schur multipliers over group algebras and generalized depolarizing semigroups.}, author = {Wirth, Melchior and Zhang, Haonan}, issn = {1424-0637}, journal = {Annales Henri Poincare}, pages = {717--750}, publisher = {Springer Nature}, title = {{Curvature-dimension conditions for symmetric quantum Markov semigroups}}, doi = {10.1007/s00023-022-01220-x}, volume = {24}, year = {2023}, } @article{9652, abstract = {In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate that such notions also give rise to distinct equivalence classes. Put differently, we find occurrences of particularly strong divergence of separated nets from the integer lattice. Our approach generalises that of Burago and Kleiner and McMullen which takes place largely in a continuous setting. Existence of irregular separated nets is verified via the existence of non-realisable density functions ρ:[0,1]d→(0,∞). In the present work we obtain stronger types of non-realisable densities.}, author = {Dymond, Michael and Kaluza, Vojtech}, issn = {1565-8511}, journal = {Israel Journal of Mathematics}, keywords = {Lipschitz, bilipschitz, bounded displacement, modulus of continuity, separated net, non-realisable density, Burago--Kleiner construction}, pages = {501--554}, publisher = {Springer Nature}, title = {{Highly irregular separated nets}}, doi = {10.1007/s11856-022-2448-6}, volume = {253}, year = {2023}, } @article{10173, abstract = {We study the large scale behavior of elliptic systems with stationary random coefficient that have only slowly decaying correlations. To this aim we analyze the so-called corrector equation, a degenerate elliptic equation posed in the probability space. In this contribution, we use a parabolic approach and optimally quantify the time decay of the semigroup. For the theoretical point of view, we prove an optimal decay estimate of the gradient and flux of the corrector when spatially averaged over a scale R larger than 1. For the numerical point of view, our results provide convenient tools for the analysis of various numerical methods.}, author = {Clozeau, Nicolas}, issn = {2194-0401}, journal = {Stochastics and Partial Differential Equations: Analysis and Computations}, pages = {1254–1378}, publisher = {Springer Nature}, title = {{Optimal decay of the parabolic semigroup in stochastic homogenization for correlated coefficient fields}}, doi = {10.1007/s40072-022-00254-w}, volume = {11}, year = {2023}, } @article{11741, abstract = {Following E. Wigner’s original vision, we prove that sampling the eigenvalue gaps within the bulk spectrum of a fixed (deformed) Wigner matrix H yields the celebrated Wigner-Dyson-Mehta universal statistics with high probability. Similarly, we prove universality for a monoparametric family of deformed Wigner matrices H+xA with a deterministic Hermitian matrix A and a fixed Wigner matrix H, just using the randomness of a single scalar real random variable x. Both results constitute quenched versions of bulk universality that has so far only been proven in annealed sense with respect to the probability space of the matrix ensemble.}, author = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J}, issn = {1432-2064}, journal = {Probability Theory and Related Fields}, pages = {1183–1218}, publisher = {Springer Nature}, title = {{Quenched universality for deformed Wigner matrices}}, doi = {10.1007/s00440-022-01156-7}, volume = {185}, year = {2023}, } @article{12331, abstract = {High carrier mobility is critical to improving thermoelectric performance over a broad temperature range. However, traditional doping inevitably deteriorates carrier mobility. Herein, we develop a strategy for fine tuning of defects to improve carrier mobility. To begin, n-type PbTe is created by compensating for the intrinsic Pb vacancy in bare PbTe. Excess Pb2+ reduces vacancy scattering, resulting in a high carrier mobility of ∼3400 cm2 V–1 s–1. Then, excess Ag is introduced to compensate for the remaining intrinsic Pb vacancies. We find that excess Ag exhibits a dynamic doping process with increasing temperatures, increasing both the carrier concentration and carrier mobility throughout a wide temperature range; specifically, an ultrahigh carrier mobility ∼7300 cm2 V–1 s–1 is obtained for Pb1.01Te + 0.002Ag at 300 K. Moreover, the dynamic doping-induced high carrier concentration suppresses the bipolar thermal conductivity at high temperatures. The final step is using iodine to optimize the carrier concentration to ∼1019 cm–3. Ultimately, a maximum ZT value of ∼1.5 and a large average ZTave value of ∼1.0 at 300–773 K are obtained for Pb1.01Te0.998I0.002 + 0.002Ag. These findings demonstrate that fine tuning of defects with <0.5% impurities can remarkably enhance carrier mobility and improve thermoelectric performance.}, author = {Wang, Siqi and Chang, Cheng and Bai, Shulin and Qin, Bingchao and Zhu, Yingcai and Zhan, Shaoping and Zheng, Junqing and Tang, Shuwei and Zhao, Li Dong}, issn = {1520-5002}, journal = {Chemistry of Materials}, number = {2}, pages = {755--763}, publisher = {American Chemical Society}, title = {{Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe}}, doi = {10.1021/acs.chemmater.2c03542}, volume = {35}, year = {2023}, } @article{11999, abstract = {A simple drawing D(G) of a graph G is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge e in the complement of G can be inserted into D(G) if there exists a simple drawing of G+e extending D(G). As a result of Levi’s Enlargement Lemma, if a drawing is rectilinear (pseudolinear), that is, the edges can be extended into an arrangement of lines (pseudolines), then any edge in the complement of G can be inserted. In contrast, we show that it is NP-complete to decide whether one edge can be inserted into a simple drawing. This remains true even if we assume that the drawing is pseudocircular, that is, the edges can be extended to an arrangement of pseudocircles. On the positive side, we show that, given an arrangement of pseudocircles A and a pseudosegment σ, it can be decided in polynomial time whether there exists a pseudocircle Φσ extending σ for which A∪{Φσ} is again an arrangement of pseudocircles.}, author = {Arroyo Guevara, Alan M and Klute, Fabian and Parada, Irene and Vogtenhuber, Birgit and Seidel, Raimund and Wiedera, Tilo}, issn = {1432-0444}, journal = {Discrete and Computational Geometry}, pages = {745–770}, publisher = {Springer Nature}, title = {{Inserting one edge into a simple drawing is hard}}, doi = {10.1007/s00454-022-00394-9}, volume = {69}, year = {2023}, } @article{12330, abstract = {The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. We investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements “move up,” whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads.}, author = {Aksenov, Vitalii and Alistarh, Dan-Adrian and Drozdova, Alexandra and Mohtashami, Amirkeivan}, issn = {1432-0452}, journal = {Distributed Computing}, pages = {395--418}, publisher = {Springer Nature}, title = {{The splay-list: A distribution-adaptive concurrent skip-list}}, doi = {10.1007/s00446-022-00441-x}, volume = {36}, year = {2023}, } @article{12159, abstract = {The term “haplotype block” is commonly used in the developing field of haplotype-based inference methods. We argue that the term should be defined based on the structure of the Ancestral Recombination Graph (ARG), which contains complete information on the ancestry of a sample. We use simulated examples to demonstrate key features of the relationship between haplotype blocks and ancestral structure, emphasizing the stochasticity of the processes that generate them. Even the simplest cases of neutrality or of a “hard” selective sweep produce a rich structure, often missed by commonly used statistics. We highlight a number of novel methods for inferring haplotype structure, based on the full ARG, or on a sequence of trees, and illustrate how they can be used to define haplotype blocks using an empirical data set. While the advent of new, computationally efficient methods makes it possible to apply these concepts broadly, they (and additional new methods) could benefit from adding features to explore haplotype blocks, as we define them. Understanding and applying the concept of the haplotype block will be essential to fully exploit long and linked-read sequencing technologies.}, author = {Shipilina, Daria and Pal, Arka and Stankowski, Sean and Chan, Yingguang Frank and Barton, Nicholas H}, issn = {1365-294X}, journal = {Molecular Ecology}, keywords = {Genetics, Ecology, Evolution, Behavior and Systematics}, number = {6}, pages = {1441--1457}, publisher = {Wiley}, title = {{On the origin and structure of haplotype blocks}}, doi = {10.1111/mec.16793}, volume = {32}, year = {2023}, } @article{12114, abstract = {Probing the dynamics of aromatic side chains provides important insights into the behavior of a protein because flips of aromatic rings in a protein’s hydrophobic core report on breathing motion involving a large part of the protein. Inherently invisible to crystallography, aromatic motions have been primarily studied by solution NMR. The question how packing of proteins in crystals affects ring flips has, thus, remained largely unexplored. Here we apply magic-angle spinning NMR, advanced phenylalanine 1H-13C/2H isotope labeling and MD simulation to a protein in three different crystal packing environments to shed light onto possible impact of packing on ring flips. The flips of the two Phe residues in ubiquitin, both surface exposed, appear remarkably conserved in the different crystal forms, even though the intermolecular packing is quite different: Phe4 flips on a ca. 10–20 ns time scale, and Phe45 are broadened in all crystals, presumably due to µs motion. Our findings suggest that intramolecular influences are more important for ring flips than intermolecular (packing) effects.}, author = {Gauto, Diego F. and Lebedenko, Olga O. and Becker, Lea Marie and Ayala, Isabel and Lichtenecker, Roman and Skrynnikov, Nikolai R. and Schanda, Paul}, issn = {2590-1524}, journal = {Journal of Structural Biology: X}, keywords = {Structural Biology}, publisher = {Elsevier}, title = {{Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD}}, doi = {10.1016/j.yjsbx.2022.100079}, volume = {7}, year = {2023}, } @article{12163, abstract = {Small GTPases play essential roles in the organization of eukaryotic cells. In recent years, it has become clear that their intracellular functions result from intricate biochemical networks of the GTPase and their regulators that dynamically bind to a membrane surface. Due to the inherent complexities of their interactions, however, revealing the underlying mechanisms of action is often difficult to achieve from in vivo studies. This review summarizes in vitro reconstitution approaches developed to obtain a better mechanistic understanding of how small GTPase activities are regulated in space and time.}, author = {Loose, Martin and Auer, Albert and Brognara, Gabriel and Budiman, Hanifatul R and Kowalski, Lukasz M and Matijevic, Ivana}, issn = {1873-3468}, journal = {FEBS Letters}, keywords = {Cell Biology, Genetics, Molecular Biology, Biochemistry, Structural Biology, Biophysics}, number = {6}, pages = {762--777}, publisher = {Wiley}, title = {{In vitro reconstitution of small GTPase regulation}}, doi = {10.1002/1873-3468.14540}, volume = {597}, year = {2023}, } @article{12164, abstract = {A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read-write registers, of a large class of shared objects that includes counters. The lower bound leaves open the question of finding counter implementations with sub-linear amortized step complexity. In this work, we address this gap. We show that n-process, wait-free and linearizable counters can be implemented from read-write registers with O(log2n) amortized step complexity. This is the first counter algorithm from read-write registers that provides sub-linear amortized step complexity in executions of arbitrary length. Since a logarithmic lower bound on the amortized step complexity of obstruction-free counter implementations exists, our upper bound is within a logarithmic factor of the optimal. The worst-case step complexity of the construction remains linear, which is optimal. This is obtained thanks to a new max register construction with O(logn) amortized step complexity in executions of arbitrary length in which the value stored in the register does not grow too quickly. We then leverage an existing counter algorithm by Aspnes, Attiya and Censor-Hillel [1] in which we “plug” our max register implementation to show that it remains linearizable while achieving O(log2n) amortized step complexity.}, author = {Baig, Mirza Ahad and Hendler, Danny and Milani, Alessia and Travers, Corentin}, issn = {1432-0452}, journal = {Distributed Computing}, keywords = {Computational Theory and Mathematics, Computer Networks and Communications, Hardware and Architecture, Theoretical Computer Science}, pages = {29--43}, publisher = {Springer Nature}, title = {{Long-lived counters with polylogarithmic amortized step complexity}}, doi = {10.1007/s00446-022-00439-5}, volume = {36}, year = {2023}, } @article{12515, abstract = {Introduction: The olfactory system in most mammals is divided into several subsystems based on the anatomical locations of the neuroreceptor cells involved and the receptor families that are expressed. In addition to the main olfactory system and the vomeronasal system, a range of olfactory subsystems converge onto the transition zone located between the main olfactory bulb (MOB) and the accessory olfactory bulb (AOB), which has been termed the olfactory limbus (OL). The OL contains specialized glomeruli that receive noncanonical sensory afferences and which interact with the MOB and AOB. Little is known regarding the olfactory subsystems of mammals other than laboratory rodents. Methods: We have focused on characterizing the OL in the red fox by performing general and specific histological stainings on serial sections, using both single and double immunohistochemical and lectin-histochemical labeling techniques. Results: As a result, we have been able to determine that the OL of the red fox (Vulpes vulpes) displays an uncommonly high degree of development and complexity. Discussion: This makes this species a novel mammalian model, the study of which could improve our understanding of the noncanonical pathways involved in the processing of chemosensory cues.}, author = {Ortiz-Leal, Irene and Torres, Mateo V. and Vargas Barroso, Victor M and Fidalgo, Luis Eusebio and López-Beceiro, Ana María and Larriva-Sahd, Jorge A. and Sánchez-Quinteiro, Pablo}, issn = {1662-5129}, journal = {Frontiers in Neuroanatomy}, publisher = {Frontiers}, title = {{The olfactory limbus of the red fox (Vulpes vulpes). New insights regarding a noncanonical olfactory bulb pathway}}, doi = {10.3389/fnana.2022.1097467}, volume = {16}, year = {2023}, } @article{12106, abstract = {Regulation of chromatin states involves the dynamic interplay between different histone modifications to control gene expression. Recent advances have enabled mapping of histone marks in single cells, but most methods are constrained to profile only one histone mark per cell. Here, we present an integrated experimental and computational framework, scChIX-seq (single-cell chromatin immunocleavage and unmixing sequencing), to map several histone marks in single cells. scChIX-seq multiplexes two histone marks together in single cells, then computationally deconvolves the signal using training data from respective histone mark profiles. This framework learns the cell-type-specific correlation structure between histone marks, and therefore does not require a priori assumptions of their genomic distributions. Using scChIX-seq, we demonstrate multimodal analysis of histone marks in single cells across a range of mark combinations. Modeling dynamics of in vitro macrophage differentiation enables integrated analysis of chromatin velocity. Overall, scChIX-seq unlocks systematic interrogation of the interplay between histone modifications in single cells.}, author = {Yeung, Jake and Florescu, Maria and Zeller, Peter and De Barbanson, Buys Anton and Wellenstein, Max D. and Van Oudenaarden, Alexander}, issn = {1546-1696}, journal = {Nature Biotechnology}, pages = {813–823}, publisher = {Springer Nature}, title = {{scChIX-seq infers dynamic relationships between histone modifications in single cells}}, doi = {10.1038/s41587-022-01560-3}, volume = {41}, year = {2023}, } @article{12183, abstract = {We consider a gas of n bosonic particles confined in a box [−ℓ/2,ℓ/2]3 with Neumann boundary conditions. We prove Bose–Einstein condensation in the Gross–Pitaevskii regime, with an optimal bound on the condensate depletion. Moreover, our lower bound for the ground state energy in a small box [−ℓ/2,ℓ/2]3 implies (via Neumann bracketing) a lower bound for the ground state energy of N bosons in a large box [−L/2,L/2]3 with density ρ=N/L3 in the thermodynamic limit.}, author = {Boccato, Chiara and Seiringer, Robert}, issn = {1424-0637}, journal = {Annales Henri Poincare}, pages = {1505--1560}, publisher = {Springer Nature}, title = {{The Bose Gas in a box with Neumann boundary conditions}}, doi = {10.1007/s00023-022-01252-3}, volume = {24}, year = {2023}, } @article{12544, abstract = {Geometry is crucial in our efforts to comprehend the structures and dynamics of biomolecules. For example, volume, surface area, and integrated mean and Gaussian curvature of the union of balls representing a molecule are used to quantify its interactions with the water surrounding it in the morphometric implicit solvent models. The Alpha Shape theory provides an accurate and reliable method for computing these geometric measures. In this paper, we derive homogeneous formulas for the expressions of these measures and their derivatives with respect to the atomic coordinates, and we provide algorithms that implement them into a new software package, AlphaMol. The only variables in these formulas are the interatomic distances, making them insensitive to translations and rotations. AlphaMol includes a sequential algorithm and a parallel algorithm. In the parallel version, we partition the atoms of the molecule of interest into 3D rectangular blocks, using a kd-tree algorithm. We then apply the sequential algorithm of AlphaMol to each block, augmented by a buffer zone to account for atoms whose ball representations may partially cover the block. The current parallel version of AlphaMol leads to a 20-fold speed-up compared to an independent serial implementation when using 32 processors. For instance, it takes 31 s to compute the geometric measures and derivatives of each atom in a viral capsid with more than 26 million atoms on 32 Intel processors running at 2.7 GHz. The presence of the buffer zones, however, leads to redundant computations, which ultimately limit the impact of using multiple processors. AlphaMol is available as an OpenSource software.}, author = {Koehl, Patrice and Akopyan, Arseniy and Edelsbrunner, Herbert}, issn = {1549-960X}, journal = {Journal of Chemical Information and Modeling}, number = {3}, pages = {973--985}, publisher = {American Chemical Society}, title = {{Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives}}, doi = {10.1021/acs.jcim.2c01346}, volume = {63}, year = {2023}, } @article{12543, abstract = {Treating sick group members is a hallmark of collective disease defence in vertebrates and invertebrates alike. Despite substantial effects on pathogen fitness and epidemiology, it is still largely unknown how pathogens react to the selection pressure imposed by care intervention. Using social insects and pathogenic fungi, we here performed a serial passage experiment in the presence or absence of colony members, which provide social immunity by grooming off infectious spores from exposed individuals. We found specific effects on pathogen diversity, virulence and transmission. Under selection of social immunity, pathogens invested into higher spore production, but spores were less virulent. Notably, they also elicited a lower grooming response in colony members, compared with spores from the individual host selection lines. Chemical spore analysis suggested that the spores from social selection lines escaped the caregivers’ detection by containing lower levels of ergosterol, a key fungal membrane component. Experimental application of chemically pure ergosterol indeed induced sanitary grooming, supporting its role as a microbe-associated cue triggering host social immunity against fungal pathogens. By reducing this detection cue, pathogens were able to evade the otherwise very effective collective disease defences of their social hosts.}, author = {Stock, Miriam and Milutinovic, Barbara and Hönigsberger, Michaela and Grasse, Anna V and Wiesenhofer, Florian and Kampleitner, Niklas and Narasimhan, Madhumitha and Schmitt, Thomas and Cremer, Sylvia}, issn = {2397-334X}, journal = {Nature Ecology and Evolution}, pages = {450--460}, publisher = {Springer Nature}, title = {{Pathogen evasion of social immunity}}, doi = {10.1038/s41559-023-01981-6}, volume = {7}, year = {2023}, } @article{12521, abstract = {Differentiated X chromosomes are expected to have higher rates of adaptive divergence than autosomes, if new beneficial mutations are recessive (the “faster-X effect”), largely because these mutations are immediately exposed to selection in males. The evolution of X chromosomes after they stop recombining in males, but before they become hemizygous, has not been well explored theoretically. We use the diffusion approximation to infer substitution rates of beneficial and deleterious mutations under such a scenario. Our results show that selection is less efficient on diploid X loci than on autosomal and hemizygous X loci under a wide range of parameters. This “slower-X” effect is stronger for genes affecting primarily (or only) male fitness, and for sexually antagonistic genes. These unusual dynamics suggest that some of the peculiar features of X chromosomes, such as the differential accumulation of genes with sex-specific functions, may start arising earlier than previously appreciated.}, author = {Mrnjavac, Andrea and Khudiakova, Kseniia and Barton, Nicholas H and Vicoso, Beatriz}, issn = {2056-3744}, journal = {Evolution Letters}, keywords = {Genetics, Ecology, Evolution, Behavior and Systematics}, number = {1}, publisher = {Oxford University Press}, title = {{Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution}}, doi = {10.1093/evlett/qrac004}, volume = {7}, year = {2023}, } @article{12679, abstract = {How to generate a brain of correct size and with appropriate cell-type diversity during development is a major question in Neuroscience. In the developing neocortex, radial glial progenitor (RGP) cells are the main neural stem cells that produce cortical excitatory projection neurons, glial cells, and establish the prospective postnatal stem cell niche in the lateral ventricles. RGPs follow a tightly orchestrated developmental program that when disrupted can result in severe cortical malformations such as microcephaly and megalencephaly. The precise cellular and molecular mechanisms instructing faithful RGP lineage progression are however not well understood. This review will summarize recent conceptual advances that contribute to our understanding of the general principles of RGP lineage progression.}, author = {Hippenmeyer, Simon}, issn = {0959-4388}, journal = {Current Opinion in Neurobiology}, keywords = {General Neuroscience}, number = {4}, publisher = {Elsevier}, title = {{Principles of neural stem cell lineage progression: Insights from developing cerebral cortex}}, doi = {10.1016/j.conb.2023.102695}, volume = {79}, year = {2023}, } @article{12429, abstract = {In this paper, we consider traces at initial times for functions with mixed time-space smoothness. Such results are often needed in the theory of evolution equations. Our result extends and unifies many previous results. Our main improvement is that we can allow general interpolation couples. The abstract results are applied to regularity problems for fractional evolution equations and stochastic evolution equations, where uniform trace estimates on the half-line are shown.}, author = {Agresti, Antonio and Lindemulder, Nick and Veraar, Mark}, issn = {1522-2616}, journal = {Mathematische Nachrichten}, number = {4}, pages = {1319--1350}, publisher = {Wiley}, title = {{On the trace embedding and its applications to evolution equations}}, doi = {10.1002/mana.202100192}, volume = {296}, year = {2023}, } @article{12430, abstract = {We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively.}, author = {Falconi, Marco and Leopold, Nikolai K and Mitrouskas, David Johannes and Petrat, Sören P}, issn = {0129-055X}, journal = {Reviews in Mathematical Physics}, number = {4}, publisher = {World Scientific Publishing}, title = {{Bogoliubov dynamics and higher-order corrections for the regularized Nelson model}}, doi = {10.1142/S0129055X2350006X}, volume = {35}, year = {2023}, } @article{12762, abstract = {Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and make direct contact with human brain resting-state activity recordings via tractable inference of the model’s two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.}, author = {Lombardi, Fabrizio and Pepic, Selver and Shriki, Oren and Tkačik, Gašper and De Martino, Daniele}, issn = {2662-8457}, journal = {Nature Computational Science}, pages = {254--263}, publisher = {Springer Nature}, title = {{Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain}}, doi = {10.1038/s43588-023-00410-9}, volume = {3}, year = {2023}, } @inproceedings{14085, abstract = {We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee.}, author = {Goranci, Gramoz and Henzinger, Monika H}, booktitle = {50th International Colloquium on Automata, Languages, and Programming}, isbn = {9783959772785}, issn = {1868-8969}, location = {Paderborn, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Efficient data structures for incremental exact and approximate maximum flow}}, doi = {10.4230/LIPIcs.ICALP.2023.69}, volume = {261}, year = {2023}, } @inproceedings{14084, abstract = {A central problem in computational statistics is to convert a procedure for sampling combinatorial objects into a procedure for counting those objects, and vice versa. We will consider sampling problems which come from Gibbs distributions, which are families of probability distributions over a discrete space Ω with probability mass function of the form μ^Ω_β(ω) ∝ e^{β H(ω)} for β in an interval [β_min, β_max] and H(ω) ∈ {0} ∪ [1, n]. The partition function is the normalization factor Z(β) = ∑_{ω ∈ Ω} e^{β H(ω)}, and the log partition ratio is defined as q = (log Z(β_max))/Z(β_min) We develop a number of algorithms to estimate the counts c_x using roughly Õ(q/ε²) samples for general Gibbs distributions and Õ(n²/ε²) samples for integer-valued distributions (ignoring some second-order terms and parameters), We show this is optimal up to logarithmic factors. We illustrate with improved algorithms for counting connected subgraphs and perfect matchings in a graph.}, author = {Harris, David G. and Kolmogorov, Vladimir}, booktitle = {50th International Colloquium on Automata, Languages, and Programming}, isbn = {9783959772785}, issn = {1868-8969}, location = {Paderborn, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Parameter estimation for Gibbs distributions}}, doi = {10.4230/LIPIcs.ICALP.2023.72}, volume = {261}, year = {2023}, } @inproceedings{14086, abstract = {The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been investigated extensively due to its algorithmic properties and expressive power. Though tight approximation algorithms for general matroid constraints exist in theory, the running times of such algorithms typically scale quadratically, and are not practical for truly large scale settings. Recent progress has focused on fast algorithms for important classes of matroids given in explicit form. Currently, nearly-linear time algorithms only exist for graphic and partition matroids [Alina Ene and Huy L. Nguyen, 2019]. In this work, we develop algorithms for monotone submodular maximization constrained by graphic, transversal matroids, or laminar matroids in time near-linear in the size of their representation. Our algorithms achieve an optimal approximation of 1-1/e-ε and both generalize and accelerate the results of Ene and Nguyen [Alina Ene and Huy L. Nguyen, 2019]. In fact, the running time of our algorithm cannot be improved within the fast continuous greedy framework of Badanidiyuru and Vondrák [Ashwinkumar Badanidiyuru and Jan Vondrák, 2014]. To achieve near-linear running time, we make use of dynamic data structures that maintain bases with approximate maximum cardinality and weight under certain element updates. These data structures need to support a weight decrease operation and a novel Freeze operation that allows the algorithm to freeze elements (i.e. force to be contained) in its basis regardless of future data structure operations. For the laminar matroid, we present a new dynamic data structure using the top tree interface of Alstrup, Holm, de Lichtenberg, and Thorup [Stephen Alstrup et al., 2005] that maintains the maximum weight basis under insertions and deletions of elements in O(log n) time. This data structure needs to support certain subtree query and path update operations that are performed every insertion and deletion that are non-trivial to handle in conjunction. For the transversal matroid the Freeze operation corresponds to requiring the data structure to keep a certain set S of vertices matched, a property that we call S-stability. While there is a large body of work on dynamic matching algorithms, none are S-stable and maintain an approximate maximum weight matching under vertex updates. We give the first such algorithm for bipartite graphs with total running time linear (up to log factors) in the number of edges.}, author = {Henzinger, Monika H and Liu, Paul and Vondrák, Jan and Zheng, Da Wei}, booktitle = {50th International Colloquium on Automata, Languages, and Programming}, isbn = {9783959772785}, issn = {18688969}, location = {Paderborn, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Faster submodular maximization for several classes of matroids}}, doi = {10.4230/LIPIcs.ICALP.2023.74}, volume = {261}, year = {2023}, } @inproceedings{14083, abstract = {In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for all integer values of q ≥ 2. A code is called (p,L)_q-list-decodable if every radius pn Hamming ball contains less than L codewords; (p,𝓁,L)_q-list-recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length 𝓁 and again stipulate that there be less than L codewords. Our main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate (p,𝓁,L)_q-list-recoverable codes, the quantity we call the zero-rate threshold. Denoting this value by p_*, we in fact show that codes correcting a p_*+ε fraction of errors must have size O_ε(1), i.e., independent of n. Such a result is typically referred to as a "Plotkin bound." To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p_*-ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery. Technically, proving the Plotkin bound boils down to demonstrating the Schur convexity of a certain function defined on the q-simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q-ary list-decoding; however, we point out that this earlier proof is flawed.}, author = {Resch, Nicolas and Yuan, Chen and Zhang, Yihan}, booktitle = {50th International Colloquium on Automata, Languages, and Programming}, isbn = {9783959772785}, issn = {1868-8969}, location = {Paderborn, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery}}, doi = {10.4230/LIPIcs.ICALP.2023.99}, volume = {261}, year = {2023}, } @article{12922, abstract = {The influence of structural modifications on the catalytic activity of carbon materials is poorly understood. A collection of carbonaceous materials with different pore networks and high nitrogen content was characterized and used to catalyze four reactions to deduce structure–activity relationships. The CO2 cycloaddition and Knoevenagel reaction depend on Lewis basic sites (electron-rich nitrogen species). The absence of large conjugated carbon domains resulting from the introduction of large amounts of nitrogen in the carbon network is responsible for poor redox activity, as observed through the catalytic reduction of nitrobenzene with hydrazine and the catalytic oxidation of 3,3′,5,5′-tetramethylbenzidine using hydroperoxide. The material with the highest activity towards Lewis acid catalysis (in the hydrolysis of (dimethoxymethyl)benzene to benzaldehyde) is the most effective for small molecule activation and presents the highest concentration of electron-poor nitrogen species.}, author = {Lepre, Enrico and Rat, Sylvain and Cavedon, Cristian and Seeberger, Peter H. and Pieber, Bartholomäus and Antonietti, Markus and López‐Salas, Nieves}, issn = {1521-3773}, journal = {Angewandte Chemie International Edition}, keywords = {General Chemistry, Catalysis}, number = {2}, publisher = {Wiley}, title = {{Catalytic properties of high nitrogen content carbonaceous materials}}, doi = {10.1002/anie.202211663}, volume = {62}, year = {2023}, } @article{13450, abstract = {In previous work, we identified a population of 38 cool and luminous variable stars in the Magellanic Clouds and examined 11 in detail in order to classify them as either Thorne–Żytkow objects (TŻOs; red supergiants with a neutron star cores) or super-asymptotic giant branch (sAGB) stars (the most massive stars that will not undergo core collapse). This population includes HV 2112, a peculiar star previously considered in other works to be either a TŻO or high-mass asymptotic giant branch (AGB) star. Here we continue this investigation, using the kinematic and radio environments and local star formation history of these stars to place constraints on the age of the progenitor systems and the presence of past supernovae. These stars are not associated with regions of recent star formation, and we find no evidence of past supernovae at their locations. Finally, we also assess the presence of heavy elements and lithium in their spectra compared to red supergiants. We find strong absorption in Li and s-process elements compared to RSGs in most of the sample, consistent with sAGB nucleosynthesis, while HV 2112 shows additional strong lines associated with TŻO nucleosynthesis. Coupled with our previous mass estimates, the results are consistent with the stars being massive (∼4–6.5 M⊙) or sAGB (∼6.5–12 M⊙) stars in the thermally pulsing phase, providing crucial observations of the transition between low- and high-mass stellar populations. HV 2112 is more ambiguous; it could either be a maximally massive sAGB star, or a TŻO if the minimum mass for stability extends down to ≲13 M⊙.}, author = {O‘Grady, Anna J. G. and Drout, Maria R. and Gaensler, B. M. and Kochanek, C. S. and Neugent, Kathryn F. and Doherty, Carolyn L. and Speagle, Joshua S. and Shappee, B. J. and Rauch, Michael and Götberg, Ylva Louise Linsdotter and Ludwig, Bethany and Thompson, Todd A.}, issn = {1538-4357}, journal = {The Astrophysical Journal}, keywords = {Space and Planetary Science, Astronomy and Astrophysics}, number = {1}, publisher = {American Astronomical Society}, title = {{Cool, luminous, and highly variable stars in the Magellanic Clouds. II. Spectroscopic and environmental analysis of Thorne–Żytkow object and super-AGB star candidates}}, doi = {10.3847/1538-4357/aca655}, volume = {943}, year = {2023}, } @article{13449, abstract = {Stars strongly impact their environment, and shape structures on all scales throughout the universe, in a process known as "feedback." Due to the complexity of both stellar evolution and the physics of larger astrophysical structures, there remain many unanswered questions about how feedback operates and what we can learn about stars by studying their imprint on the wider universe. In this white paper, we summarize discussions from the Lorentz Center meeting "Bringing Stellar Evolution and Feedback Together" in 2022 April and identify key areas where further dialog can bring about radical changes in how we view the relationship between stars and the universe they live in.}, author = {Geen, Sam and Agrawal, Poojan and Crowther, Paul A. and Keller, B. W. and de Koter, Alex and Keszthelyi, Zsolt and van de Voort, Freeke and Ali, Ahmad A. and Backs, Frank and Bonne, Lars and Brugaletta, Vittoria and Derkink, Annelotte and Ekström, Sylvia and Fichtner, Yvonne A. and Grassitelli, Luca and Götberg, Ylva Louise Linsdotter and Higgins, Erin R. and Laplace, Eva and You Liow, Kong and Lorenzo, Marta and McLeod, Anna F. and Meynet, Georges and Newsome, Megan and André Oliva, G. and Ramachandran, Varsha and Rey, Martin P. and Rieder, Steven and Romano-Díaz, Emilio and Sabhahit, Gautham and Sander, Andreas A. C. and Sarwar, Rafia and Stinshoff, Hanno and Stoop, Mitchel and Szécsi, Dorottya and Trebitsch, Maxime and Vink, Jorick S. and Winch, Ethan}, issn = {1538-3873}, journal = {Publications of the Astronomical Society of the Pacific}, keywords = {Space and Planetary Science, Astronomy and Astrophysics}, number = {1044}, publisher = {IOP Publishing}, title = {{Bringing stellar evolution and feedback together: Summary of proposals from the Lorentz Center workshop}}, doi = {10.1088/1538-3873/acb6b5}, volume = {135}, year = {2023}, } @article{14104, abstract = {Thorne–Żytkow objects (TŻO) are potential end products of the merger of a neutron star with a non-degenerate star. In this work, we have computed the first grid of evolutionary models of TŻOs with the MESA stellar evolution code. With these models, we predict several observational properties of TŻOs, including their surface temperatures and luminosities, pulsation periods, and nucleosynthetic products. We expand the range of possible TŻO solutions to cover 3.45≲log(Teff/K)≲3.65 and 4.85≲log(L/L⊙)≲5.5⁠. Due to the much higher densities our TŻOs reach compared to previous models, if TŻOs form we expect them to be stable over a larger mass range than previously predicted, without exhibiting a gap in their mass distribution. Using the GYRE stellar pulsation code we show that TŻOs should have fundamental pulsation periods of 1000–2000 d, and period ratios of ≈0.2–0.3. Models computed with a large 399 isotope fully coupled nuclear network show a nucleosynthetic signal that is different to previously predicted. We propose a new nucleosynthetic signal to determine a star’s status as a TŻO: the isotopologues 44TiO2 and 44TiO⁠, which will have a shift in their spectral features as compared to stable titanium-containing molecules. We find that in the local Universe (∼SMC metallicities and above) TŻOs show little heavy metal enrichment, potentially explaining the difficulty in finding TŻOs to-date.}, author = {Farmer, R and Renzo, M and Götberg, Ylva Louise Linsdotter and Bellinger, E and Justham, S and de Mink, S E}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, keywords = {Space and Planetary Science, Astronomy and Astrophysics}, number = {2}, pages = {1692--1709}, publisher = {Oxford University Press}, title = {{Observational predictions for Thorne–Żytkow objects}}, doi = {10.1093/mnras/stad1977}, volume = {524}, year = {2023}, } @article{13989, abstract = {Characterizing and controlling entanglement in quantum materials is crucial for the development of next-generation quantum technologies. However, defining a quantifiable figure of merit for entanglement in macroscopic solids is theoretically and experimentally challenging. At equilibrium the presence of entanglement can be diagnosed by extracting entanglement witnesses from spectroscopic observables and a nonequilibrium extension of this method could lead to the discovery of novel dynamical phenomena. Here, we propose a systematic approach to quantify the time-dependent quantum Fisher information and entanglement depth of transient states of quantum materials with time-resolved resonant inelastic x-ray scattering. Using a quarter-filled extended Hubbard model as an example, we benchmark the efficiency of this approach and predict a light-enhanced many-body entanglement due to the proximity to a phase boundary. Our work sets the stage for experimentally witnessing and controlling entanglement in light-driven quantum materials via ultrafast spectroscopic measurements.}, author = {Hales, Jordyn and Bajpai, Utkarsh and Liu, Tongtong and Baykusheva, Denitsa Rangelova and Li, Mingda and Mitrano, Matteo and Wang, Yao}, issn = {2041-1723}, journal = {Nature Communications}, keywords = {General Physics and Astronomy, General Biochemistry, Genetics and Molecular Biology, General Chemistry, Multidisciplinary}, publisher = {Springer Nature}, title = {{Witnessing light-driven entanglement using time-resolved resonant inelastic X-ray scattering}}, doi = {10.1038/s41467-023-38540-3}, volume = {14}, year = {2023}, } @article{13990, abstract = {Many-body entanglement in condensed matter systems can be diagnosed from equilibrium response functions through the use of entanglement witnesses and operator-specific quantum bounds. Here, we investigate the applicability of this approach for detecting entangled states in quantum systems driven out of equilibrium. We use a multipartite entanglement witness, the quantum Fisher information, to study the dynamics of a paradigmatic fermion chain undergoing a time-dependent change of the Coulomb interaction. Our results show that the quantum Fisher information is able to witness distinct signatures of multipartite entanglement both near and far from equilibrium that are robust against decoherence. We discuss implications of these findings for probing entanglement in light-driven quantum materials with time-resolved optical and x-ray scattering methods.}, author = {Baykusheva, Denitsa Rangelova and Kalthoff, Mona H. and Hofmann, Damian and Claassen, Martin and Kennes, Dante M. and Sentef, Michael A. and Mitrano, Matteo}, issn = {1079-7114}, journal = {Physical Review Letters}, keywords = {General Physics and Astronomy}, number = {10}, publisher = {American Physical Society}, title = {{Witnessing nonequilibrium entanglement dynamics in a strongly correlated fermionic chain}}, doi = {10.1103/physrevlett.130.106902}, volume = {130}, year = {2023}, } @article{12697, abstract = {Models for same-material contact electrification in granular media often rely on a local charge-driving parameter whose spatial variations lead to a stochastic origin for charge exchange. Measuring the charge transfer from individual granular spheres after contacts with substrates of the same material, we find instead a “global” charging behavior, coherent over the sample’s whole surface. Cleaning and baking samples fully resets charging magnitude and direction, which indicates the underlying global parameter is not intrinsic to the material, but acquired from its history. Charging behavior is randomly and irreversibly affected by changes in relative humidity, hinting at a mechanism where adsorbates, in particular, water, are fundamental to the charge-transfer process.}, author = {Grosjean, Galien M and Waitukaitis, Scott R}, issn = {1079-7114}, journal = {Physical Review Letters}, keywords = {General Physics, Electrostatics, Triboelectricity, Soft Matter, Acoustic Levitation, Granular Materials}, number = {9}, publisher = {American Physical Society}, title = {{Single-collision statistics reveal a global mechanism driven by sample history for contact electrification in granular media}}, doi = {10.1103/physrevlett.130.098202}, volume = {130}, year = {2023}, } @article{14103, abstract = {Observations of individual massive stars, super-luminous supernovae, gamma-ray bursts, and gravitational wave events involving spectacular black hole mergers indicate that the low-metallicity Universe is fundamentally different from our own Galaxy. Many transient phenomena will remain enigmatic until we achieve a firm understanding of the physics and evolution of massive stars at low metallicity (Z). The Hubble Space Telescope has devoted 500 orbits to observing ∼250 massive stars at low Z in the ultraviolet (UV) with the COS and STIS spectrographs under the ULLYSES programme. The complementary X-Shooting ULLYSES (XShootU) project provides an enhanced legacy value with high-quality optical and near-infrared spectra obtained with the wide-wavelength coverage X-shooter spectrograph at ESO’s Very Large Telescope. We present an overview of the XShootU project, showing that combining ULLYSES UV and XShootU optical spectra is critical for the uniform determination of stellar parameters such as effective temperature, surface gravity, luminosity, and abundances, as well as wind properties such as mass-loss rates as a function of Z. As uncertainties in stellar and wind parameters percolate into many adjacent areas of astrophysics, the data and modelling of the XShootU project is expected to be a game changer for our physical understanding of massive stars at low Z. To be able to confidently interpret James Webb Space Telescope spectra of the first stellar generations, the individual spectra of low-Z stars need to be understood, which is exactly where XShootU can deliver.}, author = {Vink, Jorick S. and Mehner, A. and Crowther, P. A. and Fullerton, A. and Garcia, M. and Martins, F. and Morrell, N. and Oskinova, L. M. and St-Louis, N. and ud-Doula, A. and Sander, A. A. C. and Sana, H. and Bouret, J.-C. and Kubátová, B. and Marchant, P. and Martins, L. P. and Wofford, A. and van Loon, J. Th. and Grace Telford, O. and Götberg, Ylva Louise Linsdotter and Bowman, D. M. and Erba, C. and Kalari, V. M. and Abdul-Masih, M. and Alkousa, T. and Backs, F. and Barbosa, C. L. and Berlanas, S. R. and Bernini-Peron, M. and Bestenlehner, J. M. and Blomme, R. and Bodensteiner, J. and Brands, S. A. and Evans, C. J. and David-Uraz, A. and Driessen, F. A. and Dsilva, K. and Geen, S. and Gómez-González, V. M. A. and Grassitelli, L. and Hamann, W.-R. and Hawcroft, C. and Herrero, A. and Higgins, E. R. and John Hillier, D. and Ignace, R. and Istrate, A. G. and Kaper, L. and Kee, N. D. and Kehrig, C. and Keszthelyi, Z. and Klencki, J. and de Koter, A. and Kuiper, R. and Laplace, E. and Larkin, C. J. K. and Lefever, R. R. and Leitherer, C. and Lennon, D. J. and Mahy, L. and Maíz Apellániz, J. and Maravelias, G. and Marcolino, W. and McLeod, A. F. and de Mink, S. E. and Najarro, F. and Oey, M. S. and Parsons, T. N. and Pauli, D. and Pedersen, M. G. and Prinja, R. K. and Ramachandran, V. and Ramírez-Tannus, M. C. and Sabhahit, G. N. and Schootemeijer, A. and Reyero Serantes, S. and Shenar, T. and Stringfellow, G. S. and Sudnik, N. and Tramper, F. and Wang, L.}, issn = {1432-0746}, journal = {Astronomy & Astrophysics}, keywords = {Space and Planetary Science, Astronomy and Astrophysics}, publisher = {EDP Sciences}, title = {{X-shooting ULLYSES: Massive stars at low metallicity. I. Project description}}, doi = {10.1051/0004-6361/202245650}, volume = {675}, year = {2023}, } @phdthesis{13175, abstract = {About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. Quantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. Till date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. After decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. Optical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. In this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. With this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. }, author = {Sahu, Rishabh}, isbn = {978-3-99078-030-5}, issn = {2663 - 337X}, keywords = {quantum optics, electrooptics, quantum networks, quantum communication, transduction}, pages = {202}, publisher = {Institute of Science and Technology Austria}, title = {{Cavity quantum electrooptics}}, doi = {10.15479/at:ista:13175}, year = {2023}, } @inproceedings{14242, abstract = {We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training algorithm computes the gradient of an abstract representation of the actual network. Unlike existing approaches, our method can handle the discrete semantics of QNNs. Based on QA-IBP, we also develop a complete verification procedure for verifying the adversarial robustness of QNNs, which is guaranteed to terminate and produce a correct answer. Compared to existing approaches, the key advantage of our verification procedure is that it runs entirely on GPU or other accelerator devices. We demonstrate experimentally that our approach significantly outperforms existing methods and establish the new state-of-the-art for training and certifying the robustness of QNNs.}, author = {Lechner, Mathias and Zikelic, Dorde and Chatterjee, Krishnendu and Henzinger, Thomas A and Rus, Daniela}, booktitle = {Proceedings of the 37th AAAI Conference on Artificial Intelligence}, isbn = {9781577358800}, location = {Washington, DC, United States}, number = {12}, pages = {14964--14973}, publisher = {Association for the Advancement of Artificial Intelligence}, title = {{Quantization-aware interval bound propagation for training certifiably robust quantized neural networks}}, doi = {10.1609/aaai.v37i12.26747}, volume = {37}, year = {2023}, } @inproceedings{14243, abstract = {Two-player zero-sum "graph games" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In "bidding games", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with "mean-payoff" objectives in combination with "poorman" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the "value" under pure strategies does not necessarily exist in such games.}, author = {Avni, Guy and Jecker, Ismael R and Zikelic, Dorde}, booktitle = {Proceedings of the 37th AAAI Conference on Artificial Intelligence}, isbn = {9781577358800}, location = {Washington, DC, United States}, number = {5}, pages = {5464--5471}, title = {{Bidding graph games with partially-observable budgets}}, doi = {10.1609/aaai.v37i5.25679}, volume = {37}, year = {2023}, } @inproceedings{14241, abstract = {We present a technique to optimize the reflectivity of a surface while preserving its overall shape. The naïve optimization of the mesh vertices using the gradients of reflectivity simulations results in undesirable distortion. In contrast, our robust formulation optimizes the surface normal as an independent variable that bridges the reflectivity term with differential rendering, and the regularization term with as-rigid-as-possible elastic energy. We further adaptively subdivide the input mesh to improve the convergence. Consequently, our method can minimize the retroreflectivity of a wide range of input shapes, resulting in sharply creased shapes ubiquitous among stealth aircraft and Sci-Fi vehicles. Furthermore, by changing the reward for the direction of the outgoing light directions, our method can be applied to other reflectivity design tasks, such as the optimization of architectural walls to concentrate light in a specific region. We have tested the proposed method using light-transport simulations and real-world 3D-printed objects.}, author = {Tojo, Kenji and Shamir, Ariel and Bickel, Bernd and Umetani, Nobuyuki}, booktitle = {SIGGRAPH 2023 Conference Proceedings}, isbn = {9798400701597}, location = {Los Angeles, CA, United States}, publisher = {Association for Computing Machinery}, title = {{Stealth shaper: Reflectivity optimization as surface stylization}}, doi = {10.1145/3588432.3591542}, year = {2023}, } @inproceedings{13310, abstract = {Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation.}, author = {Henzinger, Thomas A and Karimi, Mahyar and Kueffner, Konstantin and Mallik, Kaushik}, booktitle = {Computer Aided Verification}, isbn = {9783031377020}, issn = {1611-3349}, location = {Paris, France}, pages = {358–382}, publisher = {Springer Nature}, title = {{Monitoring algorithmic fairness}}, doi = {10.1007/978-3-031-37703-7_17}, volume = {13965}, year = {2023}, } @article{12205, abstract = {Background: This study seeks to evaluate the impact of breast cancer (BRCA) gene status on tumor dissemination pattern, surgical outcome and survival in a multicenter cohort of paired primary ovarian cancer (pOC) and recurrent ovarian cancer (rOC). Patients and Methods: Medical records and follow-up data from 190 patients were gathered retrospectively. All patients had surgery at pOC and at least one further rOC surgery at four European high-volume centers. Patients were divided into one cohort with confirmed mutation for BRCA1 and/or BRCA2 (BRCAmut) and a second cohort with BRCA wild type or unknown (BRCAwt). Patterns of tumor presentation, surgical outcome and survival data were analyzed between the two groups. Results: Patients with BRCAmut disease were on average 4 years younger and had significantly more tumor involvement upon diagnosis. Patients with BRCAmut disease showed higher debulking rates at all stages. Multivariate analysis showed that only patient age had significant predictive value for complete tumor resection in pOC. At rOC, however, only BRCAmut status significantly correlated with optimal debulking. Patients with BRCAmut disease showed significantly prolonged overall survival (OS) by 24.3 months. Progression-free survival (PFS) was prolonged in the BRCAmut group at all stages as well, reaching statistical significance during recurrence. Conclusions: Patients with BRCAmut disease showed a more aggressive course of disease with earlier onset and more extensive tumor dissemination at pOC. However, surgical outcome and OS were significantly better in patients with BRCAmut disease compared with patients with BRCAwt disease. We therefore propose to consider BRCAmut status in regard to patient selection for cytoreductive surgery, especially in rOC.}, author = {Glajzer, Jacek and Castillo-Tong, Dan Cacsire and Richter, Rolf and Vergote, Ignace and Kulbe, Hagen and Vanderstichele, Adriaan and Ruscito, Ilary and Trillsch, Fabian and Mustea, Alexander and Kreuzinger, Caroline and Gourley, Charlie and Gabra, Hani and Taube, Eliane T. and Dorigo, Oliver and Horst, David and Keunecke, Carlotta and Baum, Joanna and Angelotti, Timothy and Sehouli, Jalid and Braicu, Elena Ioana}, issn = {1534-4681}, journal = {Annals of Surgical Oncology}, keywords = {Oncology, Surgery}, pages = {35--45}, publisher = {Springer Nature}, title = {{Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome and patient survival in primary and recurrent high-grade serous ovarian cancer: A multicenter retrospective study by the Ovarian Cancer Therapy-Innovative Models Prolong Survival (OCTIPS) consortium}}, doi = {10.1245/s10434-022-12459-3}, volume = {30}, year = {2023}, } @article{12115, author = {Glajzer, Jacek and Castillo-Tong, Dan Cacsire and Richter, Rolf and Vergote, Ignace and Kulbe, Hagen and Vanderstichele, Adriaan and Ruscito, Ilary and Trillsch, Fabian and Mustea, Alexander and Kreuzinger, Caroline and Gourley, Charlie and Gabra, Hani and Taube, Eliane T. and Dorigo, Oliver and Horst, David and Keunecke, Carlotta and Baum, Joanna and Angelotti, Timothy and Sehouli, Jalid and Braicu, Elena Ioana}, issn = {1534-4681}, journal = {Annals of Surgical Oncology}, keywords = {Oncology, Surgery}, pages = {46--47}, publisher = {Springer Nature}, title = {{ASO Visual Abstract: Impact of BRCA mutation status on tumor dissemination pattern, surgical outcome, and patient survival in primary and recurrent high-grade serous ovarian cancer (HGSOC). A multicenter, retrospective study of the ovarian cancer therapy—innovative models prolong survival (OCTIPS) consortium}}, doi = {10.1245/s10434-022-12681-z}, volume = {30}, year = {2023}, } @article{14253, abstract = {Junctions between the endoplasmic reticulum (ER) and the plasma membrane (PM) are specialized membrane contacts ubiquitous in eukaryotic cells. Concentration of intracellular signaling machinery near ER-PM junctions allows these domains to serve critical roles in lipid and Ca2+ signaling and homeostasis. Subcellular compartmentalization of protein kinase A (PKA) signaling also regulates essential cellular functions, however, no specific association between PKA and ER-PM junctional domains is known. Here, we show that in brain neurons type I PKA is directed to Kv2.1 channel-dependent ER-PM junctional domains via SPHKAP, a type I PKA-specific anchoring protein. SPHKAP association with type I PKA regulatory subunit RI and ER-resident VAP proteins results in the concentration of type I PKA between stacked ER cisternae associated with ER-PM junctions. This ER-associated PKA signalosome enables reciprocal regulation between PKA and Ca2+ signaling machinery to support Ca2+ influx and excitation-transcription coupling. These data reveal that neuronal ER-PM junctions support a receptor-independent form of PKA signaling driven by membrane depolarization and intracellular Ca2+, allowing conversion of information encoded in electrical signals into biochemical changes universally recognized throughout the cell.}, author = {Vierra, Nicholas C. and Ribeiro-Silva, Luisa and Kirmiz, Michael and Van Der List, Deborah and Bhandari, Pradeep and Mack, Olivia A. and Carroll, James and Le Monnier, Elodie and Aicher, Sue A. and Shigemoto, Ryuichi and Trimmer, James S.}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Neuronal ER-plasma membrane junctions couple excitation to Ca2+-activated PKA signaling}}, doi = {10.1038/s41467-023-40930-6}, volume = {14}, year = {2023}, } @inproceedings{14259, abstract = {We provide a learning-based technique for guessing a winning strategy in a parity game originating from an LTL synthesis problem. A cheaply obtained guess can be useful in several applications. Not only can the guessed strategy be applied as best-effort in cases where the game’s huge size prohibits rigorous approaches, but it can also increase the scalability of rigorous LTL synthesis in several ways. Firstly, checking whether a guessed strategy is winning is easier than constructing one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy iteration faster than constructing one from scratch. Thirdly, the guess can be used in on-the-fly approaches to prioritize exploration in the most fruitful directions. In contrast to previous works, we (i) reflect the highly structured logical information in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) learn to reflect it properly by learning from previously solved games, bringing the solving process closer to human-like reasoning.}, author = {Kretinsky, Jan and Meggendorfer, Tobias and Prokop, Maximilian and Rieder, Sabine}, booktitle = {35th International Conference on Computer Aided Verification }, isbn = {9783031377051}, issn = {1611-3349}, location = {Paris, France}, pages = {390--414}, publisher = {Springer Nature}, title = {{Guessing winning policies in LTL synthesis by semantic learning}}, doi = {10.1007/978-3-031-37706-8_20}, volume = {13964}, year = {2023}, } @inproceedings{14105, abstract = {Despite their recent success, deep neural networks continue to perform poorly when they encounter distribution shifts at test time. Many recently proposed approaches try to counter this by aligning the model to the new distribution prior to inference. With no labels available this requires unsupervised objectives to adapt the model on the observed test data. In this paper, we propose Test-Time SelfTraining (TeST): a technique that takes as input a model trained on some source data and a novel data distribution at test time, and learns invariant and robust representations using a student-teacher framework. We find that models adapted using TeST significantly improve over baseline testtime adaptation algorithms. TeST achieves competitive performance to modern domain adaptation algorithms [4, 43], while having access to 5-10x less data at time of adaption. We thoroughly evaluate a variety of baselines on two tasks: object detection and image segmentation and find that models adapted with TeST. We find that TeST sets the new stateof-the art for test-time domain adaptation algorithms. }, author = {Sinha, Samarth and Gehler, Peter and Locatello, Francesco and Schiele, Bernt}, booktitle = {2023 IEEE/CVF Winter Conference on Applications of Computer Vision}, isbn = {9781665493475}, issn = {2642-9381}, location = {Waikoloa, HI, United States}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{TeST: Test-time Self-Training under distribution shift}}, doi = {10.1109/wacv56688.2023.00278}, year = {2023}, } @article{14256, abstract = {Context. Space asteroseismology is revolutionizing our knowledge of the internal structure and dynamics of stars. A breakthrough is ongoing with the recent discoveries of signatures of strong magnetic fields in the core of red giant stars. The key signature for such a detection is the asymmetry these fields induce in the frequency splittings of observed dipolar mixed gravito-acoustic modes. Aims. We investigate the ability of the observed asymmetries of the frequency splittings of dipolar mixed modes to constrain the geometrical properties of deep magnetic fields. Methods. We used the powerful analytical Racah-Wigner algebra used in quantum mechanics to characterize the geometrical couplings of dipolar mixed oscillation modes with various realistically plausible topologies of fossil magnetic fields. We also computed the induced perturbation of their frequencies. Results. First, in the case of an oblique magnetic dipole, we provide the exact analytical expression of the asymmetry as a function of the angle between the rotation and magnetic axes. Its value provides a direct measure of this angle. Second, considering a combination of axisymmetric dipolar and quadrupolar fields, we show how the asymmetry is blind to the unraveling of the relative strength and sign of each component. Finally, in the case of a given multipole, we show that a negative asymmetry is a signature of non-axisymmetric topologies. Conclusions. Asymmetries of dipolar mixed modes provide a key bit of information on the geometrical topology of deep fossil magnetic fields, but this is insufficient on its own. Asteroseismic constraints should therefore be combined with spectropolarimetric observations and numerical simulations, which aim to predict the more probable stable large-scale geometries.}, author = {Mathis, S. and Bugnet, Lisa Annabelle}, issn = {1432-0746}, journal = {Astronomy and Astrophysics}, publisher = {EDP Sciences}, title = {{Asymmetries of frequency splittings of dipolar mixed modes: A window on the topology of deep magnetic fields}}, doi = {10.1051/0004-6361/202346832}, volume = {676}, year = {2023}, } @article{14261, abstract = {In this work, a generalized, adapted Numerov implementation capable of determining band structures of periodic quantum systems is outlined. Based on the input potential, the presented approach numerically solves the Schrödinger equation in position space at each momentum space point. Thus, in addition to the band structure, the method inherently provides information about the state functions and probability densities in position space at each momentum space point considered. The generalized, adapted Numerov framework provided reliable estimates for a variety of increasingly complex test suites in one, two, and three dimensions. The accuracy of the proposed methodology was benchmarked against results obtained for the analytically solvable Kronig-Penney model. Furthermore, the presented numerical solver was applied to a model potential representing a 2D optical lattice being a challenging application relevant, for example, in the field of quantum computing.}, author = {Gamper, Jakob and Kluibenschedl, Florian and Weiss, Alexander K.H. and Hofer, Thomas S.}, issn = {1948-7185}, journal = {Journal of Physical Chemistry Letters}, number = {33}, pages = {7395--7403}, publisher = {American Chemical Society}, title = {{Accessing position space wave functions in band structure calculations of periodic systems - a generalized, adapted numerov implementation for one-, two-, and three-dimensional quantum problems}}, doi = {10.1021/acs.jpclett.3c01707}, volume = {14}, year = {2023}, } @inproceedings{14208, abstract = {This paper focuses on over-parameterized deep neural networks (DNNs) with ReLU activation functions and proves that when the data distribution is well-separated, DNNs can achieve Bayes-optimal test error for classification while obtaining (nearly) zero-training error under the lazy training regime. For this purpose, we unify three interrelated concepts of overparameterization, benign overfitting, and the Lipschitz constant of DNNs. Our results indicate that interpolating with smoother functions leads to better generalization. Furthermore, we investigate the special case where interpolating smooth ground-truth functions is performed by DNNs under the Neural Tangent Kernel (NTK) regime for generalization. Our result demonstrates that the generalization error converges to a constant order that only depends on label noise and initialization noise, which theoretically verifies benign overfitting. Our analysis provides a tight lower bound on the normalized margin under non-smooth activation functions, as well as the minimum eigenvalue of NTK under high-dimensional settings, which has its own interest in learning theory.}, author = {Zhu, Zhenyu and Liu, Fanghui and Chrysos, Grigorios G and Locatello, Francesco and Cevher, Volkan}, booktitle = {Proceedings of the 40th International Conference on Machine Learning}, location = {Honolulu, Hawaii, United States}, pages = {43105--43128}, publisher = {ML Research Press}, title = {{Benign overfitting in deep neural networks under lazy training}}, volume = {202}, year = {2023}, }