{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T01:23:07Z","timestamp":1791336187937,"version":"4.3.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T00:00:00Z","timestamp":1535587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1444\/14"],"award-info":[{"award-number":["1444\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ANR project DESCARTES"},{"name":"INRIA project GANG"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00446-018-0340-8","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T03:32:50Z","timestamp":1535599970000},"page":"217-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Randomized proof-labeling schemes"],"prefix":"10.1007","volume":"32","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9034-2247","authenticated-orcid":false,"given":"Mor","family":"Perry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"issue":"1\u20132","key":"340_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(96)00286-1","volume":"186","author":"Y Afek","year":"1997","unstructured":"Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its application to self-stabilization. Theor. Comput. Sci. 186(1\u20132), 199\u2013229 (1997). \n                    https:\/\/doi.org\/10.1016\/S0304-3975(96)00286-1","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"340_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/S0895480103433409","volume":"19","author":"S Alstrup","year":"2005","unstructured":"Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM J. Discrete Math. 19(2), 448\u2013462 (2005). \n                    https:\/\/doi.org\/10.1137\/S0895480103433409","journal-title":"SIAM J. Discrete Math."},{"key":"340_CR3","doi-asserted-by":"publisher","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new distributed algorithm. In: 14th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 258\u2013264 (2002). \n                    https:\/\/doi.org\/10.1145\/564870.564914","DOI":"10.1145\/564870.564914"},{"key":"340_CR4","doi-asserted-by":"publisher","unstructured":"Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: 43rd Symposium on Foundations of Computer Science (FOCS), pp. 53\u201362 (2002). \n                    https:\/\/doi.org\/10.1109\/SFCS.2002.1181882","DOI":"10.1109\/SFCS.2002.1181882"},{"key":"340_CR5","doi-asserted-by":"publisher","unstructured":"Arfaoui, H., Fraigniaud, P., Ilcinkas, D., Mathieu, F.: Distributedly testing cycle-freeness. In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop. Revised Selected Papers, pp. 15\u201328 (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-12340-0_2","DOI":"10.1007\/978-3-319-12340-0_2"},{"key":"340_CR6","doi-asserted-by":"publisher","unstructured":"Arfaoui, H., Fraigniaud, P., Pelc, A.: Local decision and verification with bounded-size outputs. In: Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium, SSS. Proceedings, pp. 133\u2013147 (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-319-03089-0_10","DOI":"10.1007\/978-3-319-03089-0_10"},{"key":"340_CR7","doi-asserted-by":"publisher","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: 32nd Annual Symposium on Foundations of Computer Science, pp. 268\u2013277 (1991). \n                    https:\/\/doi.org\/10.1109\/SFCS.1991.185378","DOI":"10.1109\/SFCS.1991.185378"},{"key":"340_CR8","doi-asserted-by":"publisher","unstructured":"Blin, L., Fraigniaud, P., Patt-Shamir, B.: On proof-labeling schemes versus silent self-stabilizing algorithms. In: Stabilization, Safety, and Security of Distributed Systems - 16th International Symposium, SSS. Proceedings, pp. 18\u201332 (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-11764-5_2","DOI":"10.1007\/978-3-319-11764-5_2"},{"issue":"5","key":"340_CR9","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003). \n                    https:\/\/doi.org\/10.1137\/S0097539702403098","journal-title":"SIAM J. Comput."},{"key":"340_CR10","unstructured":"Feuilloley, L., Fraigniaud, P.: Survey of distributed decision. Bulletin of the EATCS (2016). \n                    http:\/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/411\/391"},{"key":"340_CR11","unstructured":"Feuilloley, L., Fraigniaud, P., Hirvonen, J.: A Hierarchy of Local Decision. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 118:1\u2013118:15. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2016). \n                    http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2016.118\n                    \n                  . \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/6253"},{"key":"340_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2016.11.018","volume":"709","author":"K Foerster","year":"2018","unstructured":"Foerster, K., Luedi, T., Seidel, J., Wattenhofer, R.: Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNS. Theor. Comput. Sci. 709, 48\u201363 (2018). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2016.11.018","journal-title":"Theor. Comput. Sci."},{"key":"340_CR13","doi-asserted-by":"publisher","unstructured":"Foerster, K.T., Richter, O., Seidel, J., Wattenhofer, R.: Local checkability in dynamic networks. In: Proceedings of the 18th International Conference on Distributed Computing and Networking (ICDCN \u201917), pp. 4:1\u20134:10. ACM (2017). \n                    https:\/\/doi.org\/10.1145\/3007748.3007779","DOI":"10.1145\/3007748.3007779"},{"key":"340_CR14","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Automata, Languages and Programming, 28th International Colloquium, ICALP, Proceedings, pp. 757\u2013772 (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-48224-5_62","DOI":"10.1007\/3-540-48224-5_62"},{"key":"340_CR15","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, pp. 65\u201375 (2002). \n                    https:\/\/doi.org\/10.1007\/3-540-45841-7_4","DOI":"10.1007\/3-540-45841-7_4"},{"issue":"6","key":"340_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00446-014-0211-x","volume":"27","author":"P Fraigniaud","year":"2014","unstructured":"Fraigniaud, P., G\u00f6\u00f6s, M., Korman, A., Parter, M., Peleg, D.: Randomized distributed decision. Distrib. Comput. 27(6), 419\u2013434 (2014). \n                    https:\/\/doi.org\/10.1007\/s00446-014-0211-x","journal-title":"Distrib. Comput."},{"key":"340_CR17","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., G\u00f6\u00f6s, M., Korman, A., Suomela, J.: What can be decided locally without identifiers? In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, pp. 157\u2013165. ACM (2013). \n                    https:\/\/doi.org\/10.1145\/2484239.2484264","DOI":"10.1145\/2484239.2484264"},{"key":"340_CR18","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., Halld\u00f3rsson, M.M., Korman, A.: On the impact of identifiers on local decision. In: Principles of Distributed Systems: 16th International Conference, OPODIS. Proceedings, pp. 224\u2013238. Springer, Berlin (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-35476-2_16","DOI":"10.1007\/978-3-642-35476-2_16"},{"key":"340_CR19","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., Hirvonen, J., Suomela, J.: Node labels in local decision. In: Structural Information and Communication Complexity: 22nd International Colloquium, SIROCCO. Post-Proceedings, pp. 31\u201345. Springer, Berlin (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-25258-2_3","DOI":"10.1007\/978-3-319-25258-2_3"},{"key":"340_CR20","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., Korman, A.: On randomized representations of graphs using short labels. In: SPAA: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 131\u2013137 (2009). \n                    https:\/\/doi.org\/10.1145\/1583991.1584031","DOI":"10.1145\/1583991.1584031"},{"issue":"5","key":"340_CR21","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1145\/2499228","volume":"60","author":"P Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Korman, A., Peleg, D.: Towards a complexity theory for local distributed computing. J. ACM 60(5), 35:1\u201335:26 (2013). \n                    https:\/\/doi.org\/10.1145\/2499228","journal-title":"J. ACM"},{"issue":"4","key":"340_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00446-013-0188-x","volume":"26","author":"P Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Rajsbaum, S., Travers, C.: Locality and checkability in wait-free computing. Distrib. Comput. 26(4), 223\u2013242 (2013). \n                    https:\/\/doi.org\/10.1007\/s00446-013-0188-x","journal-title":"Distrib. Comput."},{"key":"340_CR23","doi-asserted-by":"publisher","unstructured":"Fraigniaud, P., Rajsbaum, S., Travers, C.: On the number of opinions needed for fault-tolerant run-time monitoring in distributed systems. In: Runtime Verification - 5th International Conference, RV. Proceedings, pp. 92\u2013107 (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-11164-3_9","DOI":"10.1007\/978-3-319-11164-3_9"},{"key":"340_CR24","doi-asserted-by":"publisher","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: 9th European Symposium on Algorithms (ESA), pp. 476\u2013487 (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44676-1_40","DOI":"10.1007\/3-540-44676-1_40"},{"key":"340_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S1571-0653(04)00374-9","volume":"10","author":"C Gavoille","year":"2001","unstructured":"Gavoille, C., Paul, C.: Split decomposition and distance labelling: an optimal scheme for distance hereditary graphs. Electron. Notes Discrete Math. 10, 117\u2013120 (2001). \n                    https:\/\/doi.org\/10.1016\/S1571-0653(04)00374-9","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"340_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53(1), 85\u2013112 (2004). \n                    https:\/\/doi.org\/10.1016\/j.jalgor.2004.05.002","journal-title":"J. Algorithms"},{"issue":"1","key":"340_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a019","volume":"12","author":"M G\u00f6\u00f6s","year":"2016","unstructured":"G\u00f6\u00f6s, M., Suomela, J.: Locally checkable proofs in distributed computing. Theory Comput. 12(1), 1\u201333 (2016). \n                    https:\/\/doi.org\/10.4086\/toc.2016.v012a019","journal-title":"Theory Comput."},{"issue":"6","key":"340_CR28","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973). \n                    https:\/\/doi.org\/10.1145\/362248.362272","journal-title":"Commun. ACM"},{"key":"340_CR29","doi-asserted-by":"publisher","unstructured":"Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: 35th Annual Symposium on Foundations of Computer Science, pp. 226\u2013239 (1994). \n                    https:\/\/doi.org\/10.1109\/SFCS.1994.365691","DOI":"10.1109\/SFCS.1994.365691"},{"issue":"4","key":"340_CR30","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5(4), 596\u2013603 (1992). \n                    https:\/\/doi.org\/10.1137\/0405049","journal-title":"SIAM J. Discrete Math."},{"key":"340_CR31","doi-asserted-by":"publisher","unstructured":"Kaplan, H., Milo, T.: Short and simple labels for small distances and other functions. In: 7th International Workshop on Algorithms and Data Structures (WADS), pp. 246\u2013257 (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44634-6_23","DOI":"10.1007\/3-540-44634-6_23"},{"issue":"1","key":"340_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539703433912","volume":"34","author":"M Katz","year":"2004","unstructured":"Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. Comput. 34(1), 23\u201340 (2004). \n                    https:\/\/doi.org\/10.1137\/S0097539703433912","journal-title":"SIAM J. Comput."},{"issue":"3","key":"340_CR33","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.dam.2004.03.005","volume":"145","author":"M Katz","year":"2005","unstructured":"Katz, M., Katz, N.A., Peleg, D.: Distance labeling schemes for well-separated graph classes. Discrete Appl. Math. 145(3), 384\u2013402 (2005). \n                    https:\/\/doi.org\/10.1016\/j.dam.2004.03.005","journal-title":"Discrete Appl. Math."},{"key":"340_CR34","doi-asserted-by":"publisher","unstructured":"Korman, A.: Labeling schemes for vertex connectivity. ACM Trans. Algorithms. \n                    https:\/\/doi.org\/10.1145\/1721837.1721855\n                    \n                   (2012)","DOI":"10.1145\/1721837.1721855"},{"issue":"4","key":"340_CR35","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00446-007-0025-1","volume":"20","author":"A Korman","year":"2007","unstructured":"Korman, A., Kutten, S.: Distributed verification of minimum spanning trees. Distrib. Comput. 20(4), 253\u2013266 (2007). \n                    https:\/\/doi.org\/10.1007\/s00446-007-0025-1","journal-title":"Distrib. Comput."},{"key":"340_CR36","doi-asserted-by":"publisher","unstructured":"Korman, A., Kutten, S., Masuzawa, T.: Fast and compact self stabilizing verification, computation, and fault detection of an MST. In: 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 311\u2013320 (2011). \n                    https:\/\/doi.org\/10.1145\/1993806.1993866","DOI":"10.1145\/1993806.1993866"},{"issue":"4","key":"340_CR37","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215\u2013233 (2010). \n                    https:\/\/doi.org\/10.1007\/s00446-010-0095-3","journal-title":"Distrib. Comput."},{"issue":"4","key":"340_CR38","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-008-9226-7","volume":"57","author":"A Korman","year":"2010","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Constructing labeling schemes through universal matrices. Algorithmica 57(4), 641\u2013652 (2010). \n                    https:\/\/doi.org\/10.1007\/s00453-008-9226-7","journal-title":"Algorithmica"},{"key":"340_CR39","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"340_CR40","doi-asserted-by":"publisher","unstructured":"Kutten, S., Trehan, C.: Fast and compact distributed verification and self-stabilization of a DFS tree. In: Principles of Distributed Systems - 18th International Conference, OPODIS. Proceedings, pp. 323\u2013338 (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-14472-6_22","DOI":"10.1007\/978-3-319-14472-6_22"},{"key":"340_CR41","doi-asserted-by":"publisher","unstructured":"Lotker, Z., Pavlov, E., Patt-Shamir, B., Peleg, D.: MST construction in \n                    \n                      \n                    \n                    $$o(log log n)$$\n                    \n                      \n                        \n                          o\n                          (\n                          l\n                          o\n                          g\n                          l\n                          o\n                          g\n                          n\n                          )\n                        \n                      \n                    \n                   communication rounds. In: SPAA: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 94\u2013100 (2003). \n                    https:\/\/doi.org\/10.1145\/777412.777428","DOI":"10.1145\/777412.777428"},{"key":"340_CR42","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Perry, M., Rosenbaum, W.: Space\u2013time tradeoffs for distributed verification. In: Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO, Revised Selected Papers, pp. 53\u201370 (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-72050-0_4","DOI":"10.1007\/978-3-319-72050-0_4"},{"key":"340_CR43","unstructured":"Papadimitriou, C.H.: Computational complexity. In: Encyclopedia of Computer Science, pp. 260\u2013265. Wiley, Chichester. URL \n                    http:\/\/dl.acm.org\/citation.cfm?id=1074100.1074233"},{"key":"340_CR44","doi-asserted-by":"publisher","unstructured":"Peleg, D.: Proximity-preserving labeling schemes and their applications. In: 25th International Workshop Graph-Theoretic Concepts in Computer Science (WG), pp. 30\u201341 (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-46784-X_5","DOI":"10.1007\/3-540-46784-X_5"},{"issue":"3","key":"340_CR45","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.tcs.2005.03.015","volume":"340","author":"D Peleg","year":"2005","unstructured":"Peleg, D.: Informative labeling schemes for graphs. Theor. Comput. Sci. 340(3), 577\u2013593 (2005). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2005.03.015","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"340_CR46","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/11085178X","volume":"41","author":"AD Sarma","year":"2012","unstructured":"Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235\u20131265 (2012). \n                    https:\/\/doi.org\/10.1137\/11085178X","journal-title":"SIAM J. Comput."},{"key":"340_CR47","doi-asserted-by":"publisher","unstructured":"Schmid, S., Suomela, J.: Exploiting locality in distributed SDN control. In: Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN), pp. 121\u2013126. ACM (2013). \n                    https:\/\/doi.org\/10.1145\/2491185.2491198","DOI":"10.1145\/2491185.2491198"},{"issue":"2","key":"340_CR48","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972). \n                    https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J. Comput."},{"key":"340_CR49","doi-asserted-by":"publisher","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In: 42nd Symposium on Foundations of Computer Science (FOCS), pp. 242\u2013251 (2001). \n                    https:\/\/doi.org\/10.1109\/SFCS.2001.959898","DOI":"10.1109\/SFCS.2001.959898"},{"key":"340_CR50","doi-asserted-by":"publisher","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 1\u201310 (2001). \n                    https:\/\/doi.org\/10.1145\/378580.378581","DOI":"10.1145\/378580.378581"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0340-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-018-0340-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0340-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T15:00:08Z","timestamp":1569337208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-018-0340-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,30]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["340"],"URL":"https:\/\/doi.org\/10.1007\/s00446-018-0340-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,30]]},"assertion":[{"value":"24 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}