@inproceedings{17093,
  abstract     = {Federated Learning (FL) enables large-scale distributed training of machine learning models, while still allowing individual nodes to maintain data locally. However, executing FL at scale comes with inherent practical challenges: 1) heterogeneity of the local node data distributions, 2) heterogeneity of node computational speeds (asynchrony), but also 3) constraints in the amount of communication between the clients and the server. In this work, we present the first variant of the classic federated averaging (FedAvg) algorithm which, at the same time, supports data heterogeneity, partial client asynchrony, and communication compression. Our algorithm comes with a novel, rigorous analysis showing that, in spite of these system relaxations, it can provide similar convergence to FedAvg in interesting parameter regimes. Experimental results in the rigorous LEAF benchmark on setups of up to 300 nodes show that our algorithm ensures fast convergence for standard federated tasks, improving upon prior quantized and asynchronous approaches.},
  author       = {Zakerinia, Hossein and Talaei, Shayan and Nadiradze, Giorgi and Alistarh, Dan-Adrian},
  booktitle    = {Proceedings of the 27th International Conference on Artificial Intelligence and Statistics},
  issn         = {2640-3498},
  location     = {Valencia, Spain},
  pages        = {3448--3456},
  publisher    = {ML Research Press},
  title        = {{Communication-efficient federated learning with data and client heterogeneity}},
  volume       = {238},
  year         = {2024},
}

@inproceedings{17098,
  abstract     = {Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided by a player that owns the current vertex. Each edge is assigned an integer weight and the payoff of a play is the discounted-sum of the weights of the play. The goal of player 1 is to maximize the discounted-sum payoff against the adversarial player 2. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class and the existence of a polynomial-time algorithm is a major open question. Since breaking the general exponential barrier has been a challenging problem, faster parameterized algorithms have been considered. If the discount factor is expressed in unary, then discounted-sum games can be solved in polynomial time. However, if the discount factor is arbitrary (or expressed in binary), but the weights are in unary, none of the existing approaches yield a sub-exponential bound. Our main result is a new analysis technique for a classical algorithm (namely, the strategy iteration algorithm) that present a new runtime bound which is [EQUATION] for game graphs with n vertices and absolute weights of at most W. In particular, our result yields a deterministic sub-exponential bound for games with weights that are constant or represented in unary.},
  author       = {Asadi, Ali and Chatterjee, Krishnendu and Svoboda, Jakub and Saona Urmeneta, Raimundo J},
  booktitle    = {39th Annual ACM/IEEE Symposium on Logic in Computer Science},
  isbn         = {9798400706608},
  issn         = {1043-6871},
  location     = {Tallinn, Estonia},
  publisher    = {Association for Computing Machinery},
  title        = {{Deterministic sub-exponential algorithm for discounted-sum games with unary weights}},
  doi          = {10.1145/3661814.3662080},
  year         = {2024},
}

@inproceedings{17099,
  abstract     = {We study two-player zero-sum concurrent stochastic games with finite state and action space played for an infinite number of steps. In every step, the two players simultaneously and independently choose an action. Given the current state and the chosen actions, the next state is obtained according to a stochastic transition function. An objective is a measurable function on plays (or infinite trajectories) of the game, and the value for an objective is the maximal expectation that the player can guarantee against the adversarial player. We consider: (a) stateful-discounted objectives, which are similar to the classical discounted-sum objectives, but states are associated with different discount factors rather than a single discount factor; and (b) parity objectives, which are a canonical representation for ω-regular objectives. For stateful-discounted objectives, given an ordering of the discount factors, the limit value is the limit of the value of the stateful-discounted objectives, as the discount factors approach zero according to the given order.
The computational problem we consider is the approximation of the value within an arbitrary
additive error. The above problem is known to be in EXPSPACE for the limit value of statefuldiscounted objectives and in PSPACE for parity objectives. The best-known algorithms for both the above problems are at least exponential time, with an exponential dependence on the number of states and actions. Our main results for the value approximation problem for the limit value of stateful-discounted objectives and parity objectives are as follows: (a) we establish TFNP[NP] complexity; and (b) we present algorithms that improve the dependency on the number of actions in the exponent from linear to logarithmic. In particular, if the number of states is constant, our algorithms run in polynomial time.},
  author       = {Asadi, Ali and Chatterjee, Krishnendu and Saona Urmeneta, Raimundo J and Svoboda, Jakub},
  booktitle    = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  isbn         = {9783959773553},
  issn         = {1868-8969},
  location     = {Gujarat, India},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms}},
  doi          = {10.4230/LIPIcs.FSTTCS.2024.5},
  volume       = {323},
  year         = {2024},
}

@unpublished{17101,
  abstract     = {This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players.
Starting from a fixed vertex, players take turns to move a token along the edges of the graph.
On the one hand, for acyclic directed graphs of bounded degree and sub-exponential expansion, we show that the value of the game converges almost surely to a constant at an exponential rate dominated in terms of the expansion.
On the other hand, for the infinite d-ary tree that does not fall into the previous class of graphs, we show convergence at a double-exponential rate in terms of the expansion.},
  author       = {Attia, Luc and Lichev, Lyuben and Mitsche, Dieter and Saona Urmeneta, Raimundo J and Ziliotto, Bruno},
  booktitle    = {arXiv},
  title        = {{Zero-sum random games on directed graphs}},
  doi          = {10.48550/arXiv.2401.16252},
  year         = {2024},
}

@article{17104,
  abstract     = {The homeostasis of epithelial tissue relies on a balance between the self-renewal of stem cell populations, cellular differentiation, and loss. Although this balance needs to be tightly regulated to avoid pathologies, such as tumor growth, the regulatory mechanisms, both cell-intrinsic and collective, which ensure tissue steady-state are still poorly understood. Here, we develop a computational model that incorporates basic assumptions of stem cell renewal into distinct populations and mechanical interactions between cells. We find that the model generates unexpected dynamic features: stem cells repel each other in the bulk tissue and are thus found rather isolated, as in a number of in vivo contexts. By mapping the system onto a gas of passive Brownian particles with effective repulsive interactions, that arise from the generated flows of differentiated cells, we show that we can quantitatively describe such stem cell distribution in tissues. The interaction potential between a pair of stem cells decays exponentially with a characteristic length that spans several cell sizes, corresponding to the volume of cells generated per stem cell division. Our findings may help understanding the dynamics of normal and cancerous epithelial tissues.},
  author       = {Krämer, Johannes C. and Hannezo, Edouard B and Gompper, Gerhard and Elgeti, Jens},
  issn         = {2542-4653},
  journal      = {SciPost Physics},
  number       = {4},
  publisher    = {SciPost Foundation},
  title        = {{Mechanically-driven stem cell separation in tissues caused by proliferating daughter cells}},
  doi          = {10.21468/scipostphys.16.4.097},
  volume       = {16},
  year         = {2024},
}

@article{17111,
  abstract     = {Membrane-associated protein phase separation plays critical roles in cell biology, driving essential cellular phenomena from immune signaling to membrane traffic. Importantly, by reducing dimensionality from three to two dimensions, lipid bilayers can nucleate phase separation at far lower concentrations compared with those required for phase separation in solution. How might other intracellular lipid substrates, such as lipid droplets, contribute to nucleation of phase separation? Distinct from bilayer membranes, lipid droplets consist of a phospholipid monolayer surrounding a core of neutral lipids, and they are energy storage organelles that protect cells from lipotoxicity and oxidative stress. Here, we show that intrinsically disordered proteins can undergo phase separation on the surface of synthetic and cell-derived lipid droplets. Specifically, we find that the model disordered domains FUS LC and LAF-1 RGG separate into protein-rich and protein-depleted phases on the surfaces of lipid droplets. Owing to the hydrophobic nature of interactions between FUS LC proteins, increasing ionic strength drives an increase in its phase separation on droplet surfaces. The opposite is true for LAF-1 RGG, owing to the electrostatic nature of its interprotein interactions. In both cases, protein-rich phases on the surfaces of synthetic and cell-derived lipid droplets demonstrate molecular mobility indicative of a liquid-like state. Our results show that lipid droplets can nucleate protein condensates, suggesting that protein phase separation could be key in organizing biological processes involving lipid droplets.},
  author       = {Kamatar, Advika and Bravo, Jack Peter Kelly and Yuan, Feng and Wang, Liping and Lafer, Eileen M. and Taylor, David W. and Stachowiak, Jeanne C. and Parekh, Sapun H.},
  issn         = {0006-3495},
  journal      = {Biophysical Journal},
  number       = {11},
  pages        = {1494--1507},
  publisher    = {Elsevier},
  title        = {{Lipid droplets as substrates for protein phase separation}},
  doi          = {10.1016/j.bpj.2024.03.015},
  volume       = {123},
  year         = {2024},
}

@article{17112,
  abstract     = {The generation of cyclic oligoadenylates and subsequent allosteric activation of proteins that carry sensory domains is a distinctive feature of type III CRISPR-Cas systems. In this work, we characterize a set of associated genes of a type III-B system from Haliangium ochraceum that contains two caspase-like proteases, SAVED-CHAT and PCaspase (prokaryotic caspase), co-opted from a cyclic oligonucleotide–based antiphage signaling system (CBASS). Cyclic tri–adenosine monophosphate (AMP)–induced oligomerization of SAVED-CHAT activates proteolytic activity of the CHAT domains, which specifically cleave and activate PCaspase. Subsequently, activated PCaspase cleaves a multitude of proteins, which results in a strong interference phenotype in vivo in Escherichia coli. Taken together, our findings reveal how a CRISPR-Cas–based detection of a target RNA triggers a cascade of caspase-associated proteolytic activities.},
  author       = {Steens, Jurre A. and Bravo, Jack Peter Kelly and Salazar, Carl Raymund P. and Yildiz, Caglar and Amieiro, Afonso M. and Köstlbacher, Stephan and Prinsen, Stijn H.P. and Patinios, Constantinos and Bardis, Andreas and Barendregt, Arjan and Scheltema, Richard A. and Ettema, Thijs J.G. and van der Oost, John and Taylor, David W. and Staals, Raymond H.J.},
  issn         = {1095-9203},
  journal      = {Science},
  number       = {6682},
  pages        = {512--519},
  publisher    = {American Association for the Advancement of Science},
  title        = {{Type III-B CRISPR-Cas cascade of proteolytic cleavages}},
  doi          = {10.1126/science.adk0378},
  volume       = {383},
  year         = {2024},
}

@article{17113,
  abstract     = {CRISPR-Cas9 is a powerful tool for genome editing, but the strict requirement for an NGG protospacer-adjacent motif (PAM) sequence immediately next to the DNA target limits the number of editable genes. Recently developed Cas9 variants have been engineered with relaxed PAM requirements, including SpG-Cas9 (SpG) and the nearly PAM-less SpRY-Cas9 (SpRY). However, the molecular mechanisms of how SpRY recognizes all potential PAM sequences remains unclear. Here, we combine structural and biochemical approaches to determine how SpRY interrogates DNA and recognizes target sites. Divergent PAM sequences can be accommodated through conformational flexibility within the PAM-interacting region, which facilitates tight binding to off-target DNA sequences. Nuclease activation occurs ~1000-fold slower than for <jats:italic>Streptococcus pyogenes</jats:italic> Cas9, enabling us to directly visualize multiple on-pathway intermediate states. Experiments with SpG position it as an intermediate enzyme between Cas9 and SpRY. Our findings shed light on the molecular mechanisms of PAMless genome editing.},
  author       = {Hibshman, Grace N. and Bravo, Jack Peter Kelly and Hooper, Matthew M. and Dangerfield, Tyler L. and Zhang, Hongshan and Finkelstein, Ilya J. and Johnson, Kenneth A. and Taylor, David W.},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{Unraveling the mechanisms of PAMless DNA interrogation by SpRY-Cas9}},
  doi          = {10.1038/s41467-024-47830-3},
  volume       = {15},
  year         = {2024},
}

@article{17114,
  abstract     = {CRISPR-Cas are adaptive immune systems in bacteria and archaea that utilize CRISPR RNA-guided surveillance complexes to target complementary RNA or DNA for destruction<jats:sup>1–5</jats:sup>. Target RNA cleavage at regular intervals is characteristic of type III effector complexes<jats:sup>6–8</jats:sup>. Here, we determine the structures of the <jats:italic>Synechocystis</jats:italic> type III-Dv complex, an apparent evolutionary intermediate from multi-protein to single-protein type III effectors<jats:sup>9,10</jats:sup>, in pre- and post-cleavage states. The structures show how multi-subunit fusion proteins in the effector are tethered together in an unusual arrangement to assemble into an active and programmable RNA endonuclease and how the effector utilizes a distinct mechanism for target RNA seeding from other type III effectors. Using structural, biochemical, and quantum/classical molecular dynamics simulation, we study the structure and dynamics of the three catalytic sites, where a 2′-OH of the ribose on the target RNA acts as a nucleophile for in line self-cleavage of the upstream scissile phosphate. Strikingly, the arrangement at the catalytic residues of most type III complexes resembles the active site of ribozymes, including the hammerhead, pistol, and Varkud satellite ribozymes. Our work provides detailed molecular insight into the mechanisms of RNA targeting and cleavage by an important intermediate in the evolution of type III effector complexes.},
  author       = {Schwartz, Evan A. and Bravo, Jack Peter Kelly and Ahsan, Mohd and Macias, Luis A. and McCafferty, Caitlyn L. and Dangerfield, Tyler L. and Walker, Jada N. and Brodbelt, Jennifer S. and Palermo, Giulia and Fineran, Peter C. and Fagerlund, Robert D. and Taylor, David W.},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{RNA targeting and cleavage by the type III-Dv CRISPR effector complex}},
  doi          = {10.1038/s41467-024-47506-y},
  volume       = {15},
  year         = {2024},
}

@article{17122,
  abstract     = {Background: Motor alterations and lowered physical activity are common in affective disorders. Previous research has indicated a link between depressive symptoms and declining muscle strength primarily focusing on the elderly but not younger individuals. Thus, we aimed to evaluate the relationship between mood and muscle strength in a sample of N = 73 young to middle-aged hospitalized patients (18–49 years, mean age 30.7 years) diagnosed with major depressive, bipolar and schizoaffective disorder, with a focus on moderating effects of psychopharmacotherapy. The study was carried out as a prospective observational study at a German psychiatric university hospital between September 2021 and March 2022.
Methods: Employing a standardized strength circuit consisting of computerized strength training devices, we measured the maximal muscle strength (Fmax) using three repetitions maximum across four muscle regions (abdomen, arm, back, leg) at three time points (t1-t3) over four weeks accompanied by psychometric testing (MADRS, BPRS, YRMS) and blood lipid profiling in a clinical setting. For analysis of psychopharmacotherapy, medication was split into activating (AM) and inhibiting (IM) medication and dosages were normalized by the respective WHO defined daily dose.
Results: While we observed a significant decrease of the MADRS score and increase of the relative total Fmax (rTFmax) in the first two weeks (t1-t2) but not later (both p < .001), we did not reveal a significant bivariate correlation between disease severity (MADRS) and muscle strength (rTFmax) at any of the timepoints. Individuals with longer disease history displayed reduced rTFmax (p = .048). IM was significantly associated with decreased rTFmax (p = .032). Regression models provide a more substantial effect of gender, age, and IM on muscle strength than the depressive episode itself (p < .001).
Conclusions: The results of the study indicate that disease severity and muscle strength are not associated in young to middle-aged inpatients with affective disorders using a strength circuit as observational measurement. Future research will be needed to differentiate the effect of medication, gender, and age on muscle strength and to develop interventions for prevention of muscle weakness, especially in younger patients with chronic affective illnesses.},
  author       = {Ramming, Hannah and Theuerkauf, Linda and Hoos, Olaf and Lichter, Katharina and Kittel-Schneider, Sarah},
  issn         = {1471-244X},
  journal      = {BMC Psychiatry},
  publisher    = {Springer Nature},
  title        = {{The association between maximal muscle strength, disease severity and psychopharmacotherapy among young to middle-aged inpatients with affective disorders – a prospective pilot study}},
  doi          = {10.1186/s12888-024-05849-2},
  volume       = {24},
  year         = {2024},
}

@article{17123,
  abstract     = {A key feature of many developmental systems is their ability to self-organize spatial patterns of functionally distinct cell fates. To ensure proper biological function, such patterns must be established reproducibly, by controlling and even harnessing intrinsic and extrinsic fluctuations. While the relevant molecular processes are increasingly well understood, we lack a principled framework to quantify the performance of such stochastic self-organizing systems. To that end, we introduce an information-theoretic measure for self-organized fate specification during embryonic development. We show that the proposed measure assesses the total information content of fate patterns and decomposes it into interpretable contributions corresponding to the positional and correlational information. By optimizing the proposed measure, our framework provides a normative theory for developmental circuits, which we demonstrate on lateral inhibition, cell type proportioning, and reaction–diffusion models of self-organization. This paves a way toward a classification of developmental systems based on a common information-theoretic language, thereby organizing the zoo of implicated chemical and mechanical signaling processes.},
  author       = {Brückner, David and Tkačik, Gašper},
  issn         = {1091-6490},
  journal      = {Proceedings of the National Academy of Sciences of the United States of America},
  number       = {23},
  publisher    = {National Academy of Sciences},
  title        = {{Information content and optimization of self-organized developmental systems}},
  doi          = {10.1073/pnas.2322326121},
  volume       = {121},
  year         = {2024},
}

@article{17125,
  abstract     = {We explore the potential of nanocrystals (a term used equivalently to nanoparticles) as building blocks for nanomaterials, and the current advances and open challenges for fundamental science developments and applications. Nanocrystal assemblies are inherently multiscale, and the generation of revolutionary material properties requires a precise understanding of the relationship between structure and function, the former being determined by classical effects and the latter often by quantum effects. With an emphasis on theory and computation, we discuss challenges that hamper current assembly strategies and to what extent nanocrystal assemblies represent thermodynamic equilibrium or kinetically trapped metastable states. We also examine dynamic effects and optimization of assembly protocols. Finally, we discuss promising material functions and examples of their realization with nanocrystal assemblies.},
  author       = {Bassani, Carlos L. and Van Anders, Greg and Banin, Uri and Baranov, Dmitry and Chen, Qian and Dijkstra, Marjolein and Dimitriyev, Michael S. and Efrati, Efi and Faraudo, Jordi and Gang, Oleg and Gaston, Nicola and Golestanian, Ramin and Guerrero-Garcia, G. Ivan and Gruenwald, Michael and Haji-Akbari, Amir and Ibáñez, Maria and Karg, Matthias and Kraus, Tobias and Lee, Byeongdu and Van Lehn, Reid C. and Macfarlane, Robert J. and Mognetti, Bortolo M. and Nikoubashman, Arash and Osat, Saeed and Prezhdo, Oleg V. and Rotskoff, Grant M. and Saiz, Leonor and Shi, An Chang and Skrabalak, Sara and Smalyukh, Ivan I. and Tagliazucchi, Mario and Talapin, Dmitri V. and Tkachenko, Alexei V. and Tretiak, Sergei and Vaknin, David and Widmer-Cooper, Asaph and Wong, Gerard C.L. and Ye, Xingchen and Zhou, Shan and Rabani, Eran and Engel, Michael and Travesset, Alex},
  issn         = {1936-086X},
  journal      = {ACS Nano},
  number       = {23},
  pages        = {14791--14840},
  publisher    = {American Chemical Society},
  title        = {{Nanocrystal assemblies: Current advances and open problems}},
  doi          = {10.1021/acsnano.3c10201},
  volume       = {18},
  year         = {2024},
}

@inproceedings{17126,
  abstract     = {Functional encryption (FE) is a primitive where the holder of a master secret key can control which functions a user can evaluate on encrypted data. It is a powerful primitive that even implies indistinguishability obfuscation (iO), given sufficiently compact ciphertexts (Ananth-Jain, CRYPTO’15 and Bitansky-Vaikuntanathan, FOCS’15). However, despite being extensively studied, there are FE schemes, such as function-hiding inner-product FE (Bishop-Jain-Kowalczyk, AC’15, Abdalla-Catalano-Fiore-Gay-Ursu, CRYPTO’18) and compact quadratic FE (Baltico-Catalano-Fiore-Gay, Lin, CRYPTO’17), that can be only realized using pairings. This raises the question if there are some mathematical barriers that hinder us from realizing these FE schemes from other assumptions.

In this paper, we study the difficulty of constructing lattice-based compact FE. We generalize the impossibility results of Ünal (EC’20) for lattice-based function-hiding FE, and extend it to the case of compact FE. Concretely, we prove lower bounds for lattice-based compact FE schemes which meet some (natural) algebraic restrictions at encryption and decryption, and have ciphertexts of linear size and secret keys of minimal degree. We see our results as important indications of why it is hard to construct lattice-based FE schemes for new functionalities, and which mathematical barriers have to be overcome.},
  author       = {Tairi, Erkan and Ünal, Akin},
  booktitle    = {Advances in Cryptology – EUROCRYPT 2024},
  isbn         = {9783031587221},
  issn         = {1611-3349},
  location     = {Zurich, Switzerland},
  pages        = {249--279},
  publisher    = {Springer Nature},
  title        = {{Lower bounds for lattice-based compact functional encryption}},
  doi          = {10.1007/978-3-031-58723-8_9},
  volume       = {14652},
  year         = {2024},
}

@article{17128,
  abstract     = {The onset of turbulence in pipe flow has defied detailed understanding ever since the first observations of the spatially heterogeneous nature of the transition. Recent theoretical studies and experiments in simpler, shear-driven flows suggest that the onset of turbulence is a directed-percolation non-equilibrium phase transition, but whether these findings are generic and also apply to open or pressure-driven flows is unknown. In pipe flow, the extremely long time scales near the transition make direct observations of critical behaviour virtually impossible. Here we find a technical solution to that limitation and show that the universality class of the transition is directed percolation, from which a jammed phase of puffs emerges above the critical point. Our method is to experimentally characterize all pairwise interactions between localized patches of turbulence puffs and use these interactions as input for renormalization group and computer simulations of minimal models that extrapolate to long length and time scales. The strong interactions in the jamming regime enable us to explicitly measure the turbulent fraction and confirm model predictions. Our work shows that directed-percolation scaling applies beyond simple closed shear flows and underscores how statistical mechanics can lead to profound, quantitative and predictive insights on turbulent flows and their phases.},
  author       = {Lemoult, Grégoire M and Vasudevan, Mukund and Shih, Hong Yan and Linga, Gaute and Mathiesen, Joachim and Goldenfeld, Nigel and Hof, Björn},
  issn         = {1745-2481},
  journal      = {Nature Physics},
  pages        = {1339--1345},
  publisher    = {Springer Nature},
  title        = {{Directed percolation and puff jamming near the transition to pipe turbulence}},
  doi          = {10.1038/s41567-024-02513-0},
  volume       = {20},
  year         = {2024},
}

@phdthesis{17133,
  abstract     = {An ideal quantum computer relies on qubits capable of performing fast gate operations and
maintaining strong interconnections while preserving their quantum coherence. Since the
inception of experimental eforts toward building a quantum computer, the community has
faced challenges in engineering such a system. Among the various methods of implementing a
quantum computer, superconducting qubits have shown fast gates close to tens of nanoseconds,
with the state-of-the-art reaching a coherence of a few milliseconds. However, achieving
simultaneously long lifetimes with fast qubit operations poses an inherent paradox. Qubits
with high coherence require isolation from the environment, while fast operation necessitates
strong coupling of the qubit. This thesis approaches this issue by proposing the idea of
engineering superconducting qubits capable of transitioning between operating in a protected
regime, where the qubit is completely isolated from the environment, and coupling to the
communication channels as needed. In this direction, we use the geometric superinductor to
scan the parameter space of rf-SQUID devices, searching for a regime where we can take the
qubit protection to its extreme.

This leads us to the inductively shunted transmon (IST) regime, characterized by EJ /EC ≫ 1
and EJ /EL ≫ 1, where the circuit potential exhibits a double well with a large barrier
separating the local ground states of each quantum well. In this regime, although it is
anticipated that the two quantum wells would be isolated from each other, we observe single
fuxon tunneling between them. The interplay of the cavity photons and the fuxon transition
forms a rich physical system, containing resonance conditions that allow the preparation of the
fuxon ground or excited states. This enables us to study the relaxation rate of such transition
and show that it can be as large as 3.6 hours. Dynamically controlling the barrier height
between the two quantum wells allows for controllable coupling, which scales exponentially,
for a qubit encoded in two fuxon states.
The 0-π qubit is one of the very few known superconducting circuit types that ofers exponential
protection from both relaxation and dephasing simultaneously. However, this qubit is not
exempt from the fact that such protection comes at the expense of complex readout and
control. In this thesis, we propose a way to controllably break the circuit symmetry, the
key reason for the protection, to momentarily restore the ability to control and manipulate
the qubit. An asymmetry in capacitances and inductances in the 0-π circuit is detrimental
since they lead to coupling of the protected state to the thermally occupied parasitic mode
of the circuit. However, here we try to exploit a controlled asymmetry in Josephson energies
and show that this can be used as a tunable coupler between the protected states. In the
future, this should allow to perform gate operations by dynamically controlling the asymmetry
instead of driving the protected transition with microwave pulses. Therefore, we believe that
the proposed method can make the use of protected qubits more practical in experimental
realizations of quantum computing.},
  author       = {Hassani, Farid},
  isbn         = {978-3-99078-040-4},
  issn         = {2663-337X},
  keywords     = {Quantum information, Qubits, Superconducting devices},
  pages        = {161},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Superconducting qubits capable of dynamic switching between protected and high-speed control regimes}},
  doi          = {10.15479/at:ista:17133},
  year         = {2024},
}

@unpublished{17136,
  abstract     = {This paper focuses on Majority Dynamics in sparse graphs, in particular, as a
tool to study internal cuts. It is known that, in Majority Dynamics on a finite
graph, each vertex eventually either comes to a fixed state, or oscillates with
period two. The empirical evidence acquired by simulations suggests that for
random odd-regular graphs, approximately half of the vertices end up
oscillating with high probability. We notice a local symmetry between
oscillating and non-oscillating vertices, that potentially can explain why the
fraction of the oscillating vertices is concentrated around $\frac{1}{2}$. In
our simulations, we observe that the parts of random odd-regular graph under
Majority Dynamics with high probability do not contain $\lceil \frac{d}{2}
\rceil$-cores at any timestep, and thus, one cannot use Majority Dynamics to
prove that internal cuts exist in odd-regular graphs almost surely. However, we
suggest a modification of Majority Dynamics, that yields parts with desired
cores with high probability.},
  author       = {Arkhipov, Pavel},
  booktitle    = {arXiv},
  title        = {{Majority dynamics and internal partitions of random regular graphs: Experimental results}},
  doi          = {10.48550/arXiv.2406.07026},
  year         = {2024},
}

@inproceedings{17139,
  author       = {Schlögl, Alois and Khalid, Waleed and Elefante, Stefano and Stadlbauer, Stephan},
  booktitle    = {ASHPC24 - Austrian-Slovenian HPC Meeting 2024},
  isbn         = {9783200096455},
  location     = {Grundlsee, Austria},
  pages        = {46},
  publisher    = {EuroCC Austria},
  title        = {{How much memory per CPU core is requested?}},
  doi          = {10.25365/phaidra.463},
  year         = {2024},
}

@article{17141,
  abstract     = {The TIR1/AFB–Aux/IAA–ARF canonical auxin signaling pathway is widely accepted to (de)active transcriptional regulation, thus controlling auxin-associated developmental processes. However, the theme of a rapid auxin response has emerged since the 2018 Auxins and Cytokinin in Plant Development conference. To date, a few signaling components have been identified to mediate both slow and rapid auxin responses, which unveils the complexity of auxin signaling.},
  author       = {Zhang, Zilin and Chen, Huihuang and Peng, Shuaiying and Han, Huibin},
  issn         = {0022-0957},
  journal      = {Journal of Experimental Botany},
  number       = {18},
  publisher    = {Oxford University Press},
  title        = {{Slow and rapid auxin responses in Arabidopsis}},
  doi          = {10.1093/jxb/erae246},
  volume       = {75},
  year         = {2024},
}

@article{17142,
  abstract     = {Despite the diverse genetic origins of autism spectrum disorders (ASDs), affected individuals share strikingly similar and correlated behavioural traits that include perceptual and sensory processing challenges. Notably, the severity of these sensory symptoms is often predictive of the expression of other autistic traits. However, the origin of these perceptual deficits remains largely elusive. Here, we show a recurrent impairment in visual threat perception that is similarly impaired in 3 independent mouse models of ASD with different molecular aetiologies. Interestingly, this deficit is associated with reduced avoidance of threatening environments—a nonperceptual trait. Focusing on a common cause of ASDs, the Setd5 gene mutation, we define the molecular mechanism. We show that the perceptual impairment is caused by a potassium channel (Kv1)-mediated hypoexcitability in a subcortical node essential for the initiation of escape responses, the dorsal periaqueductal grey (dPAG). Targeted pharmacological Kv1 blockade rescued both perceptual and place avoidance deficits, causally linking seemingly unrelated trait deficits to the dPAG. Furthermore, we show that different molecular mechanisms converge on similar behavioural phenotypes by demonstrating that the autism models Cul3 and Ptchd1, despite having similar behavioural phenotypes, differ in their functional and molecular alteration. Our findings reveal a link between rapid perception controlled by subcortical pathways and appropriate learned interactions with the environment and define a nondevelopmental source of such deficits in ASD.},
  author       = {Burnett, Laura and Koppensteiner, Peter and Symonova, Olga and Masson, Tomas and Vega Zuniga, Tomas A and Contreras, Ximena and Rülicke, Thomas and Shigemoto, Ryuichi and Novarino, Gaia and Jösch, Maximilian A},
  issn         = {1545-7885},
  journal      = {PLoS Biology},
  publisher    = {Public Library of Science},
  title        = {{Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice}},
  doi          = {10.1371/journal.pbio.3002668},
  volume       = {22},
  year         = {2024},
}

@article{17143,
  abstract     = {This paper deals with local criteria for the convergence to a global minimiser for gradient flow trajectories and their discretisations. To obtain quantitative estimates on the speed of convergence, we consider variations on the classical Kurdyka–Łojasiewicz inequality for a large class of parameter functions. Our assumptions are given in terms of the initial data, without any reference to an equilibrium point. The main results are convergence statements for gradient flow curves and proximal point sequences to a global minimiser, together with sharp quantitative estimates on the speed of convergence. These convergence results apply in the general setting of lower semicontinuous functionals on complete metric spaces, generalising recent results for smooth functionals on Rn. While the non-smooth setting covers very general spaces, it is also useful for (non)-smooth functionals on Rn.
.},
  author       = {Dello Schiavo, Lorenzo and Maas, Jan and Pedrotti, Francesco},
  issn         = {1088-6850},
  journal      = {Transactions of the American Mathematical Society},
  number       = {6},
  pages        = {3779--3804},
  publisher    = {American Mathematical Society},
  title        = {{Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces}},
  doi          = {10.1090/tran/9156},
  volume       = {377},
  year         = {2024},
}