@inproceedings{14989, abstract = {Encryption alone is not enough for secure end-to end encrypted messaging: a server must also honestly serve public keys to users. Key transparency has been presented as an efficient solution for detecting (and hence deterring) a server that attempts to dishonestly serve keys. Key transparency involves two major components: (1) a username to public key mapping, stored and cryptographically committed to by the server, and, (2) an outof-band consistency protocol for serving short commitments to users. In the setting of real-world deployments and supporting production scale, new challenges must be considered for both of these components. We enumerate these challenges and provide solutions to address them. In particular, we design and implement a memory-optimized and privacy-preserving verifiable data structure for committing to the username to public key store. To make this implementation viable for production, we also integrate support for persistent and distributed storage. We also propose a future-facing solution, termed “compaction”, as a mechanism for mitigating practical issues that arise from dealing with infinitely growing server data structures. Finally, we implement a consensusless solution that achieves the minimum requirements for a service that consistently distributes commitments for a transparency application, providing a much more efficient protocol for distributing small and consistent commitments to users. This culminates in our production-grade implementation of a key transparency system (Parakeet) which we have open-sourced, along with a demonstration of feasibility through our benchmarks.}, author = {Malvai, Harjasleen and Kokoris Kogias, Eleftherios and Sonnino, Alberto and Ghosh, Esha and Oztürk, Ercan and Lewi, Kevin and Lawlor, Sean}, booktitle = {Proceedings of the 2023 Network and Distributed System Security Symposium}, isbn = {1891562835}, location = {San Diego, CA, United States}, publisher = {Internet Society}, title = {{Parakeet: Practical key transparency for end-to-end eEncrypted messaging}}, doi = {10.14722/ndss.2023.24545}, year = {2023}, } @misc{14990, abstract = {The software artefact to evaluate the approximation of stationary distributions implementation.}, author = {Meggendorfer, Tobias}, publisher = {Zenodo}, title = {{Artefact for: Correct Approximation of Stationary Distributions}}, doi = {10.5281/ZENODO.7548214}, year = {2023}, } @misc{14991, abstract = {This repository contains the data, scripts, WRF codes and files required to reproduce the results of the manuscript "Assessing Memory in Convection Schemes Using Idealized Tests" submitted to the Journal of Advances in Modeling Earth Systems (JAMES).}, author = {Hwong, Yi-Ling and Colin, Maxime and Aglas, Philipp and Muller, Caroline J and Sherwood, Steven C.}, publisher = {Zenodo}, title = {{Data-assessing memory in convection schemes using idealized tests}}, doi = {10.5281/ZENODO.7757041}, year = {2023}, } @inbook{14992, abstract = {In this chapter we first review the Levy–Lieb functional, which gives the lowest kinetic and interaction energy that can be reached with all possible quantum states having a given density. We discuss two possible convex generalizations of this functional, corresponding to using mixed canonical and grand-canonical states, respectively. We present some recent works about the local density approximation, in which the functionals get replaced by purely local functionals constructed using the uniform electron gas energy per unit volume. We then review the known upper and lower bounds on the Levy–Lieb functionals. We start with the kinetic energy alone, then turn to the classical interaction alone, before we are able to put everything together. A later section is devoted to the Hohenberg–Kohn theorem and the role of many-body unique continuation in its proof.}, author = {Lewin, Mathieu and Lieb, Elliott H. and Seiringer, Robert}, booktitle = {Density Functional Theory}, editor = {Cances, Eric and Friesecke, Gero}, isbn = {9783031223396}, issn = {3005-0286}, pages = {115--182}, publisher = {Springer}, title = {{Universal Functionals in Density Functional Theory}}, doi = {10.1007/978-3-031-22340-2_3}, year = {2023}, } @inproceedings{14993, abstract = {Traditional top-down approaches for global health have historically failed to achieve social progress (Hoffman et al., 2015; Hoffman & Røttingen, 2015). Recently, however, a more holistic, multi-level approach termed One Health (OH) (Osterhaus et al., 2020) is being adopted. Several sets of challenges have been identified for the implementation of OH (dos S. Ribeiro et al., 2019), including policy and funding, education and training, and multi-actor, multi-domain, and multi-level collaborations. These exist despite the increasing accessibility to knowledge and digital collaborative research tools through the internet. To address some of these challenges, we propose a general framework for grassroots community-based means of participatory research. Additionally, we present a specific roadmap to create a Machine Learning for Global Health community in Africa. The proposed framework aims to enable any small group of individuals with scarce resources to build and sustain an online community within approximately two years. We provide a discussion on the potential impact of the proposed framework for global health research collaborations.}, author = {Currin, Christopher and Asiedu , Mercy Nyamewaa and Fourie, Chris and Rosman, Benjamin and Turki, Houcemeddine and Lambebo Tonja, Atnafu and Abbott, Jade and Ajala, Marvellous and Adedayo, Sadiq Adewale and Emezue, Chris Chinenye and Machangara, Daphne}, booktitle = {1st Workshop on Machine Learning & Global Health}, location = {Kigali, Rwanda}, publisher = {OpenReview}, title = {{A framework for grassroots research collaboration in machine learning and global health}}, year = {2023}, } @misc{14994, abstract = {This resource contains the artifacts for reproducing the experimental results presented in the paper titled "A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties" that has been submitted in CAV 2023.}, author = {Majumdar, Rupak and Mallik, Kaushik and Rychlicki, Mateusz and Schmuck, Anne-Kathrin and Soudjani, Sadegh}, publisher = {Zenodo}, title = {{A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties}}, doi = {10.5281/ZENODO.7877790}, year = {2023}, } @misc{15027, abstract = {This data repository underpins the paper, published in PNAS (doi pending) and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777).}, author = {Curk, Samo}, publisher = {Figshare}, title = {{aggregation_data}}, year = {2023}, } @misc{15035, abstract = {This artifact aims to reproduce experiments from the paper Monitoring Hyperproperties With Prefix Transducers accepted at RV'23, and give further pointers to implementation of prefix transducers. It has two parts: a pre-compiled docker image and sources that one can use to compile (locally or in docker) the software and run the experiments.}, author = {Chalupa, Marek and Henzinger, Thomas A}, publisher = {Zenodo}, title = {{Monitoring hyperproperties with prefix transducers}}, doi = {10.5281/ZENODO.8191723}, year = {2023}, } @article{15173, abstract = {We show that the number of linear spaces on a set of n points and the number of rank-3 matroids on a ground set of size n are both of the form (cn+o(n))n2/6, where c=e3√/2−3(1+3–√)/2. This is the final piece of the puzzle for enumerating fixed-rank matroids at this level of accuracy: the numbers of rank-1 and rank-2 matroids on a ground set of size n have exact representations in terms of well-known combinatorial functions, and it was recently proved by van der Hofstad, Pendavingh, and van der Pol that for constant r≥4 there are (e1−rn+o(n))nr−1/r! rank-r matroids on a ground set of size n. In our proof, we introduce a new approach for bounding the number of clique decompositions of a complete graph, using quasirandomness instead of the so-called entropy method that is common in this area.}, author = {Kwan, Matthew Alan and Sah, Ashwin and Sawhney, Mehtaab}, issn = {1778-3569}, journal = {Comptes Rendus Mathematique}, number = {G2}, pages = {565--575}, publisher = {Academie des Sciences}, title = {{Enumerating matroids and linear spaces}}, doi = {10.5802/crmath.423}, volume = {361}, year = {2023}, } @misc{15292, abstract = {We present a rigid body animation technique which prevents solids from interpenetrating, dissipates energy through friction, and propagates shocks through contacts. We employ the Alternating Direction Method of Multipliers (ADMM) to couple non-smooth Coulomb friction with impact propagation, allowing efficient and accurate non-smooth dynamics along with a correct transmission of impacts through assemblies of rigid bodies. We further extend our method to model adhesion, dynamic friction and lubricated contact.}, author = {Chen, Yi-Lu and Ly, Mickaël and Wojtan, Christopher J}, booktitle = {Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation}, location = {Los Angeles, CA, United States}, publisher = {ACM}, title = {{Unified treatment of contact, friction and shock-propagation in rigid body animation}}, doi = {10.1145/3606037.3606836}, year = {2023}, } @article{17074, abstract = {We verify Bogoliubov's approximation for translation invariant Bose gases in the mean field regime, i.e. we prove that the ground state energy EN is given by EN=NeH+infσ(H)+oN→∞(1), where N is the number of particles, eH is the minimal Hartree energy and H is the Bogoliubov Hamiltonian. As an intermediate result we show the existence of approximate ground states ΨN, i.e. states satisfying ⟨HN⟩ΨN=EN+oN→∞(1), exhibiting complete Bose--Einstein condensation with respect to one of the Hartree minimizers.}, author = {Brooks, Morris and Seiringer, Robert}, issn = {2690-1005}, journal = {Probability and Mathematical Physics}, number = {4}, pages = {939--1000}, publisher = {Mathematical Sciences Publishers}, title = {{Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases}}, doi = {10.2140/pmp.2022.3.939}, volume = {3}, year = {2023}, } @article{17079, abstract = {We study moments of characteristic polynomials of truncated Haar distributed matrices from the three classical compact groups O(N), U(N) and Sp(2N). For finite matrix size we calculate the moments in terms of hypergeometric functions of matrix argument and give explicit integral representations highlighting the duality between the moment and the matrix size as well as the duality between the orthogonal and symplectic cases. Asymptotic expansions in strong and weak non-unitarity regimes are obtained. Using the connection to matrix hypergeometric functions, we establish limit theorems for the log-modulus of the characteristic polynomial evaluated on the unit circle.}, author = {Serebryakov, Alexander and Simm, Nick and Dubach, Guillaume}, issn = {2010-3271}, journal = {Random Matrices: Theory and Applications}, number = {01}, publisher = {World Scientific Publishing}, title = {{Characteristic polynomials of random truncations: Moments, duality and asymptotics}}, doi = {10.1142/s2010326322500496}, volume = {12}, year = {2023}, } @unpublished{17100, abstract = {Prophet inequalities are a central object of study in optimal stopping theory. A gambler is sent values online, sampled from an instance of independent distributions, in an adversarial, random or selected order, depending on the model. When observing each value, the gambler either accepts it as a reward or irrevocably rejects it and proceeds to observe the next value. The goal of the gambler, who cannot see the future, is maximising the expected value of the reward while competing against the expectation of a prophet (the offline maximum). In other words, one seeks to maximise the gambler-to-prophet ratio of the expectations. The model, in which the gambler selects the arrival order first, and then observes the values, is known as Order Selection. In this model a ratio of 0.7251 has been proved to be attainable for any instance. In very recent work, this has been improved up to 0.7258. If the gambler chooses the arrival order (uniformly) at random, we obtain the Random Order model. The worst case ratio over all possible instances has been extensively studied for at least 40 years. In the recent work aforementioned, through simulations, this ratio has been shown to be at most 0.7254 for the Random Order model, thus establishing for the first time that carefully choosing the order, instead of simply taking it at random, benefits the gambler. We give an alternative, more rigorous proof of this fact, by showing mathematically that in the Random Order model, no algorithm can achieve a ratio larger than 0.7235. This sets a new state-of-the-art hardness for this model, and establishes more formally that there is a real benefit in choosing the order.}, author = {Giambartolomei, Giordano and Frederik Mallmann-Trenn, Frederik Mallmann-Trenn and Saona Urmeneta, Raimundo J}, booktitle = {arXiv}, title = {{Prophet inequalities: Separating random order from order selection}}, doi = {10.48550/arXiv.2304.04024}, year = {2023}, } @unpublished{17173, abstract = {Consider the random variable $\mathrm{Tr}( f_1(W)A_1\dots f_k(W)A_k)$ where $W$ is an $N\times N$ Hermitian Wigner matrix, $k\in\mathbb{N}$, and choose (possibly $N$-dependent) regular functions $f_1,\dots, f_k$ as well as bounded deterministic matrices $A_1,\dots,A_k$. We give a functional central limit theorem showing that the fluctuations around the expectation are Gaussian. Moreover, we determine the limiting covariance structure and give explicit error bounds in terms of the scaling of $f_1,\dots,f_k$ and the number of traceless matrices among $A_1,\dots,A_k$, thus extending the results of [Cipolloni, Erdős, Schröder 2023] to products of arbitrary length $k\geq2$. As an application, we consider the fluctuation of $\mathrm{Tr}(\mathrm{e}^{\mathrm{i} tW}A_1\mathrm{e}^{-\mathrm{i} tW}A_2)$ around its thermal value $\mathrm{Tr}(A_1)\mathrm{Tr}(A_2)$ when $t$ is large and give an explicit formula for the variance.}, author = {Reker, Jana}, booktitle = {arXiv}, title = {{Multi-point functional central limit theorem for Wigner Matrices}}, doi = {10.48550/arXiv.2307.11028}, year = {2023}, } @unpublished{17174, abstract = {We prove that a class of weakly perturbed Hamiltonians of the form $H_λ= H_0 + λW$, with $W$ being a Wigner matrix, exhibits prethermalization. That is, the time evolution generated by $H_λ$ relaxes to its ultimate thermal state via an intermediate prethermal state with a lifetime of order $λ^{-2}$. Moreover, we obtain a general relaxation formula, expressing the perturbed dynamics via the unperturbed dynamics and the ultimate thermal state. The proof relies on a two-resolvent law for the deformed Wigner matrix $H_λ$.}, author = {Erdös, László and Henheik, Sven Joscha and Reker, Jana and Riabov, Volodymyr}, booktitle = {arXiv}, title = {{Prethermalization for deformed Wigner Matrices}}, doi = {10.48550/arXiv.2310.06677}, year = {2023}, } @misc{18634, abstract = {There are 4 tar.xz files with the result of the model for the paper: A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. }, author = {Muñoz Hermosilla, José M}, publisher = {Zenodo}, title = {{A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen}}, doi = {10.5281/ZENODO.8005257}, year = {2023}, } @article{18942, abstract = {Photosynthesis is among the first processes negatively affected by environmental cues and its performance directly determines plant cell fitness and ultimately crop yield. Primarily sites of photosynthesis, chloroplasts are unique sites also for the biosynthesis of precursors of the growth regulator auxin and for sensing environmental stress, but their role in intracellular auxin homeostasis, vital for plant growth and survival in changing environments, remains poorly understood. Here, we identified two ATP-binding cassette (ABC) subfamily B transporters, ABCB28 and ABCB29, which export auxin across the chloroplast envelope to the cytosol in a concerted action in vivo. Moreover, we provide evidence for an auxin biosynthesis pathway in Arabidopsis thaliana chloroplasts. The overexpression of ABCB28 and ABCB29 influenced stomatal regulation and resulted in significantly improved water use efficiency and survival rates during salt and drought stresses. Our results suggest that chloroplast auxin production and transport contribute to stomata regulation for conserving water upon salt stress. ABCB28 and ABCB29 integrate photosynthesis and auxin signals and as such hold great potential to improve the adaptation potential of crops to environmental cues.}, author = {Tamizhselvan, Prashanth and Madhavan, Sharmila and Constan-Aguilar, Christian and Elrefaay, Eman Ryad and Liu, Jie and Pěnčík, Aleš and Novák, Ondřej and Cairó, Albert and Hrtyan, Mónika and Geisler, Markus and Tognetti, Vanesa Beatriz}, issn = {2223-7747}, journal = {Plants}, number = {1}, publisher = {MDPI}, title = {{Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis}}, doi = {10.3390/plants13010007}, volume = {13}, year = {2023}, } @article{18959, abstract = {This workshop continues a series of workshops whose current format originated in 1981 under then-organizers Moser and Zehnder, and whose latest iteration took place in July 2023. The general goal of this series of workshops is to discuss the latest developments in the field of dynamical systems, broadly construed, and its connections with neighboring areas of mathematics such as differential geometry, partial differential equations, and more recently contact and symplectic geometry. We continued this tradition, bringing in new participants working in areas of dynamical systems and its connections with other areas of mathematics that are currently highly active and/or showing great promise for future development. Key focus areas for the 2023 workshop include spectral rigidity for planar domains, chaotic and oscillatory motions in celestial mechanics, conformal symplectic dynamics, and relations between dynamics.he workshop by the grant DMS-2230648, “US Junior Oberwolfach Fellows”.}, author = {Arnaud, Marie-Claude and Hutchings, Michael and Kaloshin, Vadim}, issn = {1660-8941}, journal = {Oberwolfach Reports}, number = {3}, pages = {1671--1730}, publisher = {EMS Press}, title = {{Dynamische Systeme}}, doi = {10.4171/owr/2023/30}, volume = {20}, year = {2023}, } @inproceedings{19985, abstract = {We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1 + E) . (1 + square3) for some arbitrary E>0.}, author = {Schmid, Stefan and Svoboda, Jakub and Yeo, Michelle X}, booktitle = {30th International Colloquium on Structural Information and Communication Complexity}, isbn = {9783031327322}, issn = {1611-3349}, location = {Alcalá de Henares, Spain}, pages = {576--594}, publisher = {Springer Nature}, title = {{Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation}}, doi = {10.1007/978-3-031-32733-9_26}, volume = {13892}, year = {2023}, } @unpublished{20572, abstract = {We present an elementary non-recursive formula for the multivariate moments of the Dirichlet distribution on the standard simplex, in terms of the pattern inventory of the moments' exponents. We obtain analog formulas for the multivariate moments of the Dirichlet-Ferguson and Gamma measures. We further introduce a polychromatic analogue of Ewens sampling formula on colored integer partitions, discuss its relation with suitable extensions of Hoppe's urn model and of the Chinese restaurant process, and prove that it satisfies an adapted notion of consistency in the sense of Kingman.}, author = {Dello Schiavo, Lorenzo and Quattrocchi, Filippo}, booktitle = {arXiv}, keywords = {Dirichlet distribution, Ewens sampling formula, Hoppe urn model, colored partitions}, title = {{Multivariate Dirichlet moments and a polychromatic Ewens sampling formula}}, doi = {10.48550/arXiv.2309.11292}, year = {2023}, }