{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T16:40:26Z","timestamp":1772815226099,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1704656,CCF-1845171,DMS-1454939,CCF-1934964"],"award-info":[{"award-number":["CCF-1704656,CCF-1845171,DMS-1454939,CCF-1934964"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384289","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"579-586","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Estimating normalizing constants for log-concave distributions: algorithms and lower bounds"],"prefix":"10.1145","author":[{"given":"Rong","family":"Ge","sequence":"first","affiliation":[{"name":"Duke University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holden","family":"Lee","sequence":"additional","affiliation":[{"name":"Duke University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Lu","sequence":"additional","affiliation":[{"name":"Duke University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"From microphysics to macrophysics: methods and applications of statistical physics","author":"Balian Roger","year":"2007","unstructured":"Roger Balian . From microphysics to macrophysics: methods and applications of statistical physics , volume 2 . Springer Science & Business Media , 2007 . Roger Balian. From microphysics to macrophysics: methods and applications of statistical physics, volume 2. Springer Science & Business Media, 2007."},{"key":"e_1_3_2_2_2_1","volume-title":"World Scientific","author":"Stoltz Gabriel","year":"2010","unstructured":"Gabriel Stoltz , Mathias Rousset , Free energy computations: A mathematical perspective . World Scientific , 2010 . Gabriel Stoltz, Mathias Rousset, et al. Free energy computations: A mathematical perspective. World Scientific, 2010."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1028905934"},{"key":"e_1_3_2_2_4_1","volume-title":"On the complexity of computing the","author":"Dyer Martin E.","year":"1988","unstructured":"Martin E. Dyer and Alan M. Frieze . On the complexity of computing the volume of a polyhedron. SIAM Journal on Computing, 17 ( 5 ): 967-974, 1988 . Martin E. Dyer and Alan M. Frieze. On the complexity of computing the volume of a polyhedron. SIAM Journal on Computing, 17 ( 5 ): 967-974, 1988."},{"key":"e_1_3_2_2_5_1","volume-title":"Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43 : 169-188","author":"Jerrum Mark R","year":"1986","unstructured":"Mark R Jerrum , Leslie G Valiant , and Vijay V Vazirani . Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43 : 169-188 , 1986 . Mark R Jerrum, Leslie G Valiant, and Vijay V Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43 : 169-188, 1986."},{"key":"e_1_3_2_2_6_1","volume-title":"Approximate counting, uniform generation and rapidly mixing markov chains. Information and Computation, 82 ( 1 ): 93-133","author":"Sinclair Alistair","year":"1989","unstructured":"Alistair Sinclair and Mark Jerrum . Approximate counting, uniform generation and rapidly mixing markov chains. Information and Computation, 82 ( 1 ): 93-133 , 1989 . Alistair Sinclair and Mark Jerrum. Approximate counting, uniform generation and rapidly mixing markov chains. Information and Computation, 82 ( 1 ): 93-133, 1989."},{"key":"e_1_3_2_2_7_1","volume-title":"A random polynomial-time algorithm for approximating the","author":"Dyer Martin","year":"1991","unstructured":"Martin Dyer , Alan Frieze , and Ravi Kannan . A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM (JACM), 38 ( 1 ): 1-17, 1991 . Martin Dyer, Alan Frieze, and Ravi Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM (JACM), 38 ( 1 ): 1-17, 1991."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2008.06.004"},{"key":"e_1_3_2_2_9_1","volume-title":"Multilevel monte carlo path simulation. Operations Research, 56 ( 3 ): 607-617","author":"Giles Michael B","year":"2008","unstructured":"Michael B Giles . Multilevel monte carlo path simulation. Operations Research, 56 ( 3 ): 607-617 , 2008 . Michael B Giles. Multilevel monte carlo path simulation. Operations Research, 56 ( 3 ): 607-617, 2008."},{"key":"e_1_3_2_2_10_1","volume-title":"Multilevel monte carlo for scalable bayesian computations. arXiv preprint arXiv:1609.06144","author":"Giles Mike","year":"2016","unstructured":"Mike Giles , Tigran Nagapetyan , Lukasz Szpruch , Sebastian Vollmer , and Konstantinos Zygalakis . Multilevel monte carlo for scalable bayesian computations. arXiv preprint arXiv:1609.06144 , 2016 . Mike Giles, Tigran Nagapetyan, Lukasz Szpruch, Sebastian Vollmer, and Konstantinos Zygalakis. Multilevel monte carlo for scalable bayesian computations. arXiv preprint arXiv:1609.06144, 2016."},{"key":"e_1_3_2_2_11_1","first-page":"851","volume":"12","author":"Brosse N.","year":"2018","unstructured":"N. Brosse , A. Durmus , and E. Moulines . Normalizing constants of log-concave densities. Electron. J. Statist. , 12 : 851 - 889 , 2018 . N. Brosse, A. Durmus, and E. Moulines. Normalizing constants of log-concave densities. Electron. J. Statist., 12 : 851-889, 2018.","journal-title":"Normalizing constants of log-concave densities. Electron. J. Statist."},{"key":"e_1_3_2_2_12_1","volume-title":"Sampling normalizing constants in high dimensions using inhomogeneous difusions","author":"Andrieu C.","year":"2016","unstructured":"C. Andrieu , J. Ridgway , and N. Whiteley . Sampling normalizing constants in high dimensions using inhomogeneous difusions , 2016 . preprint, arXiv: 1612. 07583. C. Andrieu, J. Ridgway, and N. Whiteley. Sampling normalizing constants in high dimensions using inhomogeneous difusions, 2016. preprint, arXiv: 1612. 07583."},{"key":"e_1_3_2_2_13_1","volume-title":"Simulated annealing in convex bodies and an o*(n4)","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"2006","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Santosh Vempala . Simulated annealing in convex bodies and an o*(n4) volume algorithm. Journal of Computer and System Sciences, 72 ( 2 ): 392-417, 2006 . L\u00e1szl\u00f3 Lov\u00e1sz and Santosh Vempala. Simulated annealing in convex bodies and an o*(n4) volume algorithm. Journal of Computer and System Sciences, 72 ( 2 ): 392-417, 2006."},{"key":"e_1_3_2_2_14_1","volume-title":"Random walks in a convex body and an improved","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1993","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Mikl\u00f3s Simonovits . Random walks in a convex body and an improved volume algorithm. Random structures & algorithms, 4( 4 ): 359-412, 1993 . L\u00e1szl\u00f3 Lov\u00e1sz and Mikl\u00f3s Simonovits. Random walks in a convex body and an improved volume algorithm. Random structures & algorithms, 4( 4 ): 359-412, 1993."},{"key":"e_1_3_2_2_15_1","volume-title":"Gaussian cooling and O \u2217(n3) algorithm for","author":"Cousins B.","year":"2018","unstructured":"B. Cousins and S. Vempala . Gaussian cooling and O \u2217(n3) algorithm for volume and Gaussian volume. SIAM J. Comput., 47 : 1237-1273, 2018 . preprint, arXiv: 1409. 6011v3. B. Cousins and S. Vempala. Gaussian cooling and O \u2217(n3) algorithm for volume and Gaussian volume. SIAM J. Comput., 47 : 1237-1273, 2018. preprint, arXiv: 1409. 6011v3."},{"key":"e_1_3_2_2_16_1","volume-title":"Theoretical guarantees for approximate sampling from smooth and log-concave densities. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 79 ( 3 ): 651-676","author":"Dalalyan Arnak S","year":"2017","unstructured":"Arnak S Dalalyan . Theoretical guarantees for approximate sampling from smooth and log-concave densities. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 79 ( 3 ): 651-676 , 2017 . Arnak S Dalalyan. Theoretical guarantees for approximate sampling from smooth and log-concave densities. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 79 ( 3 ): 651-676, 2017."},{"key":"e_1_3_2_2_17_1","volume-title":"Nonasymptotic convergence analysis for the unadjusted langevin algorithm. The Annals of Applied Probability, 27 ( 3 ): 1551-1587","author":"Durmus Alain","year":"2017","unstructured":"Alain Durmus , Eric Moulines , Nonasymptotic convergence analysis for the unadjusted langevin algorithm. The Annals of Applied Probability, 27 ( 3 ): 1551-1587 , 2017 . Alain Durmus, Eric Moulines, et al. Nonasymptotic convergence analysis for the unadjusted langevin algorithm. The Annals of Applied Probability, 27 ( 3 ): 1551-1587, 2017."},{"key":"e_1_3_2_2_18_1","volume-title":"User-friendly guarantees for the langevin monte carlo with inaccurate gradient. arXiv preprint arXiv:1710.00095","author":"Dalalyan Arnak S","year":"2017","unstructured":"Arnak S Dalalyan and Avetik G Karagulyan . User-friendly guarantees for the langevin monte carlo with inaccurate gradient. arXiv preprint arXiv:1710.00095 , 2017 . Arnak S Dalalyan and Avetik G Karagulyan. User-friendly guarantees for the langevin monte carlo with inaccurate gradient. arXiv preprint arXiv:1710.00095, 2017."},{"key":"e_1_3_2_2_19_1","volume-title":"Analysis of langevin monte carlo via convex optimization. Journal of Machine Learning Research, 20 : 1-46","author":"Durmus Alain","year":"2019","unstructured":"Alain Durmus , Szymon Majewski , and B\u0142a\u017cej Miasojedow . Analysis of langevin monte carlo via convex optimization. Journal of Machine Learning Research, 20 : 1-46 , 2019 . Alain Durmus, Szymon Majewski, and B\u0142a\u017cej Miasojedow. Analysis of langevin monte carlo via convex optimization. Journal of Machine Learning Research, 20 : 1-46, 2019."},{"key":"e_1_3_2_2_20_1","volume-title":"Rapid convergence of the unadjusted langevin algorithm: Log-sobolev sufices. arXiv preprint arXiv:1903.08568","author":"Vempala Santosh S","year":"2019","unstructured":"Santosh S Vempala and Andre Wibisono . Rapid convergence of the unadjusted langevin algorithm: Log-sobolev sufices. arXiv preprint arXiv:1903.08568 , 2019 . Santosh S Vempala and Andre Wibisono. Rapid convergence of the unadjusted langevin algorithm: Log-sobolev sufices. arXiv preprint arXiv:1903.08568, 2019."},{"key":"e_1_3_2_2_21_1","volume-title":"Underdamped langevin mcmc: A non-asymptotic analysis. arXiv preprint arXiv:1707.03663","author":"Cheng Xiang","year":"2017","unstructured":"Xiang Cheng , Niladri S Chatterji , Peter L Bartlett , and Michael I Jordan . Underdamped langevin mcmc: A non-asymptotic analysis. arXiv preprint arXiv:1707.03663 , 2017 . Xiang Cheng, Niladri S Chatterji, Peter L Bartlett, and Michael I Jordan. Underdamped langevin mcmc: A non-asymptotic analysis. arXiv preprint arXiv:1707.03663, 2017."},{"key":"e_1_3_2_2_22_1","volume-title":"On sampling from a log-concave density using kinetic Langevin difusions","author":"Dalalyan A. S.","year":"2018","unstructured":"A. S. Dalalyan and L. Riou-Durand . On sampling from a log-concave density using kinetic Langevin difusions , 2018 . preprint, arXiv: 1807.09382. A. S. Dalalyan and L. Riou-Durand. On sampling from a log-concave density using kinetic Langevin difusions, 2018. preprint, arXiv: 1807.09382."},{"key":"e_1_3_2_2_23_1","volume-title":"Is there an analog of nesterov acceleration for mcmc? arXiv preprint arXiv","author":"Ma Yi-An","year":"1902","unstructured":"Yi-An Ma , Niladri Chatterji , Xiang Cheng , Nicolas Flammarion , Peter Bartlett , and Michael I Jordan . Is there an analog of nesterov acceleration for mcmc? arXiv preprint arXiv : 1902 .00996, 2019. Yi-An Ma, Niladri Chatterji, Xiang Cheng, Nicolas Flammarion, Peter Bartlett, and Michael I Jordan. Is there an analog of nesterov acceleration for mcmc? arXiv preprint arXiv: 1902.00996, 2019."},{"key":"e_1_3_2_2_24_1","volume-title":"Improved bounds for discretization of langevin difusions: Near-optimal rates without convexity. arXiv preprint arXiv:1907.11331","author":"Mou Wenlong","year":"2019","unstructured":"Wenlong Mou , Nicolas Flammarion , Martin J Wainwright , and Peter L Bartlett . Improved bounds for discretization of langevin difusions: Near-optimal rates without convexity. arXiv preprint arXiv:1907.11331 , 2019 . Wenlong Mou, Nicolas Flammarion, Martin J Wainwright, and Peter L Bartlett. Improved bounds for discretization of langevin difusions: Near-optimal rates without convexity. arXiv preprint arXiv:1907.11331, 2019."},{"key":"e_1_3_2_2_25_1","volume-title":"The randomized midpoint method for log-concave sampling. arXiv preprint arXiv:1909.05503","author":"Shen Ruoqi","year":"2019","unstructured":"Ruoqi Shen and Yin Tat Lee . The randomized midpoint method for log-concave sampling. arXiv preprint arXiv:1909.05503 , 2019 . Ruoqi Shen and Yin Tat Lee. The randomized midpoint method for log-concave sampling. arXiv preprint arXiv:1909.05503, 2019."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/3318418"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.436415"},{"key":"e_1_3_2_2_28_1","volume-title":"Log-concave sampling: Metropolis-Hastings algorithms are fast","author":"Dwivedi R.","year":"2018","unstructured":"R. Dwivedi , Y. Chen , M. J. Wainwright , and B. Yu . Log-concave sampling: Metropolis-Hastings algorithms are fast , 2018 . preprint, arXiv: 1801.02309. R. Dwivedi, Y. Chen, M. J. Wainwright, and B. Yu. Log-concave sampling: Metropolis-Hastings algorithms are fast, 2018. preprint, arXiv: 1801.02309."},{"key":"e_1_3_2_2_29_1","first-page":"1905","author":"Chen Y.","year":"2019","unstructured":"Y. Chen , R. Dwivedi , M. J. Wainwright , and B. Yu . Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients , 2019 . preprint, arXiv: 1905 .12247. Y. Chen, R. Dwivedi, M. J. Wainwright, and B. Yu. Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients, 2019. preprint, arXiv: 1905.12247.","journal-title":"Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0370-2693(87)91197-X"},{"key":"e_1_3_2_2_31_1","volume-title":"Geometric integrators and the Hamiltonian Monte Carlo method. Acta Numer., 27 : 113-206","author":"Bou-Rabee N.","year":"2018","unstructured":"N. Bou-Rabee and J. M. Sanz-Serna . Geometric integrators and the Hamiltonian Monte Carlo method. Acta Numer., 27 : 113-206 , 2018 . N. Bou-Rabee and J. M. Sanz-Serna. Geometric integrators and the Hamiltonian Monte Carlo method. Acta Numer., 27 : 113-206, 2018."},{"key":"e_1_3_2_2_32_1","volume-title":"Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions. arXiv preprint arXiv:1708.07114","author":"Mangoubi Oren","year":"2017","unstructured":"Oren Mangoubi and Aaron Smith . Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions. arXiv preprint arXiv:1708.07114 , 2017 . Oren Mangoubi and Aaron Smith. Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions. arXiv preprint arXiv:1708.07114, 2017."},{"key":"e_1_3_2_2_33_1","volume-title":"Algorithmic theory of odes and sampling from well-conditioned logconcave densities. arXiv preprint arXiv:1812.06243","author":"Lee Yin Tat","year":"2018","unstructured":"Yin Tat Lee , Zhao Song , and Santosh S Vempala . Algorithmic theory of odes and sampling from well-conditioned logconcave densities. arXiv preprint arXiv:1812.06243 , 2018 . Yin Tat Lee, Zhao Song, and Santosh S Vempala. Algorithmic theory of odes and sampling from well-conditioned logconcave densities. arXiv preprint arXiv:1812.06243, 2018."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188774"},{"key":"e_1_3_2_2_35_1","volume-title":"Optimal convergence rate of hamiltonian monte carlo for strongly logconcave distributions. arXiv preprint arXiv:1905.02313","author":"Chen Zongchen","year":"2019","unstructured":"Zongchen Chen and Santosh S Vempala . Optimal convergence rate of hamiltonian monte carlo for strongly logconcave distributions. arXiv preprint arXiv:1905.02313 , 2019 . Zongchen Chen and Santosh S Vempala. Optimal convergence rate of hamiltonian monte carlo for strongly logconcave distributions. arXiv preprint arXiv:1905.02313, 2019."},{"key":"e_1_3_2_2_36_1","first-page":"1805","author":"Bou-Rabee N.","year":"2018","unstructured":"N. Bou-Rabee , A. Eberle , and R. Zimmer . Coupling and convergence for Hamiltonian Monte Carlo , 2018 . preprint, arXiv: 1805 .00452. N. Bou-Rabee, A. Eberle, and R. Zimmer. Coupling and convergence for Hamiltonian Monte Carlo, 2018. preprint, arXiv: 1805.00452.","journal-title":"Coupling and convergence for Hamiltonian Monte Carlo"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008923215028"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.2690"},{"key":"e_1_3_2_2_39_1","first-page":"6028","volume-title":"Advances in Neural Information Processing Systems","author":"Mangoubi Oren","year":"2018","unstructured":"Oren Mangoubi and Nisheeth Vishnoi . Dimensionally tight bounds for secondorder hamiltonian monte carlo . In Advances in Neural Information Processing Systems , pages 6028 - 6038 , 2018 . Oren Mangoubi and Nisheeth Vishnoi. Dimensionally tight bounds for secondorder hamiltonian monte carlo. In Advances in Neural Information Processing Systems, pages 6028-6038, 2018."},{"key":"e_1_3_2_2_40_1","volume-title":"Stochastic Runge-Kutta accelerates Langevin Monte Carlo and beyond","author":"Li Xuechen","year":"2019","unstructured":"Xuechen Li , Denny Wu , Lester Mackey , and Murat A. Erdogdu . Stochastic Runge-Kutta accelerates Langevin Monte Carlo and beyond , 2019 . preprint, arXiv: 1906.07868. Xuechen Li, Denny Wu, Lester Mackey, and Murat A. Erdogdu. Stochastic Runge-Kutta accelerates Langevin Monte Carlo and beyond, 2019. preprint, arXiv: 1906.07868."},{"key":"e_1_3_2_2_41_1","first-page":"764","volume-title":"Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research","author":"Chatterji Niladri","year":"2018","unstructured":"Niladri Chatterji , Nicolas Flammarion , Yian Ma , Peter Bartlett , and Michael Jordan . On the theory of variance reduction for stochastic gradient Monte Carlo. In Jennifer Dy and Andreas Krause, editors , Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research , pages 764 - 773 , Stockholmsm\u00e4ssan, Stockholm Sweden , 2018 . PMLR. Niladri Chatterji, Nicolas Flammarion, Yian Ma, Peter Bartlett, and Michael Jordan. On the theory of variance reduction for stochastic gradient Monte Carlo. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pages 764-773, Stockholmsm\u00e4ssan, Stockholm Sweden, 2018. PMLR."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055416"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384289","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":42,"alternative-id":["10.1145\/3357713.3384289","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384289","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}