{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:06:47Z","timestamp":1750694807644,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597736","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"561-581","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Prophet Secretary Against the Online Optimal"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0635-6812","authenticated-orcid":false,"given":"Paul","family":"D\u00fctting","sequence":"first","affiliation":[{"name":"Google Research, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9905-2457","authenticated-orcid":false,"given":"Evangelia","family":"Gergatsouli","sequence":"additional","affiliation":[{"name":"University of Wisconsin - Madison, Madison, Wisconsin, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0155-5369","authenticated-orcid":false,"given":"Rojin","family":"Rezvan","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, Texas, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4824-3840","authenticated-orcid":false,"given":"Yifeng","family":"Teng","sequence":"additional","affiliation":[{"name":"Google Research, New York, New York, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7558-2215","authenticated-orcid":false,"given":"Alexandros","family":"Tsigonias-Dimitriadis","sequence":"additional","affiliation":[{"name":"Universidad de Chile, Santiago, Chile"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/3391403.3399484"},{"key":"e_1_3_2_1_2_1","volume-title":"FOCS'11: The 52nd IEEE Symposium on Foundations of Computer Science","author":"Alaei Saeed","year":"2011","unstructured":"Saeed Alaei . Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers . In FOCS'11: The 52nd IEEE Symposium on Foundations of Computer Science , Palm Springs, CA, USA, pages 512--521 , 2011 . Saeed Alaei. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In FOCS'11: The 52nd IEEE Symposium on Foundations of Computer Science, Palm Springs, CA, USA, pages 512--521, 2011."},{"key":"e_1_3_2_1_3_1","volume-title":"EC'19: The 20th ACM Conference on Economics and Computation","author":"Anari Nima","year":"2019","unstructured":"Nima Anari , Rad Niazadeh , Amin Saberi , and Ali Shameli . Nearly optimal pricing algorithms for production constrained and laminar bayesian selection . In EC'19: The 20th ACM Conference on Economics and Computation , Phoenix, AZ, USA. ACM , 2019 . Nima Anari, Rad Niazadeh, Amin Saberi, and Ali Shameli. Nearly optimal pricing algorithms for production constrained and laminar bayesian selection. In EC'19: The 20th ACM Conference on Economics and Computation, Phoenix, AZ, USA. ACM, 2019."},{"key":"e_1_3_2_1_4_1","volume-title":"EC'18: The 19th ACM Conference on Economics and Computation","author":"Azar Yossi","year":"2018","unstructured":"Yossi Azar , Ashish Chiplunkar , and Haim Kaplan . Prophet secretary : Surpassing the 1-1\/e barrier . In EC'18: The 19th ACM Conference on Economics and Computation , Ithaca, NY, USA, pages 303--318 , 2018 . Yossi Azar, Ashish Chiplunkar, and Haim Kaplan. Prophet secretary: Surpassing the 1-1\/e barrier. In EC'18: The 19th ACM Conference on Economics and Computation, Ithaca, NY, USA, pages 303--318, 2018."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.48550\/arXiv.2212.01524"},{"key":"e_1_3_2_1_6_1","volume-title":"EC'19: The 20th ACM Conference on Economics and Computation","author":"Beyhaghi Hedyeh","year":"2019","unstructured":"Hedyeh Beyhaghi and Robert Kleinberg . Pandora's problem with nonobligatory inspection . In EC'19: The 20th ACM Conference on Economics and Computation , Phoenix, AZ, USA, pages 131--132 , 2019 . Hedyeh Beyhaghi and Robert Kleinberg. Pandora's problem with nonobligatory inspection. In EC'19: The 20th ACM Conference on Economics and Computation, Phoenix, AZ, USA, pages 131--132, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/3391403.3399501"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/3490486.3538315"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.48550\/arXiv.2211.04145"},{"key":"e_1_3_2_1_10_1","volume-title":"WINE'10: The Sixth International Workshop on Internet and Network Economics","author":"Chakraborty Tanmoy","year":"2010","unstructured":"Tanmoy Chakraborty , Eyal Even-Dar , Sudipto Guha , Yishay Mansour , and S. Muthukrishnan . Approximation schemes for sequential posted pricing in multi-unit auctions . In WINE'10: The Sixth International Workshop on Internet and Network Economics , Stanford, CA, USA, pages 158--169. 2010 . Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, and S. Muthukrishnan. Approximation schemes for sequential posted pricing in multi-unit auctions. In WINE'10: The Sixth International Workshop on Internet and Network Economics, Stanford, CA, USA, pages 158--169. 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_12_1","volume-title":"FOCS'20: 61st IEEE Annual Symposium on Foundations of Computer Science","author":"Chawla Shuchi","year":"2020","unstructured":"Shuchi Chawla , Evangelia Gergatsouli , Yifeng Teng , Christos Tzamos , and Ruimin Zhang . Pandora's box with correlations: Learning and approximation . In FOCS'20: 61st IEEE Annual Symposium on Foundations of Computer Science , Durham, NC, USA, pages 1214--1225 , 2020 . Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, and Ruimin Zhang. Pandora's box with correlations: Learning and approximation. In FOCS'20: 61st IEEE Annual Symposium on Foundations of Computer Science, Durham, NC, USA, pages 1214--1225, 2020."},{"key":"e_1_3_2_1_13_1","volume-title":"Approximating pandora's box with correlations. CoRR, abs\/2108.12976","author":"Chawla Shuchi","year":"2021","unstructured":"Shuchi Chawla , Evangelia Gergatsouli , Jeremy McMahan , and Christos Tzamos . Approximating pandora's box with correlations. CoRR, abs\/2108.12976 , 2021 . URL https:\/\/arxiv.org\/abs\/2108.12976. Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, and Christos Tzamos. Approximating pandora's box with correlations. CoRR, abs\/2108.12976, 2021. URL https:\/\/arxiv.org\/abs\/2108.12976."},{"key":"e_1_3_2_1_14_1","volume-title":"EC'17: The 18th ACM Conference on Economics and Computation","author":"Correa Jos\u00e9 R.","year":"2017","unstructured":"Jos\u00e9 R. Correa , Patricio Foncea , Ruben Hoeksma , Tim Oosterwijk , and Tjark Vredeveld . Posted price mechanisms for a random stream of customers . In EC'17: The 18th ACM Conference on Economics and Computation , Cambridge, MA, USA, pages 169--186 , 2017 . Jos\u00e9 R. Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, and Tjark Vredeveld. Posted price mechanisms for a random stream of customers. In EC'17: The 18th ACM Conference on Economics and Computation, Cambridge, MA, USA, pages 169--186, 2017."},{"issue":"1","key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/3331033.3331039","article-title":"Recent developments in prophet inequalities","volume":"17","author":"Correa Jos\u00e9 R.","year":"2018","unstructured":"Jos\u00e9 R. Correa , Patricio Foncea , Ruben Hoeksma , Tim Oosterwijk , and Tjark Vredeveld . Recent developments in prophet inequalities . SIGecom Exchanges , 17 ( 1 ): 61 -- 70 , 2018 . Jos\u00e9 R. Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, and Tjark Vredeveld. Recent developments in prophet inequalities. SIGecom Exchanges, 17(1):61--70, 2018.","journal-title":"SIGecom Exchanges"},{"key":"e_1_3_2_1_16_1","volume-title":"From pricing to prophets, and back! Operations Research Letters, 47(1):25--29","author":"Correa Jos\u00e9 R.","year":"2019","unstructured":"Jos\u00e9 R. Correa , Patricio Foncea , Dana Pizarro , and Victor Verdugo . From pricing to prophets, and back! Operations Research Letters, 47(1):25--29 , 2019 a. Jos\u00e9 R. Correa, Patricio Foncea, Dana Pizarro, and Victor Verdugo. From pricing to prophets, and back! Operations Research Letters, 47(1):25--29, 2019a."},{"key":"e_1_3_2_1_17_1","volume-title":"SODA'19: The 30th ACM-SIAM Symposium on Discrete Algorithms","author":"Correa Jos\u00e9 R.","year":"1946","unstructured":"Jos\u00e9 R. Correa , Raimundo Saona , and Bruno Ziliotto . Prophet secretary through blind strategies . In SODA'19: The 30th ACM-SIAM Symposium on Discrete Algorithms , San Diego, California, USA, pages 1946 --1961, 2019b. Jos\u00e9 R. Correa, Raimundo Saona, and Bruno Ziliotto. Prophet secretary through blind strategies. In SODA'19: The 30th ACM-SIAM Symposium on Discrete Algorithms, San Diego, California, USA, pages 1946--1961, 2019b."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/j.jet.2018.01.005"},{"key":"e_1_3_2_1_19_1","volume-title":"FOCS'17: The 58th IEEE Symposium on Foundations of Computer Science","author":"D\u00fctting Paul","year":"2017","unstructured":"Paul D\u00fctting , Michal Feldman , Thomas Kesselheim , and Brendan Lucier . Prophet inequalities made easy: Stochastic optimization by pricing non-stochastic inputs . In FOCS'17: The 58th IEEE Symposium on Foundations of Computer Science , Berkeley, CA, USA, pages 540--551 , 2017 . Paul D\u00fctting, Michal Feldman, Thomas Kesselheim, and Brendan Lucier. Prophet inequalities made easy: Stochastic optimization by pricing non-stochastic inputs. In FOCS'17: The 58th IEEE Symposium on Foundations of Computer Science, Berkeley, CA, USA, pages 540--551, 2017."},{"key":"e_1_3_2_1_20_1","volume-title":"FOCS'20: The 61st IEEE Symposium on Foundations of Computer Science","author":"D\u00fctting Paul","year":"2020","unstructured":"Paul D\u00fctting , Thomas Kesselheim , and Brendan Lucier . An O(log log m) prophet inequality for subadditive combinatorial auctions . In FOCS'20: The 61st IEEE Symposium on Foundations of Computer Science , Durham, NC, USA, pages 306--317 , 2020 . Paul D\u00fctting, Thomas Kesselheim, and Brendan Lucier. An O(log log m) prophet inequality for subadditive combinatorial auctions. In FOCS'20: The 61st IEEE Symposium on Foundations of Computer Science, Durham, NC, USA, pages 306--317, 2020."},{"key":"e_1_3_2_1_21_1","volume-title":"SODA'18: The 29th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Ehsani Soheil","year":"2018","unstructured":"Soheil Ehsani , MohammadTaghi Hajiaghayi , Thomas Kesselheim , and Sahil Singla . Prophet secretary for combinatorial auctions and matroids . In SODA'18: The 29th Annual ACM-SIAM Symposium on Discrete Algorithms , New Orleans, LA, USA, pages 700--714 , 2018 . Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, and Sahil Singla. Prophet secretary for combinatorial auctions and matroids. In SODA'18: The 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, pages 700--714, 2018."},{"key":"e_1_3_2_1_22_1","volume-title":"ESA'15: The 23rd European Symposium on Algorithms Algorithms","author":"Esfandiari Hossein","year":"2015","unstructured":"Hossein Esfandiari , MohammadTaghi Hajiaghayi , Vahid Liaghat , and Morteza Monemizadeh . Prophet secretary . In ESA'15: The 23rd European Symposium on Algorithms Algorithms , Patras, Greece, pages 496--508 , 2015 . Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, and Morteza Monemizadeh. Prophet secretary. In ESA'15: The 23rd European Symposium on Algorithms Algorithms, Patras, Greece, pages 496--508, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3391403.3399513"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/3490486.3538290"},{"key":"e_1_3_2_1_25_1","volume-title":"SODA'15: The 26th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Feldman Michal","year":"2015","unstructured":"Michal Feldman , Nick Gravin , and Brendan Lucier . Combinatorial auctions via posted prices . In SODA'15: The 26th Annual ACM-SIAM Symposium on Discrete Algorithms , San Diego, CA, USA, pages 123--135 , 2015 . Michal Feldman, Nick Gravin, and Brendan Lucier. Combinatorial auctions via posted prices. In SODA'15: The 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, USA, pages 123--135, 2015."},{"key":"e_1_3_2_1_26_1","volume-title":"SODA'16:The 27th ACM-SIAM Symposium on Discrete Algorithms","author":"Feldman Moran","year":"2016","unstructured":"Moran Feldman , Ola Svensson , and Rico Zenklusen . Online contention resolution schemes . In SODA'16:The 27th ACM-SIAM Symposium on Discrete Algorithms , Arlington, VA, USA, pages 1014--1033 , 2016 . Moran Feldman, Ola Svensson, and Rico Zenklusen. Online contention resolution schemes. In SODA'16:The 27th ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, USA, pages 1014--1033, 2016."},{"key":"e_1_3_2_1_27_1","first-page":"1","volume-title":"ICALP'18: 45th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic","author":"Fu Hao","year":"2018","unstructured":"Hao Fu , Jian Li , and Pan Xu . A PTAS for a Class of Stochastic Dynamic Programs . In ICALP'18: 45th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic , pages 56: 1 -- 56 :14, 2018 . Hao Fu, Jian Li, and Pan Xu. A PTAS for a Class of Stochastic Dynamic Programs. In ICALP'18: 45th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic, pages 56:1--56:14, 2018."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.48550\/arXiv.2207.09545"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/3328526.3329604"},{"key":"e_1_3_2_1_30_1","volume-title":"Information acquisition and exploitation in multichannel wireless networks. CoRR, abs\/0804.1724","author":"Guha Sudipto","year":"2008","unstructured":"Sudipto Guha , Kamesh Munagala , and Saswati Sarkar . Information acquisition and exploitation in multichannel wireless networks. CoRR, abs\/0804.1724 , 2008 . URL https:\/\/arxiv.org\/abs\/0804.1724. Sudipto Guha, Kamesh Munagala, and Saswati Sarkar. Information acquisition and exploitation in multichannel wireless networks. CoRR, abs\/0804.1724, 2008. URL https:\/\/arxiv.org\/abs\/0804.1724."},{"key":"e_1_3_2_1_31_1","volume-title":"AAAI'07: The 22nd AAAI Conference on Artificial Intelligence","author":"Hajiaghayi Mohammad Taghi","year":"2007","unstructured":"Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , and Tuomas Sandholm . Automated online mechanism design and prophet inequalities . In AAAI'07: The 22nd AAAI Conference on Artificial Intelligence , Vancouver, British Columbia, Canada, pages 58--65 , 2007 . Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, and Tuomas Sandholm. Automated online mechanism design and prophet inequalities. In AAAI'07: The 22nd AAAI Conference on Artificial Intelligence, Vancouver, British Columbia, Canada, pages 58--65, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1214\/aop\/1176993861"},{"key":"e_1_3_2_1_33_1","first-page":"125","article-title":"A survey of prophet inequalities in optimal stopping theory","author":"Hill Theodore P.","year":"1992","unstructured":"Theodore P. Hill and Robert P. Kertz . A survey of prophet inequalities in optimal stopping theory . Contemporary Mathematics , 125 , 1992 . Theodore P. Hill and Robert P. Kertz. A survey of prophet inequalities in optimal stopping theory. Contemporary Mathematics, 125, 1992.","journal-title":"Contemporary Mathematics"},{"key":"e_1_3_2_1_34_1","volume-title":"STOC'12: The 44th Symposium on Theory of Computing Conference","author":"Kleinberg Robert","year":"2012","unstructured":"Robert Kleinberg and S. Matthew Weinberg . Matroid prophet inequalities . In STOC'12: The 44th Symposium on Theory of Computing Conference , New York, NY, USA, pages 123--136 , 2012 . Robert Kleinberg and S. Matthew Weinberg. Matroid prophet inequalities. In STOC'12: The 44th Symposium on Theory of Computing Conference, New York, NY, USA, pages 123--136, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_36_1","first-page":"197","article-title":"On semiamarts, amarts, and processes with finite value","volume":"4","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston . On semiamarts, amarts, and processes with finite value . Advances on Probabilty and Related Topics , 4 : 197 -- 266 , 1978 . Ulrich Krengel and Louis Sucheston. On semiamarts, amarts, and processes with finite value. Advances on Probabilty and Related Topics, 4:197--266, 1978.","journal-title":"Advances on Probabilty and Related Topics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/3465456.3467598"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/3144722.3144725"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.48550\/arXiv.2301.08680"},{"key":"e_1_3_2_1_40_1","volume-title":"WINE'18: 14th Conference on Web and Internet Economics","author":"Niazadeh Rad","year":"2018","unstructured":"Rad Niazadeh , Amin Saberi , and Ali Shameli . Prophet inequalities vs. approximating optimum online . In WINE'18: 14th Conference on Web and Internet Economics , Oxford, UK, pages 356--374 , 2018 . Rad Niazadeh, Amin Saberi, and Ali Shameli. Prophet inequalities vs. approximating optimum online. In WINE'18: 14th Conference on Web and Internet Economics, Oxford, UK, pages 356--374, 2018."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/3465456.3467613"},{"key":"e_1_3_2_1_42_1","volume-title":"FOCS'22: The 63rd IEEE Symposium on Foundations of Computer Science","author":"Peng Bo","year":"2022","unstructured":"Bo Peng and Zhihao Gavin Tang . Order selection prophet inequality: From threshold optimization to arrival time design . In FOCS'22: The 63rd IEEE Symposium on Foundations of Computer Science , Denver, CO, USA , 2022 . Bo Peng and Zhihao Gavin Tang. Order selection prophet inequality: From threshold optimization to arrival time design. In FOCS'22: The 63rd IEEE Symposium on Foundations of Computer Science, Denver, CO, USA, 2022."},{"key":"e_1_3_2_1_43_1","first-page":"1","volume-title":"ICALP'21: 48th International Colloquium on Automata, Languages, and Programming","author":"Saberi Amin","year":"2021","unstructured":"Amin Saberi and David Wajc . The Greedy Algorithm is not Optimal for On-Line Edge Coloring . In ICALP'21: 48th International Colloquium on Automata, Languages, and Programming , Glasgow, Scotland , pages 109: 1 -- 109 :18, 2021 . Amin Saberi and David Wajc. The Greedy Algorithm is not Optimal for On-Line Edge Coloring. In ICALP'21: 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, pages 109:1--109:18, 2021."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1214\/aop\/1176993150"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1145\/3465456.3467614"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.2307\/1910412"}],"event":{"sponsor":["SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC '23","name":"EC '23: 24th ACM Conference on Economics and Computation","location":"London United Kingdom"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597736","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:56Z","timestamp":1750182536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":46,"alternative-id":["10.1145\/3580507.3597736","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597736","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}