{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:58:32Z","timestamp":1781078312479,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1909204, 2019844, 2047933, 2211971"],"award-info":[{"award-number":["1909204, 2019844, 2047933, 2211971"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585206","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1657-1670","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity"],"prefix":"10.1145","author":[{"given":"Aravind","family":"Gollakota","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam R.","family":"Klivans","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pravesh K.","family":"Kothari","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00359-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0075847"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00023"},{"key":"e_1_3_2_1_4_1","volume-title":"Outlier-Robust Clustering of Non-Spherical Mixtures. CoRR, abs\/2005.02970","author":"Bakshi Ainesh","year":"2020","unstructured":"Ainesh Bakshi and Pravesh Kothari . 2020. Outlier-Robust Clustering of Non-Spherical Mixtures. CoRR, abs\/2005.02970 ( 2020 ), arXiv:2005.02970. arxiv:2005.02970 Ainesh Bakshi and Pravesh Kothari. 2020. Outlier-Robust Clustering of Non-Spherical Mixtures. CoRR, abs\/2005.02970 (2020), arXiv:2005.02970. arxiv:2005.02970"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.78"},{"key":"e_1_3_2_1_6_1","unstructured":"Peter L Bartlett. 2014. UC Berkeley CS281B\/Stat241B: Statistical Learning Theory Lecture 7. URL: https:\/\/www.stat.berkeley.edu\/ bartlett\/courses\/2014spring-cs281bstat241b\/lectures\/07-notes.pdf \t\t\t\t  Peter L Bartlett. 2014. UC Berkeley CS281B\/Stat241B: Statistical Learning Theory Lecture 7. URL: https:\/\/www.stat.berkeley.edu\/ bartlett\/courses\/2014spring-cs281bstat241b\/lectures\/07-notes.pdf"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013999503812"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1907378117"},{"key":"e_1_3_2_1_10_1","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","author":"Bartlett Peter L","year":"2002","unstructured":"Peter L Bartlett and Shahar Mendelson . 2002 . Rademacher and Gaussian complexities: Risk bounds and structural results . Journal of Machine Learning Research, 3 , Nov (2002), 463 \u2013 482 . Peter L Bartlett and Shahar Mendelson. 2002. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3, Nov (2002), 463\u2013482.","journal-title":"Journal of Machine Learning Research, 3"},{"key":"e_1_3_2_1_11_1","volume-title":"Deep learning: a statistical viewpoint. Acta numerica, 30","author":"Bartlett Peter L","year":"2021","unstructured":"Peter L Bartlett , Andrea Montanari , and Alexander Rakhlin . 2021. Deep learning: a statistical viewpoint. Acta numerica, 30 ( 2021 ), 87\u2013201. Peter L Bartlett, Andrea Montanari, and Alexander Rakhlin. 2021. Deep learning: a statistical viewpoint. Acta numerica, 30 (2021), 87\u2013201."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/070691954"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492921000039"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/117115.117118"},{"key":"e_1_3_2_1_15_1","volume-title":"Festschrift for lucien le cam","author":"Birg\u00e9 Lucien","unstructured":"Lucien Birg\u00e9 and Pascal Massart . 1997. From model selection to adaptive estimation . In Festschrift for lucien le cam . Springer , 55\u201387. Lucien Birg\u00e9 and Pascal Massart. 1997. From model selection to adaptive estimation. In Festschrift for lucien le cam. Springer, 55\u201387."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Olivier Bousquet St\u00e9phane Boucheron and G\u00e1bor Lugosi. 2003. Introduction to statistical learning theory. In Summer school on machine learning. 169\u2013207. \t\t\t\t  Olivier Bousquet St\u00e9phane Boucheron and G\u00e1bor Lugosi. 2003. Introduction to statistical learning theory. In Summer school on machine learning. 169\u2013207.","DOI":"10.1007\/978-3-540-28650-9_8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754401"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234564"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897520"},{"key":"e_1_3_2_1_20_1","volume-title":"Conference on Learning Theory. 815\u2013830","author":"Daniely Amit","year":"2016","unstructured":"Amit Daniely and Shai Shalev-Shwartz . 2016 . Complexity theoretic limitations on learning DNF\u2019s . In Conference on Learning Theory. 815\u2013830 . Amit Daniely and Shai Shalev-Shwartz. 2016. Complexity theoretic limitations on learning DNF\u2019s. In Conference on Learning Theory. 815\u2013830."},{"key":"e_1_3_2_1_21_1","unstructured":"Anindya De Shivam Nadimpalli and Rocco Servedio. 2022. Convex Influences. Innovations in Theoretical Computer Science. \t\t\t\t  Anindya De Shivam Nadimpalli and Rocco Servedio. 2022. Convex Influences. Innovations in Theoretical Computer Science."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/100783030"},{"key":"e_1_3_2_1_23_1","first-page":"13586","article-title":"Near-optimal sq lower bounds for agnostically learning halfspaces and relus under gaussian marginals","volume":"33","author":"Diakonikolas Ilias","year":"2020","unstructured":"Ilias Diakonikolas , Daniel Kane , and Nikos Zarifis . 2020 . Near-optimal sq lower bounds for agnostically learning halfspaces and relus under gaussian marginals . Advances in Neural Information Processing Systems , 33 (2020), 13586 \u2013 13596 . Ilias Diakonikolas, Daniel Kane, and Nikos Zarifis. 2020. Near-optimal sq lower bounds for agnostically learning halfspaces and relus under gaussian marginals. Advances in Neural Information Processing Systems, 33 (2020), 13586\u201313596.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.8"},{"key":"e_1_3_2_1_25_1","volume-title":"Conference on Learning Theory. 1552\u20131584","author":"Diakonikolas Ilias","year":"2021","unstructured":"Ilias Diakonikolas , Daniel M Kane , Thanasis Pittas , and Nikos Zarifis . 2021 . The optimality of polynomial regression for agnostic learning under gaussian marginals in the SQ model . In Conference on Learning Theory. 1552\u20131584 . Ilias Diakonikolas, Daniel M Kane, Thanasis Pittas, and Nikos Zarifis. 2021. The optimality of polynomial regression for agnostic learning under gaussian marginals in the SQ model. In Conference on Learning Theory. 1552\u20131584."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/120865094"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01091625"},{"key":"e_1_3_2_1_28_1","first-page":"2147","article-title":"Statistical-query lower bounds via functional gradients","volume":"33","author":"Goel Surbhi","year":"2020","unstructured":"Surbhi Goel , Aravind Gollakota , and Adam Klivans . 2020 . Statistical-query lower bounds via functional gradients . Advances in Neural Information Processing Systems , 33 (2020), 2147 \u2013 2158 . Surbhi Goel, Aravind Gollakota, and Adam Klivans. 2020. Statistical-query lower bounds via functional gradients. Advances in Neural Information Processing Systems, 33 (2020), 2147\u20132158.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/070685798"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20786"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2133"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520006"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/060649057"},{"key":"e_1_3_2_1_34_1","volume-title":"Conference on Learning Theory. 522\u2013545","author":"Kane Daniel","year":"2013","unstructured":"Daniel Kane , Adam Klivans , and Raghu Meka . 2013 . Learning halfspaces under log-concave densities: Polynomial approximations and moment matching . In Conference on Learning Theory. 522\u2013545 . Daniel Kane, Adam Klivans, and Raghu Meka. 2013. Learning halfspaces under log-concave densities: Polynomial approximations and moment matching. In Conference on Learning Theory. 522\u2013545."},{"key":"e_1_3_2_1_35_1","volume-title":"The Gaussian surface area and noise sensitivity of degree-d polynomial threshold functions. computational complexity, 20, 2","author":"Kane Daniel M","year":"2011","unstructured":"Daniel M Kane . 2011. The Gaussian surface area and noise sensitivity of degree-d polynomial threshold functions. computational complexity, 20, 2 ( 2011 ), 389\u2013412. Daniel M Kane. 2011. The Gaussian surface area and noise sensitivity of degree-d polynomial threshold functions. computational complexity, 20, 2 (2011), 389\u2013412."},{"key":"e_1_3_2_1_36_1","volume-title":"List-decodable Linear Regression. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019","author":"Karmalkar Sushrut","year":"2019","unstructured":"Sushrut Karmalkar , Adam R. Klivans , and Pravesh Kothari . 2019 . List-decodable Linear Regression. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019 , NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily B. Fox, and Roman Garnett (Eds.). 7423\u20137432. https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/7f5fc754c7af0a6370c9bf91314e79f4-Abstract.html Sushrut Karmalkar, Adam R. Klivans, and Pravesh Kothari. 2019. List-decodable Linear Regression. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily B. Fox, and Roman Garnett (Eds.). 7423\u20137432. https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/7f5fc754c7af0a6370c9bf91314e79f4-Abstract.html"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174647"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/130385.130424"},{"key":"e_1_3_2_1_39_1","volume-title":"Proximity of probability measures with common marginals in a finite number of directions. Lecture Notes-Monograph Series, 162\u2013174","author":"Klebanov LB","unstructured":"LB Klebanov and ST Rachev . 1996. Proximity of probability measures with common marginals in a finite number of directions. Lecture Notes-Monograph Series, 162\u2013174 . LB Klebanov and ST Rachev. 1996. Proximity of probability measures with common marginals in a finite number of directions. Lecture Notes-Monograph Series, 162\u2013174."},{"key":"e_1_3_2_1_40_1","unstructured":"Adam Klivans and Raghu Meka. 2013. Moment-matching polynomials. arXiv preprint arXiv:1301.0820. \t\t\t\t  Adam Klivans and Raghu Meka. 2013. Moment-matching polynomials. arXiv preprint arXiv:1301.0820."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.64"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.008"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.930926"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001019"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1358-1_29"},{"key":"e_1_3_2_1_46_1","volume-title":"9th Innovations in Theoretical Computer Science Conference (ITCS","author":"Kothari Pravesh K","year":"2018","unstructured":"Pravesh K Kothari and Roi Livni . 2018 . Improper learning by refuting . In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Pravesh K Kothari and Roi Livni. 2018. Improper learning by refuting. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)."},{"key":"e_1_3_2_1_47_1","volume-title":"On the Minimal Error of Empirical Risk Minimization. In Conference on Learning Theory. 2849\u20132852","author":"Kur Gil","year":"2021","unstructured":"Gil Kur and Alexander Rakhlin . 2021 . On the Minimal Error of Empirical Risk Minimization. In Conference on Learning Theory. 2849\u20132852 . Gil Kur and Alexander Rakhlin. 2021. On the Minimal Error of Empirical Risk Minimization. In Conference on Learning Theory. 2849\u20132852."},{"key":"e_1_3_2_1_48_1","volume-title":"The Concentration of Measure Phenomenon (Mathematical surveys and monographs)","author":"Ledoux Michel","unstructured":"Michel Ledoux . 2001. The Concentration of Measure Phenomenon (Mathematical surveys and monographs) . American Mathematical Society . Michel Ledoux. 2001. The Concentration of Measure Phenomenon (Mathematical surveys and monographs). American Mathematical Society."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174138"},{"key":"e_1_3_2_1_50_1","volume-title":"Uniform convergence may be unable to explain generalization in deep learning. Advances in Neural Information Processing Systems, 32","author":"Nagarajan Vaishnavh","year":"2019","unstructured":"Vaishnavh Nagarajan and J Zico Kolter . 2019. Uniform convergence may be unable to explain generalization in deep learning. Advances in Neural Information Processing Systems, 32 ( 2019 ). Vaishnavh Nagarajan and J Zico Kolter. 2019. Uniform convergence may be unable to explain generalization in deep learning. Advances in Neural Information Processing Systems, 32 (2019)."},{"key":"e_1_3_2_1_51_1","volume-title":"The methods of distances in the theory of probability and statistics. 10","author":"Rachev Svetlozar T","unstructured":"Svetlozar T Rachev , Lev B Klebanov , Stoyan V Stoyanov , and Frank Fabozzi . 2013. The methods of distances in the theory of probability and statistics. 10 , Springer . Svetlozar T Rachev, Lev B Klebanov, Stoyan V Stoyanov, and Frank Fabozzi. 2013. The methods of distances in the theory of probability and statistics. 10, Springer."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.10"},{"key":"e_1_3_2_1_53_1","unstructured":"Prasad Raghavendra and Morris Yau. 2020. List Decodable Subspace Recovery. arxiv:2002.03004. \t\t\t\t  Prasad Raghavendra and Morris Yau. 2020. List Decodable Subspace Recovery. arxiv:2002.03004."},{"key":"e_1_3_2_1_54_1","volume-title":"A remark on Stirling\u2019s formula. The American mathematical monthly, 62, 1","author":"Robbins Herbert","year":"1955","unstructured":"Herbert Robbins . 1955. A remark on Stirling\u2019s formula. The American mathematical monthly, 62, 1 ( 1955 ), 26\u201329. Herbert Robbins. 1955. A remark on Stirling\u2019s formula. The American mathematical monthly, 62, 1 (1955), 26\u201329."},{"key":"e_1_3_2_1_55_1","unstructured":"Ronitt Rubinfeld and Arsen Vasilyan. 2022. Testing distributional assumptions of learning algorithms. arXiv preprint arXiv:2204.07196v1 April. \t\t\t\t  Ronitt Rubinfeld and Arsen Vasilyan. 2022. Testing distributional assumptions of learning algorithms. arXiv preprint arXiv:2204.07196v1 April."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Ronitt Rubinfeld and Arsen Vasilyan. 2022. Testing distributional assumptions of learning algorithms (v2). Private communication. \t\t\t\t  Ronitt Rubinfeld and Arsen Vasilyan. 2022. Testing distributional assumptions of learning algorithms (v2). Private communication.","DOI":"10.1145\/3564246.3585117"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-SS107"},{"key":"e_1_3_2_1_58_1","volume-title":"Understanding machine learning: From theory to algorithms","author":"Shalev-Shwartz Shai","unstructured":"Shai Shalev-Shwartz and Shai Ben-David . 2014. Understanding machine learning: From theory to algorithms . Cambridge university press . Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding machine learning: From theory to algorithms. Cambridge university press."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953019"},{"key":"e_1_3_2_1_60_1","volume-title":"Semi-infinite programming","author":"Shapiro Alexander","unstructured":"Alexander Shapiro . 2001. On duality theory of conic linear problems . In Semi-infinite programming . Springer , 135\u2013165. Alexander Shapiro. 2001. On duality theory of conic linear problems. In Semi-infinite programming. Springer, 135\u2013165."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.5555\/3135595.3135610"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/1522486"},{"key":"e_1_3_2_1_63_1","volume-title":"Conference on Learning Theory. 1835\u20131848","author":"Vadhan Salil","year":"2017","unstructured":"Salil Vadhan . 2017 . On learning vs. refutation . In Conference on Learning Theory. 1835\u20131848 . Salil Vadhan. 2017. On learning vs. refutation. In Conference on Learning Theory. 1835\u20131848."},{"key":"e_1_3_2_1_64_1","volume-title":"Empirical Processes in M-estimation. 6","author":"Van de Geer Sara A","unstructured":"Sara A Van de Geer . 2000. Empirical Processes in M-estimation. 6 , Cambridge university press . Sara A Van de Geer. 2000. Empirical Processes in M-estimation. 6, Cambridge university press."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"e_1_3_2_1_66_1","volume-title":"High-dimensional probability: An introduction with applications in data science. 47","author":"Vershynin Roman","unstructured":"Roman Vershynin . 2018. High-dimensional probability: An introduction with applications in data science. 47 , Cambridge university press . Roman Vershynin. 2018. High-dimensional probability: An introduction with applications in data science. 47, Cambridge university press."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446776"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/1128025"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585206","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":68,"alternative-id":["10.1145\/3564246.3585206","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585206","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}