@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}, } @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}, } @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}, } @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}, } @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}, } @article{14551, abstract = {Methylation of CG dinucleotides (mCGs), which regulates eukaryotic genome functions, is epigenetically propagated by Dnmt1/MET1 methyltransferases. How mCG is established and transmitted across generations despite imperfect enzyme fidelity is unclear. Whether mCG variation in natural populations is governed by genetic or epigenetic inheritance also remains mysterious. Here, we show that MET1 de novo activity, which is enhanced by existing proximate methylation, seeds and stabilizes mCG in Arabidopsis thaliana genes. MET1 activity is restricted by active demethylation and suppressed by histone variant H2A.Z, producing localized mCG patterns. Based on these observations, we develop a stochastic mathematical model that precisely recapitulates mCG inheritance dynamics and predicts intragenic mCG patterns and their population-scale variation given only CG site spacing. Our results demonstrate that intragenic mCG establishment, inheritance, and variance constitute a unified epigenetic process, revealing that intragenic mCG undergoes large, millennia-long epigenetic fluctuations and can therefore mediate evolution on this timescale.}, author = {Briffa, Amy and Hollwey, Elizabeth and Shahzad, Zaigham and Moore, Jonathan D. and Lyons, David B. and Howard, Martin and Zilberman, Daniel}, issn = {2405-4720}, journal = {Cell Systems}, number = {11}, pages = {953--967}, publisher = {Elsevier}, title = {{Millennia-long epigenetic fluctuations generate intragenic DNA methylation variance in Arabidopsis populations}}, doi = {10.1016/j.cels.2023.10.007}, volume = {14}, year = {2023}, }