[{"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Ondracek, Anna S.","first_name":"Anna S.","last_name":"Ondracek","orcid":"0000-0001-7625-3651"},{"last_name":"Heiden","first_name":"Denise","full_name":"Heiden, Denise"},{"full_name":"Oostingh, Gertie J.","last_name":"Oostingh","first_name":"Gertie J."},{"full_name":"Fuerst, Elisabeth","last_name":"Fuerst","first_name":"Elisabeth"},{"full_name":"Fazekas-Singer, Judit","last_name":"Fazekas-Singer","orcid":"0000-0002-8777-3502","first_name":"Judit","id":"36432834-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Cornelia","last_name":"Bergmayr","full_name":"Bergmayr, Cornelia"},{"full_name":"Rohrhofer, Johanna","orcid":"0000-0002-2783-2099","last_name":"Rohrhofer","first_name":"Johanna"},{"full_name":"Jensen-Jarolim, Erika","first_name":"Erika","last_name":"Jensen-Jarolim","orcid":"0000-0003-4019-5765"},{"first_name":"Albert","last_name":"Duschl","orcid":"0000-0002-7034-9860","full_name":"Duschl, Albert"},{"full_name":"Untersmayr, Eva","first_name":"Eva","last_name":"Untersmayr","orcid":"0000-0002-1963-499X"}],"title":"Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model","publisher":"MDPI","publication_status":"published","_id":"8229","quality_controlled":"1","citation":{"short":"A.S. Ondracek, D. Heiden, G.J. Oostingh, E. Fuerst, J. Singer, C. Bergmayr, J. Rohrhofer, E. Jensen-Jarolim, A. Duschl, E. Untersmayr, Nutrients 11 (2019).","ista":"Ondracek AS, Heiden D, Oostingh GJ, Fuerst E, Singer J, Bergmayr C, Rohrhofer J, Jensen-Jarolim E, Duschl A, Untersmayr E. 2019. Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model. Nutrients. 11(10), 2463.","ieee":"A. S. Ondracek <i>et al.</i>, “Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model,” <i>Nutrients</i>, vol. 11, no. 10. MDPI, 2019.","ama":"Ondracek AS, Heiden D, Oostingh GJ, et al. Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model. <i>Nutrients</i>. 2019;11(10). doi:<a href=\"https://doi.org/10.3390/nu11102463\">10.3390/nu11102463</a>","chicago":"Ondracek, Anna S., Denise Heiden, Gertie J. Oostingh, Elisabeth Fuerst, Judit Singer, Cornelia Bergmayr, Johanna Rohrhofer, Erika Jensen-Jarolim, Albert Duschl, and Eva Untersmayr. “Immune Effects of the Nitrated Food Allergen Beta-Lactoglobulin in an Experimental Food Allergy Model.” <i>Nutrients</i>. MDPI, 2019. <a href=\"https://doi.org/10.3390/nu11102463\">https://doi.org/10.3390/nu11102463</a>.","apa":"Ondracek, A. S., Heiden, D., Oostingh, G. J., Fuerst, E., Singer, J., Bergmayr, C., … Untersmayr, E. (2019). Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model. <i>Nutrients</i>. MDPI. <a href=\"https://doi.org/10.3390/nu11102463\">https://doi.org/10.3390/nu11102463</a>","mla":"Ondracek, Anna S., et al. “Immune Effects of the Nitrated Food Allergen Beta-Lactoglobulin in an Experimental Food Allergy Model.” <i>Nutrients</i>, vol. 11, no. 10, 2463, MDPI, 2019, doi:<a href=\"https://doi.org/10.3390/nu11102463\">10.3390/nu11102463</a>."},"publication_identifier":{"issn":["2072-6643"]},"extern":"1","abstract":[{"text":"Food proteins may get nitrated by various exogenous or endogenous mechanisms. As individuals might get recurrently exposed to nitrated proteins via daily diet, we aimed to investigate the effect of repeatedly ingested nitrated food proteins on the subsequent immune response in non-allergic and allergic mice using the milk allergen beta-lactoglobulin (BLG) as model food protein in a mouse model. Evaluating the presence of nitrated proteins in food, we could detect 3-nitrotyrosine (3-NT) in extracts of different foods and in stomach content extracts of non-allergic mice under physiological conditions. Chemically nitrated BLG (BLGn) exhibited enhanced susceptibility to degradation in simulated gastric fluid experiments compared to untreated BLG (BLGu). Gavage of BLGn to non-allergic animals increased interferon-γ and interleukin-10 release of stimulated spleen cells and led to the formation of BLG-specific serum IgA. Allergic mice receiving three oral gavages of BLGn had higher levels of mouse mast cell protease-1 (mMCP-1) compared to allergic mice receiving BLGu. Regardless of the preceding immune status, non-allergic or allergic, repeatedly ingested nitrated food proteins seem to considerably influence the subsequent immune response.","lang":"eng"}],"type":"journal_article","year":"2019","date_updated":"2021-01-12T08:17:36Z","oa":1,"issue":"10","date_published":"2019-10-15T00:00:00Z","intvolume":"        11","month":"10","article_number":"2463","oa_version":"Published Version","publication":"Nutrients","doi":"10.3390/nu11102463","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3390/nu11102463"}],"date_created":"2020-08-10T11:51:04Z","status":"public","day":"15","volume":11},{"type":"journal_article","abstract":[{"text":"Background: The genus Streptococcus comprises pathogens that strongly influence the health of humans and animals. Genome sequencing of multiple Streptococcus strains demonstrated high variability in gene content and order even in closely related strains of the same species and created a newly emerged object for genomic analysis, the pan-genome. Here we analysed the genome evolution of 25 strains of Streptococcus suis, 50 strains of Streptococcus pyogenes and 28 strains of Streptococcus pneumoniae.\r\n\r\nResults: Fractions of the pan-genome, unique, periphery, and universal genes differ in size, functional composition, the level of nucleotide substitutions, and predisposition to horizontal gene transfer and genomic rearrangements. The density of substitutions in intergenic regions appears to be correlated with selection acting on adjacent genes, implying that more conserved genes tend to have more conserved regulatory regions.\r\nThe total pan-genome of the genus is open, but only due to strain-specific genes, whereas other pan-genome fractions reach saturation. We have identified the set of genes with phylogenies inconsistent with species and non-conserved location in the chromosome; these genes are rare in at least one species and have likely experienced recent horizontal transfer between species. The strain-specific fraction is enriched with mobile elements and hypothetical proteins, but also contains a number of candidate virulence-related genes, so it may have a strong impact on adaptability and pathogenicity.\r\nMapping the rearrangements to the phylogenetic tree revealed large parallel inversions in all species. A parallel inversion of length 15 kB with breakpoints formed by genes encoding surface antigen proteins PhtD and PhtB in S. pneumoniae leads to replacement of gene fragments that likely indicates the action of an antigen variation mechanism.\r\n\r\nConclusions: Members of genus Streptococcus have a highly dynamic, open pan-genome, that potentially confers them with the ability to adapt to changing environmental conditions, i.e. antibiotic resistance or transmission between different hosts. Hence, integrated analysis of all aspects of genome evolution is important for the identification of potential pathogens and design of drugs and vaccines.","lang":"eng"}],"extern":"1","publication_identifier":{"issn":["1471-2148"]},"citation":{"apa":"Shelyakin, P. V., Bochkareva, O., Karan, A. A., &#38; Gelfand, M. S. (2019). Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. <i>BMC Evolutionary Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1186/s12862-019-1403-6\">https://doi.org/10.1186/s12862-019-1403-6</a>","mla":"Shelyakin, Pavel V., et al. “Micro-Evolution of Three Streptococcus Species: Selection, Antigenic Variation, and Horizontal Gene Inflow.” <i>BMC Evolutionary Biology</i>, vol. 19, 83, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1186/s12862-019-1403-6\">10.1186/s12862-019-1403-6</a>.","ama":"Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. <i>BMC Evolutionary Biology</i>. 2019;19. doi:<a href=\"https://doi.org/10.1186/s12862-019-1403-6\">10.1186/s12862-019-1403-6</a>","ieee":"P. V. Shelyakin, O. Bochkareva, A. A. Karan, and M. S. Gelfand, “Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow,” <i>BMC Evolutionary Biology</i>, vol. 19. Springer Nature, 2019.","ista":"Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. 2019. Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. BMC Evolutionary Biology. 19, 83.","short":"P.V. Shelyakin, O. Bochkareva, A.A. Karan, M.S. Gelfand, BMC Evolutionary Biology 19 (2019).","chicago":"Shelyakin, Pavel V., Olga Bochkareva, Anna A. Karan, and Mikhail S. Gelfand. “Micro-Evolution of Three Streptococcus Species: Selection, Antigenic Variation, and Horizontal Gene Inflow.” <i>BMC Evolutionary Biology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1186/s12862-019-1403-6\">https://doi.org/10.1186/s12862-019-1403-6</a>."},"volume":19,"quality_controlled":"1","day":"27","status":"public","_id":"8263","date_created":"2020-08-15T11:04:07Z","main_file_link":[{"url":"https://doi.org/10.1186/s12862-019-1403-6","open_access":"1"}],"doi":"10.1186/s12862-019-1403-6","publication_status":"published","publication":"BMC Evolutionary Biology","oa_version":"Published Version","article_number":"83","publisher":"Springer Nature","month":"03","intvolume":"        19","date_published":"2019-03-27T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow","oa":1,"author":[{"last_name":"Shelyakin","orcid":"0000-0003-0120-9319","first_name":"Pavel V.","full_name":"Shelyakin, Pavel V."},{"first_name":"Olga","id":"C4558D3C-6102-11E9-A62E-F418E6697425","last_name":"Bochkareva","orcid":"0000-0003-1006-6639","full_name":"Bochkareva, Olga"},{"first_name":"Anna A.","last_name":"Karan","full_name":"Karan, Anna A."},{"last_name":"Gelfand","first_name":"Mikhail S.","full_name":"Gelfand, Mikhail S."}],"date_updated":"2023-02-23T13:28:54Z","article_processing_charge":"No","year":"2019","article_type":"original","language":[{"iso":"eng"}]},{"date_published":"2019-06-06T00:00:00Z","month":"06","article_number":"2019/676","date_updated":"2021-09-24T12:07:11Z","title":"Robust and scalable consensus for sharded distributed ledgers","author":[{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2019","extern":"1","citation":{"ista":"Kokoris Kogias E. Robust and scalable consensus for sharded distributed ledgers. Cryptology ePrint Archive, 2019/676.","ieee":"E. Kokoris Kogias, “Robust and scalable consensus for sharded distributed ledgers,” <i>Cryptology ePrint Archive</i>. .","short":"E. Kokoris Kogias, Cryptology EPrint Archive (n.d.).","ama":"Kokoris Kogias E. Robust and scalable consensus for sharded distributed ledgers. <i>Cryptology ePrint Archive</i>.","chicago":"Kokoris Kogias, Eleftherios. “Robust and Scalable Consensus for Sharded Distributed Ledgers.” <i>Cryptology EPrint Archive</i>, n.d.","apa":"Kokoris Kogias, E. (n.d.). Robust and scalable consensus for sharded distributed ledgers. <i>Cryptology ePrint Archive</i>.","mla":"Kokoris Kogias, Eleftherios. “Robust and Scalable Consensus for Sharded Distributed Ledgers.” <i>Cryptology EPrint Archive</i>, 2019/676."},"abstract":[{"text":"ByzCoin, a promising alternative of Bitcoin, is a scalable consensus protocol used as a building block of many research and enterprise-level decentralized systems. In this paper, we show that ByzCoin is unsuitable for deployment in an anopen, adversarial network and instead introduceMOTOR. MOTORis designed as a secure, robust, and scalable consensus suitable for permissionless sharded blockchains. MOTORachieves these properties by making four key design choices: (a) it prioritizes robustness in adversarial environments while maintaining adequate scalability, (b) it employees provably correct cryptography that resists DoS attacks from individual nodes, (c) it deploys unpredictable rotating leaders to defend against mildly-adaptive adversaries and prevents censorship, and (d) it creates an incentive compatible reward mechanism. These choices are materialized as (a) a “rotating subleader” communication pattern that balances the scalability needs with the robustness requirements under failures, (b) deployment of provable secure BLS multi-signatures, (c) use of deterministic thresh-old signatures as a source of randomness and (d) careful design of the reward allocation mechanism. We have implemented MOTORand compare it withByzCoin. We show that MOTORcan scale similar to ByzCoin with an at most2xoverhead whereas it maintains good performance even under high-percentage of faults, unlike ByzCoin.","lang":"eng"}],"type":"preprint","_id":"8303","date_created":"2020-08-26T12:13:56Z","day":"06","status":"public","publication":"Cryptology ePrint Archive","main_file_link":[{"url":"https://eprint.iacr.org/2019/676","open_access":"1"}],"publication_status":"submitted","oa_version":"Preprint"},{"publication_status":"submitted","main_file_link":[{"url":"https://eprint.iacr.org/2019/1128 ","open_access":"1"}],"publication":"Cryptology ePrint Archive","oa_version":"Preprint","type":"preprint","abstract":[{"text":"Enabling secure communication across distributed systems is usually studied under the assumption of trust between the different systems and an external adversary trying to compromise the messages. With the appearance of distributed ledgers or blockchains, numerous protocols have emerged, which attempt to achieve trustless communication between distrusting ledgers and participants. Cross-chain communication (CCC) thereby plays a fundamental role in cryptocurrency exchanges, sharding, bootstrapping of new and feature-extension of existing distributed ledgers. Unfortunately, existing proposals are designed ad-hoc for specific use-cases, making it hard to gain confidence on their correctness and composability.\r\nWe provide the first systematic exposition of protocols for CCC. First, we formalize the underlying research problem and show that CCC is impossible without a trusted third party, contrary to common beliefs in the blockchain community. We then develop a framework to evaluate existing and to design new cross-chain protocols. The framework is based on the use case, the trust model, and the security assumptions of interlinked blockchains. Finally, we identify security and privacy challenges faced by protocols in the cross-chain setting.\r\nThis Systematization of Knowledge (SoK) offers a comprehensive guide for designing protocols bridging the numerous distributed ledgers available today. It aims to facilitate clearer communication between academia and industry in the field.","lang":"eng"}],"citation":{"apa":"Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez, P., Kiayias, A., &#38; Knottenbelt, W. J. (n.d.). SoK: Communication across distributed ledgers. <i>Cryptology ePrint Archive</i>.","mla":"Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.” <i>Cryptology EPrint Archive</i>, 2019/1128.","ama":"Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed ledgers. <i>Cryptology ePrint Archive</i>.","ieee":"A. Zamyatin <i>et al.</i>, “SoK: Communication across distributed ledgers,” <i>Cryptology ePrint Archive</i>. .","short":"A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez, A. Kiayias, W.J. Knottenbelt, Cryptology EPrint Archive (n.d.).","ista":"Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias A, Knottenbelt WJ. SoK: Communication across distributed ledgers. Cryptology ePrint Archive, 2019/1128.","chicago":"Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK: Communication across Distributed Ledgers.” <i>Cryptology EPrint Archive</i>, n.d."},"extern":"1","day":"01","status":"public","date_created":"2020-08-26T12:16:38Z","_id":"8304","article_processing_charge":"No","year":"2019","language":[{"iso":"eng"}],"article_number":"2019/1128","month":"10","date_published":"2019-10-01T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Zamyatin, Alexei","first_name":"Alexei","last_name":"Zamyatin"},{"first_name":"Mustafa","last_name":"Al-Bassam","full_name":"Al-Bassam, Mustafa"},{"full_name":"Zindros, Dionysis","last_name":"Zindros","first_name":"Dionysis"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias"},{"last_name":"Moreno-Sanchez","first_name":"Pedro","full_name":"Moreno-Sanchez, Pedro"},{"last_name":"Kiayias","first_name":"Aggelos","full_name":"Kiayias, Aggelos"},{"first_name":"William J.","last_name":"Knottenbelt","full_name":"Knottenbelt, William J."}],"title":"SoK: Communication across distributed ledgers","oa":1,"date_updated":"2021-09-24T12:08:14Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"full_name":"KOKORIS KOGIAS, Eleftherios","last_name":"KOKORIS KOGIAS","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"},{"first_name":"Alexander","last_name":"Spiegelman","full_name":"Spiegelman, Alexander"},{"full_name":"Malkhi, Dahlia","last_name":"Malkhi","first_name":"Dahlia"},{"first_name":"Ittai","last_name":"Abraham","full_name":"Abraham, Ittai"}],"title":"Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation","date_updated":"2023-05-10T09:27:54Z","article_number":"2019/1015","date_published":"2019-09-10T00:00:00Z","month":"09","year":"2019","language":[{"iso":"eng"}],"article_processing_charge":"No","status":"public","day":"10","date_created":"2020-08-26T12:18:00Z","_id":"8305","abstract":[{"text":"In this paper, we present the first fully asynchronous distributed key generation (ADKG) algorithm as well as the first distributed key generation algorithm that can create keys with a dual (f,2f+1)−threshold that are necessary for scalable consensus (which so far needs a trusted dealer assumption). In order to create a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds f+1<k≤2f+1, which is of independent interest. Our High-threshold-AVSS (HAVSS) uses an asymmetric bi-variate polynomial, where the secret shared is hidden from any set of k nodes but an honest node that did not participate in the sharing phase can still recover his share with only n−2f shares, hence be able to contribute in the secret reconstruction. Another building block for ADKG is a novel Eventually Perfect Common Coin (EPCC) abstraction and protocol that enables the participants to create a common coin that might fail to agree at most f+1 times (even if invoked a polynomial number of times). Using EPCC we implement an Eventually Efficient Asynchronous Binary Agreement (EEABA) in which each instance takes O(n2) bits and O(1) rounds in expectation, except for at most f+1 instances which may take O(n4) bits and O(n) rounds in total. Using EEABA we construct the first fully Asynchronous Distributed Key Generation (ADKG) which has the same overhead and expected runtime as the best partially-synchronous DKG (O(n4) words, O(n) rounds). As a corollary of our ADKG we can also create the first Validated Asynchronous Byzantine Agreement (VABA) in the authenticated setting that does not need a trusted dealer to setup threshold signatures of degree n−f. Our VABA has an overhead of expected O(n2) words and O(1) time per instance after an initial O(n4) words and O(n) time bootstrap via ADKG.","lang":"eng"}],"type":"preprint","citation":{"ama":"Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation. <i>Cryptology ePrint Archive</i>.","short":"E. Kokoris Kogias, A. Spiegelman, D. Malkhi, I. Abraham, Cryptology EPrint Archive (n.d.).","ieee":"E. Kokoris Kogias, A. Spiegelman, D. Malkhi, and I. Abraham, “Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation,” <i>Cryptology ePrint Archive</i>. .","ista":"Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation. Cryptology ePrint Archive, 2019/1015.","chicago":"Kokoris Kogias, Eleftherios, Alexander Spiegelman, Dahlia Malkhi, and Ittai Abraham. “Bootstrapping Consensus without Trusted Setup: Fully Asynchronous Distributed Key Generation.” <i>Cryptology EPrint Archive</i>, n.d.","apa":"Kokoris Kogias, E., Spiegelman, A., Malkhi, D., &#38; Abraham, I. (n.d.). Bootstrapping consensus without trusted setup: fully asynchronous distributed key generation. <i>Cryptology ePrint Archive</i>.","mla":"Kokoris Kogias, Eleftherios, et al. “Bootstrapping Consensus without Trusted Setup: Fully Asynchronous Distributed Key Generation.” <i>Cryptology EPrint Archive</i>, 2019/1015."},"oa_version":"Preprint","publication":"Cryptology ePrint Archive","main_file_link":[{"url":"https://eprint.iacr.org/2019/1015","open_access":"1"}],"publication_status":"submitted"},{"_id":"8311","date_created":"2020-08-27T11:22:24Z","supervisor":[{"first_name":"Bryan Alexander","last_name":"Ford","full_name":"Ford, Bryan Alexander"}],"status":"public","day":"27","citation":{"ama":"Kokoris Kogias E. Secure, confidential blockchains providing high throughput and low latency. 2019. doi:<a href=\"https://doi.org/10.5075/epfl-thesis-7101\">10.5075/epfl-thesis-7101</a>","ieee":"E. Kokoris Kogias, “Secure, confidential blockchains providing high throughput and low latency,” École Polytechnique Fédérale de Lausanne, 2019.","short":"E. Kokoris Kogias, Secure, Confidential Blockchains Providing High Throughput and Low Latency, École Polytechnique Fédérale de Lausanne, 2019.","ista":"Kokoris Kogias E. 2019. Secure, confidential blockchains providing high throughput and low latency. École Polytechnique Fédérale de Lausanne.","chicago":"Kokoris Kogias, Eleftherios. “Secure, Confidential Blockchains Providing High Throughput and Low Latency.” École Polytechnique Fédérale de Lausanne, 2019. <a href=\"https://doi.org/10.5075/epfl-thesis-7101\">https://doi.org/10.5075/epfl-thesis-7101</a>.","apa":"Kokoris Kogias, E. (2019). <i>Secure, confidential blockchains providing high throughput and low latency</i>. École Polytechnique Fédérale de Lausanne. <a href=\"https://doi.org/10.5075/epfl-thesis-7101\">https://doi.org/10.5075/epfl-thesis-7101</a>","mla":"Kokoris Kogias, Eleftherios. <i>Secure, Confidential Blockchains Providing High Throughput and Low Latency</i>. École Polytechnique Fédérale de Lausanne, 2019, doi:<a href=\"https://doi.org/10.5075/epfl-thesis-7101\">10.5075/epfl-thesis-7101</a>."},"extern":"1","type":"dissertation","abstract":[{"text":"One of the core promises of blockchain technology is that of enabling trustworthy data dissemination in a trustless environment. What current blockchain systems deliver, however, is slow dissemination of public data, rendering blockchain technology unusable in settings where latency, transaction capacity, or data confidentiality are important. In this thesis we focus on providing solutions on two of the most pressing problems blockchain technology currently faces: scalability and data confidentiality. To address the scalability issue, we present OMNILEDGER, a novel scale-out distributed ledger that preserves long-term security under permissionless operation. It ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient cross-shard commit protocol that atomically handles transactions affecting multiple shards. To enable secure sharing of confidential data we present CALYPSO, the first fully decentralized, auditable access-control framework for secure blockchain-based data sharing which builds upon two abstractions. First, on-chain secrets enable collective management of (verifiably shared) secrets under a Byzantine adversary where an access-control blockchain enforces user-specific access rules and a secret-management cothority administers encrypted data. Second, skipchain-based identity and access management enables efficient administration of dynamic, sovereign identities and access policies and, in particular, permits clients to maintain long-term relationships with respect to evolving user identities thanks to the trust-delegating forward links of skipchains. In order to build OMNILEDGER and CALYPSO, we first build a set of tools for efficient decentralization, which are presented in Part II of this dissertation. These tools can be used in decentralized and distributed systems to achieve (1) scalable consensus (BYZCOIN), (2) bias- resistant distributed randomness creations (RANDHOUND), and (3) relationship-keeping between independently updating communication endpoints (SKIPCHAINIAC). Although we use this tools in the scope off this thesis, they can be (and already have been) used in a far wider scope.","lang":"eng"}],"oa_version":"Published Version","degree_awarded":"PhD","doi":"10.5075/epfl-thesis-7101","main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.5075/epfl-thesis-7101"}],"publication_status":"published","date_updated":"2021-12-20T15:30:47Z","author":[{"first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Secure, confidential blockchains providing high throughput and low latency","oa":1,"month":"09","date_published":"2019-09-27T00:00:00Z","publisher":"École Polytechnique Fédérale de Lausanne","language":[{"iso":"eng"}],"year":"2019","article_processing_charge":"No","page":"244"},{"date_updated":"2022-01-05T14:00:32Z","publication_date":"2019-08-22","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Methods and systems for secure data exchange","author":[{"first_name":"Bryan","last_name":"Ford","full_name":"Ford, Bryan"},{"full_name":"Gasser, Linus","last_name":"Gasser","first_name":"Linus"},{"full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"},{"full_name":"Janovic, Philipp","last_name":"Janovic","first_name":"Philipp"}],"month":"08","date_published":"2019-08-22T00:00:00Z","year":"2019","article_processing_charge":"No","ipc":"G06F21/62 ; H04L9/08 ; H04L9/32","_id":"8313","date_created":"2020-08-27T11:24:44Z","status":"public","day":"22","citation":{"apa":"Ford, B., Gasser, L., Kokoris Kogias, E., &#38; Janovic, P. (2019). Methods and systems for secure data exchange.","mla":"Ford, Bryan, et al. <i>Methods and Systems for Secure Data Exchange</i>. 2019.","ama":"Ford B, Gasser L, Kokoris Kogias E, Janovic P. Methods and systems for secure data exchange. 2019.","short":"B. Ford, L. Gasser, E. Kokoris Kogias, P. Janovic, (2019).","ista":"Ford B, Gasser L, Kokoris Kogias E, Janovic P. 2019. Methods and systems for secure data exchange.","ieee":"B. Ford, L. Gasser, E. Kokoris Kogias, and P. Janovic, “Methods and systems for secure data exchange.” 2019.","chicago":"Ford, Bryan, Linus Gasser, Eleftherios Kokoris Kogias, and Philipp Janovic. “Methods and Systems for Secure Data Exchange,” 2019."},"extern":"1","type":"patent","abstract":[{"text":"The present invention concerns a computer-implemented method for secure data exchange between a sender (A) and a recipient (B), wherein the method is performed by the sender (A) and comprises encrypting data using a symmetric key k, creating a write transaction T W , wherein the write transaction T W comprises information usable to derive the symmetric key k and an access policy identifying the recipient (B) as being allowed to decrypt the encrypted data, providing the recipient (B) access to the encrypted data, and sending the write transaction T W to a first group of servers (AC) for being stored in a blockchain data structure maintained by the first group of servers (AC).","lang":"eng"}],"ipn":"WO2019158209 (A1)","oa_version":"Published Version","applicant":["École Polytechnique Fédérale De Lausanne "],"main_file_link":[{"open_access":"1","url":"https://patents.google.com/patent/WO2019158209A1"}]},{"oa":1,"author":[{"full_name":"Avarikioti, Georgia","last_name":"Avarikioti","first_name":"Georgia"},{"last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Wattenhofer, Roger","last_name":"Wattenhofer","first_name":"Roger"},{"full_name":"Zindros, Dionysis","first_name":"Dionysis","last_name":"Zindros"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Brick: Asynchronous payment channels","date_updated":"2021-01-12T08:18:04Z","article_number":"1905.11360","month":"05","date_published":"2019-05-27T00:00:00Z","year":"2019","language":[{"iso":"eng"}],"article_processing_charge":"No","external_id":{"arxiv":["1905.11360"]},"status":"public","day":"27","_id":"8314","date_created":"2020-08-27T11:36:54Z","type":"preprint","arxiv":1,"abstract":[{"lang":"eng","text":"Off-chain protocols (channels) are a promising solution to the scalability and privacy challenges of blockchain payments. Current proposals, however, require synchrony assumptions to preserve the safety of a channel, leaking to an adversary the exact amount of time needed to control the network for a successful attack. In this paper, we introduce Brick, the first payment channel that remains secure under network asynchrony and concurrently provides correct incentives. The core idea is to incorporate the conflict resolution process within the channel by introducing a rational committee of external parties, called Wardens. Hence, if a party wants to close a channel unilaterally, it can only get the committee's approval for the last valid state. Brick provides sub-second latency because it does not employ heavy-weight consensus. Instead,\r\nBrick uses consistent broadcast to announce updates and close the channel, a light-weight abstraction that is powerful enough to preserve safety and liveness to any rational parties. Furthermore, we consider permissioned blockchains, where the additional property of auditability might be desired for regulatory purposes. We introduce Brick+, an off-chain construction that provides auditability on top of Brick without conflicting with its privacy guarantees. We formally define the properties our payment channel construction should fulfill, and prove that both Brick and Brick+ satisfy them. We also design incentives for Brick such that honest and rational behavior aligns. Finally, we provide a reference implementation of the smart contracts in Solidity."}],"extern":"1","citation":{"mla":"Avarikioti, Georgia, et al. “Brick: Asynchronous Payment Channels.” <i>ArXiv</i>, 1905.11360.","apa":"Avarikioti, G., Kokoris Kogias, E., Wattenhofer, R., &#38; Zindros, D. (n.d.). Brick: Asynchronous payment channels. <i>arXiv</i>.","chicago":"Avarikioti, Georgia, Eleftherios Kokoris Kogias, Roger Wattenhofer, and Dionysis Zindros. “Brick: Asynchronous Payment Channels.” <i>ArXiv</i>, n.d.","ama":"Avarikioti G, Kokoris Kogias E, Wattenhofer R, Zindros D. Brick: Asynchronous payment channels. <i>arXiv</i>.","ieee":"G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, and D. Zindros, “Brick: Asynchronous payment channels,” <i>arXiv</i>. .","short":"G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, D. Zindros, ArXiv (n.d.).","ista":"Avarikioti G, Kokoris Kogias E, Wattenhofer R, Zindros D. Brick: Asynchronous payment channels. arXiv, 1905.11360."},"oa_version":"Preprint","publication_status":"submitted","main_file_link":[{"url":"https://arxiv.org/abs/1905.11360","open_access":"1"}],"publication":"arXiv"},{"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1910.10434","open_access":"1"}],"publication_status":"submitted","publication":"arXiv","status":"public","day":"23","date_created":"2020-08-27T11:37:43Z","_id":"8315","type":"preprint","abstract":[{"text":"Sharding distributed ledgers is the most promising on-chain solution for scaling blockchain technology. In this work, we define and analyze the properties a sharded distributed ledger should fulfill. More specifically, we show that a sharded blockchain cannot be scalable under a fully adaptive adversary, but it can scale up to $O(n/\\log n)$ under an epoch-adaptive adversary. This is possible only if the distributed ledger creates succinct proofs of the valid state updates at the end of each epoch. Our model builds upon and extends the Bitcoin backbone protocol by defining consistency and\r\nscalability. Consistency encompasses the need for atomic execution of cross-shard transactions to preserve safety, whereas scalability encapsulates the speedup a sharded system can gain in comparison to a non-sharded system. In\r\norder to show the power of our framework, we analyze the most prominent sharded blockchains and either prove their correctness (OmniLedger, RapidChain) under our model or pinpoint where they fail to balance the consistency and\r\nscalability requirements (Elastico, Monoxide). ","lang":"eng"}],"arxiv":1,"citation":{"apa":"Avarikioti, G., Kokoris Kogias, E., &#38; Wattenhofer, R. (n.d.). Divide and scale: Formalization of distributed ledger sharding protocols. <i>arXiv</i>.","mla":"Avarikioti, Georgia, et al. “Divide and Scale: Formalization of Distributed Ledger Sharding Protocols.” <i>ArXiv</i>, 1910.10434.","ama":"Avarikioti G, Kokoris Kogias E, Wattenhofer R. Divide and scale: Formalization of distributed ledger sharding protocols. <i>arXiv</i>.","short":"G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, ArXiv (n.d.).","ista":"Avarikioti G, Kokoris Kogias E, Wattenhofer R. Divide and scale: Formalization of distributed ledger sharding protocols. arXiv, 1910.10434.","ieee":"G. Avarikioti, E. Kokoris Kogias, and R. Wattenhofer, “Divide and scale: Formalization of distributed ledger sharding protocols,” <i>arXiv</i>. .","chicago":"Avarikioti, Georgia, Eleftherios Kokoris Kogias, and Roger Wattenhofer. “Divide and Scale: Formalization of Distributed Ledger Sharding Protocols.” <i>ArXiv</i>, n.d."},"extern":"1","year":"2019","language":[{"iso":"eng"}],"article_processing_charge":"No","external_id":{"arxiv":["1910.10434"]},"author":[{"full_name":"Avarikioti, Georgia","last_name":"Avarikioti","first_name":"Georgia"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias"},{"full_name":"Wattenhofer, Roger","first_name":"Roger","last_name":"Wattenhofer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Divide and scale: Formalization of distributed ledger sharding protocols","oa":1,"date_updated":"2021-01-12T08:18:05Z","article_number":"1910.10434","month":"10","date_published":"2019-10-23T00:00:00Z"},{"volume":10,"pmid":1,"status":"public","day":"19","date_created":"2020-09-17T10:28:25Z","publication":"Nature Communications","doi":"10.1038/s41467-019-10490-9","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41467-019-10490-9"}],"oa_version":"Published Version","article_number":"2697","date_published":"2019-06-19T00:00:00Z","month":"06","intvolume":"        10","oa":1,"keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"date_updated":"2021-01-12T08:19:03Z","external_id":{"pmid":["31217444"]},"year":"2019","abstract":[{"text":"Atomic-resolution structure determination is crucial for understanding protein function. Cryo-EM and NMR spectroscopy both provide structural information, but currently cryo-EM does not routinely give access to atomic-level structural data, and, generally, NMR structure determination is restricted to small (<30 kDa) proteins. We introduce an integrated structure determination approach that simultaneously uses NMR and EM data to overcome the limits of each of these methods. The approach enables structure determination of the 468 kDa large dodecameric aminopeptidase TET2 to a precision and accuracy below 1 Å by combining secondary-structure information obtained from near-complete magic-angle-spinning NMR assignments of the 39 kDa-large subunits, distance restraints from backbone amides and ILV methyl groups, and a 4.1 Å resolution EM map. The resulting structure exceeds current standards of NMR and EM structure determination in terms of molecular weight and precision. Importantly, the approach is successful even in cases where only medium-resolution cryo-EM data are available.","lang":"eng"}],"type":"journal_article","publication_identifier":{"issn":["2041-1723"]},"citation":{"short":"D.F. Gauto, L.F. Estrozi, C.D. Schwieters, G. Effantin, P. Macek, R. Sounier, A.C. Sivertsen, E. Schmidt, R. Kerfah, G. Mas, J.-P. Colletier, P. Güntert, A. Favier, G. Schoehn, P. Schanda, J. Boisbouvier, Nature Communications 10 (2019).","ieee":"D. F. Gauto <i>et al.</i>, “Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex,” <i>Nature Communications</i>, vol. 10. Springer Nature, 2019.","ista":"Gauto DF, Estrozi LF, Schwieters CD, Effantin G, Macek P, Sounier R, Sivertsen AC, Schmidt E, Kerfah R, Mas G, Colletier J-P, Güntert P, Favier A, Schoehn G, Schanda P, Boisbouvier J. 2019. Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex. Nature Communications. 10, 2697.","ama":"Gauto DF, Estrozi LF, Schwieters CD, et al. Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex. <i>Nature Communications</i>. 2019;10. doi:<a href=\"https://doi.org/10.1038/s41467-019-10490-9\">10.1038/s41467-019-10490-9</a>","chicago":"Gauto, Diego F., Leandro F. Estrozi, Charles D. Schwieters, Gregory Effantin, Pavel Macek, Remy Sounier, Astrid C. Sivertsen, et al. “Integrated NMR and Cryo-EM Atomic-Resolution Structure Determination of a Half-Megadalton Enzyme Complex.” <i>Nature Communications</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41467-019-10490-9\">https://doi.org/10.1038/s41467-019-10490-9</a>.","apa":"Gauto, D. F., Estrozi, L. F., Schwieters, C. D., Effantin, G., Macek, P., Sounier, R., … Boisbouvier, J. (2019). Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-019-10490-9\">https://doi.org/10.1038/s41467-019-10490-9</a>","mla":"Gauto, Diego F., et al. “Integrated NMR and Cryo-EM Atomic-Resolution Structure Determination of a Half-Megadalton Enzyme Complex.” <i>Nature Communications</i>, vol. 10, 2697, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1038/s41467-019-10490-9\">10.1038/s41467-019-10490-9</a>."},"extern":"1","quality_controlled":"1","_id":"8405","publication_status":"published","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex","author":[{"first_name":"Diego F.","last_name":"Gauto","full_name":"Gauto, Diego F."},{"full_name":"Estrozi, Leandro F.","first_name":"Leandro F.","last_name":"Estrozi"},{"full_name":"Schwieters, Charles D.","first_name":"Charles D.","last_name":"Schwieters"},{"full_name":"Effantin, Gregory","first_name":"Gregory","last_name":"Effantin"},{"first_name":"Pavel","last_name":"Macek","full_name":"Macek, Pavel"},{"first_name":"Remy","last_name":"Sounier","full_name":"Sounier, Remy"},{"last_name":"Sivertsen","first_name":"Astrid C.","full_name":"Sivertsen, Astrid C."},{"full_name":"Schmidt, Elena","first_name":"Elena","last_name":"Schmidt"},{"last_name":"Kerfah","first_name":"Rime","full_name":"Kerfah, Rime"},{"last_name":"Mas","first_name":"Guillaume","full_name":"Mas, Guillaume"},{"full_name":"Colletier, Jacques-Philippe","first_name":"Jacques-Philippe","last_name":"Colletier"},{"last_name":"Güntert","first_name":"Peter","full_name":"Güntert, Peter"},{"full_name":"Favier, Adrien","last_name":"Favier","first_name":"Adrien"},{"full_name":"Schoehn, Guy","last_name":"Schoehn","first_name":"Guy"},{"full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"},{"last_name":"Boisbouvier","first_name":"Jerome","full_name":"Boisbouvier, Jerome"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}]},{"publisher":"American Association for the Advancement of Science","title":"Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors","author":[{"full_name":"Felix, Jan","first_name":"Jan","last_name":"Felix"},{"full_name":"Weinhäupl, Katharina","last_name":"Weinhäupl","first_name":"Katharina"},{"first_name":"Christophe","last_name":"Chipot","full_name":"Chipot, Christophe"},{"last_name":"Dehez","first_name":"François","full_name":"Dehez, François"},{"last_name":"Hessel","first_name":"Audrey","full_name":"Hessel, Audrey"},{"full_name":"Gauto, Diego F.","last_name":"Gauto","first_name":"Diego F."},{"last_name":"Morlot","first_name":"Cecile","full_name":"Morlot, Cecile"},{"full_name":"Abian, Olga","first_name":"Olga","last_name":"Abian"},{"first_name":"Irina","last_name":"Gutsche","full_name":"Gutsche, Irina"},{"full_name":"Velazquez-Campoy, Adrian","first_name":"Adrian","last_name":"Velazquez-Campoy"},{"last_name":"Schanda","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","full_name":"Schanda, Paul"},{"last_name":"Fraga","first_name":"Hugo","full_name":"Fraga, Hugo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Coordinated conformational transitions in oligomeric enzymatic complexes modulate function in response to substrates and play a crucial role in enzyme inhibition and activation. Caseinolytic protease (ClpP) is a tetradecameric complex, which has emerged as a drug target against multiple pathogenic bacteria. Activation of different ClpPs by inhibitors has been independently reported from drug development efforts, but no rationale for inhibitor-induced activation has been hitherto proposed. Using an integrated approach that includes x-ray crystallography, solid- and solution-state nuclear magnetic resonance, molecular dynamics simulations, and isothermal titration calorimetry, we show that the proteasome inhibitor bortezomib binds to the ClpP active-site serine, mimicking a peptide substrate, and induces a concerted allosteric activation of the complex. The bortezomib-activated conformation also exhibits a higher affinity for its cognate unfoldase ClpX. We propose a universal allosteric mechanism, where substrate binding to a single subunit locks ClpP into an active conformation optimized for chaperone association and protein processive degradation."}],"extern":"1","citation":{"apa":"Felix, J., Weinhäupl, K., Chipot, C., Dehez, F., Hessel, A., Gauto, D. F., … Fraga, H. (2019). Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.aaw3818\">https://doi.org/10.1126/sciadv.aaw3818</a>","mla":"Felix, Jan, et al. “Mechanism of the Allosteric Activation of the ClpP Protease Machinery by Substrates and Active-Site Inhibitors.” <i>Science Advances</i>, vol. 5, no. 9, eaaw3818, American Association for the Advancement of Science, 2019, doi:<a href=\"https://doi.org/10.1126/sciadv.aaw3818\">10.1126/sciadv.aaw3818</a>.","ista":"Felix J, Weinhäupl K, Chipot C, Dehez F, Hessel A, Gauto DF, Morlot C, Abian O, Gutsche I, Velazquez-Campoy A, Schanda P, Fraga H. 2019. Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors. Science Advances. 5(9), eaaw3818.","short":"J. Felix, K. Weinhäupl, C. Chipot, F. Dehez, A. Hessel, D.F. Gauto, C. Morlot, O. Abian, I. Gutsche, A. Velazquez-Campoy, P. Schanda, H. Fraga, Science Advances 5 (2019).","ieee":"J. Felix <i>et al.</i>, “Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors,” <i>Science Advances</i>, vol. 5, no. 9. American Association for the Advancement of Science, 2019.","ama":"Felix J, Weinhäupl K, Chipot C, et al. Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors. <i>Science Advances</i>. 2019;5(9). doi:<a href=\"https://doi.org/10.1126/sciadv.aaw3818\">10.1126/sciadv.aaw3818</a>","chicago":"Felix, Jan, Katharina Weinhäupl, Christophe Chipot, François Dehez, Audrey Hessel, Diego F. Gauto, Cecile Morlot, et al. “Mechanism of the Allosteric Activation of the ClpP Protease Machinery by Substrates and Active-Site Inhibitors.” <i>Science Advances</i>. American Association for the Advancement of Science, 2019. <a href=\"https://doi.org/10.1126/sciadv.aaw3818\">https://doi.org/10.1126/sciadv.aaw3818</a>."},"publication_identifier":{"issn":["2375-2548"]},"quality_controlled":"1","_id":"8406","publication_status":"published","article_number":"eaaw3818","intvolume":"         5","month":"09","date_published":"2019-09-04T00:00:00Z","issue":"9","oa":1,"date_updated":"2021-01-12T08:19:03Z","year":"2019","volume":5,"day":"04","status":"public","date_created":"2020-09-17T10:28:36Z","main_file_link":[{"url":" https://doi.org/10.1126/sciadv.aaw3818","open_access":"1"}],"doi":"10.1126/sciadv.aaw3818","publication":"Science Advances","oa_version":"Published Version"},{"publication_status":"published","publication_identifier":{"issn":["1439-4235"]},"extern":"1","citation":{"apa":"Schanda, P., &#38; Chekmenev, E. Y. (2019). NMR for Biological Systems. <i>ChemPhysChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cphc.201801100\">https://doi.org/10.1002/cphc.201801100</a>","mla":"Schanda, Paul, and Eduard Y. Chekmenev. “NMR for Biological Systems.” <i>ChemPhysChem</i>, vol. 20, no. 2, Wiley, 2019, pp. 177–177, doi:<a href=\"https://doi.org/10.1002/cphc.201801100\">10.1002/cphc.201801100</a>.","ieee":"P. Schanda and E. Y. Chekmenev, “NMR for Biological Systems,” <i>ChemPhysChem</i>, vol. 20, no. 2. Wiley, pp. 177–177, 2019.","ista":"Schanda P, Chekmenev EY. 2019. NMR for Biological Systems. ChemPhysChem. 20(2), 177–177.","short":"P. Schanda, E.Y. Chekmenev, ChemPhysChem 20 (2019) 177–177.","ama":"Schanda P, Chekmenev EY. NMR for Biological Systems. <i>ChemPhysChem</i>. 2019;20(2):177-177. doi:<a href=\"https://doi.org/10.1002/cphc.201801100\">10.1002/cphc.201801100</a>","chicago":"Schanda, Paul, and Eduard Y. Chekmenev. “NMR for Biological Systems.” <i>ChemPhysChem</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/cphc.201801100\">https://doi.org/10.1002/cphc.201801100</a>."},"type":"journal_article","_id":"8410","quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"article_type":"letter_note","publisher":"Wiley","title":"NMR for Biological Systems","author":[{"orcid":"0000-0002-9350-7606","last_name":"Schanda","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul"},{"full_name":"Chekmenev, Eduard Y.","last_name":"Chekmenev","first_name":"Eduard Y."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.1002/cphc.201801100","open_access":"1"}],"doi":"10.1002/cphc.201801100","publication":"ChemPhysChem","oa_version":"Published Version","pmid":1,"volume":20,"date_created":"2020-09-17T10:29:26Z","status":"public","day":"21","external_id":{"pmid":["30556633"]},"page":"177-177","year":"2019","month":"01","intvolume":"        20","date_published":"2019-01-21T00:00:00Z","date_updated":"2021-01-12T08:19:05Z","issue":"2","oa":1},{"year":"2019","external_id":{"arxiv":["1809.08947"]},"page":"1531-1575","oa":1,"issue":"3","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"date_updated":"2021-01-12T08:19:08Z","date_published":"2019-05-09T00:00:00Z","intvolume":"       374","month":"05","oa_version":"Preprint","publication":"Communications in Mathematical Physics","doi":"10.1007/s00220-019-03448-x","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.08947"}],"status":"public","day":"09","date_created":"2020-09-17T10:41:27Z","volume":374,"article_type":"original","language":[{"iso":"eng"}],"article_processing_charge":"No","author":[{"full_name":"Bálint, Péter","last_name":"Bálint","first_name":"Péter"},{"full_name":"De Simoi, Jacopo","first_name":"Jacopo","last_name":"De Simoi"},{"id":"FE553552-CDE8-11E9-B324-C0EBE5697425","first_name":"Vadim","orcid":"0000-0002-6051-2628","last_name":"Kaloshin","full_name":"Kaloshin, Vadim"},{"first_name":"Martin","last_name":"Leguil","full_name":"Leguil, Martin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards","publisher":"Springer Nature","publication_status":"published","quality_controlled":"1","_id":"8415","arxiv":1,"abstract":[{"text":"We consider billiards obtained by removing three strictly convex obstacles satisfying the non-eclipse condition on the plane. The restriction of the dynamics to the set of non-escaping orbits is conjugated to a subshift on three symbols that provides a natural labeling of all periodic orbits. We study the following inverse problem: does the Marked Length Spectrum (i.e., the set of lengths of periodic orbits together with their labeling), determine the geometry of the billiard table? We show that from the Marked Length Spectrum it is possible to recover the curvature at periodic points of period two, as well as the Lyapunov exponent of each periodic orbit.","lang":"eng"}],"type":"journal_article","publication_identifier":{"issn":["0010-3616","1432-0916"]},"citation":{"chicago":"Bálint, Péter, Jacopo De Simoi, Vadim Kaloshin, and Martin Leguil. “Marked Length Spectrum, Homoclinic Orbits and the Geometry of Open Dispersing Billiards.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00220-019-03448-x\">https://doi.org/10.1007/s00220-019-03448-x</a>.","ama":"Bálint P, De Simoi J, Kaloshin V, Leguil M. Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards. <i>Communications in Mathematical Physics</i>. 2019;374(3):1531-1575. doi:<a href=\"https://doi.org/10.1007/s00220-019-03448-x\">10.1007/s00220-019-03448-x</a>","ista":"Bálint P, De Simoi J, Kaloshin V, Leguil M. 2019. Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards. Communications in Mathematical Physics. 374(3), 1531–1575.","short":"P. Bálint, J. De Simoi, V. Kaloshin, M. Leguil, Communications in Mathematical Physics 374 (2019) 1531–1575.","ieee":"P. Bálint, J. De Simoi, V. Kaloshin, and M. Leguil, “Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards,” <i>Communications in Mathematical Physics</i>, vol. 374, no. 3. Springer Nature, pp. 1531–1575, 2019.","mla":"Bálint, Péter, et al. “Marked Length Spectrum, Homoclinic Orbits and the Geometry of Open Dispersing Billiards.” <i>Communications in Mathematical Physics</i>, vol. 374, no. 3, Springer Nature, 2019, pp. 1531–75, doi:<a href=\"https://doi.org/10.1007/s00220-019-03448-x\">10.1007/s00220-019-03448-x</a>.","apa":"Bálint, P., De Simoi, J., Kaloshin, V., &#38; Leguil, M. (2019). Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00220-019-03448-x\">https://doi.org/10.1007/s00220-019-03448-x</a>"},"extern":"1"},{"publisher":"American Mathematical Society","title":"On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Huang, Guan","first_name":"Guan","last_name":"Huang"},{"orcid":"0000-0002-6051-2628","last_name":"Kaloshin","first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"In this paper, we show that any smooth one-parameter deformations of a strictly convex integrable billiard table Ω0 preserving the integrability near the boundary have to be tangent to a finite dimensional space passing through Ω0."}],"arxiv":1,"extern":"1","citation":{"apa":"Huang, G., &#38; Kaloshin, V. (2019). On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables. <i>Moscow Mathematical Journal</i>. American Mathematical Society. <a href=\"https://doi.org/10.17323/1609-4514-2019-19-2-307-327\">https://doi.org/10.17323/1609-4514-2019-19-2-307-327</a>","mla":"Huang, Guan, and Vadim Kaloshin. “On the Finite Dimensionality of Integrable Deformations of Strictly Convex Integrable Billiard Tables.” <i>Moscow Mathematical Journal</i>, vol. 19, no. 2, American Mathematical Society, 2019, pp. 307–27, doi:<a href=\"https://doi.org/10.17323/1609-4514-2019-19-2-307-327\">10.17323/1609-4514-2019-19-2-307-327</a>.","ama":"Huang G, Kaloshin V. On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables. <i>Moscow Mathematical Journal</i>. 2019;19(2):307-327. doi:<a href=\"https://doi.org/10.17323/1609-4514-2019-19-2-307-327\">10.17323/1609-4514-2019-19-2-307-327</a>","ista":"Huang G, Kaloshin V. 2019. On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables. Moscow Mathematical Journal. 19(2), 307–327.","short":"G. Huang, V. Kaloshin, Moscow Mathematical Journal 19 (2019) 307–327.","ieee":"G. Huang and V. Kaloshin, “On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables,” <i>Moscow Mathematical Journal</i>, vol. 19, no. 2. American Mathematical Society, pp. 307–327, 2019.","chicago":"Huang, Guan, and Vadim Kaloshin. “On the Finite Dimensionality of Integrable Deformations of Strictly Convex Integrable Billiard Tables.” <i>Moscow Mathematical Journal</i>. American Mathematical Society, 2019. <a href=\"https://doi.org/10.17323/1609-4514-2019-19-2-307-327\">https://doi.org/10.17323/1609-4514-2019-19-2-307-327</a>."},"publication_identifier":{"issn":["1609-4514"]},"quality_controlled":"1","_id":"8416","publication_status":"published","month":"04","intvolume":"        19","date_published":"2019-04-01T00:00:00Z","issue":"2","oa":1,"date_updated":"2021-01-12T08:19:08Z","page":"307-327","external_id":{"arxiv":["1809.09341"]},"year":"2019","volume":19,"day":"01","status":"public","date_created":"2020-09-17T10:41:36Z","main_file_link":[{"url":"https://arxiv.org/abs/1809.09341","open_access":"1"}],"doi":"10.17323/1609-4514-2019-19-2-307-327","publication":"Moscow Mathematical Journal","oa_version":"Preprint"},{"volume":233,"day":"12","status":"public","date_created":"2020-09-17T10:41:51Z","main_file_link":[{"url":"https://doi.org/10.1007/s00205-019-01368-7","open_access":"1"}],"doi":"10.1007/s00205-019-01368-7","publication":"Archive for Rational Mechanics and Analysis","oa_version":"Published Version","month":"03","intvolume":"       233","date_published":"2019-03-12T00:00:00Z","issue":"2","oa":1,"date_updated":"2021-01-12T08:19:09Z","keyword":["Mechanical Engineering","Mathematics (miscellaneous)","Analysis"],"page":"799-836","year":"2019","type":"journal_article","abstract":[{"text":"For the Restricted Circular Planar 3 Body Problem, we show that there exists an open set U in phase space of fixed measure, where the set of initial points which lead to collision is O(μ120) dense as μ→0.","lang":"eng"}],"publication_identifier":{"issn":["0003-9527","1432-0673"]},"citation":{"chicago":"Guardia, Marcel, Vadim Kaloshin, and Jianlu Zhang. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00205-019-01368-7\">https://doi.org/10.1007/s00205-019-01368-7</a>.","short":"M. Guardia, V. Kaloshin, J. Zhang, Archive for Rational Mechanics and Analysis 233 (2019) 799–836.","ieee":"M. Guardia, V. Kaloshin, and J. Zhang, “Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 233, no. 2. Springer Nature, pp. 799–836, 2019.","ista":"Guardia M, Kaloshin V, Zhang J. 2019. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. Archive for Rational Mechanics and Analysis. 233(2), 799–836.","ama":"Guardia M, Kaloshin V, Zhang J. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. <i>Archive for Rational Mechanics and Analysis</i>. 2019;233(2):799-836. doi:<a href=\"https://doi.org/10.1007/s00205-019-01368-7\">10.1007/s00205-019-01368-7</a>","mla":"Guardia, Marcel, et al. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 233, no. 2, Springer Nature, 2019, pp. 799–836, doi:<a href=\"https://doi.org/10.1007/s00205-019-01368-7\">10.1007/s00205-019-01368-7</a>.","apa":"Guardia, M., Kaloshin, V., &#38; Zhang, J. (2019). Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-019-01368-7\">https://doi.org/10.1007/s00205-019-01368-7</a>"},"extern":"1","quality_controlled":"1","_id":"8418","publication_status":"published","publisher":"Springer Nature","title":"Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Guardia","first_name":"Marcel","full_name":"Guardia, Marcel"},{"orcid":"0000-0002-6051-2628","last_name":"Kaloshin","first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim"},{"last_name":"Zhang","first_name":"Jianlu","full_name":"Zhang, Jianlu"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}]},{"day":"25","quality_controlled":"1","status":"public","_id":"8570","date_created":"2020-09-26T14:23:54Z","abstract":[{"text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.</jats:p>","lang":"eng"}],"type":"conference","volume":61,"publication_identifier":{"eissn":["23987340"]},"citation":{"apa":"Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp, S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair. <a href=\"https://doi.org/10.29007/bj1w\">https://doi.org/10.29007/bj1w</a>","mla":"Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair, 2019, pp. 14–40, doi:<a href=\"https://doi.org/10.29007/bj1w\">10.29007/bj1w</a>.","short":"M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling, S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.","ieee":"M. Althoff <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 14–40.","ista":"Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40.","ama":"Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair; 2019:14-40. doi:<a href=\"https://doi.org/10.29007/bj1w\">10.29007/bj1w</a>","chicago":"Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” In <i>EPiC Series in Computing</i>, 61:14–40. EasyChair, 2019. <a href=\"https://doi.org/10.29007/bj1w\">https://doi.org/10.29007/bj1w</a>."},"oa_version":"Published Version","publication":"EPiC Series in Computing","publication_status":"published","doi":"10.29007/bj1w","main_file_link":[{"url":"https://easychair.org/publications/open/1gbP","open_access":"1"}],"author":[{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"},{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"last_name":"Kochdumper","first_name":"Niklas","full_name":"Kochdumper, Niklas"},{"full_name":"Ray, Rajarshi","first_name":"Rajarshi","last_name":"Ray"},{"full_name":"Schilling, Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0003-3658-1065","last_name":"Schilling"},{"full_name":"Schupp, Stefan","last_name":"Schupp","first_name":"Stefan"}],"oa":1,"title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:20:05Z","publisher":"EasyChair","date_published":"2019-05-25T00:00:00Z","intvolume":"        61","month":"05","year":"2019","language":[{"iso":"eng"}],"conference":{"location":"Montreal, Canada","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15","start_date":"2019-04-15"},"department":[{"_id":"ToHe"}],"page":"14-40","article_processing_charge":"No"},{"publication_status":"published","quality_controlled":"1","_id":"8693","type":"journal_article","arxiv":1,"abstract":[{"text":"We review V. I. Arnold’s 1963 celebrated paper [1] Proof of A. N. Kolmogorov’s Theorem on the Conservation of Conditionally Periodic Motions with a Small Variation in the Hamiltonian, and prove that, optimising Arnold’s scheme, one can get “sharp” asymptotic quantitative conditions (as ε → 0, ε being the strength of the perturbation). All constants involved are explicitly computed.","lang":"eng"}],"citation":{"ama":"Chierchia L, Koudjinan E. V. I. Arnold’s “pointwise” KAM theorem. <i>Regular and Chaotic Dynamics</i>. 2019;24:583–606. doi:<a href=\"https://doi.org/10.1134/S1560354719060017\">10.1134/S1560354719060017</a>","ieee":"L. Chierchia and E. Koudjinan, “V. I. Arnold’s ‘pointwise’ KAM theorem,” <i>Regular and Chaotic Dynamics</i>, vol. 24. Springer, pp. 583–606, 2019.","ista":"Chierchia L, Koudjinan E. 2019. V. I. Arnold’s “pointwise” KAM theorem. Regular and Chaotic Dynamics. 24, 583–606.","short":"L. Chierchia, E. Koudjinan, Regular and Chaotic Dynamics 24 (2019) 583–606.","chicago":"Chierchia, Luigi, and Edmond Koudjinan. “V. I. Arnold’s ‘Pointwise’ KAM Theorem.” <i>Regular and Chaotic Dynamics</i>. Springer, 2019. <a href=\"https://doi.org/10.1134/S1560354719060017\">https://doi.org/10.1134/S1560354719060017</a>.","apa":"Chierchia, L., &#38; Koudjinan, E. (2019). V. I. Arnold’s “pointwise” KAM theorem. <i>Regular and Chaotic Dynamics</i>. Springer. <a href=\"https://doi.org/10.1134/S1560354719060017\">https://doi.org/10.1134/S1560354719060017</a>","mla":"Chierchia, Luigi, and Edmond Koudjinan. “V. I. Arnold’s ‘Pointwise’ KAM Theorem.” <i>Regular and Chaotic Dynamics</i>, vol. 24, Springer, 2019, pp. 583–606, doi:<a href=\"https://doi.org/10.1134/S1560354719060017\">10.1134/S1560354719060017</a>."},"extern":"1","article_type":"original","language":[{"iso":"eng"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Luigi","last_name":"Chierchia","full_name":"Chierchia, Luigi"},{"full_name":"Koudjinan, Edmond","first_name":"Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","orcid":"0000-0003-2640-4049","last_name":"Koudjinan"}],"title":"V. I. Arnold’s “pointwise” KAM theorem","publisher":"Springer","oa_version":"Preprint","doi":"10.1134/S1560354719060017","main_file_link":[{"url":"https://arxiv.org/abs/1908.02523","open_access":"1"}],"publication":"Regular and Chaotic Dynamics","status":"public","day":"10","date_created":"2020-10-21T15:25:45Z","volume":24,"year":"2019","external_id":{"arxiv":["1908.02523"]},"page":"583–606","oa":1,"date_updated":"2021-01-12T08:20:34Z","intvolume":"        24","month":"12","date_published":"2019-12-10T00:00:00Z"},{"title":"Counting rational points on quartic del Pezzo surfaces with a rational conic","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning","full_name":"Browning, Timothy D"},{"first_name":"Efthymios","last_name":"Sofos","full_name":"Sofos, Efthymios"}],"file":[{"relation":"main_file","access_level":"open_access","checksum":"4061dc2fe99bee25d9adf2d2018cf608","creator":"dernst","file_size":712847,"content_type":"application/pdf","file_id":"6479","date_created":"2019-05-23T07:53:27Z","date_updated":"2020-07-14T12:45:12Z","file_name":"2019_MathAnnalen_Browning.pdf"}],"publisher":"Springer Nature","has_accepted_license":"1","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"170","arxiv":1,"abstract":[{"text":"Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over   ℚ  that contains a conic defined over   ℚ .","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:12Z","type":"journal_article","extern":"1","citation":{"apa":"Browning, T. D., &#38; Sofos, E. (2019). Counting rational points on quartic del Pezzo surfaces with a rational conic. <i>Mathematische Annalen</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00208-018-1716-6\">https://doi.org/10.1007/s00208-018-1716-6</a>","mla":"Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” <i>Mathematische Annalen</i>, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:<a href=\"https://doi.org/10.1007/s00208-018-1716-6\">10.1007/s00208-018-1716-6</a>.","ama":"Browning TD, Sofos E. Counting rational points on quartic del Pezzo surfaces with a rational conic. <i>Mathematische Annalen</i>. 2019;373(3-4):977-1016. doi:<a href=\"https://doi.org/10.1007/s00208-018-1716-6\">10.1007/s00208-018-1716-6</a>","short":"T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016.","ieee":"T. D. Browning and E. Sofos, “Counting rational points on quartic del Pezzo surfaces with a rational conic,” <i>Mathematische Annalen</i>, vol. 373, no. 3–4. Springer Nature, pp. 977–1016, 2019.","ista":"Browning TD, Sofos E. 2019. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 373(3–4), 977–1016.","chicago":"Browning, Timothy D, and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” <i>Mathematische Annalen</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00208-018-1716-6\">https://doi.org/10.1007/s00208-018-1716-6</a>."},"publication_status":"published","oa":1,"issue":"3-4","date_updated":"2021-01-12T06:52:37Z","date_published":"2019-04-01T00:00:00Z","intvolume":"       373","month":"04","year":"2019","external_id":{"arxiv":["1609.09057"]},"page":"977-1016","status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"date_created":"2018-12-11T11:44:59Z","volume":373,"oa_version":"Published Version","publication":"Mathematische Annalen","doi":"10.1007/s00208-018-1716-6"},{"month":"04","intvolume":"       371","date_published":"2019-04-15T00:00:00Z","date_updated":"2023-08-24T14:34:56Z","issue":"8","oa":1,"external_id":{"isi":["000464034200019"],"arxiv":["1705.01999"]},"page":"5757-5785","year":"2019","volume":371,"date_created":"2018-12-11T11:45:01Z","day":"15","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.01999"}],"doi":"10.1090/tran/7514","publication":"Transactions of the American Mathematical Society","isi":1,"oa_version":"Preprint","publisher":"American Mathematical Society","title":"Sieving rational points on varieties","author":[{"last_name":"Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","full_name":"Browning, Timothy D"},{"full_name":"Loughran, Daniel","first_name":"Daniel","last_name":"Loughran"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","publist_id":"7746","department":[{"_id":"TiBr"}],"language":[{"iso":"eng"}],"citation":{"mla":"Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.” <i>Transactions of the American Mathematical Society</i>, vol. 371, no. 8, American Mathematical Society, 2019, pp. 5757–85, doi:<a href=\"https://doi.org/10.1090/tran/7514\">10.1090/tran/7514</a>.","apa":"Browning, T. D., &#38; Loughran, D. (2019). Sieving rational points on varieties. <i>Transactions of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/tran/7514\">https://doi.org/10.1090/tran/7514</a>","chicago":"Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.” <i>Transactions of the American Mathematical Society</i>. American Mathematical Society, 2019. <a href=\"https://doi.org/10.1090/tran/7514\">https://doi.org/10.1090/tran/7514</a>.","ama":"Browning TD, Loughran D. Sieving rational points on varieties. <i>Transactions of the American Mathematical Society</i>. 2019;371(8):5757-5785. doi:<a href=\"https://doi.org/10.1090/tran/7514\">10.1090/tran/7514</a>","short":"T.D. Browning, D. Loughran, Transactions of the American Mathematical Society 371 (2019) 5757–5785.","ieee":"T. D. Browning and D. Loughran, “Sieving rational points on varieties,” <i>Transactions of the American Mathematical Society</i>, vol. 371, no. 8. American Mathematical Society, pp. 5757–5785, 2019.","ista":"Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions of the American Mathematical Society. 371(8), 5757–5785."},"publication_identifier":{"issn":["00029947"],"eissn":["10886850"]},"type":"journal_article","scopus_import":"1","arxiv":1,"abstract":[{"text":"An upper bound sieve for rational points on suitable varieties isdeveloped, together with applications tocounting rational points in thin sets,to local solubility in families, and to the notion of “friable” rational pointswith respect to divisors. In the special case of quadrics, sharper estimates areobtained by developing a version of the Selberg sieve for rational points.","lang":"eng"}],"_id":"175","quality_controlled":"1","publication_status":"published"},{"publisher":"National Academy of Sciences","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Lang, Moritz","last_name":"Lang","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","first_name":"Moritz"},{"id":"35084A62-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-4310-178X","last_name":"Shkolnikov","full_name":"Shkolnikov, Mikhail"}],"title":"Harmonic dynamics of the Abelian sandpile","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"TaHa"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"type":"journal_article","scopus_import":"1","arxiv":1,"abstract":[{"lang":"eng","text":"The abelian sandpile serves as a model to study self-organized criticality, a phenomenon occurring in biological, physical and social processes. The identity of the abelian group is a fractal composed of self-similar patches, and its limit is subject of extensive collaborative research. Here, we analyze the evolution of the sandpile identity under harmonic fields of different orders. We show that this evolution corresponds to periodic cycles through the abelian group characterized by the smooth transformation and apparent conservation of the patches constituting the identity. The dynamics induced by second and third order harmonics resemble smooth stretchings, respectively translations, of the identity, while the ones induced by fourth order harmonics resemble magnifications and rotations. Starting with order three, the dynamics pass through extended regions of seemingly random configurations which spontaneously reassemble into accentuated patterns. We show that the space of harmonic functions projects to the extended analogue of the sandpile group, thus providing a set of universal coordinates identifying configurations between different domains. Since the original sandpile group is a subgroup of the extended one, this directly implies that it admits a natural renormalization. Furthermore, we show that the harmonic fields can be induced by simple Markov processes, and that the corresponding stochastic dynamics show remarkable robustness over hundreds of periods. Finally, we encode information into seemingly random configurations, and decode this information with an algorithm requiring minimal prior knowledge. Our results suggest that harmonic fields might split the sandpile group into sub-sets showing different critical coefficients, and that it might be possible to extend the fractal structure of the identity beyond the boundaries of its domain. "}],"citation":{"mla":"Lang, Moritz, and Mikhail Shkolnikov. “Harmonic Dynamics of the Abelian Sandpile.” <i>Proceedings of the National Academy of Sciences</i>, vol. 116, no. 8, National Academy of Sciences, 2019, pp. 2821–30, doi:<a href=\"https://doi.org/10.1073/pnas.1812015116\">10.1073/pnas.1812015116</a>.","apa":"Lang, M., &#38; Shkolnikov, M. (2019). Harmonic dynamics of the Abelian sandpile. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1812015116\">https://doi.org/10.1073/pnas.1812015116</a>","chicago":"Lang, Moritz, and Mikhail Shkolnikov. “Harmonic Dynamics of the Abelian Sandpile.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2019. <a href=\"https://doi.org/10.1073/pnas.1812015116\">https://doi.org/10.1073/pnas.1812015116</a>.","ama":"Lang M, Shkolnikov M. Harmonic dynamics of the Abelian sandpile. <i>Proceedings of the National Academy of Sciences</i>. 2019;116(8):2821-2830. doi:<a href=\"https://doi.org/10.1073/pnas.1812015116\">10.1073/pnas.1812015116</a>","ieee":"M. Lang and M. Shkolnikov, “Harmonic dynamics of the Abelian sandpile,” <i>Proceedings of the National Academy of Sciences</i>, vol. 116, no. 8. National Academy of Sciences, pp. 2821–2830, 2019.","short":"M. Lang, M. Shkolnikov, Proceedings of the National Academy of Sciences 116 (2019) 2821–2830.","ista":"Lang M, Shkolnikov M. 2019. Harmonic dynamics of the Abelian sandpile. Proceedings of the National Academy of Sciences. 116(8), 2821–2830."},"publication_identifier":{"eissn":["1091-6490"]},"quality_controlled":"1","_id":"196","publication_status":"published","acknowledgement":"M.L. is grateful to the members of the C Guet and G Tkacik groups for valuable comments and support. M.S. is grateful to Nikita Kalinin for inspiring communications.\r\n","intvolume":"       116","month":"02","date_published":"2019-02-19T00:00:00Z","issue":"8","oa":1,"date_updated":"2023-09-11T14:09:34Z","page":"2821-2830","external_id":{"isi":["000459074400013"],"pmid":[" 30728300"],"arxiv":["1806.10823"]},"year":"2019","pmid":1,"volume":116,"status":"public","day":"19","date_created":"2018-12-11T11:45:08Z","doi":"10.1073/pnas.1812015116","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.1812015116"}],"publication":"Proceedings of the National Academy of Sciences","isi":1,"oa_version":"Published Version","related_material":{"link":[{"relation":"press_release","description":"News on IST Webpage","url":"https://ist.ac.at/en/news/famous-sandpile-model-shown-to-move-like-a-traveling-sand-dune/"}]}}]