{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:32Z","timestamp":1750220852037,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323208","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"59-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Massively Parallel Computation via Remote Memory Access"],"prefix":"10.1145","author":[{"given":"Soheil","family":"Behnezhad","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Esfandiari","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"\u0141\u0105cki","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren","family":"Schudy","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73035"},{"key":"e_1_3_2_1_2_1","volume-title":"Parallel Graph Connectivity in Log Diameter Rounds. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018","author":"Andoni Alexandr","year":"2018","unstructured":"Alexandr Andoni , Zhao Song , Clifford Stein , Zhengyu Wang , and Peilin Zhong . 2018 . Parallel Graph Connectivity in Log Diameter Rounds. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018 , Paris, France, October 7--9 , 2018, Mikkel Thorup (Ed.). IEEE Computer Society, 674--685. Alexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, and Peilin Zhong. 2018. Parallel Graph Connectivity in Log Diameter Rounds. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7--9, 2018, Mikkel Thorup (Ed.). IEEE Computer Society, 674--685."},{"key":"e_1_3_2_1_3_1","unstructured":"Apache Software Foundation. Beam. https:\/\/beam.apache.org . .  Apache Software Foundation. Beam. https:\/\/beam.apache.org . ."},{"key":"e_1_3_2_1_4_1","unstructured":"Apache Software Foundation. Giraph. https:\/\/giraph.apache.org .  Apache Software Foundation. Giraph. https:\/\/giraph.apache.org ."},{"key":"e_1_3_2_1_5_1","unstructured":"Apache Software Foundation. Hadoop. https:\/\/hadoop.apache.org .  Apache Software Foundation. Hadoop. https:\/\/hadoop.apache.org ."},{"key":"e_1_3_2_1_6_1","volume-title":"Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. CoRR","author":"Assadi Sepehr","year":"2018","unstructured":"Sepehr Assadi , Xiaorui Sun , and Omri Weinstein . 2018. Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. CoRR , Vol. abs\/ 1805 .02974 ( 2018 ). arxiv: 1805.02974 http:\/\/arxiv.org\/abs\/1805.02974 Sepehr Assadi, Xiaorui Sun, and Omri Weinstein. 2018. Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. CoRR, Vol. abs\/1805.02974 (2018). arxiv: 1805.02974 http:\/\/arxiv.org\/abs\/1805.02974"},{"key":"e_1_3_2_1_7_1","unstructured":"InfiniBand Trade Association. https:\/\/www.infinibandta.org\/  InfiniBand Trade Association. https:\/\/www.infinibandta.org\/"},{"key":"e_1_3_2_1_8_1","volume-title":"Supplement to InfiniBand Architecture Specification","author":"InfiniBand Trade Association","year":"2010","unstructured":"InfiniBand Trade Association . 2010. Supplement to InfiniBand Architecture Specification Volume 1 Release 1.2.2 Annex A16: RDMA over Converged Ethernet (RoCE) . ( 2010 ). InfiniBand Trade Association. 2010. Supplement to InfiniBand Architecture Specification Volume 1 Release 1.2.2 Annex A16: RDMA over Converged Ethernet (RoCE). (2010)."},{"key":"e_1_3_2_1_9_1","volume-title":"Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017","author":"Bateni MohammadHossein","year":"2017","unstructured":"MohammadHossein Bateni , Soheil Behnezhad , Mahsa Derakhshan , MohammadTaghi Hajiaghayi , Raimondas Kiveris , Silvio Lattanzi , and Vahab S. Mirrokni . 2017. Affinity Clustering: Hierarchical Clustering at Scale . In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017 , 4--9 December 2017 , Long Beach, CA, USA, Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett (Eds.). 6867--6877. http:\/\/papers.nips.cc\/paper\/7262-affinity-clustering-hierarchical-clustering-at-scale MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, and Vahab S. Mirrokni. 2017. Affinity Clustering: Hierarchical Clustering at Scale. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 4--9 December 2017, Long Beach, CA, USA, Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett (Eds.). 6867--6877. http:\/\/papers.nips.cc\/paper\/7262-affinity-clustering-hierarchical-clustering-at-scale"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3125644"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki and Vahab Mirrokni. 2019. Near-Optimal Massively Parallel Graph Connectivity. (2019). manuscript.  Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki and Vahab Mirrokni. 2019. Near-Optimal Massively Parallel Graph Connectivity. (2019). manuscript.","DOI":"10.1109\/FOCS.2019.00095"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Naama Ben-David Guy E. Blelloch Jeremy T. Fineman Phillip B. Gibbons Yan Gu Charles McGuffey and Julian Shun. 2018. Implicit Decomposition for Write-Efficient Connectivity Algorithms. In IPDPS .  Naama Ben-David Guy E. Blelloch Jeremy T. Fineman Phillip B. Gibbons Yan Gu Charles McGuffey and Julian Shun. 2018. Implicit Decomposition for Write-Efficient Connectivity Algorithms. In IPDPS .","DOI":"10.1109\/IPDPS.2018.00081"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2015.22"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312058"},{"key":"e_1_3_2_1_15_1","volume-title":"Maggs","author":"Blelloch Guy E.","year":"2010","unstructured":"Guy E. Blelloch and Bruce M . Maggs . 2010 . Algorithms and Theory of Computation Handbook. Chapman & Hall\/CRC , Chapter Parallel Algorithms, 25--25. http:\/\/dl.acm.org\/citation.cfm?id=1882723.1882748 Guy E. Blelloch and Bruce M. Maggs. 2010. Algorithms and Theory of Computation Handbook. Chapman & Hall\/CRC, Chapter Parallel Algorithms, 25--25. http:\/\/dl.acm.org\/citation.cfm?id=1882723.1882748"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806638"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_1_18_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms ( 3 rd edition) .MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd edition) .MIT Press.","edition":"3"},{"key":"e_1_3_2_1_19_1","unstructured":"Intel Corporation. Intel Omni-Path Architecture. https:\/\/www.intel.com\/content\/www\/us\/en\/high-performance-computing-fabrics\/omni-path-driving-exascale-computing.html .  Intel Corporation. Intel Omni-Path Architecture. https:\/\/www.intel.com\/content\/www\/us\/en\/high-performance-computing-fabrics\/omni-path-driving-exascale-computing.html ."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_21_1","first-page":"3","article-title":"RDMA Reads: To Use or Not to Use","volume":"40","author":"Dragojevic Aleksandar","year":"2017","unstructured":"Aleksandar Dragojevic , Dushyanth Narayanan , and Miguel Castro . 2017 . RDMA Reads: To Use or Not to Use ? IEEE Data Eng. Bull. , Vol. 40 , 1 (2017), 3 -- 14 . Aleksandar Dragojevic, Dushyanth Narayanan, and Miguel Castro. 2017. RDMA Reads: To Use or Not to Use? IEEE Data Eng. Bull., Vol. 40, 1 (2017), 3--14.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_22_1","volume-title":"11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14)","author":"Dragojevi\u0107 Aleksandar","year":"2014","unstructured":"Aleksandar Dragojevi\u0107 , Dushyanth Narayanan , Miguel Castro , and Orion Hodson . 2014 . FaRM: Fast remote memory . In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14) . 401--414. Aleksandar Dragojevi\u0107, Dushyanth Narayanan, Miguel Castro, and Orion Hodson. 2014. FaRM: Fast remote memory. In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14). 401--414."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Ghaffari Mohsen","year":"2019","unstructured":"Mohsen Ghaffari and Jara Uitto . 2019. Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation . In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 , San Diego, California, USA , January 6--9, 2019, Timothy M. Chan (Ed.). SIAM , 1636--1653. Mohsen Ghaffari and Jara Uitto. 2019. Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6--9, 2019, Timothy M. Chan (Ed.). SIAM, 1636--1653."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626299"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Karloff Howard J.","year":"2010","unstructured":"Howard J. Karloff , Siddharth Suri , and Sergei Vassilvitskii . 2010. A Model of Computation for MapReduce . In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 , Austin, Texas, USA , January 17--19, 2010, Moses Charikar (Ed.). SIAM , 938--948. Howard J. Karloff, Siddharth Suri, and Sergei Vassilvitskii. 2010. A Model of Computation for MapReduce. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17--19, 2010, Moses Charikar (Ed.). SIAM, 938--948."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2670997"},{"key":"e_1_3_2_1_29_1","volume-title":"Connected Components at Scale via Local Contractions. CoRR","author":"Lacki Jakub","year":"2018","unstructured":"Jakub Lacki , Vahab S. Mirrokni , and Michal Wlodarczyk . 2018. Connected Components at Scale via Local Contractions. CoRR , Vol. abs\/ 1807 .10727 ( 2018 ). arxiv: 1807.10727 http:\/\/arxiv.org\/abs\/1807.10727 Jakub Lacki, Vahab S. Mirrokni, and Michal Wlodarczyk. 2018. Connected Components at Scale via Local Contractions. CoRR, Vol. abs\/1807.10727 (2018). arxiv: 1807.10727 http:\/\/arxiv.org\/abs\/1807.10727"},{"key":"e_1_3_2_1_30_1","volume-title":"11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14)","author":"Lim Hyeontaek","year":"2014","unstructured":"Hyeontaek Lim , Dongsu Han , David G. Andersen , and Michael Kaminsky . 2014 . MICA: A Holistic Approach to Fast In-Memory Key-Value Storage . In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14) . USENIX Association, Seattle, WA, 429--444. https:\/\/www.usenix.org\/conference\/nsdi14\/technical-sessions\/presentation\/lim Hyeontaek Lim, Dongsu Han, David G. Andersen, and Michael Kaminsky. 2014. MICA: A Holistic Approach to Fast In-Memory Key-Value Storage. In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14) . USENIX Association, Seattle, WA, 429--444. https:\/\/www.usenix.org\/conference\/nsdi14\/technical-sessions\/presentation\/lim"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_32_1","volume-title":"Theoretical Computer Science","volume":"47","author":"Maon Yael","year":"1986","unstructured":"Yael Maon , Baruch Schieber , and Uzi Vishkin . 1986 . Parallel ear decomposition search (EDS) and st-numbering in graphs . Theoretical Computer Science , Vol. 47 (1986). Yael Maon, Baruch Schieber, and Uzi Vishkin. 1986. Parallel ear decomposition search (EDS) and st-numbering in graphs. Theoretical Computer Science, Vol. 47 (1986)."},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the 2013 USENIX Conference on Annual Technical Conference (USENIX ATC'13). USENIX Association","author":"Mitchell Christopher","year":"2013","unstructured":"Christopher Mitchell , Yifeng Geng , and Jinyang Li . 2013 . Using One-sided RDMA Reads to Build a Fast, CPU-efficient Key-value Store . In Proceedings of the 2013 USENIX Conference on Annual Technical Conference (USENIX ATC'13). USENIX Association , Berkeley, CA, USA, 103--114. http:\/\/dl.acm.org\/citation.cfm?id=2535461.2535475 Christopher Mitchell, Yifeng Geng, and Jinyang Li. 2013. Using One-sided RDMA Reads to Build a Fast, CPU-efficient Key-value Store. In Proceedings of the 2013 USENIX Conference on Annual Technical Conference (USENIX ATC'13). USENIX Association, Berkeley, CA, USA, 103--114. http:\/\/dl.acm.org\/citation.cfm?id=2535461.2535475"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.81"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806887"},{"key":"e_1_3_2_1_36_1","unstructured":"Vijaya Ramachandran. 1993. Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. In Synthesis of Parallel Algorithms .  Vijaya Ramachandran. 1993. Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. In Synthesis of Parallel Algorithms ."},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach\/Pacific Grove, CA, USA, July 11--13","author":"Roughgarden Tim","year":"2016","unstructured":"Tim Roughgarden , Sergei Vassilvitskii , and Joshua R. Wang . 2016. Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation) . In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach\/Pacific Grove, CA, USA, July 11--13 , 2016 , Christian Scheideler and Seth Gilbert (Eds.). ACM, 1--12. Tim Roughgarden, Sergei Vassilvitskii, and Joshua R. Wang. 2016. Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation). In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach\/Pacific Grove, CA, USA, July 11--13, 2016, Christian Scheideler and Seth Gilbert (Eds.). ACM, 1--12."},{"key":"e_1_3_2_1_39_1","volume-title":"1st Workshop on Randomized Parallel Algorithms .","author":"Sanders Peter","year":"1996","unstructured":"Peter Sanders . 1996 . On the competitive analysis of randomized static load balancing . In 1st Workshop on Randomized Parallel Algorithms . Peter Sanders. 1996. On the competitive analysis of randomized static load balancing. In 1st Workshop on Randomized Parallel Algorithms ."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_3_2_1_41_1","series-title":"SIAM J. Comput. (1985)","volume-title":"An efficient parallel biconnectivity algorithm","author":"Tarjan Robert E","unstructured":"Robert E Tarjan and Uzi Vishkin . 1985. An efficient parallel biconnectivity algorithm . SIAM J. Comput. (1985) . Robert E Tarjan and Uzi Vishkin. 1985. An efficient parallel biconnectivity algorithm. SIAM J. Comput. (1985)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_43_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning, ICML","author":"Yaroslavtsev Grigory","year":"2018","unstructured":"Grigory Yaroslavtsev and Adithya Vadapalli . 2018. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $ell_p$-Distances . In Proceedings of the 35th International Conference on Machine Learning, ICML 2018 , Stockholmsm\"a ssan, Stockholm, Sweden, July 10--15, 2018 (JMLR Workshop and Conference Proceedings), Jennifer G. Dy and Andreas Krause (Eds.), Vol. 80 . JMLR. org, 5596--5605. http:\/\/proceedings.mlr.press\/v80\/yaroslavtsev18a.html Grigory Yaroslavtsev and Adithya Vadapalli. 2018. Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $ell_p$-Distances. In Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsm\"a ssan, Stockholm, Sweden, July 10--15, 2018 (JMLR Workshop and Conference Proceedings), Jennifer G. Dy and Andreas Krause (Eds.), Vol. 80. JMLR.org, 5596--5605. http:\/\/proceedings.mlr.press\/v80\/yaroslavtsev18a.html"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536447"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055335"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Phoenix AZ USA","acronym":"SPAA '19"},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":45,"alternative-id":["10.1145\/3323165.3323208","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323208","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}