{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T06:19:54Z","timestamp":1782368394854,"version":"3.54.5"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,3,26]],"date-time":"2016-03-26T00:00:00Z","timestamp":1458950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00446-016-0269-8","type":"journal-article","created":{"date-parts":[[2016,3,26]],"date-time":"2016-03-26T08:27:57Z","timestamp":1458980877000},"page":"377-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4333-8506","authenticated-orcid":false,"given":"Peter","family":"Jeavons","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Scott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,26]]},"reference":[{"key":"269_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., Kuhn, F.: Beeping a maximal independent set. In: Proceedings of the 25th International Conference on Distributed Computing (DISC\u201911), pp. 32\u201350. Springer (2011)","DOI":"10.1007\/978-3-642-24100-0_3"},{"issue":"6014","key":"269_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1126\/science.1193210","volume":"331","author":"Y Afek","year":"2011","unstructured":"Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science 331(6014), 183\u2013185 (2011)","journal-title":"Science"},{"key":"269_CR3","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7, 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"269_CR4","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Distributed ( $$\\delta +1$$ \u03b4 + 1 )-coloring in linear (in $$\\delta $$ \u03b4 ) time. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC\u201909), pp. 111\u2013120. ACM, New York (2009)","DOI":"10.1145\/1536414.1536432"},{"issue":"5\u20136","key":"269_CR5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s00446-009-0088-2","volume":"22","author":"L Barenboim","year":"2010","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22(5\u20136), 363\u2013379 (2010)","journal-title":"Distrib. Comput."},{"issue":"5","key":"269_CR6","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/2027216.2027221","volume":"58","author":"L Barenboim","year":"2011","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58(5), 23:1\u201323:25 (2011)","journal-title":"J. ACM"},{"key":"269_CR7","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. In: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS\u201912), pp. 321\u2013330. IEEE Computer Society, Washington (2012)","DOI":"10.1109\/FOCS.2012.60"},{"issue":"9","key":"269_CR8","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1038\/nrm2009","volume":"7","author":"SJ Bray","year":"2006","unstructured":"Bray, S.J.: Notch signalling: a simple pathway becomes complex. Nat. Rev. Mol. Cell Biol. 7(9), 678\u2013689 (2006)","journal-title":"Nat. Rev. Mol. Cell Biol."},{"issue":"3","key":"269_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0255(87)90039-9","volume":"43","author":"P Chaudhuri","year":"1987","unstructured":"Chaudhuri, P.: Algorithms for some graph problems on a distributed computational model. Inf. Sci. 43(3), 205\u2013228 (1987)","journal-title":"Inf. Sci."},{"issue":"4","key":"269_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1006\/jtbi.1996.0233","volume":"183","author":"JR Collier","year":"1996","unstructured":"Collier, J.R., Monk, N.A., Maini, P.K., Lewis, J.H.: Pattern formation by lateral inhibition with feedback: a mathematical model of delta-notch intercellular signalling. J. Theor. Biol. 183(4), 429\u2013446 (1996)","journal-title":"J. Theor. Biol."},{"key":"269_CR11","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Proceedings of the 24th International Conference on Distributed Computing (DISC\u201910), pp. 148\u2013162. Springer, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15763-9_15"},{"key":"269_CR12","doi-asserted-by":"crossref","unstructured":"Emek, Y., Wattenhofer, R.: Stone age distributed computing. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing (PODC\u201913), pp. 137\u2013146. ACM, New York (2013)","DOI":"10.1145\/2484239.2484244"},{"issue":"1","key":"269_CR13","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1002\/net.20293","volume":"54","author":"C Gavoille","year":"2009","unstructured":"Gavoille, C., Klasing, R., Kosowski, A., Kuszner, \u0141., Navarra, A.: On the complexity of distributed graph coloring with local minimality constraints. Networks 54(1), 12\u201319 (2009)","journal-title":"Networks"},{"issue":"1","key":"269_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0166-218X(02)00424-9","volume":"131","author":"AH Gebremedhin","year":"2003","unstructured":"Gebremedhin, A.H., Lassous, I.G., Gustedt, J., Telle, J.A.: Graph coloring on coarse grained multicomputers. Discrete Appl. Math. 131(1), 179\u2013198 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"269_CR15","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0401044","volume":"1","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Plotkin, S.A., Shannon, G.E.: Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math. 1(4), 434\u2013446 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"269_CR16","volume-title":"Limits to Parallel Computation: P-Completeness Theory","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L. (eds.): Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York (1995)"},{"key":"269_CR17","first-page":"6","volume":"2","author":"P Grundy","year":"1939","unstructured":"Grundy, P.: Mathematics and games. Eureka 2, 6\u20138 (1939)","journal-title":"Eureka"},{"issue":"3","key":"269_CR18","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"JY Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J. ACM 37(3), 549\u2013587 (1990)","journal-title":"J. ACM"},{"key":"269_CR19","doi-asserted-by":"crossref","unstructured":"Hansen, J., Kubale, M., Kuszner, \u0141., Nadolski, A.: Distributed largest-first algorithm for graph coloring. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004 Parallel Processing. Lecture Notes in Computer Science, vol. 3149, pp. 804\u2013811. Springer, Berlin, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27866-5_107"},{"issue":"5","key":"269_CR20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(03)00299-0","volume":"87","author":"ST Hedetniemi","year":"2003","unstructured":"Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5), 251\u2013255 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"269_CR21","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0890-5401(90)90004-2","volume":"88","author":"A Itai","year":"1990","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Inf. Comput. 88(1), 60\u201387 (1990)","journal-title":"Inf. Comput."},{"issue":"5","key":"269_CR22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0020-0190(99)00064-2","volume":"70","author":"O Johansson","year":"1999","unstructured":"Johansson, O.: Simple distributed $$\\Delta +1$$ \u0394 + 1 -coloring of graphs. Inf. Process. Lett. 70(5), 229\u2013232 (1999)","journal-title":"Inf. Process. Lett."},{"key":"269_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations. The IBM Research Symposia Series","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"4","key":"269_CR24","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","volume":"32","author":"RM Karp","year":"1985","unstructured":"Karp, R.M., Wigderson, A.: A fast parallel algorithm for the maximal independent set problem. J. ACM 32(4), 762\u2013773 (1985)","journal-title":"J. ACM"},{"key":"269_CR25","first-page":"11","volume":"54","author":"KL Kroeker","year":"2011","unstructured":"Kroeker, K.L.: Biology-inspired networking. Commun. ACM 54, 11\u201313 (2011)","journal-title":"Commun. ACM"},{"key":"269_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, F.: Weak graph colorings: distributed algorithms and applications. In: Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures (SPAA\u201909), pp. 138\u2013144. ACM, New York (2009)","DOI":"10.1145\/1583991.1584032"},{"key":"269_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/11561927_21","volume-title":"Distributed Computing: 19th International Conference (DISC 2005)","author":"F Kuhn","year":"2005","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Fraigniaud, P. (ed.) Distributed Computing: 19th International Conference (DISC 2005). Lecture Notes in Computer Science, vol. 3724, pp. 273\u2013283. Springer, Berlin (2005)"},{"key":"269_CR28","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC\u201904), pp. 300\u2013309. ACM, New York (2004)","DOI":"10.1145\/1011767.1011811"},{"key":"269_CR29","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proceedings of the Seventeenth Annual ACM\u2013SIAM Symposium on Discrete Algorithm (SODA\u201906), pp. 980\u2013989. New York (2006)","DOI":"10.1145\/1109557.1109666"},{"key":"269_CR30","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: Lower and upper bounds. CoRR abs\/1011.5470 (2010). arXiv:1011.5470"},{"key":"269_CR31","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201906), pp. 7\u201315. New York (2006)","DOI":"10.1145\/1146381.1146387"},{"issue":"1958","key":"269_CR32","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1098\/rsta.2011.0212","volume":"370","author":"C Lenzen","year":"2012","unstructured":"Lenzen, C., Wattenhofer, R.: Distributed algorithms for sensor networks. Philos. Trans. R. Soc. A: Math. Phys. Eng. Sci. 370(1958), 11\u201326 (2012)","journal-title":"Philos. Trans. R. Soc. A: Math. Phys. Eng. Sci."},{"issue":"1","key":"269_CR33","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579408","volume":"6","author":"N Linial","year":"1986","unstructured":"Linial, N.: Legal coloring of graphs. Combinatorica 6(1), 49\u201354 (1986)","journal-title":"Combinatorica"},{"key":"269_CR34","doi-asserted-by":"crossref","unstructured":"Linial, N.: Distributive graph algorithms: global solutions from local data. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science (SFCS\u201987), pp. 331\u2013335. IEEE Computer Society, Washington (1987)","DOI":"10.1109\/SFCS.1987.20"},{"issue":"1","key":"269_CR35","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"269_CR36","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"269_CR37","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"6","key":"269_CR38","first-page":"9","volume":"58","author":"V Maan","year":"2012","unstructured":"Maan, V., Purohit, G.N.: A distributed approach for frequency allocation using graph coloring in mobile networks. Int. J. Comput. Appl. 58(6), 9\u201313 (2012)","journal-title":"Int. J. Comput. Appl."},{"issue":"11","key":"269_CR39","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1016\/j.ic.2010.07.001","volume":"208","author":"Y M\u00e9tivier","year":"2010","unstructured":"M\u00e9tivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A.: About randomised distributed graph colouring and graph partition algorithms. Inf. Comput. 208(11), 1296\u20131304 (2010)","journal-title":"Inf. Comput."},{"issue":"5\u20136","key":"269_CR40","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s00446-010-0121-5","volume":"23","author":"Y M\u00e9tivier","year":"2011","unstructured":"M\u00e9tivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A.: An optimal bit complexity randomized distributed MIS algorithm. Distrib. Comput. 23(5\u20136), 331\u2013340 (2011)","journal-title":"Distrib. Comput."},{"key":"269_CR41","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201905), pp. 148\u2013157. ACM, New York (2005)","DOI":"10.1145\/1073814.1073842"},{"issue":"2","key":"269_CR42","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1109\/TNET.2010.2090172","volume":"19","author":"J Ni","year":"2011","unstructured":"Ni, J., Srikant, R., Wu, X.: Coloring spatial point processes with applications to peer discovery in large wireless networks. IEEE\/ACM Trans. Netw. 19(2), 575\u2013588 (2011)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"269_CR43","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/PL00008932","volume":"14","author":"A Panconesi","year":"2001","unstructured":"Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14(2), 97\u2013100 (2001)","journal-title":"Distrib. Comput."},{"issue":"2","key":"269_CR44","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1006\/jagm.1996.0017","volume":"20","author":"A Panconesi","year":"1996","unstructured":"Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 356\u2013374 (1996)","journal-title":"J. Algorithms"},{"issue":"2","key":"269_CR45","first-page":"258","volume":"39","author":"T Park","year":"1996","unstructured":"Park, T., Lee, C.Y.: Application of the graph coloring algorithm to the frequency assignment problem. J. Oper. Res. Soc. Japan-Keiei Kagaku 39(2), 258\u2013265 (1996)","journal-title":"J. Oper. Res. Soc. Japan-Keiei Kagaku"},{"key":"269_CR46","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"2","key":"269_CR47","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1006\/jpdc.1996.1300","volume":"41","author":"R Prakash","year":"1997","unstructured":"Prakash, R., Raynal, M., Singhal, M.: An adaptive causal ordering algorithm suited to mobile computing environments. J. Parallel Distrib. Comput. 41(2), 190\u2013204 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"key":"269_CR48","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC\u201908), pp. 35\u201344. ACM, New York (2008)","DOI":"10.1145\/1400751.1400758"},{"key":"269_CR49","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A new technique for distributed symmetry breaking. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC\u201910), pp. 257\u2013266. ACM, New York (2010)","DOI":"10.1145\/1835698.1835760"},{"key":"269_CR50","doi-asserted-by":"crossref","unstructured":"Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing (PODC\u201913), pp. 147\u2013156. ACM, New York (2013)","DOI":"10.1145\/2484239.2484247"},{"key":"269_CR51","unstructured":"Waters, R.J.: Graph colouring and frequency assignment. Ph.D. Thesis (2005)"},{"key":"269_CR52","unstructured":"Wattenhofer, R.: http:\/\/dcg.ethz.ch\/lectures\/fs08\/distcomp\/lecture\/chapter4 (2007)"},{"issue":"6","key":"269_CR53","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1162\/NECO_a_00443","volume":"25","author":"L Xu","year":"2013","unstructured":"Xu, L., Jeavons, P.: Simple neural-like P systems for maximal independent set selection. Neural Comput. 25(6), 1642\u20131659 (2013)","journal-title":"Neural Comput."},{"key":"269_CR54","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.ins.2014.06.035","volume":"316","author":"L Xu","year":"2015","unstructured":"Xu, L., Jeavons, P.: Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge. Inf. Sci. 316, 550\u2013566 (2015)","journal-title":"Inf. Sci."},{"key":"269_CR55","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC\u201906), pp. 681\u2013690. ACM, New York (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0269-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0269-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0269-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0269-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:26:46Z","timestamp":1559122006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0269-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,26]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["269"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0269-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,26]]}}}