{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T02:30:05Z","timestamp":1791340205722,"version":"4.3.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["CNS-1314632"],"award-info":[{"award-number":["CNS-1314632"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["IIS-1408924"],"award-info":[{"award-number":["IIS-1408924"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"crossref","award":["HDTRA1-10-1-0120"],"award-info":[{"award-number":["HDTRA1-10-1-0120"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10115-017-1077-6","type":"journal-article","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T07:23:04Z","timestamp":1498634584000},"page":"677-710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["Patterns and anomalies in k-cores of real-world graphs with applications"],"prefix":"10.1007","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"key":"1077_CR1","doi-asserted-by":"crossref","unstructured":"Abello J, Resende MG, Sudarsky S (2002) Massive quasi-clique detection. In: Latin American symposium on theoretical informatics, Springer, pp 598\u2013612","DOI":"10.1007\/3-540-45995-2_51"},{"key":"1077_CR2","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. In: Pacific\u2013Asia conference on knowledge discovery and data mining, Springer, pp 410\u2013421","DOI":"10.1007\/978-3-642-13672-6_40"},{"issue":"3","key":"1077_CR3","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu L, Tong H, Koutra D (2015) Graph based anomaly detection and description: a survey. Data Min Knowl Discov 29(3):626\u2013688","journal-title":"Data Min Knowl Discov"},{"issue":"6749","key":"1077_CR4","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert R, Jeong H, Barabsi AL (1999) Internet: diameter of the world-wide web. Nature 401(6749):130\u2013131","journal-title":"Nature"},{"key":"1077_CR5","first-page":"41","volume":"18","author":"JI Alvarez-Hamelin","year":"2006","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, Vespignani A (2006) Large scale networks fingerprinting and visualization using the $$k$$-core decomposition. Adv Neural Inf Process Syst 18:41","journal-title":"Adv Neural Inf Process Syst"},{"key":"1077_CR6","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3934\/nhm.2008.3.371","volume":"3","author":"JI Alvarez-Hamelin","year":"2008","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, Vespignani A (2008) $$K$$-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases. Netw Heterog Media 3:371","journal-title":"Netw Heterog Media"},{"issue":"1","key":"1077_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader GD, Hogue CW (2003) An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform 4(1):2","journal-title":"BMC Bioinform"},{"key":"1077_CR8","unstructured":"Batagelj V, Zaversnik M (2003) An o(m) algorithm for cores decomposition of networks. arXiv:cs\/0310049"},{"key":"1077_CR9","doi-asserted-by":"crossref","unstructured":"Beutel A, Xu W, Guruswami V, Palow C, Faloutsos C (2013) Copycatch: stopping group attacks by spotting lockstep behavior in social networks. In: Proceedings of the 22nd international conference on world wide web, ACM, pp 119\u2013130","DOI":"10.1145\/2488388.2488400"},{"issue":"4","key":"1077_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","volume":"21","author":"SP Borgatti","year":"2000","unstructured":"Borgatti SP, Everett MG (2000) Models of core\/periphery structures. Soc Netw 21(4):375\u2013395","journal-title":"Soc Netw"},{"issue":"9","key":"1077_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"key":"1077_CR12","volume-title":"Spectra of graphs","author":"AE Brouwer","year":"2001","unstructured":"Brouwer AE, Haemers WH (2001) Spectra of graphs. Springer, Berlin"},{"key":"1077_CR13","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: International Workshop on approximation algorithms for combinatorial optimization, Springer, pp 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"key":"1077_CR14","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Chu S, \u00d6zsu MT (2011) Efficient core decomposition in massive networks. In: 2011 IEEE 27th international conference on data engineering, IEEE, pp 51\u201362","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"1077_CR15","unstructured":"Cohen J (2008) Trusses: cohesive subgraphs for social network analysis. In: National security agency technical report, p 16"},{"key":"1077_CR16","doi-asserted-by":"crossref","unstructured":"Davis J, Goadrich M (2006) The relationship between precision-recall and roc curves. In: Proceedings of the 23rd international conference on machine learning, ACM, pp 233\u2013240","DOI":"10.1145\/1143844.1143874"},{"key":"1077_CR17","doi-asserted-by":"crossref","unstructured":"De Stefani L, Epasto A, Riondato M, Upfal E (2016) TRI\u00c8ST: counting local and global triangles in fully-dynamic streams with fixed memory size. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 825\u2013834","DOI":"10.1145\/2939672.2939771"},{"issue":"3","key":"1077_CR18","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BF02759702","volume":"1","author":"P Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s P (1963) On the structure of linear graphs. Israel J Math 1(3):156\u2013160","journal-title":"Israel J Math"},{"key":"1077_CR19","doi-asserted-by":"crossref","unstructured":"Farach-Colton M, Tsai MT (2014) Computing the degeneracy of large graphs. In: Latin American symposium on theoretical informatics, Springer, pp 250\u2013260","DOI":"10.1007\/978-3-642-54423-1_22"},{"issue":"1","key":"1077_CR20","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder EC (1982) A sufficient condition for backtrack-free search. J ACM (JACM) 29(1):24\u201332","journal-title":"J ACM (JACM)"},{"issue":"2","key":"1077_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/980972.980992","volume":"5","author":"J Gehrke","year":"2003","unstructured":"Gehrke J, Ginsparg P, Kleinberg J (2003) Overview of the 2003 KDD cup. ACM SIGKDD Explor Newslett 5(2):149\u2013151","journal-title":"ACM SIGKDD Explor Newslett"},{"key":"1077_CR22","doi-asserted-by":"crossref","unstructured":"Giatsidis C, Malliaros F, Thilikos DM, Vazirgiannis M (2014) Corecluster: a degeneracy based graph clustering framework. In: Twenty-sixth annual conference on innovative applications of artificial intelligence, AAAI, pp 29\u201331","DOI":"10.1609\/aaai.v28i1.8731"},{"key":"1077_CR23","doi-asserted-by":"publisher","unstructured":"Hall BH, Jaffe AB, Trajtenberg M (2001) The NBER patent citation data file: lessons, insights and methodological tools. doi: 10.3386\/w8498","DOI":"10.3386\/w8498"},{"key":"1077_CR24","doi-asserted-by":"crossref","unstructured":"Hooi B, Song HA, Beutel A, Shah N, Shin K, Faloutsos C (2016a) Fraudar: bounding graph fraud in the face of camouflage. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 895\u2013904","DOI":"10.1145\/2939672.2939747"},{"key":"1077_CR25","doi-asserted-by":"crossref","unstructured":"Hooi B, Song HA, Papalexakis E, Agrawal R, Faloutsos C (2016b) Matrices, compression, learning curves: formulation, and the GROUPNTEACH algorithms. In: Pacific\u2013Asia conference on knowledge discovery and data mining, Springer, pp 376\u2013387","DOI":"10.1007\/978-3-319-31750-2_30"},{"key":"1077_CR26","doi-asserted-by":"crossref","unstructured":"Huang X, Lu W, Lakshmanan LV (2016) Truss decomposition of probabilistic graphs: semantics and algorithms. In: Proceedings of the 2016 ACM SIGMOD international conference on management of data, ACM, pp 77\u201390","DOI":"10.1145\/2882903.2882913"},{"key":"1077_CR27","doi-asserted-by":"crossref","unstructured":"Jiang M, Beutel A, Cui P, Hooi B, Yang S, Faloutsos C (2015) A general suspiciousness metric for dense blocks in multimodal data. In: 2015 IEEE international conference on data mining, IEEE, pp 781\u2013786","DOI":"10.1109\/ICDM.2015.61"},{"key":"1077_CR28","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"11","key":"1077_CR29","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888\u2013893","journal-title":"Nat Phys"},{"key":"1077_CR30","doi-asserted-by":"crossref","unstructured":"Klimt B, Yang Y (2004) The enron corpus: a new dataset for email classification research. In: European conference on machine learning, Springer, pp 217\u2013226","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"1077_CR31","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is twitter, a social network or a news media?. In: Proceedings of the 19th international conference on world wide web, ACM, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"1077_CR32","doi-asserted-by":"crossref","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2005) Realistic mathematically tractable graph generation and evolution, using kronecker multiplication. In: European conference on principles of data mining and knowledge discovery, Springer, pp 133\u2013145","DOI":"10.1007\/11564126_17"},{"issue":"1","key":"1077_CR33","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"key":"1077_CR34","doi-asserted-by":"crossref","unstructured":"Lim Y, Kang U (2015) Mascot: memory-efficient and accurate sampling for counting local triangles in graph streams. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 685\u2013694","DOI":"10.1145\/2783258.2783285"},{"issue":"2","key":"1077_CR35","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce RD (1950) Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2):169\u201390","journal-title":"Psychometrika"},{"key":"1077_CR36","unstructured":"Macdonald B, Shakarian P, Howard N, Moores G (2012) Spreaders in the network sir model: an empirical study. arXiv preprint arXiv:1208.4269"},{"key":"1077_CR37","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement, ACM, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"issue":"2","key":"1077_CR38","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken RJ (1979) Cliques, clubs and clans. Qual Quant 13(2):161\u2013173","journal-title":"Qual Quant"},{"issue":"23","key":"1077_CR39","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Nat Acad Sci 103(23):8577\u20138582","journal-title":"Proc Nat Acad Sci"},{"key":"1077_CR40","doi-asserted-by":"crossref","unstructured":"Pandit S, Chau DH, Wang S, Faloutsos C (2007) Netprobe: a fast and scalable system for fraud detection in online auction networks. In: Proceedings of the 16th international conference on world wide web, ACM, pp 201\u2013210","DOI":"10.1145\/1242572.1242600"},{"key":"1077_CR41","doi-asserted-by":"crossref","unstructured":"Prakash BA, Sridharan A, Seshadri M, Machiraju S, Faloutsos C (2010) Eigenspokes: surprising patterns and scalable community chipping in large graphs. In: Pacific\u2013Asia conference on knowledge discovery and data mining, Springer, pp 435\u2013448","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"1077_CR42","doi-asserted-by":"crossref","unstructured":"Rossi MEG, Malliaros FD, Vazirgiannis M (2015) Spread it good, spread it fast: identification of influential nodes in social networks. In: Proceedings of the 24th international conference on world wide web (companion volume), ACM, pp 101\u2013102","DOI":"10.1145\/2740908.2742736"},{"issue":"6","key":"1077_CR43","doi-asserted-by":"publisher","first-page":"433","DOI":"10.14778\/2536336.2536344","volume":"6","author":"AE Sar\u00edy\u00fcce","year":"2013","unstructured":"Sar\u00edy\u00fcce AE, Gedik B, Jacques-Silva G, Wu KL, \u00c7ataly\u00fcrek \u00dcV (2013) Streaming algorithms for $$k$$-core decomposition. Proc VLDB Endow 6(6):433\u2013444","journal-title":"Proc VLDB Endow"},{"key":"1077_CR44","doi-asserted-by":"crossref","unstructured":"Sar\u00edy\u00fcce AE, Seshadhri C, Pinar A, Catalyurek UV (2015) Finding the hierarchy of dense subgraphs using nucleus decompositions. In: Proceedings of the 24th international conference on world wide web, ACM, pp 927\u2013937","DOI":"10.1145\/2736277.2741640"},{"key":"1077_CR45","unstructured":"Schank T (2007) Algorithmic aspects of triangle-based network analysis. Ph.D. thesis, Universitt Karlsruhe (TH), Fakultt fr Informatik"},{"issue":"1","key":"1077_CR46","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph theoretic generalization of the clique concept. J Math Sociol 6(1):139\u2013154","journal-title":"J Math Sociol"},{"issue":"3","key":"1077_CR47","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287","journal-title":"Soc Netw"},{"key":"1077_CR48","doi-asserted-by":"crossref","unstructured":"Shin K, Hooi B, Faloutsos C (2016a) M-zoom: fast dense-block detection in tensors with quality guarantees. In: Joint European conference on machine learning and knowledge discovery in databases, Springer, pp 264\u2013280","DOI":"10.1007\/978-3-319-46128-1_17"},{"key":"1077_CR49","doi-asserted-by":"crossref","unstructured":"Shin K, Eliassi-Rad T, Faloutsos C (2016b) Corescope: graph mining using $$k$$-core analysis\u2014patterns, anomalies and algorithms. In: 2016 16th IEEE international conference on data mining, IEEE, pp 469\u2013478","DOI":"10.1109\/ICDM.2016.0058"},{"key":"1077_CR50","doi-asserted-by":"crossref","unstructured":"Shin K, Hooi B, Jisu K, Faloutsos C (2017a) D-cube: dense-block detection in terabyte-scale tensors. In: Proceedings of the Tenth ACM international conference on web search and data mining, ACM, pp 681\u2013690","DOI":"10.1145\/3018661.3018676"},{"key":"1077_CR51","doi-asserted-by":"crossref","unstructured":"Shin K, Hooi B, Jisu K, Faloutsos C (2017b) Densealert: incremental dense-subtensor detection in tensor streams. arXiv preprint arXiv:1706.03374","DOI":"10.1145\/3097983.3098087"},{"issue":"1","key":"1077_CR52","doi-asserted-by":"publisher","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman C (1904) The proof and measurement of association between two things. Am J Psychol 15(1):72\u2013101","journal-title":"Am J Psychol"},{"key":"1077_CR53","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE (2008) Fast counting of triangles in large real networks without counting: algorithms and laws. In: 2008 eighth IEEE international conference on data mining, IEEE, pp 608\u2013617","DOI":"10.1109\/ICDM.2008.72"},{"key":"1077_CR54","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009) Doulion: counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 837\u2013846","DOI":"10.1145\/1557019.1557111"},{"issue":"1","key":"1077_CR55","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0377-0427(00)00393-9","volume":"123","author":"CF Van Loan","year":"2000","unstructured":"Van Loan CF (2000) The ubiquitous kronecker product. J Comput Appl Math 123(1):85\u2013100","journal-title":"J Comput Appl Math"},{"issue":"9","key":"1077_CR56","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang J, Cheng J (2012) Truss decomposition in massive networks. Proc VLDB Endow 5(9):812\u2013823","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"1077_CR57","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1002\/pmic.200400962","volume":"5","author":"S Wuchty","year":"2005","unstructured":"Wuchty S, Almaas E (2005) Peeling the yeast protein network. Proteomics 5(2):444\u2013449","journal-title":"Proteomics"},{"key":"1077_CR58","doi-asserted-by":"crossref","unstructured":"Zhang S, Zhou D, Yildirim MY, Alcorn S, He J, Davulcu H, Tong H (2017) HiDDen: hierarchical dense subgraph detection with application to financial fraud detection. In: Proceedings of the 2017 SIAM international conference on data mining, SIAM, pp 570\u2013578","DOI":"10.1137\/1.9781611974973.64"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1077-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T23:11:31Z","timestamp":1659136291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1077-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,28]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["1077"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1077-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,28]]},"assertion":[{"value":"16 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}