{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T11:09:27Z","timestamp":1790507367564,"version":"4.1.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,2,24]],"date-time":"2017-02-24T00:00:00Z","timestamp":1487894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Collectiveware","award":["TIN 2015-66863-C2-1-R (MINECO\/FEDER)"],"award-info":[{"award-number":["TIN 2015-66863-C2-1-R (MINECO\/FEDER)"]}]},{"name":"COR","award":["TIN 2012-38876-C02-01"],"award-info":[{"award-number":["TIN 2012-38876-C02-01"]}]},{"DOI":"10.13039\/501100002809","name":"Generalitat of Catalunya","doi-asserted-by":"crossref","award":["2014-SGR-118"],"award-info":[{"award-number":["2014-SGR-118"]}],"id":[{"id":"10.13039\/501100002809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"EPSRC-Funded ORCHID","award":["EP\/I011587\/1"],"award-info":[{"award-number":["EP\/I011587\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2017,7,31]]},"abstract":"<jats:p>\n            Coalition formation typically involves the coming together of multiple, heterogeneous, agents to achieve both their individual and collective goals. In this article, we focus on a special case of coalition formation known as Graph-Constrained Coalition Formation (GCCF) whereby a network connecting the agents constrains the formation of coalitions. We focus on this type of problem given that in many real-world applications, agents may be connected by a communication network or only trust certain peers in their social network. We propose a novel representation of this problem based on the concept of edge contraction, which allows us to model the search space induced by the GCCF problem as a rooted tree. Then, we propose an anytime solution algorithm (Coalition Formation for Sparse Synergies (CFSS)), which is particularly efficient when applied to a general class of characteristic functions called\n            <jats:italic>m<\/jats:italic>\n            +\n            <jats:italic>a<\/jats:italic>\n            functions. Moreover, we show how CFSS can be efficiently parallelised to solve GCCF using a nonredundant partition of the search space. We benchmark CFSS on both synthetic and realistic scenarios, using a real-world dataset consisting of the energy consumption of a large number of households in the UK. Our results show that, in the best case, the serial version of CFSS is four orders of magnitude faster than the state of the art, while the parallel version is 9.44 times faster than the serial version on a 12-core machine. Moreover, CFSS is the first approach to provide anytime approximate solutions with quality guarantees for very large systems of agents (i.e., with more than 2,700 agents).\n          <\/jats:p>","DOI":"10.1145\/3040967","type":"journal-article","created":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T13:06:52Z","timestamp":1488200812000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Algorithms for Graph-Constrained Coalition Formation in the Real World"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1658-6125","authenticated-orcid":false,"given":"Filippo","family":"Bistaffa","sequence":"first","affiliation":[{"name":"University of Verona, Verona, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessandro","family":"Farinelli","sequence":"additional","affiliation":[{"name":"University of Verona, Verona, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jes\u00fas","family":"Cerquides","sequence":"additional","affiliation":[{"name":"IIIA-CSIC, Catalonia, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Rodr\u00edguez-Aguilar","sequence":"additional","affiliation":[{"name":"IIIA-CSIC, Catalonia, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarvapali D.","family":"Ramchurn","sequence":"additional","affiliation":[{"name":"University of Southampton, Southampton, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,2,24]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1465482.1465560"},{"key":"e_1_2_2_2_1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"Ausiello Giorgio","unstructured":"Giorgio Ausiello , Pierluigi Crescenzi , Giorgio Gambosi , Viggo Kann , Alberto Marchetti-Spaccamela , and Marco Protasi . 2012. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties . Springer . Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi. 2012. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-22827-6_5"},{"key":"e_1_2_2_4_1","first-page":"185","article-title":"Improved bounds on Bell numbers and on moments of sums of random variables","volume":"30","author":"Berend Daniel","year":"2010","unstructured":"Daniel Berend and Tamir Tassa . 2010 . Improved bounds on Bell numbers and on moments of sums of random variables . Probability and Mathematical Statistics 30 (2010), 185 -- 205 . Daniel Berend and Tamir Tassa. 2010. Improved bounds on Bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics 30 (2010), 185--205.","journal-title":"Probability and Mathematical Statistics"},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 13--20","author":"Bistaffa Filippo","unstructured":"Filippo Bistaffa , Alessandro Farinelli , Jes\u00fas Cerquides , Juan Rodr\u00edguez-Aguilar , and Sarvapali D. Ramchurn . 2014a. Anytime coalition structure generation on synergy graphs . In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 13--20 . Filippo Bistaffa, Alessandro Farinelli, Jes\u00fas Cerquides, Juan Rodr\u00edguez-Aguilar, and Sarvapali D. Ramchurn. 2014a. Anytime coalition structure generation on synergy graphs. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 13--20."},{"key":"e_1_2_2_6_1","volume-title":"Proceedings of the International Joint Workshop on Optimisation in Multi-Agent Systems and Distributed Constraint Reasoning.","author":"Bistaffa Filippo","unstructured":"Filippo Bistaffa , Alessandro Farinelli , Jes\u00fas Cerquides , Juan Rodr\u00edguez-Aguilar , and Sarvapali D. Ramchurn . 2014b. Anytime coalition structure generation on scale-free and community networks . In Proceedings of the International Joint Workshop on Optimisation in Multi-Agent Systems and Distributed Constraint Reasoning. Filippo Bistaffa, Alessandro Farinelli, Jes\u00fas Cerquides, Juan Rodr\u00edguez-Aguilar, and Sarvapali D. Ramchurn. 2014b. Anytime coalition structure generation on scale-free and community networks. In Proceedings of the International Joint Workshop on Optimisation in Multi-Agent Systems and Distributed Constraint Reasoning."},{"key":"e_1_2_2_7_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 608--614","author":"Bistaffa Filippo","unstructured":"Filippo Bistaffa , Alessandro Farinelli , and Sarvapali D. Ramchurn . 2015. Sharing rides with friends: A coalition formation algorithm for ridesharing . In Proceedings of the AAAI Conference on Artificial Intelligence. 608--614 . Filippo Bistaffa, Alessandro Farinelli, and Sarvapali D. Ramchurn. 2015. Sharing rides with friends: A coalition formation algorithm for ridesharing. In Proceedings of the AAAI Conference on Artificial Intelligence. 608--614."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018410.1018803"},{"key":"e_1_2_2_9_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 121--128","author":"Dasgupta Prithviraj","year":"2012","unstructured":"Prithviraj Dasgupta , Vladimir Ufimtsev , Carl Nelson , and S. G. M. Hossain . 2012 . Dynamic reconfiguration in modular robots using graph partitioning-based coalitions . In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 121--128 . Prithviraj Dasgupta, Vladimir Ufimtsev, Carl Nelson, and S. G. M. Hossain. 2012. Dynamic reconfiguration in modular robots using graph partitioning-based coalitions. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 121--128."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1086\/421171"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.2.257"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885962.1885977"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.03.016"},{"key":"e_1_2_2_14_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 106--112","author":"Farinelli Alessandro","year":"2013","unstructured":"Alessandro Farinelli , Manuele Bicego , Sarvapali Ramchurn , and Mauro Zucchelli . 2013 . C-link: A hierarchical clustering approach to large-scale near-optimal coalition formation . In Proceedings of the International Joint Conference on Artificial Intelligence. 106--112 . Alessandro Farinelli, Manuele Bicego, Sarvapali Ramchurn, and Mauro Zucchelli. 2013. C-link: A hierarchical clustering approach to large-scale near-optimal coalition formation. In Proceedings of the International Joint Conference on Artificial Intelligence. 106--112."},{"key":"e_1_2_2_15_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1990","unstructured":"Michael R. Garey and David S . Johnson . 1990 . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 8 Co. Michael R. Garey and David S. Johnson. 1990. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 8 Co."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082473.1082508"},{"key":"e_1_2_2_17_1","unstructured":"Hampshire County Council. 2014. Switch Hampshire. (2014). http:\/\/www3.hants.gov.uk\/switch.  Hampshire County Council. 2014. Switch Hampshire. (2014). http:\/\/www3.hants.gov.uk\/switch."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.01.001"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 21--30","author":"Karger David R.","year":"1993","unstructured":"David R. Karger . 1993 . Global min-cuts in RNC, and other ramifications of a simple min-out algorithm . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 21--30 . David R. Karger. 1993. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 21--30."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01665-3_4"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_2_2_24_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 594--600","author":"Lelis Levi H. S.","year":"2013","unstructured":"Levi H. S. Lelis , Lars Otten , and Rina Dechter . 2013 . Predicting the size of depth-first branch and bound search trees . In Proceedings of the International Joint Conference on Artificial Intelligence. 594--600 . Levi H. S. Lelis, Lars Otten, and Rina Dechter. 2013. Predicting the size of depth-first branch and bound search trees. In Proceedings of the International Joint Conference on Artificial Intelligence. 594--600."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.12.002"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544843"},{"key":"e_1_2_2_27_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 279--285","author":"Marcolino Leandro Soriano","year":"2013","unstructured":"Leandro Soriano Marcolino , Albert Xin Jiang , and Milind Tambe . 2013 . Multi-agent team formation: Diversity beats strength? In Proceedings of the International Joint Conference on Artificial Intelligence. 279--285 . Leandro Soriano Marcolino, Albert Xin Jiang, and Milind Tambe. 2013. Multi-agent team formation: Diversity beats strength? In Proceedings of the International Joint Conference on Artificial Intelligence. 279--285."},{"key":"e_1_2_2_28_1","volume-title":"Proceedings of the Workshop on Cooperative Games in Multi-Agent Systems.","author":"Meir Reshef","unstructured":"Reshef Meir , Yair Zick , and Jeffrey S. Rosenschein . 2012. Optimization and stability in games with restricted interactions . In Proceedings of the Workshop on Cooperative Games in Multi-Agent Systems. Reshef Meir, Yair Zick, and Jeffrey S. Rosenschein. 2012. Optimization and stability in games with restricted interactions. In Proceedings of the Workshop on Cooperative Games in Multi-Agent Systems."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.3.225"},{"key":"e_1_2_2_30_1","volume-title":"Submodular Functions and Electrical Networks","author":"Narayanan Hariharan","unstructured":"Hariharan Narayanan . 1997. Submodular Functions and Electrical Networks . Elsevier . Hariharan Narayanan. 1997. Submodular Functions and Electrical Networks. Elsevier."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788994.1789046"},{"key":"e_1_2_2_33_1","volume-title":"Game Theory","author":"Owen Guillermo","unstructured":"Guillermo Owen . 1995. Game Theory . Academic Press . Guillermo Owen. 1995. Game Theory. Academic Press."},{"key":"e_1_2_2_34_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 156--161","author":"Rahwan Talal","unstructured":"Talal Rahwan and Nicholas R. Jennings . 2008a. Coalition structure generation: Dynamic programming meets anytime optimisation . In Proceedings of the AAAI Conference on Artificial Intelligence. 156--161 . Talal Rahwan and Nicholas R. Jennings. 2008a. Coalition structure generation: Dynamic programming meets anytime optimisation. In Proceedings of the AAAI Conference on Artificial Intelligence. 156--161."},{"key":"e_1_2_2_35_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 1417--1420","author":"Rahwan Talal","unstructured":"Talal Rahwan and Nicholas R. Jennings . 2008b. An improved dynamic programming algorithm for coalition structure generation . In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 1417--1420 . Talal Rahwan and Nicholas R. Jennings. 2008b. An improved dynamic programming algorithm for coalition structure generation. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 1417--1420."},{"key":"e_1_2_2_36_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 719--725","author":"Rahwan Talal","unstructured":"Talal Rahwan , Tomasz P. Michalak , Edith Elkind , Piotr Faliszewski , Jacek Sroka , Michael Wooldridge , and Nicholas R. Jennings . 2011. Constrained coalition formation . In Proceedings of the AAAI Conference on Artificial Intelligence. 719--725 . Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael Wooldridge, and Nicholas R. Jennings. 2011. Constrained coalition formation. In Proceedings of the AAAI Conference on Artificial Intelligence. 719--725."},{"key":"e_1_2_2_37_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 1443--1449","author":"Rahwan Talal","unstructured":"Talal Rahwan , Tomasz P. Michalak , and Nicholas R. Jennings . 2012. A hybrid algorithm for coalition structure generation . In Proceedings of the AAAI Conference on Artificial Intelligence. 1443--1449 . Talal Rahwan, Tomasz P. Michalak, and Nicholas R. Jennings. 2012. A hybrid algorithm for coalition structure generation. In Proceedings of the AAAI Conference on Artificial Intelligence. 1443--1449."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.08.004"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622716.1622730"},{"key":"e_1_2_2_40_1","unstructured":"Matthew A. Russell. 2013. Mining the Social Web. O\u2019Reilly Media.  Matthew A. Russell. 2013. Mining the Social Web. O\u2019Reilly Media."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00036-3"},{"key":"e_1_2_2_42_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver Alexander","year":"2003","unstructured":"Alexander Schrijver . 2003 . Combinatorial Optimization: Polyhedra and Efficiency . Springer . Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/518904.878870"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00045-9"},{"key":"e_1_2_2_45_1","first-page":"20","article-title":"Supermodular decomposition of structural labeling problem","volume":"1","author":"Shekhovtsov Alexander","year":"2006","unstructured":"Alexander Shekhovtsov . 2006 . Supermodular decomposition of structural labeling problem . Control Systems and Computers 1 (2006), 20 . Alexander Shekhovtsov. 2006. Supermodular decomposition of structural labeling problem. Control Systems and Computers 1 (2006), 20.","journal-title":"Control Systems and Computers"},{"key":"e_1_2_2_47_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 197--204","author":"Skibski Oskar","year":"2014","unstructured":"Oskar Skibski , Tomasz P. Michalak , Talal Rahwan , and Michael Wooldridge . 2014 . Algorithms for the Shapley and Myerson values in graph-restricted games . In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 197--204 . Oskar Skibski, Tomasz P. Michalak, Talal Rahwan, and Michael Wooldridge. 2014. Algorithms for the Shapley and Myerson values in graph-restricted games. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 197--204."},{"key":"e_1_2_2_48_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 383--389","author":"Tran-Thanh Long","unstructured":"Long Tran-Thanh , Tri-Dung Nguyen , Talal Rahwan , Alex Rogers , and Nicholas R. Jennings . 2013. An efficient vector-based representation for coalitional games . In Proceedings of the International Joint Conference on Artificial Intelligence. 383--389 . Long Tran-Thanh, Tri-Dung Nguyen, Talal Rahwan, Alex Rogers, and Nicholas R. Jennings. 2013. An efficient vector-based representation for coalitional games. In Proceedings of the International Joint Conference on Artificial Intelligence. 383--389."},{"key":"e_1_2_2_49_1","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 1271--1272","author":"Ueda Suguru","year":"2011","unstructured":"Suguru Ueda , Makoto Kitaki , Atsushi Iwasaki , and Makoto Yokoo . 2011 . Concise characteristic function representations in coalitional games based on agent types . In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 1271--1272 . Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, and Makoto Yokoo. 2011. Concise characteristic function representations in coalitional games based on agent types. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems. 1271--1272."},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/EnergyCon.2012.6348270"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/2444851.2444856"},{"key":"e_1_2_2_52_1","volume-title":"International Conference on Autonomous Agents and Multi-Agent Systems. 223--230","author":"Voice Thomas","unstructured":"Thomas Voice , Sarvapali D. Ramchurn , and Nicholas R. Jennings . 2012b. On coalition formation with sparse synergies . In International Conference on Autonomous Agents and Multi-Agent Systems. 223--230 . Thomas Voice, Sarvapali D. Ramchurn, and Nicholas R. Jennings. 2012b. On coalition formation with sparse synergies. In International Conference on Autonomous Agents and Multi-Agent Systems. 223--230."},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935053"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3040967","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3040967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:58Z","timestamp":1750273498000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3040967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,24]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7,31]]}},"alternative-id":["10.1145\/3040967"],"URL":"https:\/\/doi.org\/10.1145\/3040967","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,24]]},"assertion":[{"value":"2015-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}