{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:45:03Z","timestamp":1780631103592,"version":"3.54.1"},"reference-count":66,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T00:00:00Z","timestamp":1508889600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"AJITPar","award":["EP\/L000687"],"award-info":[{"award-number":["EP\/L000687"]}]},{"name":"CoDiMa","award":["EP\/M022641"],"award-info":[{"award-number":["EP\/M022641"]}]},{"name":"Glasgow DTA","award":["EP\/K503058"],"award-info":[{"award-number":["EP\/K503058"]}]},{"name":"MaRIONet","award":["EP\/P006434"],"award-info":[{"award-number":["EP\/P006434"]}]},{"name":"Rathlin","award":["EP\/K009931"],"award-info":[{"award-number":["EP\/K009931"]}]},{"name":"Border Patrol","award":["EP\/N028201\/1"],"award-info":[{"award-number":["EP\/N028201\/1"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.jpdc.2017.10.010","type":"journal-article","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T06:15:16Z","timestamp":1511504116000},"page":"92-114","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"special_numbering":"C","title":["Replicable parallel branch and bound search"],"prefix":"10.1016","volume":"113","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3699-6658","authenticated-orcid":false,"given":"Blair","family":"Archibald","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Maier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ciaran","family":"McCreesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0365-693X","authenticated-orcid":false,"given":"Robert","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0190-7010","authenticated-orcid":false,"given":"Phil","family":"Trinder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jpdc.2017.10.010_b1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.jpdc.2015.07.006","article-title":"On scalable parallel recursive backtracking","volume":"84","author":"Abu-Khzam","year":"2015","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jpdc.2017.10.010_b2","series-title":"European Conference on Parallel Processing","first-page":"927","article-title":"MALLBA: A library of skeletons for combinatorial optimisation","author":"Alba","year":"2002"},{"issue":"3\u20134","key":"10.1016\/j.jpdc.2017.10.010_b3","first-page":"179","article-title":"Skeleton-based parallel programming: Functional and parallel semantics in a single shot","volume":"33","author":"Aldinucci","year":"2007","journal-title":"Comput. Lang. Syst. Struct."},{"key":"10.1016\/j.jpdc.2017.10.010_b4","doi-asserted-by":"crossref","unstructured":"B. Archibald, P. Maier, C. McCreesh, R. Stewart, P. Trinder, Replicable Parallel Branch and Bound Search [Data Collection], 2017. http:\/\/dx.doi.org\/10.5525\/gla.researchdata.442.","DOI":"10.1016\/j.jpdc.2017.10.010"},{"key":"10.1016\/j.jpdc.2017.10.010_b5","series-title":"Proceedings of the International Workshop on Parallel Symbolic Computation","first-page":"6:1","article-title":"Towards generic scalable parallel combinatorial search","author":"Archibald","year":"2017"},{"issue":"6","key":"10.1016\/j.jpdc.2017.10.010_b6","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","article-title":"Parallel branch-and-bound algorithms: Survey and synthesis","volume":"42","author":"Bernard\u00a0Gendron","year":"1994","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.jpdc.2017.10.010_b7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jpdc.1996.0107","article-title":"Cilk: An efficient multithreaded runtime system","volume":"37","author":"Blumofe","year":"1996","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jpdc.2017.10.010_b8","first-page":"1","article-title":"The maximum clique problem","volume":"4","author":"Bomze","year":"1999","journal-title":"Handb. Combin. Opt. (Suppl. Vol. A)"},{"issue":"1","key":"10.1016\/j.jpdc.2017.10.010_b9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","article-title":"Clique-detection models in computational biochemistry and genomics","volume":"173","author":"Butenko","year":"2006","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.jpdc.2017.10.010_b10","series-title":"Parallel Programming in OpenMP","author":"Chandra","year":"2000"},{"key":"10.1016\/j.jpdc.2017.10.010_b11","series-title":"Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20\u201324, 2009, Proceedings","first-page":"226","article-title":"Confidence-based work stealing in parallel constraint programming","author":"Chu","year":"2009"},{"key":"10.1016\/j.jpdc.2017.10.010_b12","series-title":"Algorithmic Skeletons: Structured Management of Parallel Computation","author":"Cole","year":"1991"},{"issue":"1","key":"10.1016\/j.jpdc.2017.10.010_b13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","article-title":"MapReduce: simplified data processing on large clusters","volume":"51","author":"Dean","year":"2008","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jpdc.2017.10.010_b14","series-title":"Parallel Algorithms for Irregularly Structured Problems","first-page":"363","article-title":"Asynchronous parallel branch and bound and anomalies","volume":"vol. 980","author":"de\u00a0Bruin","year":"1995"},{"issue":"9","key":"10.1016\/j.jpdc.2017.10.010_b15","doi-asserted-by":"crossref","first-page":"2217","DOI":"10.1021\/ci4002525","article-title":"Exact parallel maximum clique algorithm for general and protein graphs","volume":"53","author":"Depolli","year":"2013","journal-title":"J. Chem. Inf. Model."},{"key":"10.1016\/j.jpdc.2017.10.010_b16","series-title":"Bioinformatics Research and Applications","first-page":"306","article-title":"The maximum clique enumeration problem: Algorithms, applications and implementations","volume":"vol. 6674","author":"Eblen","year":"2011"},{"key":"10.1016\/j.jpdc.2017.10.010_b17","series-title":"The Cambridge Dictionary of Statistics","author":"Everitt","year":"2002"},{"issue":"Suppl. 1","key":"10.1016\/j.jpdc.2017.10.010_b18","doi-asserted-by":"crossref","first-page":"S13","DOI":"10.1186\/1471-2105-12-S1-S13","article-title":"A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures","volume":"12","author":"Fukagawa","year":"2011","journal-title":"BMC Bioinformatics"},{"issue":"2","key":"10.1016\/j.jpdc.2017.10.010_b19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/227699.227700","article-title":"Type classes in Haskell","volume":"18","author":"Hall","year":"1996","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/j.jpdc.2017.10.010_b20","series-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montr\u00e9al Qu\u00e9bec, Canada, August 20\u201325 1995, 2 Volumes","first-page":"607","article-title":"Limited discrepancy search","author":"Harvey","year":"1995"},{"key":"10.1016\/j.jpdc.2017.10.010_b21","unstructured":"D. Johnson, L. McGeoch, F. Glover, C. Rego, Eighth DIMACS Implementation Challenge, http:\/\/dimacs.rutgers.edu\/Challenges\/TSP\/. (Accessed 05 December 2016)."},{"key":"10.1016\/j.jpdc.2017.10.010_b22","series-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993","year":"1996"},{"key":"10.1016\/j.jpdc.2017.10.010_b23","series-title":"Haskell 98 Language and Libraries: the Revised Report","author":"Jones","year":"2003"},{"key":"10.1016\/j.jpdc.2017.10.010_b24","series-title":"Adaptive and Natural Computing Algorithms","first-page":"399","article-title":"A branch and bound algorithm for matching protein structures","volume":"vol. 4432","author":"Konc","year":"2007"},{"issue":"6","key":"10.1016\/j.jpdc.2017.10.010_b25","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in parallel branch-and-bound algorithms","volume":"27","author":"Lai","year":"1984","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/j.jpdc.2017.10.010_b26","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.jpdc.2017.10.010_b27","series-title":"2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013","first-page":"939","article-title":"Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem","author":"Li","year":"2013"},{"key":"10.1016\/j.jpdc.2017.10.010_b28","series-title":"Learning and Intelligent Optimization - 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers","first-page":"268","article-title":"Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique","author":"Li","year":"2015"},{"issue":"6","key":"10.1016\/j.jpdc.2017.10.010_b29","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/TC.1986.5009434","article-title":"Coping with anomalies in parallel branch-and-bound algorithms","volume":"C-35","author":"Li","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.jpdc.2017.10.010_b30","series-title":"Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell, Haskell \u201914","first-page":"65","article-title":"The HdpH DSLs for scalable reliable computation","author":"Maier","year":"2014"},{"issue":"3","key":"10.1016\/j.jpdc.2017.10.010_b31","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","article-title":"An upper bound for the zero-one knapsack problem and a branch and bound algorithm","volume":"1","author":"Martello","year":"1977","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.jpdc.2017.10.010_b32","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/j.jpdc.2017.10.010_b33","series-title":"Understanding and using Linear Programming","first-page":"29","article-title":"Integer programming and LP relaxation","author":"Matou\u0161ek","year":"2007"},{"key":"10.1016\/j.jpdc.2017.10.010_b34","series-title":"Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings","first-page":"350","article-title":"Clique and constraint models for maximum common (connected) subgraph problems","author":"McCreesh","year":"2016"},{"issue":"4","key":"10.1016\/j.jpdc.2017.10.010_b35","doi-asserted-by":"crossref","first-page":"618","DOI":"10.3390\/a6040618","article-title":"Multi-threading a state-of-the-art maximum clique algorithm","volume":"6","author":"McCreesh","year":"2013","journal-title":"Algorithms"},{"key":"10.1016\/j.jpdc.2017.10.010_b36","series-title":"Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings","first-page":"549","article-title":"Reducing the branching in a branch and bound algorithm for the maximum clique problem","author":"McCreesh","year":"2014"},{"issue":"1","key":"10.1016\/j.jpdc.2017.10.010_b37","doi-asserted-by":"crossref","first-page":"8:1","DOI":"10.1145\/2742359","article-title":"The shape of the search tree for the maximum clique problem and the implications for parallel branch and bound","volume":"2","author":"McCreesh","year":"2015","journal-title":"ACM Trans. Parallel Comput."},{"key":"10.1016\/j.jpdc.2017.10.010_b38","series-title":"Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings","first-page":"377","article-title":"Parallel depth-bounded discrepancy search","author":"Moisan","year":"2014"},{"key":"10.1016\/j.jpdc.2017.10.010_b39","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","article-title":"Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning","volume":"19","author":"Morrison","year":"2016","journal-title":"Discrete Optim."},{"key":"10.1016\/j.jpdc.2017.10.010_b40","series-title":"Learning and Intelligent Optimization - 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers","first-page":"275","article-title":"Reusing the same coloring in the child nodes of the search tree for the maximum clique problem","author":"Nikolaev","year":"2015"},{"key":"10.1016\/j.jpdc.2017.10.010_b41","series-title":"Proceedings of the 2006 IEEE\/WIC\/ACM International Conference on Web Intelligence, WI \u201906","first-page":"347","article-title":"Finding conceptual document clusters with improved top-N formal concept search","author":"Okubo","year":"2006"},{"key":"10.1016\/j.jpdc.2017.10.010_b42","series-title":"International Workshop on Languages and Compilers for Parallel Computing","first-page":"235","article-title":"UTS: An unbalanced tree search benchmark","author":"Olivier","year":"2006"},{"key":"10.1016\/j.jpdc.2017.10.010_b43","unstructured":"D. Pisinger, David Pisinger\u2019s optimization codes \u2013hard knapsack instances, http:\/\/www.diku.dk\/~pisinger\/hardinstances_pisinger.tgz. (Accessed 14 October 2016)."},{"issue":"9","key":"10.1016\/j.jpdc.2017.10.010_b44","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","article-title":"Where are the hard knapsack problems?","volume":"32","author":"Pisinger","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.jpdc.2017.10.010_b45","series-title":"International Conference on Software and Data Technologies","first-page":"204","article-title":"Algorithmic skeletons for branch and bound","author":"Poldner","year":"2006"},{"issue":"6","key":"10.1016\/j.jpdc.2017.10.010_b46","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"10.1016\/j.jpdc.2017.10.010_b47","doi-asserted-by":"crossref","first-page":"545","DOI":"10.3390\/a5040545","article-title":"Exact algorithms for maximum clique: A Computational study","volume":"5","author":"Prosser","year":"2012","journal-title":"Algorithms"},{"issue":"4","key":"10.1016\/j.jpdc.2017.10.010_b48","first-page":"113","article-title":"Formation control of quadrotor helicopters with guaranteed collision avoidance via safe path","volume":"56","author":"Regula","year":"2013","journal-title":"Electr. Eng. Comput. Sci."},{"key":"10.1016\/j.jpdc.2017.10.010_b49","series-title":"Intel threading building blocks: outfitting C++ for multi-core processor parallelism","author":"Reinders","year":"2007"},{"issue":"4","key":"10.1016\/j.jpdc.2017.10.010_b50","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIBA traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"issue":"1","key":"10.1016\/j.jpdc.2017.10.010_b51","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/nav.3800220110","article-title":"The knapsack problem: A survey","volume":"22","author":"Salkin","year":"1975","journal-title":"Naval Res. Logist. Q."},{"issue":"3","key":"10.1016\/j.jpdc.2017.10.010_b52","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s11590-011-0431-y","article-title":"An improved bit parallel exact maximum clique algorithm","volume":"7","author":"San\u00a0Segundo","year":"2011","journal-title":"Optim. Lett."},{"issue":"3","key":"10.1016\/j.jpdc.2017.10.010_b53","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10489-008-0147-6","article-title":"Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver","volume":"32","author":"San\u00a0Segundo","year":"2010","journal-title":"Appl. Intell."},{"key":"10.1016\/j.jpdc.2017.10.010_b54","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.cor.2015.06.009","article-title":"Infra-chromatic bound for exact maximum clique search","volume":"64","author":"Segundo","year":"2015","journal-title":"Comput. & OR"},{"issue":"2","key":"10.1016\/j.jpdc.2017.10.010_b55","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","article-title":"An exact bit-parallel algorithm for the maximum clique problem","volume":"38","author":"Segundo","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.jpdc.2017.10.010_b56","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.cor.2013.10.018","article-title":"Relaxed approximate coloring in exact maximum clique search","volume":"44","author":"Segundo","year":"2014","journal-title":"Comput. OR"},{"key":"10.1016\/j.jpdc.2017.10.010_b57","series-title":"MPI-2: Extensions to the Message-Passing Interface","year":"1997"},{"issue":"1","key":"10.1016\/j.jpdc.2017.10.010_b58","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","article-title":"An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments","volume":"37","author":"Tomita","year":"2007","journal-title":"J. Global Optim."},{"key":"10.1016\/j.jpdc.2017.10.010_b59","series-title":"Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7\u201312, 2003. Proceedings","first-page":"278","article-title":"An efficient branch-and-bound algorithm for finding a maximum clique","author":"Tomita","year":"2003"},{"key":"10.1016\/j.jpdc.2017.10.010_b60","series-title":"WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings","first-page":"191","article-title":"A simple and faster branch-and-bound algorithm for finding a maximum clique","author":"Tomita","year":"2010"},{"key":"10.1016\/j.jpdc.2017.10.010_b61","series-title":"Parallel Branch and Bound Algorithms","author":"Trienekens","year":"1990"},{"issue":"1","key":"10.1016\/j.jpdc.2017.10.010_b62","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/1435417.1435432","article-title":"Eventually consistent","volume":"52","author":"Vogels","year":"2009","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jpdc.2017.10.010_b63","series-title":"IJCAI, vol. 97","first-page":"1388","article-title":"Depth-bounded discrepancy search","author":"Walsh","year":"1997"},{"issue":"3","key":"10.1016\/j.jpdc.2017.10.010_b64","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","article-title":"A review on algorithms for maximum clique problems","volume":"242","author":"Wu","year":"2015","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.jpdc.2017.10.010_b65","series-title":"29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, April 8-12, 2013","first-page":"74","article-title":"Scalable maximum clique computation using MapReduce","author":"Xiang","year":"2013"},{"key":"10.1016\/j.jpdc.2017.10.010_b66","series-title":"Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on, vol. 1","first-page":"832","article-title":"Detecting communities in networks by merging cliques","author":"Yan","year":"2009"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731517302861?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731517302861?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T22:25:37Z","timestamp":1760048737000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731517302861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":66,"alternative-id":["S0743731517302861"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2017.10.010","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Replicable parallel branch and bound search","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2017.10.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}