@misc{13122, abstract = {Data for submitted article "Entangling microwaves with light" at arXiv:2301.03315v1}, author = {Sahu, Rishabh}, publisher = {Zenodo}, title = {{Entangling microwaves with light}}, doi = {10.5281/ZENODO.7789417}, year = {2023}, } @misc{13124, abstract = {This dataset comprises all data shown in the figures of the submitted article "Tunable directional photon scattering from a pair of superconducting qubits" at arXiv:2205.03293. Additional raw data are available from the corresponding author on reasonable request.}, author = {Redchenko, Elena and Poshakinskiy, Alexander and Sett, Riya and Zemlicka, Martin and Poddubny, Alexander and Fink, Johannes M}, publisher = {Zenodo}, title = {{Tunable directional photon scattering from a pair of superconducting qubits}}, doi = {10.5281/ZENODO.7858567}, year = {2023}, } @article{13125, abstract = {The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of p layers of alternating unitary operators and a classical computer is used to optimize the variational parameters. For a random initialization, the optimization typically leads to local minima with poor performance, motivating the search for initialization strategies of QAOA variational parameters. Although numerous heuristic initializations exist, an analytical understanding and performance guarantees for large p remain evasive.We introduce a greedy initialization of QAOA which guarantees improving performance with an increasing number of layers. Our main result is an analytic construction of 2p + 1 transition states—saddle points with a unique negative curvature direction—for QAOA with p + 1 layers that use the local minimum of QAOA with p layers. Transition states connect to new local minima, which are guaranteed to lower the energy compared to the minimum found for p layers. We use the GREEDY procedure to navigate the exponentially increasing with p number of local minima resulting from the recursive application of our analytic construction. The performance of the GREEDY procedure matches available initialization strategies while providing a guarantee for the minimal energy to decrease with an increasing number of layers p. }, author = {Sack, Stefan and Medina Ramos, Raimel A and Kueng, Richard and Serbyn, Maksym}, issn = {2469-9934}, journal = {Physical Review A}, number = {6}, publisher = {American Physical Society}, title = {{Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement}}, doi = {10.1103/physreva.107.062404}, volume = {107}, year = {2023}, } @misc{13126, abstract = {Mapping the complex and dense arrangement of cells and their connectivity in brain tissue demands nanoscale spatial resolution imaging. Super-resolution optical microscopy excels at visualizing specific molecules and individual cells but fails to provide tissue context. Here, we developed Comprehensive Analysis of Tissues across Scales (CATS), a technology to densely map brain tissue architecture from millimeter regional to nanometer synaptic scales in diverse chemically fixed brain preparations, including rodent and human. CATS uses fixation-compatible extracellular labeling and optical imaging, including stimulated emission depletion or expansion microscopy, to comprehensively delineate cellular structures. It enables three-dimensional reconstruction of single synapses and mapping of synaptic connectivity by identification and analysis of putative synaptic cleft regions. Applying CATS to the mouse hippocampal mossy fiber circuitry, we reconstructed and quantified the synaptic input and output structure of identified neurons. We furthermore demonstrate applicability to clinically derived human tissue samples, including formalin-fixed paraffin-embedded routine diagnostic specimens, for visualizing the cellular architecture of brain tissue in health and disease.}, author = {Danzl, Johann G}, publisher = {Institute of Science and Technology Austria}, title = {{Research data for the publication "Imaging brain tissue architecture across millimeter to nanometer scales"}}, doi = {10.15479/AT:ISTA:13126}, year = {2023}, } @article{13127, abstract = {Cooperative disease defense emerges as group-level collective behavior, yet how group members make the underlying individual decisions is poorly understood. Using garden ants and fungal pathogens as an experimental model, we derive the rules governing individual ant grooming choices and show how they produce colony-level hygiene. Time-resolved behavioral analysis, pathogen quantification, and probabilistic modeling reveal that ants increase grooming and preferentially target highly-infectious individuals when perceiving high pathogen load, but transiently suppress grooming after having been groomed by nestmates. Ants thus react to both, the infectivity of others and the social feedback they receive on their own contagiousness. While inferred solely from momentary ant decisions, these behavioral rules quantitatively predict hour-long experimental dynamics, and synergistically combine into efficient colony-wide pathogen removal. Our analyses show that noisy individual decisions based on only local, incomplete, yet dynamically-updated information on pathogen threat and social feedback can lead to potent collective disease defense.}, author = {Casillas Perez, Barbara E and Bod'Ová, Katarína and Grasse, Anna V and Tkačik, Gašper and Cremer, Sylvia}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Dynamic pathogen detection and social feedback shape collective hygiene in ants}}, doi = {10.1038/s41467-023-38947-y}, volume = {14}, year = {2023}, } @article{13128, abstract = {Given A⊆GL2(Fq), we prove that there exist disjoint subsets B,C⊆A such that A=B⊔C and their additive and multiplicative energies satisfying max{E+(B),E×(C)}≪|A|3/M(|A|), where M(|A|)=min{q4/3/|A|1/3(log|A|)2/3,|A|4/5/q13/5(log|A|)27/10}. We also study some related questions on moderate expanders over matrix rings, namely, for A,B,C⊆GL2(Fq), we have |AB+C|, |(A+B)C|≫q4, whenever |A||B||C|≫q10+1/2. These improve earlier results due to Karabulut, Koh, Pham, Shen, and Vinh ([2019], Expanding phenomena over matrix rings, ForumMath., 31, 951–970). }, author = {Mohammadi, Ali and Pham, Thang and Wang, Yiting}, issn = {1496-4287}, journal = {Canadian Mathematical Bulletin}, number = {4}, pages = {1280--1295}, publisher = {Cambridge University Press}, title = {{An energy decomposition theorem for matrices and related questions}}, doi = {10.4153/S000843952300036X}, volume = {66}, year = {2023}, } @article{13129, abstract = {We study the representative volume element (RVE) method, which is a method to approximately infer the effective behavior ahom of a stationary random medium. The latter is described by a coefficient field a(x) generated from a given ensemble ⟨⋅⟩ and the corresponding linear elliptic operator −∇⋅a∇. In line with the theory of homogenization, the method proceeds by computing d=3 correctors (d denoting the space dimension). To be numerically tractable, this computation has to be done on a finite domain: the so-called representative volume element, i.e., a large box with, say, periodic boundary conditions. The main message of this article is: Periodize the ensemble instead of its realizations. By this, we mean that it is better to sample from a suitably periodized ensemble than to periodically extend the restriction of a realization a(x) from the whole-space ensemble ⟨⋅⟩. We make this point by investigating the bias (or systematic error), i.e., the difference between ahom and the expected value of the RVE method, in terms of its scaling w.r.t. the lateral size L of the box. In case of periodizing a(x), we heuristically argue that this error is generically O(L−1). In case of a suitable periodization of ⟨⋅⟩ , we rigorously show that it is O(L−d). In fact, we give a characterization of the leading-order error term for both strategies and argue that even in the isotropic case it is generically non-degenerate. We carry out the rigorous analysis in the convenient setting of ensembles ⟨⋅⟩ of Gaussian type, which allow for a straightforward periodization, passing via the (integrable) covariance function. This setting has also the advantage of making the Price theorem and the Malliavin calculus available for optimal stochastic estimates of correctors. We actually need control of second-order correctors to capture the leading-order error term. This is due to inversion symmetry when applying the two-scale expansion to the Green function. As a bonus, we present a stream-lined strategy to estimate the error in a higher-order two-scale expansion of the Green function.}, author = {Clozeau, Nicolas and Josien, Marc and Otto, Felix and Xu, Qiang}, issn = {1615-3383}, journal = {Foundations of Computational Mathematics}, publisher = {Springer Nature}, title = {{Bias in the representative volume element method: Periodize the ensemble instead of its realizations}}, doi = {10.1007/s10208-023-09613-y}, year = {2023}, } @article{13134, abstract = {We propose a characterization of discrete analytical spheres, planes and lines in the body-centered cubic (BCC) grid, both in the Cartesian and in the recently proposed alternative compact coordinate system, in which each integer triplet addresses some voxel in the grid. We define spheres and planes through double Diophantine inequalities and investigate their relevant topological features, such as functionality or the interrelation between the thickness of the objects and their connectivity and separation properties. We define lines as the intersection of planes. The number of the planes (up to six) is equal to the number of the pairs of faces of a BCC voxel that are parallel to the line.}, author = {Čomić, Lidija and Largeteau-Skapin, Gaëlle and Zrour, Rita and Biswas, Ranita and Andres, Eric}, issn = {0031-3203}, journal = {Pattern Recognition}, number = {10}, publisher = {Elsevier}, title = {{Discrete analytical objects in the body-centered cubic grid}}, doi = {10.1016/j.patcog.2023.109693}, volume = {142}, year = {2023}, } @article{13135, abstract = {In this paper we consider a class of stochastic reaction-diffusion equations. We provide local well-posedness, regularity, blow-up criteria and positivity of solutions. The key novelties of this work are related to the use transport noise, critical spaces and the proof of higher order regularity of solutions – even in case of non-smooth initial data. Crucial tools are Lp(Lp)-theory, maximal regularity estimates and sharp blow-up criteria. We view the results of this paper as a general toolbox for establishing global well-posedness for a large class of reaction-diffusion systems of practical interest, of which many are completely open. In our follow-up work [8], the results of this paper are applied in the specific cases of the Lotka-Volterra equations and the Brusselator model.}, author = {Agresti, Antonio and Veraar, Mark}, issn = {1090-2732}, journal = {Journal of Differential Equations}, number = {9}, pages = {247--300}, publisher = {Elsevier}, title = {{Reaction-diffusion equations with transport noise and critical superlinear diffusion: Local well-posedness and positivity}}, doi = {10.1016/j.jde.2023.05.038}, volume = {368}, year = {2023}, } @article{13136, abstract = {Despite its fundamental importance for development, the question of how organs achieve their correct size and shape is poorly understood. This complex process requires coordination between the generation of cell mass and the morphogenetic mechanisms that sculpt tissues. These processes are regulated by morphogen signalling pathways and mechanical forces. Yet, in many systems, it is unclear how biochemical and mechanical signalling are quantitatively interpreted to determine the behaviours of individual cells and how they contribute to growth and morphogenesis at the tissue scale. In this review, we discuss the development of the vertebrate neural tube and somites as an example of the state of knowledge, as well as the challenges in understanding the mechanisms of tissue size control in vertebrate organogenesis. We highlight how the recent advances in stem cell differentiation and organoid approaches can be harnessed to provide new insights into this question.}, author = {Minchington, Thomas and Rus, Stefanie and Kicheva, Anna}, issn = {2452-3100}, journal = {Current Opinion in Systems Biology}, publisher = {Elsevier}, title = {{Control of tissue dimensions in the developing neural tube and somites}}, doi = {10.1016/j.coisb.2023.100459}, volume = {35}, year = {2023}, } @article{13138, abstract = {We consider the spin- 1 2 Heisenberg chain (XXX model) weakly perturbed away from integrability by an isotropic next-to-nearest neighbor exchange interaction. Recently, it was conjectured that this model possesses an infinite tower of quasiconserved integrals of motion (charges) [D. Kurlov et al., Phys. Rev. B 105, 104302 (2022)]. In this work we first test this conjecture by investigating how the norm of the adiabatic gauge potential (AGP) scales with the system size, which is known to be a remarkably accurate measure of chaos. We find that for the perturbed XXX chain the behavior of the AGP norm corresponds to neither an integrable nor a chaotic regime, which supports the conjectured quasi-integrability of the model. We then prove the conjecture and explicitly construct the infinite set of quasiconserved charges. Our proof relies on the fact that the XXX chain perturbed by next-to-nearest exchange interaction can be viewed as a truncation of an integrable long-range deformation of the Heisenberg spin chain.}, author = {Orlov, Pavel and Tiutiakina, Anastasiia and Sharipov, Rustem and Petrova, Elena and Gritsev, Vladimir and Kurlov, Denis V.}, issn = {2469-9969}, journal = {Physical Review B}, number = {18}, publisher = {American Physical Society}, title = {{Adiabatic eigenstate deformations and weak integrability breaking of Heisenberg chain}}, doi = {10.1103/PhysRevB.107.184312}, volume = {107}, year = {2023}, } @inproceedings{13139, abstract = {A classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to large instances, and iterative solutions are desirable. It turns out that a naive approach, as used by current model checkers, may yield completely wrong results. We present a new approach, which utilizes recent advances in partial exploration and mean payoff computation to obtain a correct, converging approximation.}, author = {Meggendorfer, Tobias}, booktitle = {TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783031308222}, issn = {1611-3349}, location = {Paris, France}, pages = {489--507}, publisher = {Springer Nature}, title = {{Correct approximation of stationary distributions}}, doi = {10.1007/978-3-031-30823-9_25}, volume = {13993}, year = {2023}, } @inproceedings{13141, abstract = {We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness). For parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω -regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive.}, author = {Anand, Ashwani and Mallik, Kaushik and Nayak, Satya Prakash and Schmuck, Anne Kathrin}, booktitle = {TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783031308192}, issn = {1611-3349}, location = {Paris, France}, pages = {211--228}, publisher = {Springer Nature}, title = {{Computing adequately permissive assumptions for synthesis}}, doi = {10.1007/978-3-031-30820-8_15}, volume = {13994}, year = {2023}, } @inproceedings{13142, abstract = {Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Lechner, Mathias and Zikelic, Dorde}, booktitle = {Tools and Algorithms for the Construction and Analysis of Systems }, isbn = {9783031308222}, issn = {1611-3349}, location = {Paris, France}, pages = {3--25}, publisher = {Springer Nature}, title = {{A learner-verifier framework for neural network controllers and certificates of stochastic systems}}, doi = {10.1007/978-3-031-30823-9_1}, volume = {13993}, year = {2023}, } @inproceedings{13143, abstract = {GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth primes. The numbers in the current search-space are millions of digits large and the participating volunteers need to run resource-consuming primality tests. Once a candidate prime N has been found, the only way for another party to independently verify the primality of N used to be by repeating the expensive primality test. To avoid the need for second recomputation of each primality test, these projects have recently adopted certifying mechanisms that enable efficient verification of performed tests. However, the mechanisms presently in place only detect benign errors and there is no guarantee against adversarial behavior: a malicious volunteer can mislead the project to reject a giant prime as being non-prime. In this paper, we propose a practical, cryptographically-sound mechanism for certifying the non-primality of Proth numbers. That is, a volunteer can – parallel to running the primality test for N – generate an efficiently verifiable proof at a little extra cost certifying that N is not prime. The interactive protocol has statistical soundness and can be made non-interactive using the Fiat-Shamir heuristic. Our approach is based on a cryptographic primitive called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple (x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol. 2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional cost to make it a cryptographically-sound certificate of non-primality.}, author = {Hoffmann, Charlotte and Hubáček, Pavel and Kamath, Chethan and Pietrzak, Krzysztof Z}, booktitle = {Public-Key Cryptography - PKC 2023}, isbn = {9783031313677}, issn = {1611-3349}, location = {Atlanta, GA, United States}, pages = {530--553}, publisher = {Springer Nature}, title = {{Certifying giant nonprimes}}, doi = {10.1007/978-3-031-31368-4_19}, volume = {13940}, year = {2023}, } @article{13145, abstract = {We prove a characterization of the Dirichlet–Ferguson measure over an arbitrary finite diffuse measure space. We provide an interpretation of this characterization in analogy with the Mecke identity for Poisson point processes.}, author = {Dello Schiavo, Lorenzo and Lytvynov, Eugene}, issn = {1083-589X}, journal = {Electronic Communications in Probability}, pages = {1--12}, publisher = {Institute of Mathematical Statistics}, title = {{A Mecke-type characterization of the Dirichlet–Ferguson measure}}, doi = {10.1214/23-ECP528}, volume = {28}, year = {2023}, } @inproceedings{13161, author = {Schlögl, Alois and Elefante, Stefano and Hodirnau, Victor-Valentin}, booktitle = {ASHPC23 - Austrian-Slovenian HPC Meeting 2023}, location = {Maribor, Slovenia}, pages = {59--59}, publisher = {EuroCC}, title = {{Running Windows-applications on a Linux HPC cluster using WINE}}, year = {2023}, } @inproceedings{13162, author = {Elefante, Stefano and Stadlbauer, Stephan and Alexander, Michael F and Schlögl, Alois}, booktitle = {ASHPC23 - Austrian-Slovenian HPC Meeting 2023}, location = {Maribor, Slovenia}, pages = {42--42}, publisher = {EuroCC}, title = {{Cryo-EM software packages: A sys-admins point of view}}, year = {2023}, } @article{13164, abstract = {Molecular compatibility between gametes is a prerequisite for successful fertilization. As long as a sperm and egg can recognize and bind each other via their surface proteins, gamete fusion may occur even between members of separate species, resulting in hybrids that can impact speciation. The egg membrane protein Bouncer confers species specificity to gamete interactions between medaka and zebrafish, preventing their cross-fertilization. Here, we leverage this specificity to uncover distinct amino acid residues and N-glycosylation patterns that differentially influence the function of medaka and zebrafish Bouncer and contribute to cross-species incompatibility. Curiously, in contrast to the specificity observed for medaka and zebrafish Bouncer, seahorse and fugu Bouncer are compatible with both zebrafish and medaka sperm, in line with the pervasive purifying selection that dominates Bouncer’s evolution. The Bouncer-sperm interaction is therefore the product of seemingly opposing evolutionary forces that, for some species, restrict fertilization to closely related fish, and for others, allow broad gamete compatibility that enables hybridization.}, author = {Gert, Krista R.B. and Panser, Karin and Surm, Joachim and Steinmetz, Benjamin S. and Schleiffer, Alexander and Jovine, Luca and Moran, Yehu and Kondrashov, Fyodor and Pauli, Andrea}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Divergent molecular signatures in fish Bouncer proteins define cross-fertilization boundaries}}, doi = {10.1038/s41467-023-39317-4}, volume = {14}, year = {2023}, } @article{13165, abstract = {A graph G=(V, E) is called fully regular if for every independent set I c V, the number of vertices in V\I that are not connected to any element of I depends only on the size of I. A linear ordering of the vertices of G is called successive if for every i, the first i vertices induce a connected subgraph of G. We give an explicit formula for the number of successive vertex orderings of a fully regular graph. As an application of our results, we give alternative proofs of two theorems of Stanley and Gao & Peng, determining the number of linear edge orderings of complete graphs and complete bipartite graphs, respectively, with the property that the first i edges induce a connected subgraph. As another application, we give a simple product formula for the number of linear orderings of the hyperedges of a complete 3-partite 3-uniform hypergraph such that, for every i, the first i hyperedges induce a connected subgraph. We found similar formulas for complete (non-partite) 3-uniform hypergraphs and in another closely related case, but we managed to verify them only when the number of vertices is small.}, author = {Fang, Lixing and Huang, Hao and Pach, János and Tardos, Gábor and Zuo, Junchi}, issn = {1096-0899}, journal = {Journal of Combinatorial Theory. Series A}, number = {10}, publisher = {Elsevier}, title = {{Successive vertex orderings of fully regular graphs}}, doi = {10.1016/j.jcta.2023.105776}, volume = {199}, year = {2023}, }