[{"intvolume":"        40","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"3","main_file_link":[{"url":"https://arxiv.org/abs/1702.05172","open_access":"1"}],"volume":40,"scopus_import":"1","article_processing_charge":"No","date_published":"2018-09-01T00:00:00Z","title":"Long geodesics on convex surfaces","date_updated":"2023-09-13T08:49:16Z","month":"09","_id":"106","external_id":{"arxiv":["1702.05172"],"isi":["000444141200005"]},"date_created":"2018-12-11T11:44:40Z","publication":"Mathematical Intelligencer","page":"26 - 31","quality_controlled":"1","publist_id":"7948","publication_status":"published","abstract":[{"lang":"eng","text":"The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below."}],"status":"public","language":[{"iso":"eng"}],"citation":{"mla":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>, vol. 40, no. 3, Springer, 2018, pp. 26–31, doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>.","ista":"Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical Intelligencer. 40(3), 26–31.","ama":"Akopyan A, Petrunin A. Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. 2018;40(3):26-31. doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>","chicago":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>.","ieee":"A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” <i>Mathematical Intelligencer</i>, vol. 40, no. 3. Springer, pp. 26–31, 2018.","apa":"Akopyan, A., &#38; Petrunin, A. (2018). Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. Springer. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>","short":"A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31."},"type":"journal_article","year":"2018","isi":1,"author":[{"last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Anton","last_name":"Petrunin","full_name":"Petrunin, Anton"}],"department":[{"_id":"HeEd"}],"publisher":"Springer","day":"01","doi":"10.1007/s00283-018-9795-5","oa_version":"Preprint","arxiv":1},{"author":[{"last_name":"Polshyn","full_name":"Polshyn, Hryhoriy","orcid":"0000-0001-8223-8896","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"last_name":"Zhou","full_name":"Zhou, H.","first_name":"H."},{"last_name":"Spanton","full_name":"Spanton, E. M.","first_name":"E. M."},{"first_name":"T.","last_name":"Taniguchi","full_name":"Taniguchi, T."},{"first_name":"K.","last_name":"Watanabe","full_name":"Watanabe, K."},{"full_name":"Young, A. F.","last_name":"Young","first_name":"A. F."}],"year":"2018","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"publisher":"American Physical Society","day":"28","doi":"10.1103/physrevlett.121.226801","oa_version":"Preprint","arxiv":1,"quality_controlled":"1","abstract":[{"text":"Owing to their wide tunability, multiple internal degrees of freedom, and low disorder, graphene heterostructures are emerging as a promising experimental platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal activation gap measurements in dual graphite-gated monolayer graphene devices fabricated in an edgeless Corbino geometry. In devices with substrate-induced sublattice splitting, we find a tunable crossover between single- and multicomponent FQH states in the zero energy Landau level. Activation gaps in the single-component regime show excellent agreement with numerical calculations using a single broadening parameter \r\nΓ≈7.2K. In the first excited Landau level, in contrast, FQH gaps are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered state at integer filling ν=−4.","lang":"eng"}],"publication_status":"published","language":[{"iso":"eng"}],"status":"public","article_type":"original","type":"journal_article","citation":{"ieee":"H. Polshyn, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young, “Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices,” <i>Physical Review Letters</i>, vol. 121, no. 22. American Physical Society, 2018.","short":"H. Polshyn, H. Zhou, E.M. Spanton, T. Taniguchi, K. Watanabe, A.F. Young, Physical Review Letters 121 (2018).","apa":"Polshyn, H., Zhou, H., Spanton, E. M., Taniguchi, T., Watanabe, K., &#38; Young, A. F. (2018). Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.121.226801\">https://doi.org/10.1103/physrevlett.121.226801</a>","mla":"Polshyn, Hryhoriy, et al. “Quantitative Transport Measurements of Fractional Quantum Hall Energy Gaps in Edgeless Graphene Devices.” <i>Physical Review Letters</i>, vol. 121, no. 22, 226801, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevlett.121.226801\">10.1103/physrevlett.121.226801</a>.","ista":"Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. 2018. Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. Physical Review Letters. 121(22), 226801.","ama":"Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. <i>Physical Review Letters</i>. 2018;121(22). doi:<a href=\"https://doi.org/10.1103/physrevlett.121.226801\">10.1103/physrevlett.121.226801</a>","chicago":"Polshyn, Hryhoriy, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young. “Quantitative Transport Measurements of Fractional Quantum Hall Energy Gaps in Edgeless Graphene Devices.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevlett.121.226801\">https://doi.org/10.1103/physrevlett.121.226801</a>."},"date_published":"2018-11-28T00:00:00Z","article_processing_charge":"No","keyword":["general physics and astronomy"],"title":"Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices","date_updated":"2022-01-14T13:48:35Z","month":"11","_id":"10626","date_created":"2022-01-14T12:15:47Z","external_id":{"arxiv":["1805.04199"]},"publication":"Physical Review Letters","article_number":"226801","issue":"22","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"We thank Cory Dean, S. Chen, Y. Zeng, M. Yankowitz, and J. Li for discussing their unpublished data and for sharing the stack inversion technique. The authors acknowledge further discussions of the results with I. Sodemann, M. Zaletel, C. Nayak, and J. Jain. A. F. Y., H. P., H. Z., and E. M. S. were supported by the ARO under awards 69188PHH and MURI W911NF-17-1-0323. A portion of this work was performed at the National High Magnetic Field Laboratory, which is supported by National Science Foundation Cooperative Agreement No. DMR-1644779 and the State of Florida. K. W. and T. T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, and JSPS KAKENHI Grant No. JP15K21722. E. M. S. acknowledges the support of the Elings Prize Fellowship in Science of the California Nanosystems Institute at the University of California, Santa Barbara. A. F. Y. acknowledges the support of the David and Lucile Packard Foundation.","intvolume":"       121","oa":1,"volume":121,"main_file_link":[{"url":"https://arxiv.org/abs/1805.04199","open_access":"1"}],"scopus_import":"1","extern":"1"},{"article_processing_charge":"No","date_published":"2018-05-08T00:00:00Z","title":"Imaging phase slip dynamics in micron-size superconducting rings","date_updated":"2022-01-14T13:58:24Z","month":"05","_id":"10627","external_id":{"arxiv":["1703.08184"]},"date_created":"2022-01-14T13:48:47Z","publication":"Physical Review B","article_number":"184501","intvolume":"        97","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"18","acknowledgement":"We are grateful to Nadya Mason for useful discussions. This work was supported by the DOE Basic Energy Sciences under Contract No. DE-SC0012649, the Department of Physics and the Frederick Seitz Materials Research Laboratory Central Facilities at the University of Illinois.\r\n","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.08184"}],"volume":97,"extern":"1","scopus_import":"1","year":"2018","author":[{"first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","last_name":"Polshyn"},{"first_name":"Tyler R.","full_name":"Naibert, Tyler R.","last_name":"Naibert"},{"first_name":"Raffi","full_name":"Budakian, Raffi","last_name":"Budakian"}],"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"publisher":"American Physical Society","day":"08","doi":"10.1103/physrevb.97.184501","oa_version":"Preprint","arxiv":1,"quality_controlled":"1","publication_status":"published","abstract":[{"text":"We present a scanning probe technique for measuring the dynamics of individual fluxoid transitions in multiply connected superconducting structures. In these measurements, a small magnetic particle attached to the tip of a silicon cantilever is scanned over a micron-size superconducting ring fabricated from a thin aluminum film. We find that near the superconducting transition temperature of the aluminum, the dissipation and frequency of the cantilever changes significantly at particular locations where the tip-induced magnetic flux penetrating the ring causes the two lowest-energy fluxoid states to become nearly degenerate. In this regime, we show that changes in the cantilever frequency and dissipation are well-described by a stochastic resonance (SR) process, wherein small oscillations of the cantilever in the presence of thermally activated phase slips (TAPS) in the ring give rise to a dynamical force that modifies the mechanical properties of the cantilever. Using the SR model, we calculate the average fluctuation rate of the TAPS as a function of temperature over a 32-dB range in frequency, and we compare it to the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting structures.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","citation":{"ieee":"H. Polshyn, T. R. Naibert, and R. Budakian, “Imaging phase slip dynamics in micron-size superconducting rings,” <i>Physical Review B</i>, vol. 97, no. 18. American Physical Society, 2018.","apa":"Polshyn, H., Naibert, T. R., &#38; Budakian, R. (2018). Imaging phase slip dynamics in micron-size superconducting rings. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.97.184501\">https://doi.org/10.1103/physrevb.97.184501</a>","short":"H. Polshyn, T.R. Naibert, R. Budakian, Physical Review B 97 (2018).","mla":"Polshyn, Hryhoriy, et al. “Imaging Phase Slip Dynamics in Micron-Size Superconducting Rings.” <i>Physical Review B</i>, vol. 97, no. 18, 184501, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevb.97.184501\">10.1103/physrevb.97.184501</a>.","ista":"Polshyn H, Naibert TR, Budakian R. 2018. Imaging phase slip dynamics in micron-size superconducting rings. Physical Review B. 97(18), 184501.","chicago":"Polshyn, Hryhoriy, Tyler R. Naibert, and Raffi Budakian. “Imaging Phase Slip Dynamics in Micron-Size Superconducting Rings.” <i>Physical Review B</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevb.97.184501\">https://doi.org/10.1103/physrevb.97.184501</a>.","ama":"Polshyn H, Naibert TR, Budakian R. Imaging phase slip dynamics in micron-size superconducting rings. <i>Physical Review B</i>. 2018;97(18). doi:<a href=\"https://doi.org/10.1103/physrevb.97.184501\">10.1103/physrevb.97.184501</a>"}},{"has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"6324","publication_status":"published","abstract":[{"lang":"eng","text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets."}],"quality_controlled":"1","type":"journal_article","citation":{"ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &#38; Computational Geometry 59 (2018) 1001–1009.","apa":"Akopyan, A., Balitskiy, A., &#38; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>","ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &#38; Computational Geometry. 59(4), 1001–1009.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>.","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. 2018;59(4):1001-1009. doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>."},"file":[{"date_created":"2019-01-18T09:27:36Z","creator":"dernst","file_id":"5844","file_name":"2018_DiscreteComp_Akopyan.pdf","access_level":"open_access","success":1,"relation":"main_file","file_size":482518,"content_type":"application/pdf","date_updated":"2019-01-18T09:27:36Z"}],"article_type":"original","ddc":["516","000"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"HeEd"}],"publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"year":"2018","isi":1,"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan"},{"first_name":"Alexey","last_name":"Balitskiy","full_name":"Balitskiy, Alexey"},{"first_name":"Mikhail","last_name":"Grigorev","full_name":"Grigorev, Mikhail"}],"oa_version":"Published Version","doi":"10.1007/s00454-017-9883-x","day":"01","publisher":"Springer","volume":59,"oa":1,"intvolume":"        59","issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","month":"06","date_updated":"2023-09-20T12:08:51Z","title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","ec_funded":1,"article_processing_charge":"Yes (via OA deal)","date_published":"2018-06-01T00:00:00Z","page":"1001-1009","publication":"Discrete & Computational Geometry","file_date_updated":"2019-01-18T09:27:36Z","external_id":{"isi":["000432205500011"]},"date_created":"2018-12-11T11:49:57Z","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"_id":"1064"},{"scopus_import":"1","issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"intvolume":"        65","article_number":"20","volume":65,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2009/608"}],"date_created":"2018-12-11T11:44:40Z","external_id":{"isi":["000442938200004"]},"project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"},{"call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"_id":"107","publication":"Journal of the ACM","ec_funded":1,"date_published":"2018-08-01T00:00:00Z","article_processing_charge":"No","month":"08","date_updated":"2023-09-13T09:05:17Z","title":"Non-malleable codes","article_type":"original","citation":{"ama":"Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. <i>Journal of the ACM</i>. 2018;65(4). doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>","chicago":"Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable Codes.” <i>Journal of the ACM</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>.","ista":"Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.","mla":"Dziembowski, Stefan, et al. “Non-Malleable Codes.” <i>Journal of the ACM</i>, vol. 65, no. 4, 20, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>.","short":"S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).","apa":"Dziembowski, S., Pietrzak, K. Z., &#38; Wichs, D. (2018). Non-malleable codes. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>","ieee":"S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” <i>Journal of the ACM</i>, vol. 65, no. 4. ACM, 2018."},"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","abstract":[{"text":"We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every “small enough” family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions—e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against “tampering attacks.” In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security” (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.","lang":"eng"}],"publication_status":"published","publist_id":"7947","day":"01","publisher":"ACM","oa_version":"Preprint","doi":"10.1145/3178432","author":[{"first_name":"Stefan","full_name":"Dziembowski, Stefan","last_name":"Dziembowski"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Wichs","full_name":"Wichs, Daniel","first_name":"Daniel"}],"isi":1,"year":"2018","department":[{"_id":"KrPi"}]},{"scopus_import":"1","volume":2018,"alternative_title":["ISIT Proceedings"],"main_file_link":[{"url":"https://eprint.iacr.org/2017/507","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"      2018","oa":1,"date_created":"2018-12-11T11:44:40Z","external_id":{"isi":["000448139300368"]},"_id":"108","month":"08","title":"Inverted leftover hash lemma","date_updated":"2023-09-13T08:23:18Z","date_published":"2018-08-16T00:00:00Z","article_processing_charge":"No","citation":{"short":"M. Obremski, M. Skórski, in:, IEEE, 2018.","apa":"Obremski, M., &#38; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>","ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>.","ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>","mla":"Obremski, Marciej, and Maciej Skórski. <i>Inverted Leftover Hash Lemma</i>. Vol. 2018, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>.","ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018."},"type":"conference","language":[{"iso":"eng"}],"status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes."}],"publist_id":"7946","quality_controlled":"1","oa_version":"Submitted Version","doi":"10.1109/ISIT.2018.8437654","day":"16","publisher":"IEEE","department":[{"_id":"KrPi"}],"author":[{"last_name":"Obremski","full_name":"Obremski, Marciej","first_name":"Marciej"},{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","full_name":"Skorski, Maciej","last_name":"Skorski"}],"isi":1,"conference":{"end_date":"2018-06-22","location":"Vail, CO, USA","start_date":"2018-06-17 ","name":"ISIT: International Symposium on Information Theory"},"year":"2018"},{"volume":115,"related_material":{"link":[{"url":"https://doi.org/10.1101/187674 ","relation":"earlier_version"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"20","intvolume":"       115","oa":1,"scopus_import":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","extern":"1","month":"05","date_updated":"2021-12-14T07:53:40Z","title":"FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis","date_published":"2018-05-15T00:00:00Z","keyword":["Multidisciplinary"],"article_processing_charge":"No","page":"E4720-E4729","file_date_updated":"2021-06-07T06:16:38Z","publication":"Proceedings of the National Academy of Sciences","date_created":"2021-06-07T06:11:28Z","external_id":{"pmid":["29712855"]},"_id":"9471","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","pmid":1,"abstract":[{"lang":"eng","text":"The DEMETER (DME) DNA glycosylase catalyzes genome-wide DNA demethylation and is required for endosperm genomic imprinting and embryo viability. Targets of DME-mediated DNA demethylation reside in small, euchromatic, AT-rich transposons and at the boundaries of large transposons, but how DME interacts with these diverse chromatin states is unknown. The STRUCTURE SPECIFIC RECOGNITION PROTEIN 1 (SSRP1) subunit of the chromatin remodeler FACT (facilitates chromatin transactions), was previously shown to be involved in the DME-dependent regulation of genomic imprinting in Arabidopsis endosperm. Therefore, to investigate the interaction between DME and chromatin, we focused on the activity of the two FACT subunits, SSRP1 and SUPPRESSOR of TY16 (SPT16), during reproduction in Arabidopsis. We found that FACT colocalizes with nuclear DME in vivo, and that DME has two classes of target sites, the first being euchromatic and accessible to DME, but the second, representing over half of DME targets, requiring the action of FACT for DME-mediated DNA demethylation genome-wide. Our results show that the FACT-dependent DME targets are GC-rich heterochromatin domains with high nucleosome occupancy enriched with H3K9me2 and H3K27me1. Further, we demonstrate that heterochromatin-associated linker histone H1 specifically mediates the requirement for FACT at a subset of DME-target loci. Overall, our results demonstrate that FACT is required for DME targeting by facilitating its access to heterochromatin."}],"publication_status":"published","quality_controlled":"1","type":"journal_article","citation":{"apa":"Frost, J. M., Kim, M. Y., Park, G. T., Hsieh, P.-H., Nakamura, M., Lin, S. J. H., … Fischer, R. L. (2018). FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>","short":"J.M. Frost, M.Y. Kim, G.T. Park, P.-H. Hsieh, M. Nakamura, S.J.H. Lin, H. Yoo, J. Choi, Y. Ikeda, T. Kinoshita, Y. Choi, D. Zilberman, R.L. Fischer, Proceedings of the National Academy of Sciences 115 (2018) E4720–E4729.","ieee":"J. M. Frost <i>et al.</i>, “FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20. National Academy of Sciences, pp. E4720–E4729, 2018.","chicago":"Frost, Jennifer M., M. Yvonne Kim, Guen Tae Park, Ping-Hung Hsieh, Miyuki Nakamura, Samuel J. H. Lin, Hyunjin Yoo, et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>.","ama":"Frost JM, Kim MY, Park GT, et al. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(20):E4720-E4729. doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>","mla":"Frost, Jennifer M., et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20, National Academy of Sciences, 2018, pp. E4720–29, doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>.","ista":"Frost JM, Kim MY, Park GT, Hsieh P-H, Nakamura M, Lin SJH, Yoo H, Choi J, Ikeda Y, Kinoshita T, Choi Y, Zilberman D, Fischer RL. 2018. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. Proceedings of the National Academy of Sciences. 115(20), E4720–E4729."},"file":[{"success":1,"access_level":"open_access","file_name":"2018_PNAS_Frost.pdf","date_updated":"2021-06-07T06:16:38Z","content_type":"application/pdf","file_size":3045260,"checksum":"810260dc0e3cc3033e15c19ad0dc123e","relation":"main_file","creator":"asandaue","date_created":"2021-06-07T06:16:38Z","file_id":"9472"}],"article_type":"original","ddc":["580"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"department":[{"_id":"DaZi"}],"author":[{"full_name":"Frost, Jennifer M.","last_name":"Frost","first_name":"Jennifer M."},{"full_name":"Kim, M. Yvonne","last_name":"Kim","first_name":"M. Yvonne"},{"last_name":"Park","full_name":"Park, Guen Tae","first_name":"Guen Tae"},{"full_name":"Hsieh, Ping-Hung","last_name":"Hsieh","first_name":"Ping-Hung"},{"full_name":"Nakamura, Miyuki","last_name":"Nakamura","first_name":"Miyuki"},{"full_name":"Lin, Samuel J. H.","last_name":"Lin","first_name":"Samuel J. H."},{"first_name":"Hyunjin","last_name":"Yoo","full_name":"Yoo, Hyunjin"},{"first_name":"Jaemyung","last_name":"Choi","full_name":"Choi, Jaemyung"},{"last_name":"Ikeda","full_name":"Ikeda, Yoko","first_name":"Yoko"},{"last_name":"Kinoshita","full_name":"Kinoshita, Tetsu","first_name":"Tetsu"},{"last_name":"Choi","full_name":"Choi, Yeonhee","first_name":"Yeonhee"},{"first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649"},{"last_name":"Fischer","full_name":"Fischer, Robert L.","first_name":"Robert L."}],"year":"2018","oa_version":"Published Version","doi":"10.1073/pnas.1713333115","day":"15","publisher":"National Academy of Sciences"},{"oa_version":"Preprint","arxiv":1,"doi":"10.1103/PhysRevMaterials.2.035602","day":"29","publisher":"American Physical Society","year":"2018","author":[{"first_name":"Victor","last_name":"Lee","full_name":"Lee, Victor"},{"last_name":"James","full_name":"James, Nicole","first_name":"Nicole"},{"last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"},{"first_name":"Heinrich","full_name":"Jaeger, Heinrich","last_name":"Jaeger"}],"citation":{"ista":"Lee V, James N, Waitukaitis SR, Jaeger H. 2018. Collisional charging of individual submillimeter particles: Using ultrasonic levitation to initiate and track charge transfer. Physical Review Materials. 2(3), 035602.","mla":"Lee, Victor, et al. “Collisional Charging of Individual Submillimeter Particles: Using Ultrasonic Levitation to Initiate and Track Charge Transfer.” <i>Physical Review Materials</i>, vol. 2, no. 3, 035602, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.2.035602\">10.1103/PhysRevMaterials.2.035602</a>.","chicago":"Lee, Victor, Nicole James, Scott R Waitukaitis, and Heinrich Jaeger. “Collisional Charging of Individual Submillimeter Particles: Using Ultrasonic Levitation to Initiate and Track Charge Transfer.” <i>Physical Review Materials</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevMaterials.2.035602\">https://doi.org/10.1103/PhysRevMaterials.2.035602</a>.","ama":"Lee V, James N, Waitukaitis SR, Jaeger H. Collisional charging of individual submillimeter particles: Using ultrasonic levitation to initiate and track charge transfer. <i>Physical Review Materials</i>. 2018;2(3). doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.2.035602\">10.1103/PhysRevMaterials.2.035602</a>","ieee":"V. Lee, N. James, S. R. Waitukaitis, and H. Jaeger, “Collisional charging of individual submillimeter particles: Using ultrasonic levitation to initiate and track charge transfer,” <i>Physical Review Materials</i>, vol. 2, no. 3. American Physical Society, 2018.","short":"V. Lee, N. James, S.R. Waitukaitis, H. Jaeger, Physical Review Materials 2 (2018).","apa":"Lee, V., James, N., Waitukaitis, S. R., &#38; Jaeger, H. (2018). Collisional charging of individual submillimeter particles: Using ultrasonic levitation to initiate and track charge transfer. <i>Physical Review Materials</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevMaterials.2.035602\">https://doi.org/10.1103/PhysRevMaterials.2.035602</a>"},"type":"journal_article","status":"public","language":[{"iso":"eng"}],"publist_id":"7959","abstract":[{"lang":"eng","text":"Electrostatic charging of insulating fine particles can be responsible for numerous phenomena ranging from lightning in volcanic plumes to dust explosions. However, even basic aspects of how fine particles become charged are still unclear. Studying particle charging is challenging because it usually involves the complexities associated with many-particle collisions. To address these issues, we introduce a method based on acoustic levitation, which makes it possible to initiate sequences of repeated collisions of a single submillimeter particle with a flat plate, and to precisely measure the particle charge in situ after each collision. We show that collisional charge transfer between insulators is dependent on the hydrophobicity of the contacting surfaces. We use glass, which we modify by attaching nonpolar molecules to the particle, the plate, or both. We find that hydrophilic surfaces develop significant positive charges after contacting hydrophobic surfaces. Moreover, we demonstrate that charging between a hydrophilic and a hydrophobic surface is suppressed in an acidic environment and enhanced in a basic one. Application of an electric field during each collision is found to modify the charge transfer, again depending on surface hydrophobicity. We discuss these results within the context of contact charging due to ion transfer, and we show that they lend strong support to OH− ions as the charge carriers."}],"publication_status":"published","quality_controlled":"1","publication":"Physical Review Materials","external_id":{"arxiv":["1801.09278"]},"date_created":"2018-12-11T11:44:36Z","_id":"95","month":"03","title":"Collisional charging of individual submillimeter particles: Using ultrasonic levitation to initiate and track charge transfer","date_updated":"2021-01-12T08:22:09Z","date_published":"2018-03-29T00:00:00Z","extern":"1","main_file_link":[{"url":"https://arxiv.org/abs/1801.09278","open_access":"1"}],"volume":2,"oa":1,"intvolume":"         2","issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"035602"},{"day":"01","publisher":"Wiley","oa_version":"Preprint","arxiv":1,"doi":"10.1002/rsa.20815","year":"2018","author":[{"first_name":"Asaf","full_name":"Ferber, Asaf","last_name":"Ferber"},{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"}],"publication_identifier":{"eissn":["1098-2418"],"issn":["1042-9832"]},"article_type":"original","citation":{"ieee":"A. Ferber, M. A. Kwan, and B. Sudakov, “Counting Hamilton cycles in sparse random directed graphs,” <i>Random Structures and Algorithms</i>, vol. 53, no. 4. Wiley, pp. 592–603, 2018.","apa":"Ferber, A., Kwan, M. A., &#38; Sudakov, B. (2018). Counting Hamilton cycles in sparse random directed graphs. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/rsa.20815\">https://doi.org/10.1002/rsa.20815</a>","short":"A. Ferber, M.A. Kwan, B. Sudakov, Random Structures and Algorithms 53 (2018) 592–603.","mla":"Ferber, Asaf, et al. “Counting Hamilton Cycles in Sparse Random Directed Graphs.” <i>Random Structures and Algorithms</i>, vol. 53, no. 4, Wiley, 2018, pp. 592–603, doi:<a href=\"https://doi.org/10.1002/rsa.20815\">10.1002/rsa.20815</a>.","ista":"Ferber A, Kwan MA, Sudakov B. 2018. Counting Hamilton cycles in sparse random directed graphs. Random Structures and Algorithms. 53(4), 592–603.","chicago":"Ferber, Asaf, Matthew Alan Kwan, and Benny Sudakov. “Counting Hamilton Cycles in Sparse Random Directed Graphs.” <i>Random Structures and Algorithms</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/rsa.20815\">https://doi.org/10.1002/rsa.20815</a>.","ama":"Ferber A, Kwan MA, Sudakov B. Counting Hamilton cycles in sparse random directed graphs. <i>Random Structures and Algorithms</i>. 2018;53(4):592-603. doi:<a href=\"https://doi.org/10.1002/rsa.20815\">10.1002/rsa.20815</a>"},"type":"journal_article","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if p≥(logn+ω(1))/n then D(n,p) typically has a directed Hamilton cycle, and this is best possible. In this paper, we obtain a strengthening of this result, showing that under the same condition, the number of directed Hamilton cycles in D(n,p) is typically n!(p(1+o(1)))n. We also prove a hitting-time version of this statement, showing that in the random directed graph process, as soon as every vertex has in-/out-degrees at least 1, there are typically n!(logn/n(1+o(1)))n directed Hamilton cycles."}],"publication_status":"published","external_id":{"arxiv":["1708.07746"]},"date_created":"2021-06-18T12:06:28Z","_id":"9565","page":"592-603","publication":"Random Structures and Algorithms","article_processing_charge":"No","date_published":"2018-12-01T00:00:00Z","month":"12","title":"Counting Hamilton cycles in sparse random directed graphs","date_updated":"2023-02-23T14:01:03Z","extern":"1","scopus_import":"1","intvolume":"        53","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","issue":"4","main_file_link":[{"url":"https://arxiv.org/abs/1708.07746","open_access":"1"}],"volume":53},{"intvolume":"        53","oa":1,"issue":"4","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"url":"https://arxiv.org/abs/1708.01054","open_access":"1"}],"volume":53,"extern":"1","scopus_import":"1","article_processing_charge":"No","date_published":"2018-12-01T00:00:00Z","month":"12","date_updated":"2023-02-23T14:01:07Z","title":"The random k‐matching‐free process","external_id":{"arxiv":["1708.01054"]},"date_created":"2021-06-18T12:37:40Z","_id":"9567","page":"692-716","publication":"Random Structures and Algorithms","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Let P be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty n-vertex graph and then adds edges one-by-one, each chosen uniformly at random subject to the constraint that P is not violated. These types of random processes have been the subject of extensive research over the last 20 years, having striking applications in extremal combinatorics, and leading to the discovery of important probabilistic tools. In this paper we consider the k-matching-free process, where P is the property of not containing a matching of size k. We are able to analyse the behaviour of this process for a wide range of values of k; in particular we prove that if k=o(n) or if n−2k=o(n−−√/logn) then this process is likely to terminate in a k-matching-free graph with the maximum possible number of edges, as characterised by Erdős and Gallai. We also show that these bounds on k are essentially best possible, and we make a first step towards understanding the behaviour of the process in the intermediate regime."}],"publication_status":"published","article_type":"original","citation":{"ista":"Krivelevich M, Kwan MA, Loh P, Sudakov B. 2018. The random k‐matching‐free process. Random Structures and Algorithms. 53(4), 692–716.","mla":"Krivelevich, Michael, et al. “The Random K‐matching‐free Process.” <i>Random Structures and Algorithms</i>, vol. 53, no. 4, Wiley, 2018, pp. 692–716, doi:<a href=\"https://doi.org/10.1002/rsa.20814\">10.1002/rsa.20814</a>.","chicago":"Krivelevich, Michael, Matthew Alan Kwan, Po‐Shen Loh, and Benny Sudakov. “The Random K‐matching‐free Process.” <i>Random Structures and Algorithms</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/rsa.20814\">https://doi.org/10.1002/rsa.20814</a>.","ama":"Krivelevich M, Kwan MA, Loh P, Sudakov B. The random k‐matching‐free process. <i>Random Structures and Algorithms</i>. 2018;53(4):692-716. doi:<a href=\"https://doi.org/10.1002/rsa.20814\">10.1002/rsa.20814</a>","ieee":"M. Krivelevich, M. A. Kwan, P. Loh, and B. Sudakov, “The random k‐matching‐free process,” <i>Random Structures and Algorithms</i>, vol. 53, no. 4. Wiley, pp. 692–716, 2018.","apa":"Krivelevich, M., Kwan, M. A., Loh, P., &#38; Sudakov, B. (2018). The random k‐matching‐free process. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/rsa.20814\">https://doi.org/10.1002/rsa.20814</a>","short":"M. Krivelevich, M.A. Kwan, P. Loh, B. Sudakov, Random Structures and Algorithms 53 (2018) 692–716."},"type":"journal_article","year":"2018","author":[{"first_name":"Michael","full_name":"Krivelevich, Michael","last_name":"Krivelevich"},{"last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"last_name":"Loh","full_name":"Loh, Po‐Shen","first_name":"Po‐Shen"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"}],"publication_identifier":{"eissn":["1098-2418"],"issn":["1042-9832"]},"day":"01","publisher":"Wiley","oa_version":"Preprint","arxiv":1,"doi":"10.1002/rsa.20814"},{"publication_identifier":{"issn":["1042-9832"],"eissn":["1098-2418"]},"author":[{"last_name":"Kwan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"}],"year":"2018","doi":"10.1002/rsa.20742","arxiv":1,"oa_version":"Preprint","publisher":"Wiley","day":"01","abstract":[{"text":"An intercalate in a Latin square is a 2×2 Latin subsquare. Let N be the number of intercalates in a uniformly random n×n Latin square. We prove that asymptotically almost surely N≥(1−o(1))n2/4, and that EN≤(1+o(1))n2/2 (therefore asymptotically almost surely N≤fn2 for any f→∞). This significantly improves the previous best lower and upper bounds. We also give an upper tail bound for the number of intercalates in two fixed rows of a random Latin square. In addition, we discuss a problem of Linial and Luria on low-discrepancy Latin squares.","lang":"eng"}],"publication_status":"published","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","type":"journal_article","citation":{"short":"M.A. Kwan, B. Sudakov, Random Structures and Algorithms 52 (2018) 181–196.","apa":"Kwan, M. A., &#38; Sudakov, B. (2018). Intercalates and discrepancy in random Latin squares. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/rsa.20742\">https://doi.org/10.1002/rsa.20742</a>","ieee":"M. A. Kwan and B. Sudakov, “Intercalates and discrepancy in random Latin squares,” <i>Random Structures and Algorithms</i>, vol. 52, no. 2. Wiley, pp. 181–196, 2018.","ama":"Kwan MA, Sudakov B. Intercalates and discrepancy in random Latin squares. <i>Random Structures and Algorithms</i>. 2018;52(2):181-196. doi:<a href=\"https://doi.org/10.1002/rsa.20742\">10.1002/rsa.20742</a>","chicago":"Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.” <i>Random Structures and Algorithms</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/rsa.20742\">https://doi.org/10.1002/rsa.20742</a>.","ista":"Kwan MA, Sudakov B. 2018. Intercalates and discrepancy in random Latin squares. Random Structures and Algorithms. 52(2), 181–196.","mla":"Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random Latin Squares.” <i>Random Structures and Algorithms</i>, vol. 52, no. 2, Wiley, 2018, pp. 181–96, doi:<a href=\"https://doi.org/10.1002/rsa.20742\">10.1002/rsa.20742</a>."},"article_type":"original","date_updated":"2023-02-23T14:01:09Z","title":"Intercalates and discrepancy in random Latin squares","month":"03","date_published":"2018-03-01T00:00:00Z","article_processing_charge":"No","publication":"Random Structures and Algorithms","page":"181-196","_id":"9568","date_created":"2021-06-18T12:47:25Z","external_id":{"arxiv":["1607.04981"]},"volume":52,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.04981"}],"issue":"2","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"intvolume":"        52","scopus_import":"1","extern":"1"},{"_id":"9587","date_created":"2021-06-22T11:42:48Z","external_id":{"arxiv":["1703.09946"]},"publication":"Journal of Combinatorial Theory Series A","page":"44-60","date_published":"2018-05-01T00:00:00Z","article_processing_charge":"No","title":"Non-trivially intersecting multi-part families","date_updated":"2023-02-23T14:01:55Z","month":"05","scopus_import":"1","extern":"1","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","intvolume":"       156","oa":1,"volume":156,"main_file_link":[{"url":"https://arxiv.org/abs/1703.09946","open_access":"1"}],"publisher":"Elsevier","day":"01","doi":"10.1016/j.jcta.2017.12.001","oa_version":"Preprint","arxiv":1,"author":[{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"full_name":"Sudakov, Benny","last_name":"Sudakov","first_name":"Benny"},{"full_name":"Vieira, Pedro","last_name":"Vieira","first_name":"Pedro"}],"year":"2018","publication_identifier":{"issn":["0097-3165"]},"article_type":"original","citation":{"ista":"Kwan MA, Sudakov B, Vieira P. 2018. Non-trivially intersecting multi-part families. Journal of Combinatorial Theory Series A. 156, 44–60.","mla":"Kwan, Matthew Alan, et al. “Non-Trivially Intersecting Multi-Part Families.” <i>Journal of Combinatorial Theory Series A</i>, vol. 156, Elsevier, 2018, pp. 44–60, doi:<a href=\"https://doi.org/10.1016/j.jcta.2017.12.001\">10.1016/j.jcta.2017.12.001</a>.","ama":"Kwan MA, Sudakov B, Vieira P. Non-trivially intersecting multi-part families. <i>Journal of Combinatorial Theory Series A</i>. 2018;156:44-60. doi:<a href=\"https://doi.org/10.1016/j.jcta.2017.12.001\">10.1016/j.jcta.2017.12.001</a>","chicago":"Kwan, Matthew Alan, Benny Sudakov, and Pedro Vieira. “Non-Trivially Intersecting Multi-Part Families.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.jcta.2017.12.001\">https://doi.org/10.1016/j.jcta.2017.12.001</a>.","ieee":"M. A. Kwan, B. Sudakov, and P. Vieira, “Non-trivially intersecting multi-part families,” <i>Journal of Combinatorial Theory Series A</i>, vol. 156. Elsevier, pp. 44–60, 2018.","apa":"Kwan, M. A., Sudakov, B., &#38; Vieira, P. (2018). Non-trivially intersecting multi-part families. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcta.2017.12.001\">https://doi.org/10.1016/j.jcta.2017.12.001</a>","short":"M.A. Kwan, B. Sudakov, P. Vieira, Journal of Combinatorial Theory Series A 156 (2018) 44–60."},"type":"journal_article","quality_controlled":"1","publication_status":"published","abstract":[{"text":"We say a family of sets is intersecting if any two of its sets intersect, and we say it is trivially intersecting if there is an element which appears in every set of the family. In this paper we study the maximum size of a non-trivially intersecting family in a natural “multi-part” setting. Here the ground set is divided into parts, and one considers families of sets whose intersection with each part is of a prescribed size. Our work is motivated by classical results in the single-part setting due to Erdős, Ko and Rado, and Hilton and Milner, and by a theorem of Frankl concerning intersecting families in this multi-part setting. In the case where the part sizes are sufficiently large we determine the maximum size of a non-trivially intersecting multi-part family, disproving a conjecture of Alon and Katona.","lang":"eng"}],"language":[{"iso":"eng"}],"status":"public"},{"extern":"1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1063/1.5038396"}],"volume":148,"oa":1,"intvolume":"       148","issue":"23","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_number":"231102","publication":"The Journal of Chemical Physics","external_id":{"arxiv":["1803.09140"],"pmid":["29935495"]},"date_created":"2021-07-15T07:51:42Z","_id":"9659","month":"06","title":"Communication: Computing the Tolman length for solid-liquid interfaces","date_updated":"2023-02-23T14:03:57Z","article_processing_charge":"No","date_published":"2018-06-21T00:00:00Z","citation":{"ieee":"B. Cheng and M. Ceriotti, “Communication: Computing the Tolman length for solid-liquid interfaces,” <i>The Journal of Chemical Physics</i>, vol. 148, no. 23. AIP Publishing, 2018.","apa":"Cheng, B., &#38; Ceriotti, M. (2018). Communication: Computing the Tolman length for solid-liquid interfaces. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5038396\">https://doi.org/10.1063/1.5038396</a>","short":"B. Cheng, M. Ceriotti, The Journal of Chemical Physics 148 (2018).","ista":"Cheng B, Ceriotti M. 2018. Communication: Computing the Tolman length for solid-liquid interfaces. The Journal of Chemical Physics. 148(23), 231102.","mla":"Cheng, Bingqing, and Michele Ceriotti. “Communication: Computing the Tolman Length for Solid-Liquid Interfaces.” <i>The Journal of Chemical Physics</i>, vol. 148, no. 23, 231102, AIP Publishing, 2018, doi:<a href=\"https://doi.org/10.1063/1.5038396\">10.1063/1.5038396</a>.","ama":"Cheng B, Ceriotti M. Communication: Computing the Tolman length for solid-liquid interfaces. <i>The Journal of Chemical Physics</i>. 2018;148(23). doi:<a href=\"https://doi.org/10.1063/1.5038396\">10.1063/1.5038396</a>","chicago":"Cheng, Bingqing, and Michele Ceriotti. “Communication: Computing the Tolman Length for Solid-Liquid Interfaces.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2018. <a href=\"https://doi.org/10.1063/1.5038396\">https://doi.org/10.1063/1.5038396</a>."},"type":"journal_article","article_type":"original","status":"public","pmid":1,"language":[{"iso":"eng"}],"abstract":[{"text":"The curvature dependence of interfacial free energy, which is crucial in quantitatively predicting nucleation kinetics and the stability of bubbles and droplets, is quantified by the Tolman length δ. For solid-liquid interfaces, however, δ has never been computed directly due to various theoretical and practical challenges. Here we perform a direct evaluation of the Tolman length from atomistic simulations of a solid-liquid planar interface in out-of-equilibrium conditions, by first computing the surface tension from the amplitude of thermal capillary fluctuations of a localized version of the Gibbs dividing surface and by then calculating how much the surface energy changes when it is defined relative to the equimolar dividing surface. We computed δ for a model potential, and found a good agreement with the values indirectly inferred from nucleation simulations. The agreement not only validates our approach but also suggests that the nucleation free energy of the system can be perfectly described using classical nucleation theory if the Tolman length is taken into account.","lang":"eng"}],"publication_status":"published","quality_controlled":"1","oa_version":"Submitted Version","arxiv":1,"doi":"10.1063/1.5038396","day":"21","publisher":"AIP Publishing","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"year":"2018","author":[{"last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing"},{"first_name":"Michele","full_name":"Ceriotti, Michele","last_name":"Ceriotti"}]},{"doi":"10.1103/physrevlett.120.225901","oa_version":"Preprint","arxiv":1,"publisher":"American Physical Society","day":"01","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"year":"2018","author":[{"orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","last_name":"Cheng","first_name":"Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9"},{"first_name":"Anthony T.","full_name":"Paxton, Anthony T.","last_name":"Paxton"},{"full_name":"Ceriotti, Michele","last_name":"Ceriotti","first_name":"Michele"}],"type":"journal_article","citation":{"ama":"Cheng B, Paxton AT, Ceriotti M. Hydrogen diffusion and trapping in α-iron: The role of quantum and anharmonic fluctuations. <i>Physical Review Letters</i>. 2018;120(22). doi:<a href=\"https://doi.org/10.1103/physrevlett.120.225901\">10.1103/physrevlett.120.225901</a>","chicago":"Cheng, Bingqing, Anthony T. Paxton, and Michele Ceriotti. “Hydrogen Diffusion and Trapping in α-Iron: The Role of Quantum and Anharmonic Fluctuations.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevlett.120.225901\">https://doi.org/10.1103/physrevlett.120.225901</a>.","mla":"Cheng, Bingqing, et al. “Hydrogen Diffusion and Trapping in α-Iron: The Role of Quantum and Anharmonic Fluctuations.” <i>Physical Review Letters</i>, vol. 120, no. 22, 225901, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevlett.120.225901\">10.1103/physrevlett.120.225901</a>.","ista":"Cheng B, Paxton AT, Ceriotti M. 2018. Hydrogen diffusion and trapping in α-iron: The role of quantum and anharmonic fluctuations. Physical Review Letters. 120(22), 225901.","short":"B. Cheng, A.T. Paxton, M. Ceriotti, Physical Review Letters 120 (2018).","apa":"Cheng, B., Paxton, A. T., &#38; Ceriotti, M. (2018). Hydrogen diffusion and trapping in α-iron: The role of quantum and anharmonic fluctuations. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.120.225901\">https://doi.org/10.1103/physrevlett.120.225901</a>","ieee":"B. Cheng, A. T. Paxton, and M. Ceriotti, “Hydrogen diffusion and trapping in α-iron: The role of quantum and anharmonic fluctuations,” <i>Physical Review Letters</i>, vol. 120, no. 22. American Physical Society, 2018."},"article_type":"review","publication_status":"published","abstract":[{"text":"We investigate the thermodynamics and kinetics of a hydrogen interstitial in magnetic α-iron, taking account of the quantum fluctuations of the proton as well as the anharmonicities of lattice vibrations and hydrogen hopping. We show that the diffusivity of hydrogen in the lattice of bcc iron deviates strongly from an Arrhenius behavior at and below room temperature. We compare a quantum transition state theory to explicit ring polymer molecular dynamics in the calculation of diffusivity. We then address the trapping of hydrogen by a vacancy as a prototype lattice defect. By a sequence of steps in a thought experiment, each involving a thermodynamic integration, we are able to separate out the binding free energy of a proton to a defect into harmonic and anharmonic, and classical and quantum contributions. We find that about 30% of a typical binding free energy of hydrogen to a lattice defect in iron is accounted for by finite temperature effects, and about half of these arise from quantum proton fluctuations. This has huge implications for the comparison between thermal desorption and permeation experiments and standard electronic structure theory. The implications are even greater for the interpretation of muon spin resonance experiments.","lang":"eng"}],"pmid":1,"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","publication":"Physical Review Letters","_id":"9665","external_id":{"arxiv":["1803.00600"],"pmid":["29906144"]},"date_created":"2021-07-15T12:22:41Z","title":"Hydrogen diffusion and trapping in α-iron: The role of quantum and anharmonic fluctuations","date_updated":"2021-08-09T12:36:22Z","month":"06","article_processing_charge":"No","date_published":"2018-06-01T00:00:00Z","extern":"1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.00600"}],"volume":120,"article_number":"225901","oa":1,"intvolume":"       120","issue":"22","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"quality_controlled":"1","abstract":[{"text":"Estimating the homogeneous ice nucleation rate from undercooled liquid water is crucial for understanding many important physical phenomena and technological applications, and challenging for both experiments and theory. From a theoretical point of view, difficulties arise due to the long time scales required, as well as the numerous nucleation pathways involved to form ice nuclei with different stacking disorders. We computed the homogeneous ice nucleation rate at a physically relevant undercooling for a single-site water model, taking into account the diffuse nature of ice–water interfaces, stacking disorders in ice nuclei, and the addition rate of particles to the critical nucleus. We disentangled and investigated the relative importance of all the terms, including interfacial free energy, entropic contributions and the kinetic prefactor, that contribute to the overall nucleation rate. Breaking down the problem into pieces not only provides physical insights into ice nucleation, but also sheds light on the long-standing discrepancy between different theoretical predictions, as well as between theoretical and experimental determinations of the nucleation rate. Moreover, we pinpoint the main shortcomings and suggest strategies to systematically improve the existing simulation methods.","lang":"eng"}],"publication_status":"published","status":"public","pmid":1,"language":[{"iso":"eng"}],"article_type":"original","citation":{"ieee":"B. Cheng, C. Dellago, and M. Ceriotti, “Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics,” <i>Physical Chemistry Chemical Physics</i>, vol. 20, no. 45. Royal Society of Chemistry, pp. 28732–28740, 2018.","short":"B. Cheng, C. Dellago, M. Ceriotti, Physical Chemistry Chemical Physics 20 (2018) 28732–28740.","apa":"Cheng, B., Dellago, C., &#38; Ceriotti, M. (2018). Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics. <i>Physical Chemistry Chemical Physics</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c8cp04561e\">https://doi.org/10.1039/c8cp04561e</a>","ista":"Cheng B, Dellago C, Ceriotti M. 2018. Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics. Physical Chemistry Chemical Physics. 20(45), 28732–28740.","mla":"Cheng, Bingqing, et al. “Theoretical Prediction of the Homogeneous Ice Nucleation Rate: Disentangling Thermodynamics and Kinetics.” <i>Physical Chemistry Chemical Physics</i>, vol. 20, no. 45, Royal Society of Chemistry, 2018, pp. 28732–40, doi:<a href=\"https://doi.org/10.1039/c8cp04561e\">10.1039/c8cp04561e</a>.","chicago":"Cheng, Bingqing, Christoph Dellago, and Michele Ceriotti. “Theoretical Prediction of the Homogeneous Ice Nucleation Rate: Disentangling Thermodynamics and Kinetics.” <i>Physical Chemistry Chemical Physics</i>. Royal Society of Chemistry, 2018. <a href=\"https://doi.org/10.1039/c8cp04561e\">https://doi.org/10.1039/c8cp04561e</a>.","ama":"Cheng B, Dellago C, Ceriotti M. Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics. <i>Physical Chemistry Chemical Physics</i>. 2018;20(45):28732-28740. doi:<a href=\"https://doi.org/10.1039/c8cp04561e\">10.1039/c8cp04561e</a>"},"type":"journal_article","year":"2018","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing","last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"},{"full_name":"Dellago, Christoph","last_name":"Dellago","first_name":"Christoph"},{"first_name":"Michele","full_name":"Ceriotti, Michele","last_name":"Ceriotti"}],"publication_identifier":{"issn":["1463-9076"],"eissn":["1463-9084"]},"publisher":"Royal Society of Chemistry","day":"07","doi":"10.1039/c8cp04561e","oa_version":"Preprint","arxiv":1,"oa":1,"intvolume":"        20","issue":"45","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"url":"https://arxiv.org/abs/1807.05551","open_access":"1"}],"volume":20,"extern":"1","scopus_import":"1","article_processing_charge":"No","date_published":"2018-12-07T00:00:00Z","date_updated":"2021-08-09T12:36:47Z","title":"Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics","month":"12","_id":"9668","external_id":{"pmid":["30412211"],"arxiv":["1807.05551"]},"date_created":"2021-07-15T12:51:44Z","publication":"Physical Chemistry Chemical Physics","page":"28732-28740"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1710.02815"}],"volume":97,"intvolume":"        97","oa":1,"issue":"5","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_number":"054102","extern":"1","scopus_import":"1","month":"02","date_updated":"2021-08-09T12:38:26Z","title":"Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids","article_processing_charge":"No","date_published":"2018-02-01T00:00:00Z","publication":"Physical Review B","external_id":{"arxiv":["1710.02815"]},"date_created":"2021-07-19T09:39:48Z","_id":"9687","status":"public","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"text":"The Gibbs free energy is the fundamental thermodynamic potential underlying the relative stability of different states of matter under constant-pressure conditions. However, computing this quantity from atomic-scale simulations is far from trivial, so the potential energy of a system is often used as a proxy. In this paper, we use a combination of thermodynamic integration methods to accurately evaluate the Gibbs free energies associated with defects in crystals, including the vacancy formation energy in bcc iron, and the stacking fault energy in fcc nickel, iron, and cobalt. We quantify the importance of entropic and anharmonic effects in determining the free energies of defects at high temperatures, and show that the potential energy approximation as well as the harmonic approximation may produce inaccurate or even qualitatively wrong results. Our calculations manifest the necessity to employ accurate free energy methods such as thermodynamic integration to estimate the stability of crystallographic defects at high temperatures.","lang":"eng"}],"quality_controlled":"1","type":"journal_article","citation":{"chicago":"Cheng, Bingqing, and Michele Ceriotti. “Computing the Absolute Gibbs Free Energy in Atomistic Simulations: Applications to Defects in Solids.” <i>Physical Review B</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevb.97.054102\">https://doi.org/10.1103/physrevb.97.054102</a>.","ama":"Cheng B, Ceriotti M. Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids. <i>Physical Review B</i>. 2018;97(5). doi:<a href=\"https://doi.org/10.1103/physrevb.97.054102\">10.1103/physrevb.97.054102</a>","ista":"Cheng B, Ceriotti M. 2018. Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids. Physical Review B. 97(5), 054102.","mla":"Cheng, Bingqing, and Michele Ceriotti. “Computing the Absolute Gibbs Free Energy in Atomistic Simulations: Applications to Defects in Solids.” <i>Physical Review B</i>, vol. 97, no. 5, 054102, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevb.97.054102\">10.1103/physrevb.97.054102</a>.","short":"B. Cheng, M. Ceriotti, Physical Review B 97 (2018).","apa":"Cheng, B., &#38; Ceriotti, M. (2018). Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.97.054102\">https://doi.org/10.1103/physrevb.97.054102</a>","ieee":"B. Cheng and M. Ceriotti, “Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids,” <i>Physical Review B</i>, vol. 97, no. 5. American Physical Society, 2018."},"article_type":"original","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"year":"2018","author":[{"last_name":"Cheng","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","first_name":"Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9"},{"first_name":"Michele","full_name":"Ceriotti, Michele","last_name":"Ceriotti"}],"oa_version":"Preprint","arxiv":1,"doi":"10.1103/physrevb.97.054102","day":"01","publisher":"American Physical Society"},{"_id":"9807","publisher":"Springer Nature","day":"03","date_created":"2021-08-06T12:26:53Z","doi":"10.6084/m9.figshare.7295339.v1","oa_version":"Published Version","article_processing_charge":"No","year":"2018","date_published":"2018-11-03T00:00:00Z","author":[{"first_name":"Juan","last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan"},{"last_name":"Karbiener","full_name":"Karbiener, Michael","first_name":"Michael"},{"full_name":"Giroud, Maude","last_name":"Giroud","first_name":"Maude"},{"orcid":"0000-0002-7462-0048","full_name":"Pauler, Florian","last_name":"Pauler","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Teresa","full_name":"Gerhalter, Teresa","last_name":"Gerhalter"},{"first_name":"Stephan","last_name":"Herzig","full_name":"Herzig, Stephan"},{"last_name":"Scheideler","full_name":"Scheideler, Marcel","first_name":"Marcel"}],"department":[{"_id":"SiHi"}],"title":"Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","date_updated":"2023-09-13T09:10:47Z","month":"11","citation":{"ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","mla":"Higareda Almaraz, Juan, et al. <i>Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>."},"type":"research_data_reference","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.7295339.v1","open_access":"1"}],"related_material":{"record":[{"id":"20","status":"public","relation":"used_in_publication"}]},"abstract":[{"lang":"eng","text":"Table S1. Genes with highest betweenness. Table S2. Local and Master regulators up-regulated. Table S3. Local and Master regulators down-regulated (XLSX 23 kb)."}],"status":"public"},{"type":"research_data_reference","citation":{"ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>","mla":"Higareda Almaraz, Juan, et al. <i>Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>."},"oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295369.v1"}],"related_material":{"record":[{"id":"20","status":"public","relation":"used_in_publication"}]},"abstract":[{"lang":"eng","text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb)."}],"status":"public","_id":"9808","publisher":"Springer Nature","day":"03","date_created":"2021-08-06T12:31:57Z","doi":"10.6084/m9.figshare.7295369.v1","oa_version":"Published Version","year":"2018","article_processing_charge":"No","author":[{"first_name":"Juan","last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan"},{"last_name":"Karbiener","full_name":"Karbiener, Michael","first_name":"Michael"},{"first_name":"Maude","full_name":"Giroud, Maude","last_name":"Giroud"},{"id":"48EA0138-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Pauler","full_name":"Pauler, Florian","orcid":"0000-0002-7462-0048"},{"first_name":"Teresa","last_name":"Gerhalter","full_name":"Gerhalter, Teresa"},{"last_name":"Herzig","full_name":"Herzig, Stephan","first_name":"Stephan"},{"last_name":"Scheideler","full_name":"Scheideler, Marcel","first_name":"Marcel"}],"date_published":"2018-11-03T00:00:00Z","department":[{"_id":"SiHi"}],"title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","date_updated":"2023-09-13T09:10:47Z","month":"11"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","related_material":{"record":[{"id":"82","relation":"used_in_publication","status":"public"}]},"type":"research_data_reference","citation":{"short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, (2018).","apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Numerical data used in figures. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">https://doi.org/10.1371/journal.pbio.2005971.s008</a>","ieee":"W. Chaudhry <i>et al.</i>, “Numerical data used in figures.” Public Library of Science, 2018.","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Numerical Data Used in Figures.” Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">https://doi.org/10.1371/journal.pbio.2005971.s008</a>.","ama":"Chaudhry W, Pleska M, Shah N, et al. Numerical data used in figures. 2018. doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>","mla":"Chaudhry, Waqas, et al. <i>Numerical Data Used in Figures</i>. Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>.","ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Numerical data used in figures, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>."},"author":[{"full_name":"Chaudhry, Waqas","last_name":"Chaudhry","first_name":"Waqas"},{"last_name":"Pleska","orcid":"0000-0001-7460-7479","full_name":"Pleska, Maros","first_name":"Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Shah","full_name":"Shah, Nilang","first_name":"Nilang"},{"last_name":"Weiss","full_name":"Weiss, Howard","first_name":"Howard"},{"full_name":"Mccall, Ingrid","last_name":"Mccall","first_name":"Ingrid"},{"first_name":"Justin","full_name":"Meyer, Justin","last_name":"Meyer"},{"first_name":"Animesh","last_name":"Gupta","full_name":"Gupta, Animesh"},{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"},{"first_name":"Bruce","full_name":"Levin, Bruce","last_name":"Levin"}],"date_published":"2018-08-16T00:00:00Z","year":"2018","article_processing_charge":"No","month":"08","title":"Numerical data used in figures","date_updated":"2023-09-13T08:45:41Z","department":[{"_id":"CaGu"}],"date_created":"2021-08-06T12:43:44Z","day":"16","_id":"9810","publisher":"Public Library of Science","oa_version":"Published Version","doi":"10.1371/journal.pbio.2005971.s008"},{"day":"31","date_created":"2021-08-06T12:53:49Z","publisher":"Springer Nature","_id":"9811","oa_version":"Preprint","doi":"10.6084/m9.figshare.6401390.v1","article_processing_charge":"No","year":"2018","author":[{"last_name":"Zapata","full_name":"Zapata, Luis","first_name":"Luis"},{"first_name":"Oriol","last_name":"Pich","full_name":"Pich, Oriol"},{"first_name":"Luis","full_name":"Serrano, Luis","last_name":"Serrano"},{"first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor","orcid":"0000-0001-8243-4694","last_name":"Kondrashov"},{"last_name":"Ossowski","full_name":"Ossowski, Stephan","first_name":"Stephan"},{"first_name":"Martin","last_name":"Schaefer","full_name":"Schaefer, Martin"}],"date_published":"2018-05-31T00:00:00Z","month":"05","department":[{"_id":"FyKo"}],"title":"Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome","date_updated":"2023-09-13T09:01:31Z","type":"research_data_reference","citation":{"apa":"Zapata, L., Pich, O., Serrano, L., Kondrashov, F., Ossowski, S., &#38; Schaefer, M. (2018). Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">https://doi.org/10.6084/m9.figshare.6401390.v1</a>","short":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer, (2018).","ieee":"L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, and M. Schaefer, “Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome.” Springer Nature, 2018.","ama":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">10.6084/m9.figshare.6401390.v1</a>","chicago":"Zapata, Luis, Oriol Pich, Luis Serrano, Fyodor Kondrashov, Stephan Ossowski, and Martin Schaefer. “Additional File 1: Of Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">https://doi.org/10.6084/m9.figshare.6401390.v1</a>.","mla":"Zapata, Luis, et al. <i>Additional File 1: Of Negative Selection in Tumor Genome Evolution Acts on Essential Cellular Functions and the Immunopeptidome</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">10.6084/m9.figshare.6401390.v1</a>.","ista":"Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. 2018. Additional file 1: Of negative selection in tumor genome evolution acts on essential cellular functions and the immunopeptidome, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.6401390.v1\">10.6084/m9.figshare.6401390.v1</a>."},"oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"279"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.6401390.v1"}],"abstract":[{"lang":"eng","text":"This document contains additional supporting evidence presented as supplemental tables. (XLSX 50Â kb)"}]}]