{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:05:20Z","timestamp":1767927920152,"version":"3.49.0"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:00:00Z","timestamp":1704153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["CCF-1901381, CCF-2115104,CCF-2119352, CCF-2107241"],"award-info":[{"award-number":["CCF-1901381, CCF-2115104,CCF-2119352, CCF-2107241"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2024,1,2]]},"abstract":"<jats:p>Recent work has proposed a memory property for parallel programs, called disentanglement, and showed that it is pervasive in a variety of programs, written in different languages, ranging from C\/C++ to Parallel ML, and showed that it can be exploited to improve the performance of parallel functional programs. All existing work on disentanglement, however, considers the \u201cfork\/join\u201d model for parallelism and does not apply to \u201cfutures\u201d, the more powerful approach to parallelism. This is not surprising: fork\/join parallel programs exhibit a reasonably strict dependency structure (e.g., series-parallel DAGs), which disentanglement exploits. In contrast, with futures, parallel computations become first-class values of the language, and thus can be created, and passed between functions calls or stored in memory, just like other ordinary values, resulting in complex dependency structures, especially in the presence of mutable state. For example, parallel programs with futures can have deadlocks, which is impossible with fork-join parallelism.<\/jats:p>\n          <jats:p>In this paper, we are interested in the theoretical question of whether disentanglement may be extended beyond fork\/join parallelism, and specifically to futures. We consider a functional language with futures, Input\/Output (I\/O), and mutable state (references) and show that a broad range of programs written in this language are disentangled. We start by formalizing disentanglement for futures and proving that purely functional programs written in this language are disentangled. We then generalize this result in three directions. First, we consider state (effects) and prove that stateful programs are disentangled if they are race free. Second, we show that race freedom is sufficient but not a necessary condition and non-deterministic programs, e.g. those that use atomic read-modify-operations and some non-deterministic combinators, may also be disentangled. Third, we prove that disentangled task-parallel programs written with futures are free of deadlocks, which arise due to interactions between state and the rich dependencies that can be expressed with futures. Taken together, these results show that disentanglement generalizes to parallel programs with futures and, thus, the benefits of disentanglement may go well beyond fork-join parallelism.<\/jats:p>","DOI":"10.1145\/3632895","type":"journal-article","created":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T20:48:51Z","timestamp":1704487731000},"page":"1569-1599","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Disentanglement with Futures, State, and Interaction"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8302-6844","authenticated-orcid":false,"given":"Jatin","family":"Arora","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3210-9727","authenticated-orcid":false,"given":"Stefan K.","family":"Muller","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology, Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2623-4986","authenticated-orcid":false,"given":"Umut A.","family":"Acar","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"key":"e_1_3_1_2_1","unstructured":"Umut A. Acar Jatin Arora Matthew Fluet Ram Raghunathan Sam Westrick and Rohan Yadav. 2020. MPL: A High-Performance Compiler for Parallel ML. https:\/\/github.com\/MPLLang\/mpl."},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-002-1057-3"},{"key":"e_1_3_1_4_1","doi-asserted-by":"crossref","unstructured":"Umut A. Acar Arthur Chargu\u00e9raud Mike Rainey and Filip Sieczkowski. 2016. Dag-calculus: A Calculus for Parallel Computation. In Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (ICFP 2016). 18\u201332.","DOI":"10.1145\/2951913.2951946"},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839676.1839697"},{"key":"e_1_3_1_6_1","unstructured":"T R. Allen and D. A. Padua. 1987. Debugging Fortran on a Shared Memory Machine. In Proceedings of the 1987 International Conference on Parallel Processing. 721\u2013727."},{"key":"e_1_3_1_7_1","doi-asserted-by":"crossref","unstructured":"Jatin Arora Sam Westrick and Umut A. Acar. 2021. Provably Space Efficient Parallel Functional Programming. In Proceedings of the 48th Annual ACM Symposium on Principles of Programming Languages (POPL)\u201d.","DOI":"10.1145\/3434299"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591284"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275808.1276390"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800228.806932"},{"key":"e_1_3_1_11_1","doi-asserted-by":"crossref","unstructured":"Michael A. Bender Jeremy T. Fineman Seth Gilbert and Charles E. Leiserson. 2004. On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures. 133\u2013144.","DOI":"10.1145\/1007912.1007933"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000117"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_1_14_1","doi-asserted-by":"crossref","unstructured":"Robert L. Bocchino Stephen Heumann Nima Honarmand Sarita V. Adve Vikram S. Adve Adam Welc and Tatiana Shpeisman. 2011. Safe nondeterminism in a deterministic-by-default parallel language. In ACM POPL.","DOI":"10.1145\/1926385.1926447"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640097"},{"key":"e_1_3_1_16_1","volume-title":"3rd USENIX Workshop on Hot Topics in Parallelism, HotPar\u201911","author":"Boehm Hans-Juergen","year":"2011","unstructured":"Hans-Juergen Boehm. 2011. How to Miscompile Programs with \u201cBenign\u201d Data Races. In 3rd USENIX Workshop on Hot Topics in Parallelism, HotPar\u201911, Berkeley, CA, USA, May 26-27, 2011."},{"key":"e_1_3_1_17_1","doi-asserted-by":"crossref","unstructured":"Guang-Ien Cheng Mingdong Feng Charles E. Leiserson Keith H. Randall and Andrew F. Stark. 1998. Detecting data races in Cilk programs that use locks. In Proceedings of the 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201998).","DOI":"10.1145\/277651.277696"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3143359"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_1_20_1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-319-89719-6_6","volume-title":"Trends in Functional Programming","author":"Dolan Stephen","year":"2018","unstructured":"Stephen Dolan, Spiros Eliopoulos, Daniel Hillerstr\u00f6m, Anil Madhavapeddy, K. C. Sivaramakrishnan, and Leo White. 2018a. Concurrent System Programming with Effect Handlers. In Trends in Functional Programming, Meng Wang and Scott Owens (Eds.). Springer International Publishing, Cham, 98\u2013117."},{"key":"e_1_3_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192421"},{"key":"e_1_3_1_22_1","doi-asserted-by":"crossref","unstructured":"Perry A. Emrath Sanjoy Ghosh and David A. Padua. 1991. Event Synchronization Analysis for Debugging Parallel Programs. In Supercomputing \u201991. 580\u2013588.","DOI":"10.1145\/76263.76329"},{"key":"e_1_3_1_23_1","doi-asserted-by":"crossref","unstructured":"Mingdong Feng and Charles E. Leiserson. 1997. Efficient Detection of Determinacy Races in Cilk Programs. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 1\u201311.","DOI":"10.1145\/258492.258493"},{"key":"e_1_3_1_24_1","volume-title":"Provably Good Race Detection That Runs in Parallel","author":"Fineman Jeremy T.","year":"2005","unstructured":"Jeremy T. Fineman. 2005. Provably Good Race Detection That Runs in Parallel. Master\u2019s thesis. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, Cambridge, MA."},{"key":"e_1_3_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542490"},{"key":"e_1_3_1_26_1","doi-asserted-by":"crossref","unstructured":"Matthew Fluet Mike Rainey and John Reppy. 2008. A scheduling framework for general-purpose parallel languages. In ACM SIGPLAN International Conference on Functional Programming (ICFP).","DOI":"10.1145\/1411204.1411239"},{"issue":"5","key":"e_1_3_1_27_1","first-page":"1","article-title":"Implicitly threaded parallelism in Manticore","volume":"20","author":"Fluet Matthew","year":"2011","unstructured":"Matthew Fluet, Mike Rainey, John Reppy, and Adam Shaw. 2011. Implicitly threaded parallelism in Manticore. Journal of Functional Programming 20, 5-6 (2011), 1\u201340.","journal-title":"Journal of Functional Programming"},{"key":"e_1_3_1_28_1","doi-asserted-by":"crossref","unstructured":"Matteo Frigo Charles E. Leiserson and Keith H. Randall. 1998. The Implementation of the Cilk-5 Multithreaded Language. In PLDI. 212\u2013223.","DOI":"10.1145\/277650.277725"},{"key":"e_1_3_1_29_1","doi-asserted-by":"crossref","unstructured":"Adrien Guatto Sam Westrick Ram Raghunathan Umut A. Acar and Matthew Fluet. 2018. Hierarchical memory management for mutable state. In Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming PPoPP 2018 Vienna Austria February 24-28 2018. 81\u201393.","DOI":"10.1145\/3178487.3178494"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/4472.4478"},{"key":"e_1_3_1_31_1","doi-asserted-by":"crossref","unstructured":"Kevin Hammond. 2011. Why Parallel Functional Programming Matters: Panel Statement. In Reliable Software Technologies -Ada-Europe 2011 - 16th Ada-Europe International Conference on Reliable Software Technologies Edinburgh UK June 20-24 2011. Proceedings. 201\u2013205.","DOI":"10.1007\/978-3-642-21338-0_17"},{"key":"e_1_3_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555257"},{"key":"e_1_3_1_33_1","doi-asserted-by":"crossref","unstructured":"Shams Mahmood Imam and Vivek Sarkar. 2014. Habanero-Java library: a Java 8 framework for multicore programming. In 2014 International Conference on Principles and Practices of Programming on the Java Platform Virtual Machines Languages and Tools PPPJ \u201914. 75\u201386.","DOI":"10.1145\/2647508.2647514"},{"key":"e_1_3_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062374"},{"key":"e_1_3_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009869"},{"key":"e_1_3_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337465"},{"key":"e_1_3_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640106"},{"key":"e_1_3_1_38_1","doi-asserted-by":"crossref","unstructured":"Peng Li Simon Marlow Simon L. Peyton Jones and Andrew P. Tolmach. 2007. Lightweight concurrency primitives for GHC. In Proceedings of the ACM SIGPLAN Workshop on Haskell Haskell 2007 Freiburg Germany September 30 2007. 107\u2013118.","DOI":"10.1145\/1291201.1291217"},{"key":"e_1_3_1_39_1","volume-title":"LWT OCaml","author":"LWT","year":"2022","unstructured":"LWT. 2022. LWT OCaml. GitHub. https:\/\/github.com\/ocsigen\/lwt"},{"key":"e_1_3_1_40_1","first-page":"339","volume-title":"Central European Functional Programming School - 4th Summer School, CEFP 2011, Budapest, Hungary, June 14-24, 2011, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 7241)","author":"Marlow Simon","year":"2011","unstructured":"Simon Marlow. 2011. Parallel and Concurrent Programming in Haskell. In Central European Functional Programming School - 4th Summer School, CEFP 2011, Budapest, Hungary, June 14-24, 2011, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 7241), Vikt\u00f3ria Zs\u00f3k, Zolt\u00e1n Horv\u00e1th, and Rinus Plasmeijer (Eds.). Springer, 339\u2013401."},{"key":"e_1_3_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993478.1993482"},{"key":"e_1_3_1_42_1","doi-asserted-by":"crossref","unstructured":"John Mellor-Crummey. 1991. On-the-fly Detection of Data Races for Programs with Nested Fork-Join Parallelism. In Proceedings of Supercomputing\u201991. 24\u201333.","DOI":"10.1145\/125826.125861"},{"key":"e_1_3_1_43_1","doi-asserted-by":"crossref","unstructured":"Stefan Muller Kyle Singer Noah Goldstein Umut A. Acar Kunal Agrawal and I-Ting Angelina Lee. 2020. Responsive Parallelism with Futures and State. In Proceedings of the ACM Conference on Programming Language Design and Implementation (PLDI).","DOI":"10.1145\/3385412.3386013"},{"key":"e_1_3_1_44_1","doi-asserted-by":"crossref","unstructured":"Stefan K. Muller and Umut A. Acar. 2016. Latency-Hiding Work Stealing: Scheduling Interacting Parallel Computations with Work Stealing. 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. 71\u201382.","DOI":"10.1145\/2935764.2935793"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062370"},{"key":"e_1_3_1_46_1","unstructured":"Stefan K. Muller Umut A. Acar and Robert Harper. 2018. Types and Cost Models for Responsive Parallelism. In Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming (ICFP \u201918)."},{"key":"e_1_3_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591249"},{"key":"e_1_3_1_48_1","doi-asserted-by":"crossref","unstructured":"Stefan K. Muller Sam Westrick and Umut A. Acar. 2019. Fairness in Responsive Parallelism. In Proceedings of the 24th ACM SIGPLAN International Conference on Functional Programming (ICFP 2019).","DOI":"10.1145\/3341685"},{"key":"e_1_3_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/130616.130623"},{"key":"e_1_3_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781528"},{"key":"e_1_3_1_51_1","unstructured":"Atsushi Ohori Kenjiro Taura and Katsuhiro Ueno. 2018. Making SML# a General-purpose High-performance Language. Unpublished Manuscript."},{"key":"e_1_3_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036940"},{"key":"e_1_3_1_53_1","doi-asserted-by":"crossref","unstructured":"Simon L. Peyton Jones Roman Leshchinskiy Gabriele Keller and Manuel M. T. Chakravarty. 2008. Harnessing the Multicores: Nested Data Parallelism in Haskell. In FSTTCS. 383\u2013414.","DOI":"10.1007\/978-3-540-89330-1_10"},{"key":"e_1_3_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951935"},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16612-9_28"},{"key":"e_1_3_1_56_1","doi-asserted-by":"crossref","unstructured":"Raghavan Raman Jisheng Zhao Vivek Sarkar Martin Vechev and Eran Yahav. 2012. Scalable and Precise Dynamic Datarace Detection for Structured Parallelism. In Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI \u201912). 531\u2013542.","DOI":"10.1145\/2254064.2254127"},{"key":"e_1_3_1_57_1","unstructured":"Rust Team. 2019. Rust Language. https:\/\/www.rust-lang.org\/"},{"key":"e_1_3_1_58_1","unstructured":"Stefan Savage Michael Burrows Greg Nelson Patrick Sobalvarro and Thomas Anderson. 1997. Eraser: A Dynamic Race Detector for Multi-Threaded Programs. In Proceedings of the Sixteenth ACM Symposium on Operating Systems Principles (SOSP)."},{"key":"e_1_3_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/L9781611976021.11"},{"key":"e_1_3_1_60_1","doi-asserted-by":"crossref","unstructured":"Kyle Singer Noah Goldstein Stefan K. Muller Kunal Agrawal I-Ting Angelina Lee and Umut A. Acar. 2020b. Priority Scheduling for Interactive Applications. In SPAA \u201920: 32nd ACM Symposium on Parallelism in Algorithms and Architectures Virtual Event USA July 15-17 2020 Christian Scheideler and Michael Spear (Eds.). 465\u2013477.","DOI":"10.1145\/3350755.3400236"},{"key":"e_1_3_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295735"},{"key":"e_1_3_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295735"},{"key":"e_1_3_1_63_1","doi-asserted-by":"crossref","unstructured":"K. C. Sivaramakrishnan Lukasz Ziarek and Suresh Jagannathan. 2014. MultiMLton: A multicore-aware runtime for standard ML. Journal of Functional Programming FirstView (6 2014) 1\u201362.","DOI":"10.1017\/S0956796814000161"},{"key":"e_1_3_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103702"},{"key":"e_1_3_1_65_1","unstructured":"Daniel Spoonhower. 2009a. Scheduling Deterministic Parallel Programs. Ph. D. Dissertation. Carnegie Mellon University. https:\/\/www.cs.cmu.edu\/~rwh\/theses\/spoonhower.pdf"},{"key":"e_1_3_1_66_1","volume-title":"Scheduling Deterministic Parallel Programs","author":"Spoonhower Daniel","year":"2009","unstructured":"Daniel Spoonhower. 2009b. Scheduling Deterministic Parallel Programs. Ph. D. Dissertation. Carnegie Mellon University, Pittsburgh, PA, USA."},{"key":"e_1_3_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584019"},{"key":"e_1_3_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96731"},{"key":"e_1_3_1_69_1","doi-asserted-by":"crossref","unstructured":"Robert Utterback Kunal Agrawal Jeremy T. Fineman and I-Ting Angelina Lee. 2016. Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs. 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. 83\u201394.","DOI":"10.1145\/2935764.2935801"},{"key":"e_1_3_1_70_1","doi-asserted-by":"crossref","unstructured":"Caleb Voss Tiago Cogumbreiro and Vivek Sarkar. 2019. Transitive joins: a sound and efficient online deadlock-avoidance policy. In Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming PPoPP 2019 Washington DC USA February 16-20 2019 Jeffrey K. Hollingsworth and Idit Keidar (Eds.). 378\u2013390.","DOI":"10.1145\/3293883.3295724"},{"key":"e_1_3_1_71_1","doi-asserted-by":"crossref","unstructured":"Sam Westrick Jatin Arora and Umut A. Acar. 2022. Entanglement Detection With Near-Zero Cost. In Proceedings of the 24th ACM SIGPLAN International Conference on Functional Programming (ICFP 2022).","DOI":"10.1145\/3547646"},{"key":"e_1_3_1_72_1","doi-asserted-by":"crossref","unstructured":"Sam Westrick Rohan Yadav Matthew Fluet and Umut A. Acar. 2020. Disentanglement in Nested-Parallel Programs. In Proceedings of the 47th Annual ACM Symposium on Principles of Programming Languages (POPL)\".","DOI":"10.1145\/3371115"},{"key":"e_1_3_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579990.3580013"},{"key":"e_1_3_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374536"},{"key":"e_1_3_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095832"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632895","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3632895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:04:54Z","timestamp":1751659494000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,2]]},"references-count":74,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2024,1,2]]}},"alternative-id":["10.1145\/3632895"],"URL":"https:\/\/doi.org\/10.1145\/3632895","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,2]]},"assertion":[{"value":"2024-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}