{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:46Z","timestamp":1767339286112},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s12243-021-00875-7","type":"journal-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T07:17:58Z","timestamp":1633591078000},"page":"77-99","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Voting-based probabilistic consensuses and their applications in distributed ledgers"],"prefix":"10.1007","volume":"77","author":[{"given":"Serguei","family":"Popov","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"875_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.07.026","volume":"180","author":"MA Abdullah","year":"2015","unstructured":"Abdullah MA, Draief M (2015) Global majority consensus by local majority polling on graphs of a given degree sequence. Discret Appl Math 180:1\u201310","journal-title":"Discret Appl Math"},{"issue":"5","key":"875_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00446-012-0162-z","volume":"25","author":"MK Aguilera","year":"2012","unstructured":"Aguilera MK, Toueg S (2012) The correctness proof of Ben-Or\u2019s randomized consensus algorithm. Distrib Comput 25(5):371\u2013381","journal-title":"Distrib Comput"},{"issue":"3","key":"875_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-4149(82)90016-3","volume":"13","author":"DJ Aldous","year":"1982","unstructured":"Aldous DJ (1982) Markov chains with almost exponential hitting times. Stoch Process Appl 13 (3):305\u2013310","journal-title":"Stoch Process Appl"},{"key":"875_CR4","doi-asserted-by":"crossref","unstructured":"Aldous David J. , Brown M (1992) Inequalities for rare events in time-reversible Markov chains. I, volume 22 of Lecture Notes\u2013Monograph Series, pp 1\u201316. Institute of Mathematical Statistics, Hayward, CA","DOI":"10.1214\/lnms\/1215461937"},{"issue":"1","key":"875_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0304-4149(93)90035-3","volume":"44","author":"DJ Aldous","year":"1993","unstructured":"Aldous DJ, Brown M (1993) Inequalities for rare events in time-reversible Markov chains II. Stoch Process Appl 44(1):15\u201325","journal-title":"Stoch Process Appl"},{"key":"875_CR6","doi-asserted-by":"crossref","unstructured":"Aumann Y, adversaries Yehuda Lindell. (2007) Security against covert adversaries: efficient protocols for realistic adversaries. In: Theory of cryptography conference. Springer, pp 137\u2013156","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"875_CR7","doi-asserted-by":"crossref","unstructured":"Becchetti L, Clementi A, Natale E, Pasquale F, Trevisan L (2016) Stabilizing consensus with many opinions. In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms. SIAM, pp 620\u2013635","DOI":"10.1137\/1.9781611974331.ch46"},{"issue":"4","key":"875_CR8","doi-asserted-by":"publisher","first-page":"3796","DOI":"10.1109\/COMST.2019.2928178","volume":"21","author":"M Belotti","year":"2019","unstructured":"Belotti M, Bo\u017ei\u0107 N., Pujolle G (2019) S. Secci. A vademecum on blockchain technologies When, which, and how. IEEE Communications Surveys Tutorials 21(4):3796\u20133838","journal-title":"IEEE Communications Surveys Tutorials"},{"key":"875_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or M (1983) Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In: Proceedings of the 2nd ACM Annual symposium on principles of distributed computing, Montreal, Quebec, pp 27\u201330","DOI":"10.1145\/800221.806707"},{"issue":"9","key":"875_CR10","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.1016\/j.spa.2016.02.015","volume":"126","author":"I Benjamini","year":"2016","unstructured":"Benjamini I, Chan Siu-On, O\u2019Donnell R, Tamuz O, Tan Li-Yang (2016) Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs. Stoch Process Appl 126(9):2719\u20132733","journal-title":"Stoch Process Appl"},{"key":"875_CR11","doi-asserted-by":"crossref","unstructured":"Bovier A (2016) Metastability. A potentialtheoretic approach. Springer","DOI":"10.1007\/978-3-319-24777-9"},{"key":"875_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4171\/JEMS\/14","volume":"6","author":"A Bovier","year":"2004","unstructured":"Bovier A, Eckhoff M, Gayrard V, Klein M (2004) Metastability in reversible diffusion processes I Sharp asymptotics for capacities and exit times. J Eur Math Soc 6:399\u2013424","journal-title":"J Eur Math Soc"},{"issue":"2","key":"875_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha G (1987) Asynchronous Byzantine agreement protocols. Inf Comput 75(2):130\u2013143","journal-title":"Inf Comput"},{"key":"875_CR14","doi-asserted-by":"crossref","unstructured":"Bramson M, Cox J, Le J-F, Gall T (2001) Super-Brownian limits of voter model clusters. Ann Probab 29(3):1001\u20131032","DOI":"10.1214\/aop\/1015345593"},{"key":"875_CR15","unstructured":"Capossele A, Mueller S, Penzkofer A (2019) Robustness and efficiency of leaderless probabilistic consensus protocols within Byzantine infrastructures. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2096720921000026"},{"key":"875_CR16","doi-asserted-by":"crossref","unstructured":"Cascudo I, David B (2017) Scrape: scalable randomness attested by public entities. In: International conference on applied cryptography and network security. Springer, pp 537\u2013556","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"875_CR17","doi-asserted-by":"crossref","unstructured":"Cassandro M, Galves A, Olivieri E, Vares ME (June 1984) Metastable behavior of stochastic dynamics: a pathwise approach. J Stat Phys 35(5-6):603\u2013634","DOI":"10.1007\/BF01010826"},{"issue":"3","key":"875_CR18","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/biomet\/60.3.581","volume":"60","author":"P Clifford","year":"1973","unstructured":"Clifford P, Sudbury A (1973) A model for spatial conflict. Biometrika 60(3):581\u2013588","journal-title":"Biometrika"},{"key":"875_CR19","volume-title":"Cellular automata","author":"EF Codd","year":"1968","unstructured":"Codd EF (1968) Cellular automata. Cambridge, Academic Press"},{"issue":"4","key":"875_CR20","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00440-003-0273-3","volume":"126","author":"F Comets","year":"2003","unstructured":"Comets F, Popov S (2003) Limit law for transition probabilities and moderate deviations for Sinai\u2019s random walk in random environment. Probab Theory Related Fields 126(4):571\u2013609","journal-title":"Probab Theory Related Fields"},{"key":"875_CR21","doi-asserted-by":"crossref","unstructured":"Cooper C, Els\u00e4sser R., Radzik T (2014) The power of two choices in distributed voting. In: International colloquium on automata, languages, and programming. Springer, pp 435\u2013446","DOI":"10.1007\/978-3-662-43951-7_37"},{"key":"875_CR22","doi-asserted-by":"crossref","unstructured":"Cooper C, Els\u00e4sser R., Radzik T, Rivera N, Shiraga T (2015) Fast consensus for voting on general expander graphs. In: International Symposium on Distributed Computing. Springer, pp 248\u2013262","DOI":"10.1007\/978-3-662-48653-5_17"},{"key":"875_CR23","first-page":"185","volume":"01","author":"J Theodore Cox","year":"2000","unstructured":"Theodore Cox J, Durrett R, Perkins Edwin A. (2000) Rescaled voter models converge to super-Brownian motion. Ann Probab., 28(1) 01:185\u2013234","journal-title":"Ann Probab., 28(1)"},{"issue":"4","key":"875_CR24","first-page":"876","volume":"11","author":"J Theodore Cox","year":"1983","unstructured":"Theodore Cox J, Griffeath D (1983) Occupation time limit theorems for the voter model. Ann Probab 11(4):876\u2013893","journal-title":"Ann Probab"},{"issue":"2","key":"875_CR25","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s11134-014-9397-7","volume":"78","author":"J Cruise","year":"2014","unstructured":"Cruise J, Ganesh A (2014) Probabilistic consensus via polling and majority rules. Queueing Syst Theory Appl 78(2):99\u2013120","journal-title":"Queueing Syst Theory Appl"},{"key":"875_CR26","unstructured":"Dembo A, Guionnet A, Zeitouni O (2001) Aging properties of Sinai\u2019s model of random walk in random environment. In: St. Flour Summer School 2001, Springer\u2019s lecture notes in mathematics, vol 1837"},{"key":"875_CR27","doi-asserted-by":"crossref","unstructured":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C (2011) Stabilizing consensus with the power of two choices. In: Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201911. Association for Computing Machinery, New York, pp 149\u2013158","DOI":"10.1145\/1989493.1989516"},{"key":"875_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: theory and examples. Cambridge Series in Statistical and Probabilistic Mathematics","author":"R Durrett","year":"2010","unstructured":"Durrett R (2010) Probability: theory and examples. Cambridge Series in Statistical and Probabilistic Mathematics, fourth. Cambridge University Press, Cambridge","edition":"fourth"},{"key":"875_CR29","unstructured":"Els\u00e4sser R., Friedetzky T, Kaaser D, Mallmann-Trenn F, Trinker H (2016) Rapid asynchronous plurality consensus. arXiv:1602.04667"},{"issue":"3","key":"875_CR30","doi-asserted-by":"publisher","first-page":"423","DOI":"10.24033\/bsmf.2580","volume":"137","author":"N Enriquez","year":"2009","unstructured":"Enriquez N, Sabot C, Zindy O (2009) Aging and quenched localization for one-dimensional random walks in random environment in the sub-ballistic regime. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 137(3):423\u2013452","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"issue":"11","key":"875_CR31","doi-asserted-by":"publisher","first-page":"5624","DOI":"10.1073\/pnas.1912980117","volume":"117","author":"G Fanti","year":"2020","unstructured":"Fanti G, Holden N, Peres Y, Ranade G (2020) Communication cost of consensus for nodes with limited memory. Proc Natl Acad Sci 117(11):5624\u20135630","journal-title":"Proc Natl Acad Sci"},{"key":"875_CR32","doi-asserted-by":"crossref","unstructured":"Feldman P, Micali S (1989) An optimal probabilistic algorithm for synchronous Byzantine agreement. In: International Colloquium on Automata, Languages, and Programming. Springer, pp 341\u2013378","DOI":"10.1007\/BFb0035770"},{"key":"875_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25847-3","volume-title":"Random perturbations of dynamical systems grundlehren der mathematischen wissenschaften","author":"MI Freidlin","year":"2012","unstructured":"Freidlin MI, Sz\u00fccs J., Wentzell AD (2012) Random perturbations of dynamical systems grundlehren der mathematischen wissenschaften. Springer, Berlin"},{"issue":"1","key":"875_CR34","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TDSC.2005.13","volume":"2","author":"R Friedman","year":"2005","unstructured":"Friedman R, Mostefaoui A, Raynal M (2005) Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems. IEEE Trans Dependable Secure Comput 2(1):46\u2013 56","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"875_CR35","unstructured":"G\u00e1cs P., Kurdyumov GL, Levin LA (1978) One-dimensional uniform arrays that wash out finite islands. In: Problemy Peredachi Informatsii"},{"key":"875_CR36","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner B., Zehmakan AN (2018) Majority model on random regular graphs. Lect Notes Comput Sci: 572\u2013583","DOI":"10.1007\/978-3-319-77404-6_42"},{"issue":"3","key":"875_CR37","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/2746347","volume":"10","author":"A Gogolev","year":"2015","unstructured":"Gogolev A, Marchenko N, Marcenaro L, Bettstetter C (2015) Distributed binary consensus in networks with disturbances. ACM Trans Auton Adapt Syst 10(3):19:1\u201319:17","journal-title":"ACM Trans Auton Adapt Syst"},{"key":"875_CR38","doi-asserted-by":"crossref","unstructured":"Gutierrez A, M\u00fcller S., \u0160ebek S (2021) On asymptotic fairness in voting consensus protocols","DOI":"10.1007\/978-3-030-80126-7_65"},{"issue":"4","key":"875_CR39","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1214\/aop\/1176996306","volume":"3","author":"RA Holley","year":"1975","unstructured":"Holley RA, Liggett TM (1975) Ergodic theorems for weakly interacting infinite systems and the voter model. The Annals of Probability 3(4):643\u2013663","journal-title":"The Annals of Probability"},{"issue":"4","key":"875_CR40","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.crhy.2019.05.002","volume":"20","author":"A Jedrzejewski","year":"2019","unstructured":"Jedrzejewski A, Sznajd-Weron K (2019) Statistical physics of opinion formation Is it a spoof? Comptes Rendus Physique 20(4):244\u2013261","journal-title":"Comptes Rendus Physique"},{"key":"875_CR41","doi-asserted-by":"crossref","unstructured":"Kar S, Moura JMF (2007) Distributed average consensus in sensor networks with random link failures. In: 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP \u201907, vol 2, pp II\u20131013\u2013II\u20131016","DOI":"10.1109\/ICASSP.2007.366410"},{"issue":"5","key":"875_CR42","first-page":"272","volume":"60","author":"J Keilson","year":"1980","unstructured":"Keilson J (1980) Markov chain models \u2013 rarity and exponentiality. Applied Mathematical Sciences 28. Berlin-Heidelberg-New York, Springer\u2013Verlag 1979. ZAMM - J Appl Math Mech \/ Zeitschrift f\u00fc,r Angewandte Mathematik und Mechanik 60(5):272\u2013272","journal-title":"ZAMM - J Appl Math Mech \/ Zeitschrift f\u00fc,r Angewandte Mathematik und Mechanik"},{"key":"875_CR43","doi-asserted-by":"crossref","unstructured":"Kurtz TG, Swanson J (2021) Finite Markov chains coupled to general Markov processes and an application to metastability I","DOI":"10.1007\/978-3-030-98519-6_12"},{"issue":"4","key":"875_CR44","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1504\/IJACT.2017.089354","volume":"3","author":"AK Lenstra","year":"2017","unstructured":"Lenstra AK, Wesolowski B (2017) Trustworthy public randomness with sloth, unicorn, and trx. International Journal of Applied Cryptography 3(4):330\u2013343","journal-title":"International Journal of Applied Cryptography"},{"key":"875_CR45","unstructured":"Thomas M (2012) Liggett. Interacting particle systems, vol 276. Springer Science & Business Media"},{"key":"875_CR46","doi-asserted-by":"crossref","unstructured":"Manzo F, Quattropani M, Scoppola E, Quattropani M, Scoppola E. (2021) A probabilistic proof of Cooper and Frieze\u2019s. \u201cFirst Visit Time Lemma\u201d","DOI":"10.30757\/ALEA.v18-64"},{"key":"875_CR47","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1007\/s10955-019-02233-3","volume":"174","author":"F Manzo","year":"2019","unstructured":"Manzo F, Scoppola E (2019) Exact results on the first hitting via conditional strong quasi-stationary times and applications to metastability. J Stat Phys 174:1239\u20131262","journal-title":"J Stat Phys"},{"key":"875_CR48","volume-title":"Non-homogeneous random walks \u2013 Lyapunov function methods for near-critical stochastic systems","author":"M Menshikov","year":"2017","unstructured":"Menshikov M, Popov S, Wade A (2017) Non-homogeneous random walks \u2013 Lyapunov function methods for near-critical stochastic systems. Cambridge University Press, Cambridge"},{"key":"875_CR49","doi-asserted-by":"publisher","first-page":"12085","DOI":"10.1073\/pnas.0400672101","volume":"101","author":"AA Moreira","year":"2004","unstructured":"Moreira AA, Mathur A, Diermeier D, Amaral LAN (2004) Efficient system-wide coordination in noisy environments. Proc Natl Acad Sci USA 101:12085\u201312090","journal-title":"Proc Natl Acad Sci USA"},{"issue":"3","key":"875_CR50","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/s10458-013-9230-4","volume":"28","author":"E Mossel","year":"2013","unstructured":"Mossel E, Neeman J, Tamuz O (2013) Majority dynamics and aggregation of information in social networks. Auton Agent Multi-Agent Syst 28(3):408\u2013429","journal-title":"Auton Agent Multi-Agent Syst"},{"key":"875_CR51","unstructured":"M\u00fcller S, Penzkofer A, Camargo D, Saa O On fairness in voting consensus protocols. Computing Conference 21, to appear"},{"key":"875_CR52","doi-asserted-by":"crossref","unstructured":"M\u00fcller S., Penzkofer A, Ku\u015bmierz B., Camargo D, weighted William J. Buchanan. Fast Probabilistic Consensus with weighted votes. FTC 2020. Advances in intelligent systems and computing, vol 1289, 2","DOI":"10.1007\/978-3-030-63089-8_24"},{"key":"875_CR53","unstructured":"Nakomoto S (2008) Bitcoin: A peer-to-peer electronic cash system. https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"875_CR54","unstructured":"NKN L. (2018) NKN: a scalable self-evolving and self-incentivized decentralized network"},{"issue":"1","key":"875_CR55","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.physa.2011.07.050","volume":"391","author":"P Nyczka","year":"2012","unstructured":"Nyczka P, Cis\u0142o J., Sznajd-Weron K (2012) Opinion dynamics as a movement in a bistable potential. Physica A: Stat Mech Appl 391(1):317\u2013327","journal-title":"Physica A: Stat Mech Appl"},{"key":"875_CR56","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543272","volume-title":"Large deviations and metastability: Encyclopedia of mathematics and its applications","author":"E Olivieri","year":"2005","unstructured":"Olivieri E, Vares ME (2005) Large deviations and metastability: Encyclopedia of mathematics and its applications. Cambridge University Press, Cambridge"},{"issue":"2","key":"875_CR57","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01019851","volume":"3","author":"O Penrose","year":"1971","unstructured":"Penrose O, Lebowitz JL (1971) Rigorous treatment of metastable states in the van der Waals-Maxwell theory. J Stat Phys 3(2):211\u2013236","journal-title":"J Stat Phys"},{"issue":"1","key":"875_CR58","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1515\/jmc-2016-0019","volume":"11","author":"S Popov","year":"2017","unstructured":"Popov S (2017) On a decentralized trustless pseudo-random number generation algorithm. J Math Crypt 11(1):37\u201343","journal-title":"J Math Crypt"},{"key":"875_CR59","volume-title":"Two-dimensional random walk \u2013 from path counting to random interlacements","author":"S Popov","year":"2021","unstructured":"Popov S (2021) Two-dimensional random walk \u2013 from path counting to random interlacements. Cambridge University Press, Cambridge"},{"key":"875_CR60","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jpdc.2020.09.002","volume":"147","author":"S Popov","year":"2021","unstructured":"Popov S, Buchanan WJ (2021) FPC-BI Fast probabilistic consensus within Byzantine infrastructures. J Parallel Distrib Comput 147:77\u201386","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"875_CR61","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1214\/aop\/1176993437","volume":"11","author":"E Presutti","year":"1983","unstructured":"Presutti E, Spohn H (1983) Hydrodynamics of the voter model. Ann Probab 11(4):867\u2013875","journal-title":"Ann Probab"},{"key":"875_CR62","doi-asserted-by":"crossref","unstructured":"Rabin MO (1983) Randomized Byzantine generals. In: 24th Annual symposium on foundations of computer science (sfcs 1983). IEEE, pp 403\u2013409","DOI":"10.1109\/SFCS.1983.48"},{"issue":"4","key":"875_CR63","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.crhy.2019.05.004","volume":"20","author":"S Redner","year":"2019","unstructured":"Redner S (2019) Reality-inspired voter models: a mini-review. Comptes Rendus Physique 20 (4):275\u2013292","journal-title":"Comptes Rendus Physique"},{"key":"875_CR64","unstructured":"Rocket T. (2018) Snowflake to avalanche: a novel metastable consensus protocol family for cryptocurrencies"},{"key":"875_CR65","unstructured":"Rocket T, Yin M, Sekniqi K, van Renesse R, Sirer EG (2019) Scalable and probabilistic leaderless BFT consensus through metastability"},{"key":"875_CR66","volume-title":"Introduction to probability models","author":"SM Ross","year":"2009","unstructured":"Ross SM (2009) Introduction to probability models, 10th edn. Academic Press, Cambridge","edition":"10th edn."},{"key":"875_CR67","unstructured":"Schindler P, Judmayer A, Stifter N, Weippl E (2018) Hydrand: Practical continuous distributed randomness. Cryptology ePrint Archive, Report 2018\/319. https:\/\/eprint.iacr.org\/2018\/319"},{"key":"875_CR68","first-page":"247","volume":"27","author":"YG Sinaj","year":"1982","unstructured":"Sinaj YG (1982) Limit behavior of the one-dimensional random walks in random environments. Teor Veroyatn Primen 27:247\u2013258","journal-title":"Teor Veroyatn Primen"},{"issue":"2","key":"875_CR69","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1006\/jfan.1999.3477","volume":"169","author":"RB Sowers","year":"1999","unstructured":"Sowers RB (1999) Hydrodynamical limits and geometric measure theory: Mean curvature limits from a threshold voter model. J Funct Anal 169(2):421\u2013455","journal-title":"J Funct Anal"},{"key":"875_CR70","doi-asserted-by":"crossref","unstructured":"Syta E, Jovanovic P, Kogias EK, Gailly N, Gasser L, Khoffi I, Fischer MJ, Ford B (2017) Scalable bias-resistant distributed randomness. In: 2017 IEEE Symposium on Security and Privacy (SP). IEEE, pp 444\u2013460","DOI":"10.1109\/SP.2017.45"},{"issue":"1","key":"875_CR71","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0921-8890(96)00030-9","volume":"19","author":"M Tanaka-Yamawaki","year":"1996","unstructured":"Tanaka-Yamawaki M, Kitamikado S, Fukuda T (1996) Consensus formation and the cellular automata. Robot Auton Syst 19(1):15\u201322","journal-title":"Robot Auton Syst"},{"key":"875_CR72","unstructured":"Tran LV, Vu V (2020) Reaching a consensus on random networks: the power of few. In: Byrka J, Meka R (eds) Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX\/RANDOM 2020, August 17-19, 2020, Virtual Conference, volume 176 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp 20:1\u201320:15"},{"key":"875_CR73","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/s00145-020-09364-x","volume":"33","author":"B Wesolowski","year":"2020","unstructured":"Wesolowski B (2020) Efficient verifiable delay functions. J Cryptol 33:2113\u20132147","journal-title":"J Cryptol"},{"key":"875_CR74","volume-title":"Cellular automata and complexity: collected papers","author":"S Wolfram","year":"1994","unstructured":"Wolfram S (1994) Cellular automata and complexity: collected papers. Westview Press, Boulder"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-021-00875-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12243-021-00875-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-021-00875-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T18:50:18Z","timestamp":1675795818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12243-021-00875-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,7]]},"references-count":74,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["875"],"URL":"https:\/\/doi.org\/10.1007\/s12243-021-00875-7","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,7]]},"assertion":[{"value":"10 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}