@article{14484,
  abstract     = {Intercellular signaling molecules, known as morphogens, act at a long range in developing tissues to provide spatial information and control properties such as cell fate and tissue growth. The production, transport, and removal of morphogens shape their concentration profiles in time and space. Downstream signaling cascades and gene regulatory networks within cells then convert the spatiotemporal morphogen profiles into distinct cellular responses. Current challenges are to understand the diverse molecular and cellular mechanisms underlying morphogen gradient formation, as well as the logic of downstream regulatory circuits involved in morphogen interpretation. This knowledge, combining experimental and theoretical results, is essential to understand emerging properties of morphogen-controlled systems, such as robustness and scaling.},
  author       = {Kicheva, Anna and Briscoe, James},
  issn         = {1530-8995},
  journal      = {Annual Review of Cell and Developmental Biology},
  pages        = {91--121},
  publisher    = {Annual Reviews},
  title        = {{Control of tissue development by morphogens}},
  doi          = {10.1146/annurev-cellbio-020823-011522},
  volume       = {39},
  year         = {2023},
}

@inproceedings{14485,
  abstract     = {Batching is a technique that stores multiple keys/values in each node of a data structure. In sequential search data structures, batching reduces latency by reducing the number of cache misses and shortening the chain of pointers to dereference. Applying batching to concurrent data structures is challenging, because it is difficult to maintain the search property and keep contention low in the presence of batching.
In this paper, we present a general methodology for leveraging batching in concurrent search data structures, called BatchBoost. BatchBoost builds a search data structure from distinct "data" and "index" layers. The data layer’s purpose is to store a batch of key/value pairs in each of its nodes. The index layer uses an unmodified concurrent search data structure to route operations to a position in the data layer that is "close" to where the corresponding key should exist. The requirements on the index and data layers are low: with minimal effort, we were able to compose three highly scalable concurrent search data structures based on three original data structures as the index layers with a batched version of the Lazy List as the data layer. The resulting BatchBoost data structures provide significant performance improvements over their original counterparts.},
  author       = {Aksenov, Vitaly and Anoprenko, Michael and Fedorov, Alexander and Spear, Michael},
  booktitle    = {37th International Symposium on Distributed Computing},
  isbn         = {9783959773010},
  issn         = {1868-8969},
  location     = {L'Aquila, Italy},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Brief announcement: BatchBoost: Universal batching for concurrent data structures}},
  doi          = {10.4230/LIPIcs.DISC.2023.35},
  volume       = {281},
  year         = {2023},
}

@article{14486,
  abstract     = {We present a minimal model of ferroelectric large polarons, which are suggested as one of the mechanisms responsible for the unique charge transport properties of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions lead to long-range ferroelectric ordering of rotors, which strongly affects the carrier mobility. In the nonperturbative regime, where our theory cannot be reduced to any of the earlier models, we reveal that the polaron is characterized by large coherence length and a roughly tenfold increase of the effective mass as compared to the bare mass. These results are in good agreement with other theoretical predictions for ferroelectric polarons. Our model establishes a general phenomenological framework for ferroelectric polarons providing the starting point for future studies of their role in the transport properties of hybrid organic-inorganic perovskites.},
  author       = {Koutentakis, Georgios and Ghazaryan, Areg and Lemeshko, Mikhail},
  issn         = {2643-1564},
  journal      = {Physical Review Research},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Rotor lattice model of ferroelectric large polarons}},
  doi          = {10.1103/PhysRevResearch.5.043016},
  volume       = {5},
  year         = {2023},
}

@article{14487,
  abstract     = {High Mountain Asia (HMA) is among the most vulnerable water towers globally and yet future projections of water availability in and from its high-mountain catchments remain uncertain, as their hydrologic response to ongoing environmental changes is complex. Mechanistic modeling approaches incorporating cryospheric, hydrological, and vegetation processes in high spatial, temporal, and physical detail have never been applied for high-elevation catchments of HMA. We use a land surface model at high spatial and temporal resolution (100 m and hourly) to simulate the coupled dynamics of energy, water, and vegetation for the 350 km2 Langtang catchment (Nepal). We compare our model outputs for one hydrological year against a large set of observations to gain insight into the partitioning of the water balance at the subseasonal scale and across elevation bands. During the simulated hydrological year, we find that evapotranspiration is a key component of the total water balance, as it causes about the equivalent of 20% of all the available precipitation or 154% of the water production from glacier melt in the basin to return directly to the atmosphere. The depletion of the cryospheric water budget is dominated by snow melt, but at high elevations is primarily dictated by snow and ice sublimation. Snow sublimation is the dominant vapor flux (49%) at the catchment scale, accounting for the equivalent of 11% of snowfall, 17% of snowmelt, and 75% of ice melt, respectively. We conclude that simulations should consider sublimation and other evaporative fluxes explicitly, as otherwise water balance estimates can be ill-quantified.},
  author       = {Buri, Pascal and Fatichi, Simone and Shaw, Thomas and Miles, Evan S. and Mccarthy, Michael and Fyffe, Catriona Louise and Fugger, Stefan and Ren, Shaoting and Kneib, Marin and Jouberton, Achille and Steiner, Jakob and Fujita, Koji and Pellicciotti, Francesca},
  issn         = {1944-7973},
  journal      = {Water Resources Research},
  number       = {10},
  publisher    = {Wiley},
  title        = {{Land surface modeling in the Himalayas: On the importance of evaporative fluxes for the water balance of a high-elevation catchment}},
  doi          = {10.1029/2022WR033841},
  volume       = {59},
  year         = {2023},
}

@article{14488,
  abstract     = {Portrait viewpoint and illumination editing is an important problem with several applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry and illumination is critical for obtaining photorealistic results. Current methods are unable to explicitly model in 3D while handling both viewpoint and illumination editing from a single image. In this paper, we propose VoRF, a novel approach that can take even a single portrait image as input and relight human heads under novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents a human head as a continuous volumetric field and learns a prior model of human heads using a coordinate-based MLP with individual latent spaces for identity and illumination. The prior model is learned in an auto-decoder manner over a diverse class of head shapes and appearances, allowing VoRF to generalize to novel test identities from a single input image. Additionally, VoRF has a reflectance MLP that uses the intermediate features of the prior model for rendering One-Light-at-A-Time (OLAT) images under novel views. We synthesize novel illuminations by combining these OLAT images with target environment maps. Qualitative and quantitative evaluations demonstrate the effectiveness of VoRF for relighting and novel view synthesis, even when applied to unseen subjects under uncontrolled illumination. This work is an extension of Rao et al. (VoRF: Volumetric Relightable Faces 2022). We provide extensive evaluation and ablative studies of our model and also provide an application, where any face can be relighted using textual input.},
  author       = {Rao, Pramod and Mallikarjun, B. R. and Fox, Gereon and Weyrich, Tim and Bickel, Bernd and Pfister, Hanspeter and Matusik, Wojciech and Zhan, Fangneng and Tewari, Ayush and Theobalt, Christian and Elgharib, Mohamed},
  issn         = {1573-1405},
  journal      = {International Journal of Computer Vision},
  publisher    = {Springer Nature},
  title        = {{A deeper analysis of volumetric relightiable faces}},
  doi          = {10.1007/s11263-023-01899-3},
  year         = {2023},
}

@article{14489,
  abstract     = {Microwave-optics entanglement is a vital component for building hybrid quantum networks. Here, a new mechanism for preparing stationary entanglement between microwave and optical cavity fields in a cavity optomagnomechanical system is proposed. It consists of a magnon mode in a ferrimagnetic crystal that couples directly to a microwave cavity mode via the magnetic dipole interaction and indirectly to an optical cavity through the deformation displacement of the crystal. The mechanical displacement is induced by the magnetostrictive force and coupled to the optical cavity via radiation pressure. Both the opto- and magnomechanical couplings are dispersive. Magnon–phonon entanglement is created via magnomechanical parametric down-conversion, which is further distributed to optical and microwave photons via simultaneous optomechanical beamsplitter interaction and electromagnonic state-swap interaction, yielding stationary microwave-optics entanglement. The microwave-optics entanglement is robust against thermal noise, which will find broad potential applications in quantum networks and quantum information processing with hybrid quantum systems.},
  author       = {Fan, Zhi Yuan and Qiu, Liu and Gröblacher, Simon and Li, Jie},
  issn         = {1863-8899},
  journal      = {Laser and Photonics Reviews},
  number       = {12},
  publisher    = {Wiley},
  title        = {{Microwave-optics entanglement via cavity optomagnomechanics}},
  doi          = {10.1002/lpor.202200866},
  volume       = {17},
  year         = {2023},
}

@inproceedings{14490,
  abstract     = {Payment channel networks (PCNs) are a promising solution to the scalability problem of cryptocurrencies. Any two users connected by a payment channel in the network can theoretically send an unbounded number of instant, costless transactions between them. Users who are not directly connected can also transact with each other in a multi-hop fashion. In this work, we study the incentive structure behind the creation of payment channel networks, particularly from the point of view of a single user that wants to join the network. We define a utility function for a new user in terms of expected revenue, expected fees, and the cost of creating channels, and then provide constant factor approximation algorithms that optimise the utility function given a certain budget. Additionally, we take a step back from a single user to the whole network and examine the parameter spaces under which simple graph topologies form a Nash equilibrium.},
  author       = {Avarikioti, Zeta and Lizurej, Tomasz and Michalak, Tomasz and Yeo, Michelle X},
  booktitle    = {43rd International Conference on Distributed Computing Systems},
  isbn         = {9798350339864},
  issn         = {2575-8411},
  location     = {Hong Kong, China},
  pages        = {603--613},
  publisher    = {IEEE},
  title        = {{Lightning creation games}},
  doi          = {10.1109/ICDCS57875.2023.00037},
  volume       = {2023},
  year         = {2023},
}

@misc{14494,
  abstract     = {We provide i) gridded initial conditions (.tif), ii) modeled gridded monthly outputs (.tif), and iii) modeled hourly outputs at the station locations (.txt) for the hydrological year 2019. Information about the variables and units can be found in the figures (.png) associated to each dataset. Details about the datasets can be found in the original publication by Buri and others (2023).

Buri, P., Fatichi, S., Shaw, T. E., Miles, E. S., McCarthy, M. J., Fyffe, C. L., ... & Pellicciotti, F. (2023). Land Surface Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a High‐Elevation Catchment. Water Resources Research, 59(10), e2022WR033841. DOI: 10.1029/2022WR033841},
  author       = {Buri, Pascal and Fatichi, Simone and Shaw, Thomas and Miles, Evan  and McCarthy, Michael and Fyffe, Catriona Louise and Fugger, Stefan and Ren, Shaoting and Kneib, Marin and Jouberton, Achille and Steiner, Jakob and Fujita, Koji and Pellicciotti, Francesca},
  publisher    = {Zenodo},
  title        = {{Model output data to "Land surface modeling in the Himalayas: on the importance of evaporative fluxes for the water balance of a high elevation catchment"}},
  doi          = {10.5281/ZENODO.8402426},
  year         = {2023},
}

@article{14499,
  abstract     = {An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.

The proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes.},
  author       = {Kwan, Matthew Alan and Sah, Ashwin and Sauermann, Lisa and Sawhney, Mehtaab},
  issn         = {2050-5086},
  journal      = {Forum of Mathematics, Pi},
  keywords     = {Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics, Statistics and Probability, Algebra and Number Theory, Analysis},
  publisher    = {Cambridge University Press},
  title        = {{Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture}},
  doi          = {10.1017/fmp.2023.17},
  volume       = {11},
  year         = {2023},
}

@misc{14502,
  abstract     = {A precise quantitative description of the ultrastructural characteristics underlying biological mechanisms is often key to their understanding. This is particularly true for dynamic extra- and intracellular filamentous assemblies, playing a role in cell motility, cell integrity, cytokinesis, tissue formation and maintenance. For example, genetic manipulation or modulation of actin regulatory proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural architecture of actin filament-rich cell peripheral structures, such as lamellipodia or filopodia. However, the observed ultrastructural effects often remain subtle and require sufficiently large datasets for appropriate quantitative analysis. The acquisition of such large datasets has been enabled by recent advances in high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates the development of complementary approaches to maximize the extraction of relevant biological information. We have developed a computational toolbox for the semi-automatic quantification of segmented and vectorized fila- mentous networks from pre-processed cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple experimental conditions. GUI-based components simplify the processing of data and allow users to obtain a large number of ultrastructural parameters describing filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing cryo-ET data of untreated and chemically perturbed branched actin filament networks and that of parallel actin filament arrays. In principle, the computational toolbox presented here is applicable for data analysis comprising any type of filaments in regular (i.e. parallel) or random arrangement. We show that it can ease the identification of key differences between experimental groups and facilitate the in-depth analysis of ultrastructural data in a time-efficient manner.},
  author       = {Dimchev, Georgi A and Amiri, Behnam and Fäßler, Florian and Falcke, Martin and Schur, Florian KM},
  keywords     = {cryo-electron tomography, actin cytoskeleton, toolbox},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data}},
  doi          = {10.15479/AT:ISTA:14502},
  year         = {2023},
}

@phdthesis{14506,
  abstract     = {Payment channel networks are a promising approach to improve the scalability bottleneck
of cryptocurrencies. Two design principles behind payment channel networks are
efficiency and privacy. Payment channel networks improve efficiency by allowing users
to transact in a peer-to-peer fashion along multi-hop routes in the network, avoiding
the lengthy process of consensus on the blockchain. Transacting over payment channel
networks also improves privacy as these transactions are not broadcast to the blockchain.
Despite the influx of recent protocols built on top of payment channel networks and
their analysis, a common shortcoming of many of these protocols is that they typically
focus only on either improving efficiency or privacy, but not both. Another limitation
on the efficiency front is that the models used to model actions, costs and utilities of
users are limited or come with unrealistic assumptions.
This thesis aims to address some of the shortcomings of recent protocols and algorithms
on payment channel networks, particularly in their privacy and efficiency aspects. We
first present a payment route discovery protocol based on hub labelling and private
information retrieval that hides the route query and is also efficient. We then present
a rebalancing protocol that formulates the rebalancing problem as a linear program
and solves the linear program using multiparty computation so as to hide the channel
balances. The rebalancing solution as output by our protocol is also globally optimal.
We go on to develop more realistic models of the action space, costs, and utilities of
both existing and new users that want to join the network. In each of these settings,
we also develop algorithms to optimise the utility of these users with good guarantees
on the approximation and competitive ratios.},
  author       = {Yeo, Michelle X},
  issn         = {2663 - 337X},
  pages        = {162},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Advances in efficiency and privacy in payment channel network analysis}},
  doi          = {10.15479/14506},
  year         = {2023},
}

@phdthesis{14510,
  author       = {Gnyliukh, Nataliia},
  isbn         = {978-3-99078-037-4},
  issn         = {2663-337X},
  keywords     = {Clathrin-Mediated Endocytosis, vesicle scission, Dynamin-Related Protein 2, SH3P2, TPLATE complex, Total internal reflection fluorescence microscopy, Arabidopsis thaliana},
  pages        = {180},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Mechanism of clathrin-coated vesicle  formation during endocytosis in plants}},
  doi          = {10.15479/at:ista:14510},
  year         = {2023},
}

@article{14513,
  abstract     = {Cold atomic gases have become a paradigmatic system for exploring fundamental physics, which at the same time allows for applications in quantum technologies. The accelerating developments in the field have led to a highly advanced set of engineering techniques that, for example, can tune interactions, shape the external geometry, select among a large set of atomic species with different properties, or control the number of atoms. In particular, it is possible to operate in lower dimensions and drive atomic systems into the strongly correlated regime. In this review, we discuss recent advances in few-body cold atom systems confined in low dimensions from a theoretical viewpoint. We mainly focus on bosonic systems in one dimension and provide an introduction to the static properties before we review the state-of-the-art research into quantum dynamical processes stimulated by the presence of correlations. Besides discussing the fundamental physical phenomena arising in these systems, we also provide an overview of the calculational and numerical tools and methods that are commonly used, thus delivering a balanced and comprehensive overview of the field. We conclude by giving an outlook on possible future directions that are interesting to explore in these correlated systems.},
  author       = {Mistakidis, S. I. and Volosniev, Artem and Barfknecht, R. E. and Fogarty, T. and Busch, Th and Foerster, A. and Schmelcher, P. and Zinner, N. T.},
  issn         = {0370-1573},
  journal      = {Physics Reports},
  pages        = {1--108},
  publisher    = {Elsevier},
  title        = {{Few-body Bose gases in low dimensions - A laboratory for quantum dynamics}},
  doi          = {10.1016/j.physrep.2023.10.004},
  volume       = {1042},
  year         = {2023},
}

@article{14514,
  abstract     = {The elastic Leidenfrost effect occurs when a vaporizable soft solid is lowered onto a hot surface. Evaporative flow couples to elastic deformation, giving spontaneous bouncing or steady-state floating. The effect embodies an unexplored interplay between thermodynamics, elasticity, and lubrication: despite being observed, its basic theoretical description remains a challenge. Here, we provide a theory of elastic Leidenfrost floating. As weight increases, a rigid solid sits closer to the hot surface. By contrast, we discover an elasticity-dominated regime where the heavier the solid, the higher it floats. This geometry-governed behavior is reminiscent of the dynamics of large liquid Leidenfrost drops. We show that this elastic regime is characterized by Hertzian behavior of the solid’s underbelly and derive how the float height scales with materials parameters. Introducing a dimensionless elastic Leidenfrost number, we capture the crossover between rigid and Hertzian behavior. Our results provide theoretical underpinning for recent experiments, and point to the design of novel soft machines.},
  author       = {Binysh, Jack and Chakraborty, Indrajit and Chubynsky, Mykyta V. and Diaz Melian, Vicente L and Waitukaitis, Scott R and Sprittles, James E. and Souslov, Anton},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  number       = {16},
  publisher    = {American Physical Society},
  title        = {{Modeling Leidenfrost levitation of soft elastic solids}},
  doi          = {10.1103/PhysRevLett.131.168201},
  volume       = {131},
  year         = {2023},
}

@article{14515,
  abstract     = {Most natural and engineered information-processing systems transmit information via signals that vary in time. Computing the information transmission rate or the information encoded in the temporal characteristics of these signals requires the mutual information between the input and output signals as a function of time, i.e., between the input and output trajectories. Yet, this is notoriously difficult because of the high-dimensional nature of the trajectory space, and all existing techniques require approximations. We present an exact Monte Carlo technique called path weight sampling (PWS) that, for the first time, makes it possible to compute the mutual information between input and output trajectories for any stochastic system that is described by a master equation. The principal idea is to use the master equation to evaluate the exact conditional probability of an individual output trajectory for a given input trajectory and average this via Monte Carlo sampling in trajectory space to obtain the mutual information. We present three variants of PWS, which all generate the trajectories using the standard stochastic simulation algorithm. While direct PWS is a brute-force method, Rosenbluth-Rosenbluth PWS exploits the analogy between signal trajectory sampling and polymer sampling, and thermodynamic integration PWS is based on a reversible work calculation in trajectory space. PWS also makes it possible to compute the mutual information between input and output trajectories for systems with hidden internal states as well as systems with feedback from output to input. Applying PWS to the bacterial chemotaxis system, consisting of 182 coupled chemical reactions, demonstrates not only that the scheme is highly efficient but also that the number of receptor clusters is much smaller than hitherto believed, while their size is much larger.},
  author       = {Reinhardt, Manuel and Tkačik, Gašper and Ten Wolde, Pieter Rein},
  issn         = {2160-3308},
  journal      = {Physical Review X},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Path weight sampling: Exact Monte Carlo computation of the mutual information between stochastic trajectories}},
  doi          = {10.1103/PhysRevX.13.041017},
  volume       = {13},
  year         = {2023},
}

@inproceedings{14516,
  abstract     = {We revisit decentralized random beacons with a focus on practical distributed applications. Decentralized random beacons (Beaver and So, Eurocrypt'93) provide the functionality for n parties to generate an unpredictable sequence of bits in a way that cannot be biased, which is useful for any decentralized protocol requiring trusted randomness. Existing beacon constructions are highly inefficient in practical settings where protocol parties need to rejoin after crashes or disconnections, and more significantly where smart contracts may rely on arbitrary index points in high-volume streams. For this, we introduce a new notion of history-generating decentralized random beacons (HGDRBs). Roughly, the history-generation property of HGDRBs allows for previous beacon outputs to be efficiently generated knowing only the current value and the public key. At application layers, history-generation supports registering a sparser set of on-chain values if desired, so that apps like lotteries can utilize on-chain values without incurring high-frequency costs, enjoying all the benefits of DRBs implemented off-chain or with decoupled, special-purpose chains. Unlike rollups, HG is tailored specifically to recovering and verifying pseudorandom bit sequences and thus enjoys unique optimizations investigated in this work. We introduce STROBE: an efficient HGDRB construction which generalizes the original squaring-based RSA approach of Beaver and So. STROBE enjoys several useful properties that make it suited for practical applications that use beacons: 1) history-generating: it can regenerate and verify high-throughput beacon streams, supporting sparse (thus cost-effective) ledger entries; 2) concisely self-verifying: NIZK-free, with state and validation employing a single ring element; 3) eco-friendly: stake-based rather than work based; 4) unbounded: refresh-free, addressing limitations of Beaver and So; 5) delay-free: results are immediately available. 6) storage-efficient: the last beacon suffices to derive all past outputs, thus O(1) storage requirements for nodes serving the whole history.},
  author       = {Beaver, Donald and Kelkar, Mahimna and Lewi, Kevin and Nikolaenko, Valeria and Sonnino, Alberto and Chalkias, Konstantinos and Kokoris Kogias, Eleftherios and Naurois, Ladi De and Roy, Arnab},
  booktitle    = {5th Conference on Advances in Financial Technologies},
  isbn         = {9783959773034},
  issn         = {1868-8969},
  location     = {Princeton, NJ, United States},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{STROBE: Streaming Threshold Random Beacons}},
  doi          = {10.4230/LIPIcs.AFT.2023.7},
  volume       = {282},
  year         = {2023},
}

@article{14517,
  abstract     = {State-of-the-art transmon qubits rely on large capacitors, which systematically improve their coherence due to reduced surface-loss participation. However, this approach increases both the footprint and the parasitic cross-coupling and is ultimately limited by radiation losses—a potential roadblock for scaling up quantum processors to millions of qubits. In this work we present transmon qubits with sizes as low as 36 × 39 µm2 with  100-nm-wide vacuum-gap capacitors that are micromachined from commercial silicon-on-insulator wafers and shadow evaporated with aluminum. We achieve a vacuum participation ratio up to 99.6% in an in-plane design that is compatible with standard coplanar circuits. Qubit relaxationtime measurements for small gaps with high zero-point electric field variance of up to 22 V/m reveal a double exponential decay indicating comparably strong qubit interaction with long-lived two-level systems. The exceptionally high selectivity of up to 20 dB to the superconductor-vacuum interface allows us to precisely back out the sub-single-photon dielectric loss tangent of aluminum oxide previously exposed to ambient conditions. In terms of future scaling potential, we achieve a ratio of qubit quality factor to a footprint area equal to 20 µm−2, which is comparable with the highest T1 devices relying on larger geometries, a value that could improve substantially for lower surface-loss superconductors. },
  author       = {Zemlicka, Martin and Redchenko, Elena and Peruzzo, Matilda and Hassani, Farid and Trioni, Andrea and Barzanjeh, Shabir and Fink, Johannes M},
  issn         = {2331-7019},
  journal      = {Physical Review Applied},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Compact vacuum-gap transmon qubits: Selective and sensitive probes for superconductor surface losses}},
  doi          = {10.1103/PhysRevApplied.20.044054},
  volume       = {20},
  year         = {2023},
}

@inproceedings{14518,
  abstract     = {We consider bidding games, a class of two-player zero-sum graph games. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit bids, and the higher bidder moves the token, where we break bidding ties in favor of Player 1. Player 1 wins the game iff the token visits a designated target vertex. We consider, for the first time, poorman discrete-bidding in which the granularity of the bids is restricted and the higher bid is paid to the bank. Previous work either did not impose granularity restrictions or considered Richman bidding (bids are paid to the opponent). While the latter mechanisms are technically more accessible, the former is more appealing from a practical standpoint. Our study focuses on threshold budgets, which is the necessary and sufficient initial budget required for Player 1 to ensure winning against a given Player 2 budget. We first show existence of thresholds. In DAGs, we show that threshold budgets can be approximated with error bounds by thresholds under continuous-bidding and that they exhibit a periodic behavior. We identify closed-form solutions in special cases. We implement and experiment with an algorithm to find threshold budgets.},
  author       = {Avni, Guy and Meggendorfer, Tobias and Sadhukhan, Suman and Tkadlec, Josef and Zikelic, Dorde},
  booktitle    = {Frontiers in Artificial Intelligence and Applications},
  isbn         = {9781643684369},
  issn         = {0922-6389},
  location     = {Krakow, Poland},
  pages        = {141--148},
  publisher    = {IOS Press},
  title        = {{Reachability poorman discrete-bidding games}},
  doi          = {10.3233/FAIA230264},
  volume       = {372},
  year         = {2023},
}

@misc{14523,
  abstract     = {see Readme file},
  author       = {Binysh, Jack and Chakraborty, Indrajit and Chubynsky, Mykyta and Diaz Melian, Vicente L and Waitukaitis, Scott R and Sprittles, James and Souslov, Anton},
  publisher    = {Zenodo},
  title        = {{SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: v1.0.1}},
  doi          = {10.5281/ZENODO.8329143},
  year         = {2023},
}

@phdthesis{14530,
  abstract     = {Most motions of many-body systems at any scale in nature with sufficient degrees of freedom tend to be chaotic; reaching from the orbital motion of planets, the air currents in our atmosphere, down to the water flowing through our pipelines or the movement of a population of bacteria. To the observer it is therefore intriguing when a moving collective exhibits order. Collective motion of flocks of birds, schools of fish or swarms of self-propelled particles or robots have been studied extensively over the past decades but the mechanisms involved in the transition from chaos to order remain unclear. Here, the interactions, that in most systems give rise to chaos, sustain order.  In this thesis we investigate mechanisms that preserve, destabilize or lead to the ordered state. We show that endothelial cells migrating in circular confinements transition to a collective rotating state and concomitantly synchronize the frequencies of nucleating actin waves within individual cells. Consequently, the frequency dependent cell migration speed uniformizes across the population. Complementary to the WAVE dependent nucleation of traveling actin waves, we show that in leukocytes the actin polymerization depending on WASp generates pushing forces locally at stationary patches. Next, in pipe flows, we study methods to disrupt the self--sustaining cycle of turbulence and therefore relaminarize the flow. While we find in pulsating flow conditions that turbulence emerges through a helical instability during the decelerating phase. Finally, we show quantitatively in brain slices of mice that wild-type control neurons can compensate the migratory deficits of a genetically modified neuronal sub--population in the developing cortex.  },
  author       = {Riedl, Michael},
  issn         = {2663 - 337X},
  keywords     = {Synchronization, Collective Movement, Active Matter, Cell Migration, Active Colloids},
  pages        = {260},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Synchronization in collectively moving active matter}},
  doi          = {10.15479/14530},
  year         = {2023},
}