@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{14458,
abstract = {We show for the first time that large-scale generative pretrained transformer (GPT) family models can be pruned to at least 50% sparsity in one-shot, without any retraining, at minimal loss of accuracy. This is achieved via a new pruning method called SparseGPT, specifically designed to work efficiently and accurately on massive GPT-family models. We can execute SparseGPT on the largest available open-source models, OPT-175B and BLOOM-176B, in under 4.5 hours, and can reach 60% unstructured sparsity with negligible increase in perplexity: remarkably, more than 100 billion weights from these models can be ignored at inference time. SparseGPT generalizes to semi-structured (2:4 and 4:8) patterns, and is compatible with weight quantization approaches. The code is available at: https://github.com/IST-DASLab/sparsegpt.},
author = {Frantar, Elias and Alistarh, Dan-Adrian},
booktitle = {Proceedings of the 40th International Conference on Machine Learning},
issn = {2640-3498},
location = {Honolulu, Hawaii, HI, United States},
pages = {10323--10337},
publisher = {ML Research Press},
title = {{SparseGPT: Massive language models can be accurately pruned in one-shot}},
volume = {202},
year = {2023},
}
@inproceedings{14459,
abstract = {Autoencoders are a popular model in many branches of machine learning and lossy data compression. However, their fundamental limits, the performance of gradient methods and the features learnt during optimization remain poorly understood, even in the two-layer setting. In fact, earlier work has considered either linear autoencoders or specific training regimes (leading to vanishing or diverging compression rates). Our paper addresses this gap by focusing on non-linear two-layer autoencoders trained in the challenging proportional regime in which the input dimension scales linearly with the size of the representation. Our results characterize the minimizers of the population risk, and show that such minimizers are achieved by gradient methods; their structure is also unveiled, thus leading to a concise description of the features obtained via training. For the special case of a sign activation function, our analysis establishes the fundamental limits for the lossy compression of Gaussian sources via (shallow) autoencoders. Finally, while the results are proved for Gaussian data, numerical simulations on standard datasets display the universality of the theoretical predictions.},
author = {Shevchenko, Aleksandr and Kögler, Kevin and Hassani, Hamed and Mondelli, Marco},
booktitle = {Proceedings of the 40th International Conference on Machine Learning},
issn = {2640-3498},
location = {Honolulu, Hawaii, HI, United States},
pages = {31151--31209},
publisher = {ML Research Press},
title = {{Fundamental limits of two-layer autoencoders, and achieving them with gradient methods}},
volume = {202},
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{14461,
abstract = {Communication-reduction techniques are a popular way to improve scalability in data-parallel training of deep neural networks (DNNs). The recent emergence of large language models such as GPT has created the need for new approaches to exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training is highly popular, yet it still encounters scalability bottlenecks. One reason is that applying compression techniques to FSDP is challenging: as the vast majority of the communication involves the model’s weights, direct compression alters convergence and leads to accuracy loss. We present QSDP, a variant of FSDP which supports both gradient and weight quantization with theoretical guarantees, is simple to implement and has essentially no overheads. To derive QSDP we prove that a natural modification of SGD achieves convergence even when we only maintain quantized weights, and thus the domain over which we train consists of quantized points and is, therefore, highly non-convex. We validate this approach by training GPT-family models with up to 1.3 billion parameters on a multi-node cluster. Experiments show that QSDP preserves model accuracy, while completely removing the communication bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x.},
author = {Markov, Ilia and Vladu, Adrian and Guo, Qi and Alistarh, Dan-Adrian},
booktitle = {Proceedings of the 40th International Conference on Machine Learning},
issn = {2640-3498},
location = {Honolulu, Hawaii, HI, United States},
pages = {24020--24044},
publisher = {ML Research Press},
title = {{Quantized distributed training of large models with convergence guarantees}},
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{14463,
abstract = {Inversions are thought to play a key role in adaptation and speciation, suppressing recombination between diverging populations. Genes influencing adaptive traits cluster in inversions, and changes in inversion frequencies are associated with environmental differences. However, in many organisms, it is unclear if inversions are geographically and taxonomically widespread. The intertidal snail, Littorina saxatilis, is one such example. Strong associations between putative polymorphic inversions and phenotypic differences have been demonstrated between two ecotypes of L. saxatilis in Sweden and inferred elsewhere, but no direct evidence for inversion polymorphism currently exists across the species range. Using whole genome data from 107 snails, most inversion polymorphisms were found to be widespread across the species range. The frequencies of some inversion arrangements were significantly different among ecotypes, suggesting a parallel adaptive role. Many inversions were also polymorphic in the sister species, L. arcana, hinting at an ancient origin.},
author = {Reeve, James and Butlin, Roger K. and Koch, Eva L. and Stankowski, Sean and Faria, Rui},
issn = {1365-294X},
journal = {Molecular Ecology},
publisher = {Wiley},
title = {{Chromosomal inversion polymorphisms are widespread across the species ranges of rough periwinkles (Littorina saxatilis and L. arcana)}},
doi = {10.1111/mec.17160},
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},
}
@article{14466,
abstract = {The first long-lived turbulent structures observable in planar shear flows take the form of localized stripes, inclined with respect to the mean flow direction. The dynamics of these stripes is central to transition, and recent studies proposed an analogy to directed percolation where the stripes’ proliferation is ultimately responsible for the turbulence becoming sustained. In the present study we focus on the internal stripe dynamics as well as on the eventual stripe expansion, and we compare the underlying mechanisms in pressure- and shear-driven planar flows, respectively, plane-Poiseuille and plane-Couette flow. Despite the similarities of the overall laminar–turbulence patterns, the stripe proliferation processes in the two cases are fundamentally different. Starting from the growth and sustenance of individual stripes, we find that in plane-Couette flow new streaks are created stochastically throughout the stripe whereas in plane-Poiseuille flow streak creation is deterministic and occurs locally at the downstream tip. Because of the up/downstream symmetry, Couette stripes, in contrast to Poiseuille stripes, have two weak and two strong laminar turbulent interfaces. These differences in symmetry as well as in internal growth give rise to two fundamentally different stripe splitting mechanisms. In plane-Poiseuille flow splitting is connected to the elongational growth of the original stripe, and it results from a break-off/shedding of the stripe's tail. In plane-Couette flow splitting follows from a broadening of the original stripe and a division along the stripe into two slimmer stripes.},
author = {Marensi, Elena and Yalniz, Gökhan and Hof, Björn},
issn = {1469-7645},
journal = {Journal of Fluid Mechanics},
keywords = {turbulence, transition to turbulence, patterns},
publisher = {Cambridge University Press},
title = {{Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows}},
doi = {10.1017/jfm.2023.780},
volume = {974},
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},
}
@unpublished{14478,
abstract = {Entire chromosomes are typically only transmitted vertically from one generation to the next. The horizontal transfer of such chromosomes has long been considered improbable, yet gained recent support in several pathogenic fungi where it may affect the fitness or host specificity. To date, it is unknown how these transfers occur, how common they are and whether they can occur between different species. In this study, we show multiple independent instances of horizontal transfers of the same accessory chromosome between two distinct strains of the asexual entomopathogenic fungusMetarhizium robertsiiduring experimental co-infection of its insect host, the Argentine ant. Notably, only the one chromosome – but no other – was transferred from the donor to the recipient strain. The recipient strain, now harboring the accessory chromosome, exhibited a competitive advantage under certain host conditions. By phylogenetic analysis we further demonstrate that the same accessory chromosome was horizontally transferred in a natural environment betweenM. robertsiiand another congeneric insect pathogen,M. guizhouense. Hence horizontal chromosome transfer is not limited to the observed frequent events within species during experimental infections but also occurs naturally across species. The transferred accessory chromosome contains genes that might be involved in its preferential horizontal transfer, encoding putative histones and histone-modifying enzymes, but also putative virulence factors that may support its establishment. Our study reveals that both intra- and interspecies horizontal transfer of entire chromosomes is more frequent than previously assumed, likely representing a not uncommon mechanism for gene exchange.Significance StatementThe enormous success of bacterial pathogens has been attributed to their ability to exchange genetic material between one another. Similarly, in eukaryotes, horizontal transfer of genetic material allowed the spread of virulence factors across species. The horizontal transfer of whole chromosomes could be an important pathway for such exchange of genetic material, but little is known about the origin of transferable chromosomes and how frequently they are exchanged. Here, we show that the transfer of accessory chromosomes - chromosomes that are non-essential but may provide fitness benefits - is common during fungal co-infections and is even possible between distant pathogenic species, highlighting the importance of horizontal gene transfer via chromosome transfer also for the evolution and function of eukaryotic pathogens.},
author = {Habig, Michael and Grasse, Anna V and Müller, Judith and Stukenbrock, Eva H. and Leitner, Hanna and Cremer, Sylvia},
booktitle = {bioRxiv},
title = {{Frequent horizontal chromosome transfer between asexual fungal insect pathogens}},
doi = {10.1101/2023.09.18.558174},
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{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},
}