@article{14452,
  abstract     = {The classical infinitesimal model is a simple and robust model for the inheritance of quantitative traits. In this model, a quantitative trait is expressed as the sum of a genetic and an environmental component, and the genetic component of offspring traits within a family follows a normal distribution around the average of the parents’ trait values, and has a variance that is independent of the parental traits. In previous work, we showed that when trait values are determined by the sum of a large number of additive Mendelian factors, each of small effect, one can justify the infinitesimal model as a limit of Mendelian inheritance. In this paper, we show that this result extends to include dominance. We define the model in terms of classical quantities of quantitative genetics, before justifying it as a limit of Mendelian inheritance as the number, M, of underlying loci tends to infinity. As in the additive case, the multivariate normal distribution of trait values across the pedigree can be expressed in terms of variance components in an ancestral population and probabilities of identity by descent determined by the pedigree. Now, with just first-order dominance effects, we require two-, three-, and four-way identities. We also show that, even if we condition on parental trait values, the “shared” and “residual” components of trait values within each family will be asymptotically normally distributed as the number of loci tends to infinity, with an error of order 1/M−−√⁠. We illustrate our results with some numerical examples.},
  author       = {Barton, Nicholas H and Etheridge, Alison M. and Véber, Amandine},
  issn         = {1943-2631},
  journal      = {Genetics},
  number       = {2},
  publisher    = {Oxford University Press},
  title        = {{The infinitesimal model with dominance}},
  doi          = {10.1093/genetics/iyad133},
  volume       = {225},
  year         = {2023},
}

@article{14453,
  abstract     = {Squall lines are substantially influenced by the interaction of low-level shear with cold pools associated with convective downdrafts. Beyond an optimal shear amplitude, squall lines tend to orient themselves at an angle with respect to the low-level shear. While the mechanisms behind squall line orientation seem to be increasingly well understood, uncertainties remain on the implications of this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4) show that long lived mesoscale convective systems, including squall lines, are disproportionately involved in rainfall extremes in the tropics. This article investigates the influence of the interaction between low-level shear and squall line outflow on squall line generated precipitation extrema in the tropics. Using a cloud resolving model, simulated squall lines in radiative convective equilibrium amid a shear-dominated regime (super optimal), a balanced regime (optimal), and an outflow dominated regime (suboptimal). Our results show that precipitation extremes in squall lines are 40% more intense in the case of optimal shear and remain 30% superior in the superoptimal regime relative to a disorganized case. With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020, https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates control the amplification of precipitation extremes in tropical squall lines, mainly due to its change in vertical mass flux (dynamic component). The reduction of dilution by entrainment explains half of this change, consistent with Mulholland et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained by increased cloud-base velocity intensity in optimal and superoptimal squall lines.},
  author       = {Abramian, Sophie and Muller, Caroline J and Risi, Camille},
  issn         = {1942-2466},
  journal      = {Journal of Advances in Modeling Earth Systems},
  number       = {10},
  publisher    = {Wiley},
  title        = {{Extreme precipitation in tropical squall lines}},
  doi          = {10.1029/2022MS003477},
  volume       = {15},
  year         = {2023},
}

@article{14455,
  author       = {Narzisi, Antonio and Halladay, Alycia and Masi, Gabriele and Novarino, Gaia and Lord, Catherine},
  issn         = {1664-0640},
  journal      = {Frontiers in Psychiatry},
  publisher    = {Frontiers},
  title        = {{Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment}},
  doi          = {10.3389/fpsyt.2023.1287879},
  volume       = {14},
  year         = {2023},
}

@inproceedings{14456,
  abstract     = {In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the TOKEN SLIDING model. In this problem, a graph is provided along with its two dominating sets, which can be imagined as tokens placed on vertices. The objective is to find a shortest sequence of dominating sets that transforms one set into the other, with each set in the sequence resulting from sliding a single token in the previous set. While identifying any sequence has been well studied, our work presents the first polynomial algorithms for this optimization variant in the context of dominating sets.},
  author       = {Křišťan, Jan Matyáš and Svoboda, Jakub},
  booktitle    = {24th International Symposium on Fundamentals of Computation Theory},
  isbn         = {9783031435867},
  issn         = {1611-3349},
  location     = {Trier, Germany},
  pages        = {333--347},
  publisher    = {Springer Nature},
  title        = {{Shortest dominating set reconfiguration under token sliding}},
  doi          = {10.1007/978-3-031-43587-4_24},
  volume       = {14292},
  year         = {2023},
}

@inproceedings{14457,
  abstract     = {Threshold secret sharing allows a dealer to split a secret s into n shares, such that any t shares allow for reconstructing s, but no t-1 shares reveal any information about s. Leakage-resilient secret sharing requires that the secret remains hidden, even when an adversary additionally obtains a limited amount of leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n and conjectured that the same holds for t = c.n for any constant 0≤c≤1.  Nielsen and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).
In this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy leakage-resilience, where a random subset of leakages is replaced by uniformly random noise. We prove a lower bound for Shamir’s secret sharing, similar to that of Nielsen and Simkin, which holds even when a constant fraction of leakages is replaced by random noise. To this end, we first prove a lower bound on the share size of any noisy-leakage-resilient sharing scheme. We then use this lower bound to show that there exist universal constants c1, c2,  such that for sufficiently large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random noise.



},
  author       = {Hoffmann, Charlotte and Simkin, Mark},
  booktitle    = {8th International Conference on Cryptology and Information Security in Latin America},
  isbn         = {9783031444685},
  issn         = {1611-3349},
  location     = {Quito, Ecuador},
  pages        = {215--228},
  publisher    = {Springer Nature},
  title        = {{Stronger lower bounds for leakage-resilient secret sharing}},
  doi          = {10.1007/978-3-031-44469-2_11},
  volume       = {14168},
  year         = {2023},
}

@inproceedings{14460,
  abstract     = {We provide an efficient implementation of the backpropagation algorithm, specialized to the case where the weights of the neural network being trained are sparse. Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and common layer types (e.g., convolutional or linear). We provide a fast vectorized implementation on commodity CPUs, and show that it can yield speedups in end-to-end runtime experiments, both in transfer learning using already-sparsified networks, and in training sparse networks from scratch. Thus, our results provide the first support for sparse training on commodity hardware.},
  author       = {Nikdan, Mahdi and Pegolotti, Tommaso and Iofinova, Eugenia B and Kurtic, Eldar and Alistarh, Dan-Adrian},
  booktitle    = {Proceedings of the 40th International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Honolulu, Hawaii, HI, United States},
  pages        = {26215--26227},
  publisher    = {ML Research Press},
  title        = {{SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge}},
  volume       = {202},
  year         = {2023},
}

@inproceedings{14462,
  abstract     = {We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation model. More specifically, we give an explicit factorization for the counting matrix Mcount and upper bound the error explicitly. We also give a fine-grained analysis, specifying the exact constant in the upper bound. Our analysis is based on upper and lower bounds of the completely bounded norm (cb-norm) of Mcount
. Along the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large range of the dimension of Mcount. Furthermore, we are the first to give concrete error bounds for various problems under continual observation such as binary counting, maintaining a histogram, releasing an approximately cut-preserving synthetic graph, many graph-based statistics, and substring and episode counting. Finally, we note that our result can be used to get a fine-grained error bound for non-interactive local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private counting under continual observation. Subsequent to this work, Henzinger et al. (SODA, 2023) showed that our factorization also achieves fine-grained mean-squared error.},
  author       = {Fichtenberger, Hendrik and Henzinger, Monika H and Upadhyay, Jalaj},
  booktitle    = {Proceedings of the 40th International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Honolulu, Hawaii, HI, United States},
  pages        = {10072--10092},
  publisher    = {ML Research Press},
  title        = {{Constant matters: Fine-grained error bound on differentially private continual observation}},
  volume       = {202},
  year         = {2023},
}

@article{14464,
  abstract     = {Given a triangle Δ, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of Δ with respect to area and perimeter. This problem was initially posed by Nandakumar [17, 22] and was first studied by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present paper, we prove that for any triangle Δ, every maximum area isosceles triangle embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter enclosing triangles is different: there are infinite families of triangles Δ whose minimum perimeter isosceles containers do not share a side and an angle with Δ.},
  author       = {Ambrus, Áron and Csikós, Mónika and Kiss, Gergely and Pach, János and Somlai, Gábor},
  issn         = {1793-6373},
  journal      = {International Journal of Foundations of Computer Science},
  number       = {7},
  pages        = {737--760},
  publisher    = {World Scientific Publishing},
  title        = {{Optimal embedded and enclosing isosceles triangles}},
  doi          = {10.1142/S012905412342008X},
  volume       = {34},
  year         = {2023},
}

@misc{14472,
  abstract     = {Data related to the following paper:
"Stress granules plug and stabilize damaged endolysosomal membranes" (https://doi.org/10.1038/s41586-023-06726-w)

Abstract: 
Endomembrane damage represents a form of stress that is detrimental for eukaryotic cells. To cope with this threat, cells possess mechanisms that repair the damage and restore cellular homeostasis. Endomembrane damage also results in organelle instability and the mechanisms by which cells stabilize damaged endomembranes to enable membrane repair remains unknown. In this work we use a minimal coarse-grained molecular dynamics system to explore how lipid vesicles undergoing poration in a protein-rich medium can be plugged and stabilised by condensate formation. The solution of proteins in and out of the vesicle is described by beads dispersed in implicit solvent. The membrane is described as a one-bead-thick fluid elastic layer of mechanical properties that mimic biological membranes. We tune the interactions between solution beads in the different compartments to capture the differences between the cytoplasmic and endosomal protein solutions and explore how the system responds to different degrees of membrane poration. We find that, in the right interaction regime, condensates form rapidly at the damage site upon solution mixing and act as a plug that prevents futher mixing and destabilisation of the vesicle. Further, when the condensate can interact with the membrane (wetting interactions) we find that it mediates pore sealing and membrane repair. This research is part of the work published in "Stress granules plug and stabilize damaged endolysosomal membranes", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w.},
  author       = {Vanhille-Campos, Christian Eduardo and Šarić, Anđela},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Stress granules plug and stabilize damaged endolysosomal membranes}},
  doi          = {10.15479/AT:ISTA:14472},
  year         = {2023},
}

@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{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},
}

@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},
}

@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{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},
}

