{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:01Z","timestamp":1750220401903,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Marie Sk?odowska-Curie grant","award":["754362"],"award-info":[{"award-number":["754362"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,9,6]]},"DOI":"10.1145\/3479394.3479402","type":"proceedings-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T22:23:02Z","timestamp":1633645382000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Canonical proof-objects for coinductive programming: infinets with infinitely many cuts"],"prefix":"10.1145","author":[{"given":"Abhishek","family":"De","sequence":"first","affiliation":[{"name":"Universit\ufffd\ufffd de Paris, IRIF, CNRS, France"}]},{"given":"Luc","family":"Pellissier","sequence":"additional","affiliation":[{"name":"LACL, Universit\ufffd\ufffd Paris Est Cr\ufffd\ufffdteil, France"}]},{"given":"Alexis","family":"Saurin","sequence":"additional","affiliation":[{"name":"Universit\ufffd\ufffd de Paris, IRIF, CNRS, France"}]}],"member":"320","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000186"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500591"},{"volume-title":"Logic, Language, Information, and Computation, Rosalie Iemhoff, Michael Moortgat, and Ruy de\u00a0Queiroz (Eds.)","author":"Afshari Bahareh","key":"e_1_3_2_1_3_1","unstructured":"Bahareh Afshari , Gerhard J\u00e4ger , and Graham\u00a0 E. Leigh . 2019. An Infinitary Treatment of Full Mu-Calculus . In Logic, Language, Information, and Computation, Rosalie Iemhoff, Michael Moortgat, and Ruy de\u00a0Queiroz (Eds.) . Springer Berlin Heidelberg , Berlin, Heidelberg , 17\u201334. Bahareh Afshari, Gerhard J\u00e4ger, and Graham\u00a0E. Leigh. 2019. An Infinitary Treatment of Full Mu-Calculus. In Logic, Language, Information, and Computation, Rosalie Iemhoff, Michael Moortgat, and Ruy de\u00a0Queiroz (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 17\u201334."},{"key":"e_1_3_2_1_4_1","volume-title":"19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02741)","author":"Avenhaus J\u00fcrgen","year":"2003","unstructured":"J\u00fcrgen Avenhaus , Ulrich K\u00fchler , Tobias Schmidt-Samoa , and Claus-Peter Wirth . 2003 . How to Prove Inductive Theorems? QUODLIBET!. In Automated Deduction - CADE-19 , 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02741) . Springer, 328\u2013333. https:\/\/doi.org\/10.1007\/978-3-540-45085-6_29 10.1007\/978-3-540-45085-6_29 J\u00fcrgen Avenhaus, Ulrich K\u00fchler, Tobias Schmidt-Samoa, and Claus-Peter Wirth. 2003. How to Prove Inductive Theorems? QUODLIBET!. In Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings(Lecture Notes in Computer Science, Vol.\u00a02741). Springer, 328\u2013333. https:\/\/doi.org\/10.1007\/978-3-540-45085-6_29"},{"key":"e_1_3_2_1_5_1","unstructured":"David Baelde Amina Doumane Denis Kuperberg and Alexis Saurin. 2020. Bouncing threads for circular and non-wellfounded proofs. (2020). https:\/\/arxiv.org\/abs\/2005.08257.  David Baelde Amina Doumane Denis Kuperberg and Alexis Saurin. 2020. Bouncing threads for circular and non-wellfounded proofs. (2020). https:\/\/arxiv.org\/abs\/2005.08257."},{"key":"e_1_3_2_1_6_1","volume-title":"Infinitary Proof Theory: the Multiplicative Additive Case. In 25th EACSL Annual Conference on Computer Science Logic, CSL 2016","author":"Baelde David","year":"2016","unstructured":"David Baelde , Amina Doumane , and Alexis Saurin . 2016 . Infinitary Proof Theory: the Multiplicative Additive Case. In 25th EACSL Annual Conference on Computer Science Logic, CSL 2016 , August 29 - September 1, 2016, Marseille, France(LIPIcs, Vol.\u00a062). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 42:1\u201342:17. http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-022-4 David Baelde, Amina Doumane, and Alexis Saurin. 2016. Infinitary Proof Theory: the Multiplicative Additive Case. In 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France(LIPIcs, Vol.\u00a062). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 42:1\u201342:17. http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-022-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46678-0_28"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/212876.212898"},{"volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"Brotherston James","key":"e_1_3_2_1_9_1","unstructured":"James Brotherston . 2005. Cyclic Proofs for First-Order Logic with Inductive Definitions . In Automated Reasoning with Analytic Tableaux and Related Methods , Bernhard Beckert (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg, 78\u201392. James Brotherston. 2005. Cyclic Proofs for First-Order Logic with Inductive Definitions. In Automated Reasoning with Analytic Tableaux and Related Methods, Bernhard Beckert (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 78\u201392."},{"key":"e_1_3_2_1_10_1","volume-title":"APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07705)","author":"Brotherston James","year":"2012","unstructured":"James Brotherston , Nikos Gorogiannis , and Rasmus\u00a0Lerchedahl Petersen . 2012 . A Generic Cyclic Theorem Prover. In Programming Languages and Systems - 10th Asian Symposium , APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07705) . Springer, 350\u2013367. https:\/\/doi.org\/10.1007\/978-3-642-35182-2_25 10.1007\/978-3-642-35182-2_25 James Brotherston, Nikos Gorogiannis, and Rasmus\u00a0Lerchedahl Petersen. 2012. A Generic Cyclic Theorem Prover. In Programming Languages and Systems - 10th Asian Symposium, APLAS 2012, Kyoto, Japan, December 11-13, 2012. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07705). Springer, 350\u2013367. https:\/\/doi.org\/10.1007\/978-3-642-35182-2_25"},{"key":"e_1_3_2_1_11_1","article-title":"Sequent calculi for induction and infinite descent","volume":"21","author":"Brotherston James","year":"2010","unstructured":"James Brotherston and Alex Simpson . 2010 . Sequent calculi for induction and infinite descent . Journal of Logic and Computation 21 , 6 (10 2010), 1177\u20131216. https:\/\/doi.org\/10.1093\/logcom\/exq052 arXiv:https:\/\/academic.oup.com\/logcom\/article-pdf\/21\/6\/1177\/2787531\/exq052.pdf 10.1093\/logcom James Brotherston and Alex Simpson. 2010. Sequent calculi for induction and infinite descent. Journal of Logic and Computation 21, 6 (10 2010), 1177\u20131216. https:\/\/doi.org\/10.1093\/logcom\/exq052 arXiv:https:\/\/academic.oup.com\/logcom\/article-pdf\/21\/6\/1177\/2787531\/exq052.pdf","journal-title":"Journal of Logic and Computation"},{"volume-title":"Handbook of Automated Reasoning (in 2 volumes)","author":"Bundy Alan","key":"e_1_3_2_1_12_1","unstructured":"Alan Bundy . 2001. The Automation of Proof by Mathematical Induction . In Handbook of Automated Reasoning (in 2 volumes) . Elsevier and MIT Press , 845\u2013911. Alan Bundy. 2001. The Automation of Proof by Mathematical Induction. In Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press, 845\u2013911."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1936-1501858-0"},{"key":"e_1_3_2_1_14_1","unstructured":"Pierre-Louis Curien. 2006. Introduction to linear logic and ludics part II. 44\u00a0pages.  Pierre-Louis Curien. 2006. Introduction to linear logic and ludics part II. 44\u00a0pages."},{"key":"e_1_3_2_1_15_1","unstructured":"Anupam Das. 2019. Structure vs. Invariants in Proofs: project announcement. (2019). Talk at CiSS-19 http:\/\/www.cse.chalmers.se\/~bahafs\/CiSS2019\/programme.html.  Anupam Das. 2019. Structure vs. Invariants in Proofs: project announcement. (2019). Talk at CiSS-19 http:\/\/www.cse.chalmers.se\/~bahafs\/CiSS2019\/programme.html."},{"key":"e_1_3_2_1_16_1","unstructured":"Anupam Das Amina Doumane and Damien Pous. 2018. Left-Handed Completeness for Kleene algebra via Cyclic Proofs. In LPAR(EPiC Series in Computing Vol.\u00a057). EasyChair 271\u2013289.  Anupam Das Amina Doumane and Damien Pous. 2018. Left-Handed Completeness for Kleene algebra via Cyclic Proofs. In LPAR(EPiC Series in Computing Vol.\u00a057). EasyChair 271\u2013289."},{"volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods, Renate\u00a0A","author":"Das Anupam","key":"e_1_3_2_1_17_1","unstructured":"Anupam Das and Damien Pous . 2017. A Cut-Free Cyclic Proof System for Kleene Algebra . In Automated Reasoning with Analytic Tableaux and Related Methods, Renate\u00a0A . Schmidtand Cl\u00e1udia Nalon (Eds.). Springer International Publishing , Cham , 261\u2013277. Anupam Das and Damien Pous. 2017. A Cut-Free Cyclic Proof System for Kleene Algebra. In Automated Reasoning with Analytic Tableaux and Related Methods, Renate\u00a0A. Schmidtand Cl\u00e1udia Nalon (Eds.). Springer International Publishing, Cham, 261\u2013277."},{"key":"e_1_3_2_1_18_1","unstructured":"Abhishek De Luc Pellissier and Alexis Saurin. [n.d.]. Eliminating infinitely many cuts in non-wellfounded MLL proof-nets. ([n.\u00a0d.]). https:\/\/hal.archives-ouvertes.fr\/hal-03235591 Available at: https:\/\/hal.archives-ouvertes.fr\/hal-03235591.  Abhishek De Luc Pellissier and Alexis Saurin. [n.d.]. Eliminating infinitely many cuts in non-wellfounded MLL proof-nets. ([n.\u00a0d.]). https:\/\/hal.archives-ouvertes.fr\/hal-03235591 Available at: https:\/\/hal.archives-ouvertes.fr\/hal-03235591."},{"key":"e_1_3_2_1_19_1","volume-title":"Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. In TABLEAUX","author":"De Abhishek","year":"2019","unstructured":"Abhishek De and Alexis Saurin . 2019 . Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. In TABLEAUX 2019, Serenella Cerrito and Andrei Popescu (Eds.). Springer International Publishing , 297\u2013316. https:\/\/doi.org\/10.1007\/978-3-030-29026-9_17 10.1007\/978-3-030-29026-9_17 Abhishek De and Alexis Saurin. 2019. Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. In TABLEAUX 2019, Serenella Cerrito and Andrei Popescu (Eds.). Springer International Publishing, 297\u2013316. https:\/\/doi.org\/10.1007\/978-3-030-29026-9_17"},{"key":"e_1_3_2_1_20_1","volume-title":"Article arXiv:1908.01909 (Aug.","author":"Derakhshan Farzaneh","year":"2019","unstructured":"Farzaneh Derakhshan and Frank Pfenning . 2019. Circular Proofs as Session-Typed Processes: A Local Validity Condition. arXiv e-prints , Article arXiv:1908.01909 (Aug. 2019 ), arXiv:1908.01909\u00a0pages. arxiv:1908.01909\u00a0[cs.LO] Farzaneh Derakhshan and Frank Pfenning. 2019. Circular Proofs as Session-Typed Processes: A Local Validity Condition. arXiv e-prints, Article arXiv:1908.01909 (Aug. 2019), arXiv:1908.01909\u00a0pages. arxiv:1908.01909\u00a0[cs.LO]"},{"key":"e_1_3_2_1_21_1","volume-title":"\u00a0S. Rowe","author":"Docherty Simon","year":"2019","unstructured":"Simon Docherty and Reuben N . \u00a0S. Rowe . 2019 . A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic. In Automated Reasoning with Analytic Tableaux and Related Methods, Serenella Cerrito and Andrei Popescu (Eds.). Springer International Publishing , Cham, 335\u2013352. Simon Docherty and Reuben N.\u00a0S. Rowe. 2019. A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic. In Automated Reasoning with Analytic Tableaux and Related Methods, Serenella Cerrito and Andrei Popescu (Eds.). Springer International Publishing, Cham, 335\u2013352."},{"volume-title":"Constructive completeness for the linear-time \u03bc-calculus","author":"Doumane Amina","key":"e_1_3_2_1_22_1","unstructured":"Amina Doumane . 2017. Constructive completeness for the linear-time \u03bc-calculus . In LICS. IEEE Computer Society , 1\u201312. Amina Doumane. 2017. Constructive completeness for the linear-time \u03bc-calculus. In LICS. IEEE Computer Society, 1\u201312."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470664"},{"key":"e_1_3_2_1_25_1","unstructured":"J\u00e9r\u00f4me Fortier and Luigi Santocanale. 2013. Cuts for circular proofs: semantics and cut-elimination. In CSL.  J\u00e9r\u00f4me Fortier and Luigi Santocanale. 2013. Cuts for circular proofs: semantics and cut-elimination. In CSL."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.686159"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_28_1","volume-title":"Proof-nets: The parallel syntax for proof-theory. In Logic and Algebra","author":"Girard Jean-Yves","year":"1996","unstructured":"Jean-Yves Girard . 1996 . Proof-nets: The parallel syntax for proof-theory. In Logic and Algebra . Marcel Dekker , 97\u2013124. Jean-Yves Girard. 1996. Proof-nets: The parallel syntax for proof-theory. In Logic and Algebra. Marcel Dekker, 97\u2013124."},{"key":"e_1_3_2_1_29_1","unstructured":"Farzad Jafarrahmani. 2018. Denotational semantics of linear logic with least and greatest fixpoint. Master\u2019s thesis. Universit\u00e9 Paris Diderot.  Farzad Jafarrahmani. 2018. Denotational semantics of linear logic with least and greatest fixpoint. Master\u2019s thesis. Universit\u00e9 Paris Diderot."},{"volume-title":"Monotone Fixed-Point Types and Strong Normalization","author":"Matthes Ralph","key":"e_1_3_2_1_30_1","unstructured":"Ralph Matthes . 1999. Monotone Fixed-Point Types and Strong Normalization . In Computer Science Logic, Georg Gottlob, Etienne Grandjean, and Katrin Seyr (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 298\u2013312. Ralph Matthes. 1999. Monotone Fixed-Point Types and Strong Normalization. In Computer Science Logic, Georg Gottlob, Etienne Grandjean, and Katrin Seyr (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 298\u2013312."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01091743"},{"key":"e_1_3_2_1_32_1","first-page":"1","article-title":"Local Validity for Circular Proofs in Linear Logic with Fixed Points. In CSL(LIPIcs, Vol.\u00a0119)","volume":"35","author":"Nollet R\u00e9mi","year":"2018","unstructured":"R\u00e9mi Nollet , Alexis Saurin , and Christine Tasson . 2018 . Local Validity for Circular Proofs in Linear Logic with Fixed Points. In CSL(LIPIcs, Vol.\u00a0119) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 35 : 1 \u2013 35 :23. R\u00e9mi Nollet, Alexis Saurin, and Christine Tasson. 2018. Local Validity for Circular Proofs in Linear Logic with Fixed Points. In CSL(LIPIcs, Vol.\u00a0119). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 35:1\u201335:23.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_33_1","volume-title":"Natural Deduction: A Proof-Theoretical Study","author":"Prawitz Dag","year":"1965","unstructured":"Dag Prawitz . 1965 . Natural Deduction: A Proof-Theoretical Study . Dover Publications . Dag Prawitz. 1965. Natural Deduction: A Proof-Theoretical Study. Dover Publications."},{"volume-title":"Automated Deduction \u2014 CADE-12","author":"Protzen Martin","key":"e_1_3_2_1_34_1","unstructured":"Martin Protzen . 1994. Lazy generation of induction hypotheses . In Automated Deduction \u2014 CADE-12 , Alan Bundy (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 42\u201356. Martin Protzen. 1994. Lazy generation of induction hypotheses. In Automated Deduction \u2014 CADE-12, Alan Bundy (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 42\u201356."},{"volume-title":"Foundations of Software Science and Computation Structures(Lecture Notes in Computer Science, Vol.\u00a02303)","author":"Santocanale Luigi","key":"e_1_3_2_1_35_1","unstructured":"Luigi Santocanale . 2002. A Calculus of Circular Proofs and Its Categorical Semantics . In Foundations of Software Science and Computation Structures(Lecture Notes in Computer Science, Vol.\u00a02303) , Mogens Nielsen and Uffe Engberg (Eds.). Springer , 357\u2013371. Luigi Santocanale. 2002. A Calculus of Circular Proofs and Its Categorical Semantics. In Foundations of Software Science and Computation Structures(Lecture Notes in Computer Science, Vol.\u00a02303), Mogens Nielsen and Uffe Engberg (Eds.). Springer, 357\u2013371."},{"volume-title":"FoSSaCS(Lecture Notes in Computer Science, Vol.\u00a02303)","author":"Sch\u00f6pp Ulrich","key":"e_1_3_2_1_36_1","unstructured":"Ulrich Sch\u00f6pp and Alex\u00a0 K. Simpson . 2002. Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes . In FoSSaCS(Lecture Notes in Computer Science, Vol.\u00a02303) . Springer , 372\u2013386. Ulrich Sch\u00f6pp and Alex\u00a0K. Simpson. 2002. Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. In FoSSaCS(Lecture Notes in Computer Science, Vol.\u00a02303). Springer, 372\u2013386."},{"volume-title":"Foundations of Software Science and Computation Structures, Andrew\u00a0D","author":"Sprenger Christoph","key":"e_1_3_2_1_37_1","unstructured":"Christoph Sprenger and Mads Dam . 2003. On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the \u03bcCalculus . In Foundations of Software Science and Computation Structures, Andrew\u00a0D . Gordon (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 425\u2013440. Christoph Sprenger and Mads Dam. 2003. On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the \u03bcCalculus. In Foundations of Software Science and Computation Structures, Andrew\u00a0D. Gordon (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 425\u2013440."},{"key":"e_1_3_2_1_38_1","volume-title":"TABLEAUX 2017, Bras\u00edlia, Brazil, September 25-28, 2017, Proceedings. 311\u2013327","author":"Stratulat Sorin","year":"2017","unstructured":"Sorin Stratulat . 2017 . Cyclic Proofs with Ordering Constraints. In Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference , TABLEAUX 2017, Bras\u00edlia, Brazil, September 25-28, 2017, Proceedings. 311\u2013327 . Sorin Stratulat. 2017. Cyclic Proofs with Ordering Constraints. In Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Bras\u00edlia, Brazil, September 25-28, 2017, Proceedings. 311\u2013327."}],"event":{"name":"PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming","acronym":"PPDP 2021","location":"Tallinn Estonia"},"container-title":["23rd International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3479394.3479402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3479394.3479402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:52Z","timestamp":1750191532000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3479394.3479402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,6]]},"references-count":37,"alternative-id":["10.1145\/3479394.3479402","10.1145\/3479394"],"URL":"https:\/\/doi.org\/10.1145\/3479394.3479402","relation":{},"subject":[],"published":{"date-parts":[[2021,9,6]]},"assertion":[{"value":"2021-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}