@article{14658, abstract = {We investigate spin-charge separation of a spin- 1 2 Fermi system confined in a triple well where multiple bands are occupied. We assume that our finite fermionic system is close to fully spin polarized while being doped by a hole and an impurity fermion with opposite spin. Our setup involves ferromagnetic couplings among the particles in different bands, leading to the development of strong spin-transport correlations in an intermediate interaction regime. Interactions are then strong enough to lift the degeneracy among singlet and triplet spin configurations in the well of the spin impurity but not strong enough to prohibit hole-induced magnetic excitations to the singlet state. Despite the strong spin-hole correlations, the system exhibits spin-charge deconfinement allowing for long-range entanglement of the spatial and spin degrees of freedom.}, author = {Becker, J. M. and Koutentakis, Georgios and Schmelcher, P.}, issn = {2643-1564}, journal = {Physical Review Research}, number = {4}, publisher = {American Physical Society}, title = {{Spin-charge correlations in finite one-dimensional multiband Fermi systems}}, doi = {10.1103/PhysRevResearch.5.043039}, volume = {5}, year = {2023}, } @article{14659, abstract = {Understanding the response of Himalayan glaciers to global warming is vital because of their role as a water source for the Asian subcontinent. However, great uncertainties still exist on the climate drivers of past and present glacier changes across scales. Here, we analyse continuous hourly climate station data from a glacierized elevation (Pyramid station, Mount Everest) since 1994 together with other ground observations and climate reanalysis. We show that a decrease in maximum air temperature and precipitation occurred during the last three decades at Pyramid in response to global warming. Reanalysis data suggest a broader occurrence of this effect in the glacierized areas of the Himalaya. We hypothesize that the counterintuitive cooling is caused by enhanced sensible heat exchange and the associated increase in glacier katabatic wind, which draws cool air downward from higher elevations. The stronger katabatic winds have also lowered the elevation of local wind convergence, thereby diminishing precipitation in glacial areas and negatively affecting glacier mass balance. This local cooling may have partially preserved glaciers from melting and could help protect the periglacial environment.}, author = {Salerno, Franco and Guyennon, Nicolas and Yang, Kun and Shaw, Thomas and Lin, Changgui and Colombo, Nicola and Romano, Emanuele and Gruber, Stephan and Bolch, Tobias and Alessandri, Andrea and Cristofanelli, Paolo and Putero, Davide and Diolaiuti, Guglielmina and Tartari, Gianni and Verza, Gianpietro and Thakuri, Sudeep and Balsamo, Gianpaolo and Miles, Evan S. and Pellicciotti, Francesca}, issn = {1752-0908}, journal = {Nature Geoscience}, pages = {1120--1127}, publisher = {Springer Nature}, title = {{Local cooling and drying induced by Himalayan glaciers under global warming}}, doi = {10.1038/s41561-023-01331-y}, volume = {16}, year = {2023}, } @article{14660, abstract = {The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set 𝑆⊂ℝ𝑑, then there are at most 2𝑑 points of 𝑆 whose convex hull contains the origin in the interior. BĂĄrĂĄny, Katchalski,and Pach proved the following quantitative version of Steinitz’s theorem. Let 𝑄 be a convex polytope in ℝ𝑑 containing the standard Euclidean unit ball 𝐁𝑑. Then there exist at most 2𝑑 vertices of 𝑄 whose convex hull 𝑄â€Č satisfies 𝑟𝐁𝑑⊂𝑄â€Č with đ‘Ÿâ©Ÿđ‘‘âˆ’2𝑑. They conjectured that đ‘Ÿâ©Ÿđ‘đ‘‘âˆ’1∕2 holds with a universal constant 𝑐>0. We prove đ‘Ÿâ©Ÿ15𝑑2, the first polynomial lower bound on 𝑟. Furthermore, we show that 𝑟 is not greater than 2/√𝑑.}, author = {Ivanov, Grigory and NaszĂłdi, MĂĄrton}, issn = {1469-2120}, journal = {Bulletin of the London Mathematical Society}, publisher = {London Mathematical Society}, title = {{Quantitative Steinitz theorem: A polynomial bound}}, doi = {10.1112/blms.12965}, year = {2023}, } @article{14661, abstract = {This paper is concerned with equilibrium configurations of one-dimensional particle systems with non-convex nearest-neighbour and next-to-nearest-neighbour interactions and its passage to the continuum. The goal is to derive compactness results for a Γ-development of the energy with the novelty that external forces are allowed. In particular, the forces may depend on Lagrangian or Eulerian coordinates and thus may model dead as well as live loads. Our result is based on a new technique for deriving compactness results which are required for calculating the first-order Γ-limit in the presence of external forces: instead of comparing a configuration of n atoms to a global minimizer of the Γ-limit, we compare the configuration to a minimizer in some subclass of functions which in some sense are "close to" the configuration. The paper is complemented with the study of the minimizers of the Γ-limit.}, author = {Carioni, Marcello and Fischer, Julian L and Schlömerkemper, Anja}, issn = {2363-6394}, journal = {Journal of Convex Analysis}, number = {1}, pages = {217--247}, publisher = {Heldermann Verlag}, title = {{External forces in the continuum limit of discrete systems with non-convex interaction potentials: Compactness for a Γ-development}}, volume = {30}, year = {2023}, } @article{14662, abstract = {We consider a class of polaron models, including the Fröhlich model, at zero total momentum, and show that at sufficiently weak coupling there are no excited eigenvalues below the essential spectrum.}, author = {Seiringer, Robert}, issn = {1664-0403}, journal = {Journal of Spectral Theory}, number = {3}, pages = {1045--1055}, publisher = {EMS Press}, title = {{Absence of excited eigenvalues for Fröhlich type polaron models at weak coupling}}, doi = {10.4171/JST/469}, volume = {13}, year = {2023}, } @article{14663, abstract = {As a bottleneck in the direct synthesis of hydrogen peroxide, the development of an efficient palladium-based catalyst has garnered great attention. However, elusive active centers and reaction mechanism issues inhibit further optimization of its performance. In this work, advanced microkinetic modeling with the adsorbate–adsorbate interaction and nanoparticle size effect based on first-principles calculations is developed. A full mechanism uncovering the significance of adsorbate–adsorbate interaction is determined on Pd nanoparticles. We demonstrate unambiguously that Pd(100) with main coverage species of O2 and H is beneficial to H2O2 production, being consistent with experimental operando observation, while H2O forms on Pd(111) covered by O species and Pd(211) covered by O and OH species. Kinetic analyses further enable quantitative estimation of the influence of temperature, pressure, and particle size. Large-size Pd nanoparticles are found to achieve a high H2O2 reaction rate when the operating conditions are moderate temperature and higher oxygen partial pressure. We reveal that specific facets of the Pd nanoparticles are crucial factors for their selectivity and activity. Consistent with the experiment, the production of H2O2 is discovered to be more favorable on Pd nanoparticles containing Pd(100) facets. The ratio of H2/O2 induces substantial variations in the coverage of intermediates of O2 and H on Pd(100), resulting in a change in product selectivity.}, author = {Zhao, Jinyan and Yao, Zihao and Bunting, Rhys and Hu, P. and Wang, Jianguo}, issn = {2155-5435}, journal = {ACS Catalysis}, number = {22}, pages = {15054--15073}, publisher = {American Chemical Society}, title = {{Microkinetic modeling with size-dependent and adsorbate-adsorbate interactions for the direct synthesis of H₂O₂ over Pd nanoparticles}}, doi = {10.1021/acscatal.3c03893}, volume = {13}, year = {2023}, } @article{14664, abstract = {The architecture of self-assembled host molecules can profoundly affect the properties of the encapsulated guests. For example, a rigid cage with small windows can efficiently protect its contents from the environment; in contrast, tube-shaped, flexible hosts with large openings and an easily accessible cavity are ideally suited for catalysis. Here, we report a “Janus” nature of a Pd6L4 coordination host previously reported to exist exclusively as a tube isomer (T). We show that upon encapsulating various tetrahedrally shaped guests, T can reconfigure into a cage-shaped host (C) in quantitative yield. Extracting the guest affords empty C, which is metastable and spontaneously relaxes to T, and the T⇄C interconversion can be repeated for multiple cycles. Reversible toggling between two vastly different isomers paves the way toward controlling functional properties of coordination hosts “on demand”.}, author = {Hema, Kuntrapakam and Grommet, Angela B. and BiaƂek, MichaƂ J. and Wang, Jinhua and Schneider, Laura and Drechsler, Christoph and Yanshyna, Oksana and Diskin-Posner, Yael and Clever, Guido H. and Klajn, Rafal}, issn = {1520-5126}, journal = {Journal of the American Chemical Society}, number = {45}, pages = {24755--24764}, publisher = {American Chemical Society}, title = {{Guest encapsulation alters the thermodynamic landscape of a coordination host}}, doi = {10.1021/jacs.3c08666}, volume = {145}, year = {2023}, } @article{14665, abstract = {We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. For any N > 0 and L ∈ Z ≄2 , a multiple packing is a set C of points in R n such that any point in R n lies in the intersection of at most L - 1 balls of radius √ nN around points in C . This is a natural generalization of the sphere packing problem. We study the multiple packing problem for both bounded point sets whose points have norm at most √ nP for some constant P > 0, and unbounded point sets whose points are allowed to be anywhere in R n . Given a well-known connection with coding theory, multiple packings can be viewed as the Euclidean analog of list-decodable codes, which are well-studied over finite fields. We derive the best known lower bounds on the optimal multiple packing density. This is accomplished by establishing an inequality which relates the list-decoding error exponent for additive white Gaussian noise channels, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We also derive novel bounds on the list-decoding error exponent for infinite constellations and closed-form expressions for the list-decoding error exponents for the power-constrained AWGN channel, which may be of independent interest beyond multiple packing.}, author = {Zhang, Yihan and Vatedka, Shashank}, issn = {1557-9654}, journal = {IEEE Transactions on Information Theory}, publisher = {IEEE}, title = {{Multiple packing: Lower bounds via error exponents}}, doi = {10.1109/TIT.2023.3334032}, year = {2023}, } @article{14666, abstract = {So-called spontaneous activity is a central hallmark of most nervous systems. Such non-causal firing is contrary to the tenet of spikes as a means of communication, and its purpose remains unclear. We propose that self-initiated firing can serve as a release valve to protect neurons from the toxic conditions arising in mitochondria from lower-than-baseline energy consumption. To demonstrate the viability of our hypothesis, we built a set of models that incorporate recent experimental results indicating homeostatic control of metabolic products—Adenosine triphosphate (ATP), adenosine diphosphate (ADP), and reactive oxygen species (ROS)—by changes in firing. We explore the relationship of metabolic cost of spiking with its effect on the temporal patterning of spikes and reproduce experimentally observed changes in intrinsic firing in the fruitfly dorsal fan-shaped body neuron in a model with ROS-modulated potassium channels. We also show that metabolic spiking homeostasis can produce indefinitely sustained avalanche dynamics in cortical circuits. Our theory can account for key features of neuronal activity observed in many studies ranging from ion channel function all the way to resting state dynamics. We finish with a set of experimental predictions that would confirm an integrated, crucial role for metabolically regulated spiking and firmly link metabolic homeostasis and neuronal function.}, author = {Chintaluri, Chaitanya and Vogels, Tim P}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, number = {48}, publisher = {National Academy of Sciences}, title = {{Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species}}, doi = {10.1073/pnas.2306525120}, volume = {120}, year = {2023}, } @article{14667, abstract = {For large dimensional non-Hermitian random matrices X with real or complex independent, identically distributed, centered entries, we consider the fluctuations of f (X) as a matrix where f is an analytic function around the spectrum of X. We prove that for a generic bounded square matrix A, the quantity Tr f (X)A exhibits Gaussian fluctuations as the matrix size grows to infinity, which consists of two independent modes corresponding to the tracial and traceless parts of A. We find a new formula for the variance of the traceless part that involves the Frobenius norm of A and the L2-norm of f on the boundary of the limiting spectrum. }, author = {Erdös, LĂĄszlĂł and Ji, Hong Chang}, issn = {0246-0203}, journal = {Annales de l'institut Henri Poincare (B) Probability and Statistics}, number = {4}, pages = {2083--2105}, publisher = {Institute of Mathematical Statistics}, title = {{Functional CLT for non-Hermitian random matrices}}, doi = {10.1214/22-AIHP1304}, volume = {59}, year = {2023}, } @article{14683, abstract = {Mosaic analysis with double markers (MADM) technology enables the generation of genetic mosaic tissue in mice and high-resolution phenotyping at the individual cell level. Here, we present a protocol for isolating MADM-labeled cells with high yield for downstream molecular analyses using fluorescence-activated cell sorting (FACS). We describe steps for generating MADM-labeled mice, perfusion, single-cell suspension, and debris removal. We then detail procedures for cell sorting by FACS and downstream analysis. This protocol is suitable for embryonic to adult mice. For complete details on the use and execution of this protocol, please refer to Contreras et al. (2021).1}, author = {Amberg, Nicole and Cheung, Giselle T and Hippenmeyer, Simon}, issn = {2666-1667}, journal = {STAR Protocols}, keywords = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Neuroscience}, number = {1}, publisher = {Elsevier}, title = {{Protocol for sorting cells from mouse brains labeled with mosaic analysis with double markers by flow cytometry}}, doi = {10.1016/j.xpro.2023.102771}, volume = {5}, year = {2023}, } @article{14687, abstract = {The short history of research on Li-O2 batteries has seen a remarkable number of mechanistic U-turns over the years. From the initial use of carbonate electrolytes, that were then found to be entirely unsuitable, to the belief that (su)peroxide was solely responsible for degradation, before the more reactive singlet oxygen was found to form, to the hypothesis that capacity depends on a competing surface/solution mechanism before a practically exclusive solution mechanism was identified. Herein, we argue for an ever-fresh look at the reported data without bias towards supposedly established explanations. We explain how the latest findings on rate and capacity limits, as well as the origin of side reactions, are connected via the disproportionation (DISP) step in the (dis)charge mechanism. Therefrom, directions emerge for the design of electrolytes and mediators on how to suppress side reactions and to enable high rate and high reversible capacity.}, author = {Jethwa, Rajesh B and Mondal, Soumyadip and Pant, Bhargavi and Freunberger, Stefan Alexander}, issn = {1521-3773}, journal = {Angewandte Chemie International Edition}, keywords = {General Chemistry, Catalysis}, publisher = {Wiley}, title = {{To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries}}, doi = {10.1002/anie.202316476}, year = {2023}, } @article{14689, author = {Ing-Simmons, Elizabeth and Machnik, Nick N and Vaquerizas, Juan M.}, issn = {1546-1718}, journal = {Nature Genetics}, number = {12}, pages = {2053--2055}, publisher = {Springer Nature}, title = {{Reply to: Revisiting the use of structural similarity index in Hi-C}}, doi = {10.1038/s41588-023-01595-5}, volume = {55}, year = {2023}, } @article{14690, abstract = {Generalized multifractality characterizes system size dependence of pure scaling local observables at Anderson transitions in all 10 symmetry classes of disordered systems. Recently, the concept of generalized multifractality has been extended to boundaries of critical disordered noninteracting systems. Here we study the generalized boundary multifractality in the presence of electron-electron interaction, focusing on the spin quantum Hall symmetry class (class C). Employing the two-loop renormalization group analysis within the Finkel'stein nonlinear sigma model, we compute the anomalous dimensions of the pure scaling operators located at the boundary of the system. We find that generalized boundary multifractal exponents are twice larger than their bulk counterparts. Exact symmetry relations between generalized boundary multifractal exponents in the case of noninteracting systems are explicitly broken by the interaction.}, author = {Babkin, Serafim and Burmistrov, I}, issn = {2469-9969}, journal = {Physical Review B}, number = {20}, publisher = {American Physical Society}, title = {{Boundary multifractality in the spin quantum Hall symmetry class with interaction}}, doi = {10.1103/PhysRevB.108.205429}, volume = {108}, year = {2023}, } @inproceedings{14691, abstract = {Continuous Group-Key Agreement (CGKA) allows a group of users to maintain a shared key. It is the fundamental cryptographic primitive underlying group messaging schemes and related protocols, most notably TreeKEM, the underlying key agreement protocol of the Messaging Layer Security (MLS) protocol, a standard for group messaging by the IETF. CKGA works in an asynchronous setting where parties only occasionally must come online, and their messages are relayed by an untrusted server. The most expensive operation provided by CKGA is that which allows for a user to refresh their key material in order to achieve forward secrecy (old messages are secure when a user is compromised) and post-compromise security (users can heal from compromise). One caveat of early CGKA protocols is that these update operations had to be performed sequentially, with any user wanting to update their key material having had to receive and process all previous updates. Late versions of TreeKEM do allow for concurrent updates at the cost of a communication overhead per update message that is linear in the number of updating parties. This was shown to be indeed necessary when achieving PCS in just two rounds of communication by [Bienstock et al. TCC’20]. The recently proposed protocol CoCoA [Alwen et al. Eurocrypt’22], however, shows that this overhead can be reduced if PCS requirements are relaxed, and only a logarithmic number of rounds is required. The natural question, thus, is whether CoCoA is optimal in this setting. In this work we answer this question, providing a lower bound on the cost (concretely, the amount of data to be uploaded to the server) for CGKA protocols that heal in an arbitrary k number of rounds, that shows that CoCoA is very close to optimal. Additionally, we extend CoCoA to heal in an arbitrary number of rounds, and propose a modification of it, with a reduced communication cost for certain k. We prove our bound in a combinatorial setting where the state of the protocol progresses in rounds, and the state of the protocol in each round is captured by a set system, each set specifying a set of users who share a secret key. We show this combinatorial model is equivalent to a symbolic model capturing building blocks including PRFs and public-key encryption, related to the one used by Bienstock et al. Our lower bound is of order k‱n1+1/(k-1)/log(k), where 2≀k≀log(n) is the number of updates per user the protocol requires to heal. This generalizes the n2 bound for k=2 from Bienstock et al.. This bound almost matches the k⋅n1+2/(k-1) or k2⋅n1+1/(k-1) efficiency we get for the variants of the CoCoA protocol also introduced in this paper.}, author = {Auerbach, Benedikt and Cueto Noval, Miguel and Pascual Perez, Guillermo and Pietrzak, Krzysztof Z}, booktitle = {21st International Conference on Theory of Cryptography}, isbn = {9783031486203}, issn = {1611-3349}, location = {Taipei, Taiwan}, pages = {271--300}, publisher = {Springer Nature}, title = {{On the cost of post-compromise security in concurrent Continuous Group-Key Agreement}}, doi = {10.1007/978-3-031-48621-0_10}, volume = {14371}, year = {2023}, } @inproceedings{14692, abstract = {The generic-group model (GGM) aims to capture algorithms working over groups of prime order that only rely on the group operation, but do not exploit any additional structure given by the concrete implementation of the group. In it, it is possible to prove information-theoretic lower bounds on the hardness of problems like the discrete logarithm (DL) or computational Diffie-Hellman (CDH). Thus, since its introduction, it has served as a valuable tool to assess the concrete security provided by cryptographic schemes based on such problems. A work on the related algebraic-group model (AGM) introduced a method, used by many subsequent works, to adapt GGM lower bounds for one problem to another, by means of conceptually simple reductions. In this work, we propose an alternative approach to extend GGM bounds from one problem to another. Following an idea by Yun [EC15], we show that, in the GGM, the security of a large class of problems can be reduced to that of geometric search-problems. By reducing the security of the resulting geometric-search problems to variants of the search-by-hypersurface problem, for which information theoretic lower bounds exist, we give alternative proofs of several results that used the AGM approach. The main advantage of our approach is that our reduction from geometric search-problems works, as well, for the GGM with preprocessing (more precisely the bit-fixing GGM introduced by Coretti, Dodis and Guo [Crypto18]). As a consequence, this opens up the possibility of transferring preprocessing GGM bounds from one problem to another, also by means of simple reductions. Concretely, we prove novel preprocessing bounds on the hardness of the d-strong discrete logarithm, the d-strong Diffie-Hellman inversion, and multi-instance CDH problems, as well as a large class of Uber assumptions. Additionally, our approach applies to Shoup’s GGM without additional restrictions on the query behavior of the adversary, while the recent works of Zhang, Zhou, and Katz [AC22] and Zhandry [Crypto22] highlight that this is not the case for the AGM approach.}, author = {Auerbach, Benedikt and Hoffmann, Charlotte and Pascual Perez, Guillermo}, booktitle = {21st International Conference on Theory of Cryptography}, isbn = {9783031486203}, issn = {1611-3349}, pages = {301--330}, publisher = {Springer Nature}, title = {{Generic-group lower bounds via reductions between geometric-search problems: With and without preprocessing}}, doi = {10.1007/978-3-031-48621-0_11}, volume = {14371}, year = {2023}, } @inproceedings{14693, abstract = {Lucas sequences are constant-recursive integer sequences with a long history of applications in cryptography, both in the design of cryptographic schemes and cryptanalysis. In this work, we study the sequential hardness of computing Lucas sequences over an RSA modulus. First, we show that modular Lucas sequences are at least as sequentially hard as the classical delay function given by iterated modular squaring proposed by Rivest, Shamir, and Wagner (MIT Tech. Rep. 1996) in the context of time-lock puzzles. Moreover, there is no obvious reduction in the other direction, which suggests that the assumption of sequential hardness of modular Lucas sequences is strictly weaker than that of iterated modular squaring. In other words, the sequential hardness of modular Lucas sequences might hold even in the case of an algorithmic improvement violating the sequential hardness of iterated modular squaring. Second, we demonstrate the feasibility of constructing practically-efficient verifiable delay functions based on the sequential hardness of modular Lucas sequences. Our construction builds on the work of Pietrzak (ITCS 2019) by leveraging the intrinsic connection between the problem of computing modular Lucas sequences and exponentiation in an appropriate extension field.}, author = {Hoffmann, Charlotte and Hubáček, Pavel and Kamath, Chethan and Krƈåk, TomĂĄĆĄ}, booktitle = {21st International Conference on Theory of Cryptography}, isbn = {9783031486234}, issn = {1611-3349}, location = {Taipei, Taiwan}, pages = {336--362}, publisher = {Springer Nature}, title = {{(Verifiable) delay functions from Lucas sequences}}, doi = {10.1007/978-3-031-48624-1_13}, volume = {14372}, year = {2023}, } @phdthesis{14697, author = {Stopp, Julian A}, isbn = {978-3-99078-038-1}, issn = {2663 - 337X}, pages = {226}, publisher = {Institute of Science and Technology Austria}, title = {{Neutrophils on the hunt: Migratory strategies employed by neutrophils to fulfill their effector function}}, doi = {10.15479/at:ista:14697}, year = {2023}, } @article{14701, author = {Archer, Lynden A. and Bruce, Peter G. and Calvo, Ernesto J. and Dewar, Daniel and Ellison, James H. J. and Freunberger, Stefan Alexander and Gao, Xiangwen and Hardwick, Laurence J. and Horwitz, Gabriela and Janek, JĂŒrgen and Johnson, Lee R. and Jordan, Jack W. and Matsuda, Shoichi and Menkin, Svetlana and Mondal, Soumyadip and Qiu, Qianyuan and Samarakoon, Thukshan and Temprano, Israel and Uosaki, Kohei and Vailaya, Ganesh and Wachsman, Eric D. and Wu, Yiying and Ye, Shen}, issn = {1364-5498}, journal = {Faraday Discussions}, keywords = {Physical and Theoretical Chemistry}, publisher = {Royal Society of Chemistry}, title = {{Towards practical metal–oxygen batteries: General discussion}}, doi = {10.1039/d3fd90062b}, year = {2023}, } @article{14702, author = {Attard, Gary A. and Calvo, Ernesto J. and Curtiss, Larry A. and Dewar, Daniel and Ellison, James H. J. and Gao, Xiangwen and Grey, Clare P. and Hardwick, Laurence J. and Horwitz, Gabriela and Janek, Juergen and Johnson, Lee R. and Jordan, Jack W. and Matsuda, Shoichi and Mondal, Soumyadip and Neale, Alex R. and Ortiz-Vitoriano, Nagore and Temprano, Israel and Vailaya, Ganesh and Wachsman, Eric D. and Wang, Hsien-Hau and Wu, Yiying and Ye, Shen}, issn = {1364-5498}, journal = {Faraday Discussions}, keywords = {Physical and Theoretical Chemistry}, publisher = {Royal Society of Chemistry}, title = {{Materials for stable metal–oxygen battery cathodes: general discussion}}, doi = {10.1039/d3fd90059b}, year = {2023}, }