{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:09Z","timestamp":1780994709145,"version":"3.54.1"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T00:00:00Z","timestamp":1589846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["FA8750-14-2-0007"],"award-info":[{"award-number":["FA8750-14-2-0007"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>\n            Disintegration is a relation on measures and a transformation on probabilistic programs that generalizes density calculation and conditioning, two operations widely used for exact and approximate inference. Existing program transformations that find a disintegration or density automatically are limited to a fixed base measure that is an independent product of Lebesgue and counting measures, so they are of no help in practical cases that require tricky reasoning about other base measures. We present the first disintegrator that handles variable base measures, including\n            <jats:italic>discrete-continuous mixtures<\/jats:italic>\n            ,\n            <jats:italic>dependent products<\/jats:italic>\n            , and\n            <jats:italic>disjoint sums<\/jats:italic>\n            . By analogy with type inference, our disintegrator can check a given base measure as well as infer an unknown one that is principal. We derive the disintegrator and prove it sound by equational reasoning from semantic specifications. It succeeds in a variety of applications where disintegration and density calculation had not been previously mechanized.\n          <\/jats:p>","DOI":"10.1145\/3374208","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T18:15:24Z","timestamp":1590430524000},"page":"1-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Symbolic Disintegration with a Variety of Base Measures"],"prefix":"10.1145","volume":"42","author":[{"given":"Praveen","family":"Narayanan","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, Indiana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chung-chieh","family":"Shan","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, Indiana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,5,19]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 26th Symposium on Logic in Computer Science (LICS\u201911)","author":"Ackerman Nathanael L.","unstructured":"Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy. 2011. Noncomputable conditional distributions. In Proceedings of the 26th Symposium on Logic in Computer Science (LICS\u201911). IEEE Computer Society Press, 107--116."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129516000098"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence. AAAI Press.","author":"Afshar Hadi Mohasel","year":"2016","unstructured":"Hadi Mohasel Afshar, Scott Sanner, and Christfried Webers. 2016. Closed-form Gibbs sampling for graphical models with algebraic constraints. In Proceedings of the 30th AAAI Conference on Artificial Intelligence. AAAI Press."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034830"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103721"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201913)","author":"Bhat Sooraj","unstructured":"Sooraj Bhat, Johannes Borgstr\u00f6m, Andrew D. Gordon, and Claudio V. Russo. 2013. Deriving probability density functions from probabilistic functional programs. In Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201913), Nir Piterman and Scott A. Smolka (Eds.). Springer, 508--522."},{"key":"e_1_2_1_7_1","volume-title":"Bird and Oege de Moor","author":"Richard","year":"1996","unstructured":"Richard S. Bird and Oege de Moor. 1996. Algebra of Programming. Prentice-Hall."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/141471.141483"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951942"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.62"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28228-2_9"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v076.i01"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9574.00056"},{"key":"e_1_2_1_14_1","volume-title":"Thomas","author":"Cover Thomas M.","year":"2006","unstructured":"Thomas M. Cover and Joy A. Thomas. 2006. Elements of Information Theory (2nd ed.). Wiley."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54434-1_14"},{"key":"e_1_2_1_16_1","volume-title":"Mansinghka","author":"Cusumano-Towner Marco F.","year":"2019","unstructured":"Marco F. Cusumano-Towner, Feras A. Saad, Alexander K. Lew, and Vikash K. Mansinghka. 2019. Gen: A general-purpose probabilistic programming system with programmable inference. In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Kathryn S. McKinley and Kathleen Fisher (Eds.). ACM Press, 221--236."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91622"},{"key":"e_1_2_1_18_1","volume-title":"Teoria delle Probabilit\u00e0: Sintesi Introduttiva con Appendice Critica","author":"de Finetti Bruno","year":"1974","unstructured":"Bruno de Finetti. 1970. Teoria delle Probabilit\u00e0: Sintesi Introduttiva con Appendice Critica. Vol. 1. Giulio Einaudi, Torino. Translated as de Finetti 1974."},{"key":"e_1_2_1_19_1","volume-title":"Probability, Induction, and Statistics","author":"de Finetti Bruno","unstructured":"Bruno de Finetti. 1972. Probability, Induction, and Statistics. Wiley."},{"key":"e_1_2_1_20_1","volume-title":"Theory of Probability: A Critical Introductory Treatment","author":"de Finetti Bruno","unstructured":"Bruno de Finetti. 1974. Theory of Probability: A Critical Introductory Treatment. Vol. 1. Wiley."},{"key":"e_1_2_1_21_1","volume-title":"Non-Uniform Random Variate Generation","author":"Devroye Luc","unstructured":"Luc Devroye. 1986. Non-Uniform Random Variate Generation. Springer."},{"key":"e_1_2_1_22_1","unstructured":"Jean Dieudonn\u00e9. 1947\u20131948. Sur le Th\u00e9or\u00e8me de Lebesgue-Nikodym (III). Annales de l\u2019universit\u00e9 de Grenoble 23 (1947\u20131948) 25--53. http:\/\/eudml.org\/doc\/84619."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78769-3_6"},{"key":"e_1_2_1_24_1","volume-title":"Advances in Neural Information Processing Systems, Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M","author":"Gao Weihao","unstructured":"Weihao Gao, Sreeram Kannan, Sewoong Oh, and Pramod Viswanath. 2017. Estimating mutual information for discrete-continuous mixtures. In Advances in Neural Information Processing Systems, Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett (Eds.). Curran Associates, 5986--5997."},{"key":"e_1_2_1_25_1","volume-title":"Vechev","author":"Gehr Timon","year":"2016","unstructured":"Timon Gehr, Sasa Misailovic, and Martin T. Vechev. 2016. PSI: Exact symbolic inference for probabilistic programs. In Proceedings of the 28th International Conference on Computer Aided Verification, Part I (Lecture Notes in Computer Science), Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer, 62--83."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1992.10475235"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092872"},{"key":"e_1_2_1_29_1","volume-title":"Tenenbaum","author":"Goodman Noah D.","year":"2008","unstructured":"Noah D. Goodman, Vikash K. Mansinghka, Daniel Roy, Keith Bonawitz, and Joshua B. Tenenbaum. 2008. Church: A language for generative models. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, David Allen McAllester and Petri Myllym\u00e4ki (Eds.). AUAI Press, 220--229."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-f-2.1993.0015"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/82.4.711"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005137"},{"key":"e_1_2_1_34_1","unstructured":"G\u00e9rard Huet. 1976. R\u00e9solution d\u2019\u00c9quations dans des Langages d\u2019Ordre . Th\u00e8se de doctorat es sciences math\u00e9matiques. Universit\u00e9 Paris VII."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264598"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 1st International Spring School on Advanced Functional Programming Techniques, Johan Jeuring and Erik Meijer (Eds.). Number 925 in Lecture Notes in Computer Science","author":"Hughes John","unstructured":"John Hughes. 1995. The design of a pretty-printing library. In Proceedings of the 1st International Spring School on Advanced Functional Programming Techniques, Johan Jeuring and Erik Meijer (Eds.). Number 925 in Lecture Notes in Computer Science. Springer, 53--96."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800001623"},{"key":"e_1_2_1_38_1","volume-title":"Partial Evaluation and Automatic Program Generation","author":"Jones Neil D.","unstructured":"Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143220"},{"key":"e_1_2_1_40_1","first-page":"27","article-title":"Estimation of particle transmission by random sampling","volume":"12","author":"Kahn Herman","year":"1951","unstructured":"Herman Kahn and T. E. Harris. 1951. Estimation of particle transmission by random sampling. Nat. Bureau Stand. Appl. Math. Ser. 12 (1951), 27--30.","journal-title":"Nat. Bureau Stand. Appl. Math. Ser."},{"key":"e_1_2_1_41_1","first-page":"97","article-title":"Commutative monads as a theory of distributions","volume":"26","author":"Kock Anders","year":"2012","unstructured":"Anders Kock. 2012. Commutative monads as a theory of distributions. Theory Appl. Cat. 26, 4 (2012), 97--131.","journal-title":"Theory Appl. Cat."},{"key":"e_1_2_1_42_1","volume-title":"Lawall and Olivier Danvy","author":"Julia","year":"1994","unstructured":"Julia L. Lawall and Olivier Danvy. 1994. Continuation-based partial evaluation. In Proceedings of the ACM Conference on Lisp and Functional Programming. ACM Press, 227--238."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008929526011"},{"key":"e_1_2_1_44_1","volume-title":"Learning and Inference in Graphical Models, Michael I","author":"MacKay David J. C.","unstructured":"David J. C. MacKay. 1998. Introduction to Monte Carlo methods. In Learning and Inference in Graphical Models, Michael I. Jordan (Ed.). Kluwer."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, Jacques Garrigue, Gabriele Keller, and Eijiro Sumii (Eds.). ACM Press, 47--59","author":"Ismail Wazim Mohammed","year":"2016","unstructured":"Wazim Mohammed Ismail and Chung-chieh Shan. 2016. Deriving a probability density calculator (functional pearl). In Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, Jacques Garrigue, Gabriele Keller, and Eijiro Sumii (Eds.). ACM Press, 47--59."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29604-3_5"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110255"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-131-179"},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence, Craig Boutilier (Ed.). 1943--1950","author":"Pfeffer Avi","year":"2009","unstructured":"Avi Pfeffer. 2009. CTPPL: A continuous time probabilistic programming language. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, Craig Boutilier (Ed.). 1943--1950."},{"key":"e_1_2_1_51_1","volume-title":"Types and Programming Languages","author":"Pierce Benjamin C.","unstructured":"Benjamin C. Pierce. 2002. Types and Programming Languages. MIT Press."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023064908962"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"e_1_2_1_54_1","volume-title":"A User\u2019s Guide to Measure Theoretic Probability","author":"Pollard David","unstructured":"David Pollard. 2001. A User\u2019s Guide to Measure Theoretic Probability. Cambridge University Press."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503288"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS\u201919)","author":"Roberts David A.","year":"2019","unstructured":"David A. Roberts, Marcus Gallagher, and Thomas Taimre. 2019. Reversible jump probabilistic programming. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS\u201919) (Proceedings of Machine Learning Research), Kamalika Chaudhuri and Masashi Sugiyama (Eds.). 634--643."},{"key":"e_1_2_1_58_1","volume-title":"Real Analysis","author":"Royden Halsey L.","unstructured":"Halsey L. Royden. 1988. Real Analysis (3rd ed.). Prentice-Hall.","edition":"3"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290351"},{"key":"e_1_2_1_60_1","volume-title":"Proc. ACM Program. Lang. 2, POPL","author":"\u015acibior Adam","year":"2018","unstructured":"Adam \u015acibior, Ohad Kammar, Matthijs V\u00e1k\u00e1r, Sam Staton, Hongseok Yang, Yufei Cai, Klaus Ostermann, Sean K. Moss, Chris Heunen, and Zoubin Ghahramani. 2018. Denotational validation of higher-order Bayesian inference. Proc. ACM Program. Lang. 2, POPL (2018), 60:1\u201360:29."},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, Giuseppe Castagna and Andrew D. Gordon (Eds.). ACM Press, 130--144","author":"Norman Ramsey Shan","year":"2017","unstructured":"Chung-chieh Shan and Norman Ramsey. 2017. Exact Bayesian inference by symbolic disintegration. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, Giuseppe Castagna and Andrew D. Gordon (Eds.). ACM Press, 130--144."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0266466699156056"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54434-1_32"},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the ACM Symposium on Principles of Programming Languages, Patrick C. Fischer and Jeffrey D. Ullman (Eds.). ACM Press, 95--107","author":"Tennent Robert D.","year":"1973","unstructured":"Robert D. Tennent. 1973. Mathematical semantics of SNOBOL 4. In Proceedings of the ACM Symposium on Principles of Programming Languages, Patrick C. Fischer and Jeffrey D. Ullman (Eds.). ACM Press, 95--107."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604144"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1027961031"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907382"},{"key":"e_1_2_1_68_1","volume-title":"Proc. ACM Program. Lang. 3, POPL","author":"V\u00e1k\u00e1r Matthijs","year":"2019","unstructured":"Matthijs V\u00e1k\u00e1r, Ohad Kammar, and Sam Staton. 2019. A domain theory for statistical probabilistic programming. Proc. ACM Program. Lang. 3, POPL (2019), 36:1\u201336:29."},{"key":"e_1_2_1_69_1","volume-title":"On s-finite measures and kernels. e-Print","author":"V\u00e1k\u00e1r Matthijs","year":"1810","unstructured":"Matthijs V\u00e1k\u00e1r and Luke Ong. 2018. On s-finite measures and kernels. e-Print 1810.01837. Retrieved from https:\/\/arxiv.org\/abs\/1810.01837"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341702"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of the Symposium on Logic in Computer Science (LICS\u201987)","author":"Wand Mitchell","year":"1987","unstructured":"Mitchell Wand. 1987a. Complete type inference for simple objects. In Proceedings of the Symposium on Logic in Computer Science (LICS\u201987). IEEE Computer Society Press, 37--44."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1987-10202"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236782"},{"key":"e_1_2_1_74_1","volume-title":"Goodman","author":"Wingate David","year":"2011","unstructured":"David Wingate, Andreas Stuhlm\u00fcller, and Noah D. Goodman. 2011. Lightweight implementations of probabilistic programming languages via transformational compilation. In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics (AISTATS\u201911) (JMLR Workshop and Conference Proceedings), Geoffrey Gordon, David Dunson, and Miroslav Dud\u00edk (Eds.). 770--778."},{"key":"e_1_2_1_75_1","volume-title":"Proceedings of the 17th International Conference on Artificial Intelligence and Statistics (AISTATS\u201914) (JMLR Workshop and Conference Proceedings). 1024--1032","author":"Wood Frank","unstructured":"Frank Wood, Jan Willem van de Meent, and Vikash Mansinghka. 2014. A new approach to probabilistic programming inference. In Proceedings of the 17th International Conference on Artificial Intelligence and Statistics (AISTATS\u201914) (JMLR Workshop and Conference Proceedings). 1024--1032."},{"key":"e_1_2_1_76_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.)","volume":"80","author":"Wu Yi","year":"2018","unstructured":"Yi Wu, Siddharth Srivastava, Nicholas Hay, Simon Du, and Stuart Russell. 2018. Discrete-continuous mixtures in probabilistic programming: Generalized semantics and inference algorithms. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.), Vol. 80. 5339--5348."},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence.","author":"Zinkov Robert","year":"2017","unstructured":"Robert Zinkov and Chung-chieh Shan. 2017. Composing inference algorithms as program transformations. In Proceedings of the Conference on Uncertainty in Artificial Intelligence."}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3374208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3374208","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3374208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:47Z","timestamp":1750200107000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3374208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,19]]},"references-count":77,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3374208"],"URL":"https:\/\/doi.org\/10.1145\/3374208","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,19]]},"assertion":[{"value":"2019-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}