{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:46:05Z","timestamp":1767339965655},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030365912"},{"type":"electronic","value":"9783030365929"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36592-9_59","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T06:02:43Z","timestamp":1575871363000},"page":"725-734","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Start-up and the Results of the Volunteer Computing Project RakeSearch"],"prefix":"10.1007","author":[{"given":"Maxim","family":"Manzyuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia","family":"Nikitina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduard","family":"Vatutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"59_CR1","volume-title":"Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications). Chapman & Hall\/CRC, Boca Raton (2006)"},{"issue":"1","key":"59_CR2","first-page":"170","volume":"8","author":"NS Bolshakova","year":"2005","unstructured":"Bolshakova, N.S.: About one another application of Latin squares. Vestnik of MSTU 8(1), 170\u2013173 (2005). (in Russian)","journal-title":"Vestnik of MSTU"},{"issue":"3\u20134","key":"59_CR3","first-page":"501","volume":"1","author":"PR Thomas","year":"2007","unstructured":"Thomas, P.R., Morgan, J.P.: Modern experimental design. Stat. Theory Pract. 1(3\u20134), 501\u2013506 (2007)","journal-title":"Stat. Theory Pract."},{"key":"59_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198500292.001.0001","volume-title":"Combinatorial Designs and Tournaments","author":"I Anderson","year":"1997","unstructured":"Anderson, I.: Combinatorial Designs and Tournaments, vol. 6. Oxford University Press, Oxford (1997)"},{"key":"59_CR5","first-page":"33","volume":"12","author":"J Cooper","year":"1994","unstructured":"Cooper, J., Donovan, D., Seberry, J.: Secret sharing schemes arising from Latin squares. Bull. Inst. Comb. Appl. 12, 33\u201343 (1994)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"59_CR6","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland Publishing Co., Amsterdam (1977)"},{"key":"59_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.endm.2016.09.053","volume":"54","author":"O Zaikin","year":"2016","unstructured":"Zaikin, O., Zhuravlev, A., Kochemazov, S., Vatutin, E.: On the construction of triples of diagonal Latin squares of order 10. Electron. Notes Discrete Math. 54, 307\u2013312 (2016)","journal-title":"Electron. Notes Discrete Math."},{"key":"59_CR8","unstructured":"Afanasiev, A.P., Bychkov, I.V., Manzyuk, M.O., Posypkin, M.A., Semenov, A.A., Zaikin, O.S.: Technology for integrating idle computing cluster resources into volunteer computing projects. In: Proceedings of the 5th International Workshop on Computer Science and Engineering, Moscow, Russia, pp. 109\u2013114 (2015)"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"Anderson, D.P.: BOINC: a platform for volunteer computing. J Grid Computing (2019)","DOI":"10.1007\/s10723-019-09497-9"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Parker, E.T.: Computer investigation of orthogonal Latin squares of order ten. In: Proceeding of Symposia in Applied Mathematics, vol. 15, pp. 73\u201381 (1963)","DOI":"10.1090\/psapm\/015\/0180910"},{"issue":"3","key":"59_CR11","first-page":"1","volume":"2","author":"BD McKay","year":"1995","unstructured":"McKay, B.D., Rogoyski, E.: Latin squares of order 10. Electron. J. Comb. 2(3), 1\u20134 (1995)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"59_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00026-005-0261-7","volume":"9","author":"BD McKay","year":"2005","unstructured":"McKay, B.D., Wanless, I.M.: On the number of Latin squares. Ann. Comb. 9(3), 335\u2013344 (2005)","journal-title":"Ann. Comb."},{"issue":"2","key":"59_CR13","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/jcd.20105","volume":"15","author":"BD McKay","year":"2007","unstructured":"McKay, B.D., Meynert, A., Myrvold, W.: Small Latin squares, quasigroups, and loops. J. Comb. Des. 15(2), 98\u2013119 (2007)","journal-title":"J. Comb. Des."},{"issue":"298","key":"59_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1090\/mcom\/3010","volume":"85","author":"J Egan","year":"2016","unstructured":"Egan, J., Wanless, I.: Enumeration of MOLS of small order. Math. Comput. 85(298), 799\u2013824 (2016)","journal-title":"Math. Comput."},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Lin, H.-H., Wu, I-C.: Solving the minimum sudoku poblem. In: 2010 International Conference on Technologies and Applications of Artificial Intelligence, pp. 456\u2013461. IEEE (2010)","DOI":"10.1109\/TAAI.2010.77"},{"issue":"1","key":"59_CR16","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1515\/eng-2017-0052","volume":"7","author":"EI Vatutin","year":"2017","unstructured":"Vatutin, E.I., Zaikin, O.S., Kochemazov, S.E., Valyaev, S.Y.: Using volunteer computing to study some features of diagonal Latin squares. Open Eng. 7(1), 453\u2013460 (2017)","journal-title":"Open Eng."},{"key":"59_CR17","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-67035-5_9","volume-title":"Parallel Computational Technologies","author":"EI Vatutin","year":"2017","unstructured":"Vatutin, E.I., Kochemazov, S.E., Zaikin, O.S.: Applying volunteer and parallel computing for enumerating diagonal Latin squares of order 9. In: Sokolinsky, L., Zymbler, M. (eds.) PCT 2017. CCIS, vol. 753, pp. 114\u2013129. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67035-5_9"},{"key":"59_CR18","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-030-05807-4_49","volume-title":"Supercomputing","author":"E Vatutin","year":"2019","unstructured":"Vatutin, E., Belyshev, A., Kochemazov, S., Zaikin, O., Nikitina, N.: Enumeration of isotopy classes of diagonal Latin squares of small order using volunteer computing. In: Voevodin, V., Sobolev, S. (eds.) RuSCDays 2018. CCIS, vol. 965, pp. 578\u2013586. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05807-4_49"},{"issue":"11","key":"59_CR19","first-page":"4","volume":"3","author":"O Zaikin","year":"2015","unstructured":"Zaikin, O., Kochemazov, S.: The search for systems of diagonal Latin squares using the SAT@home project. Int. J. Open Inf. Technol. 3(11), 4\u20139 (2015)","journal-title":"Int. J. Open Inf. Technol."},{"key":"59_CR20","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1515\/eng-2017-0052","volume":"7","author":"E Vatutin","year":"2017","unstructured":"Vatutin, E., Zaikin, O., Kochemazov, S., Valyaev, S.: Using volunteer computing to study some features of diagonal Latin square. Open Eng. 7, 453\u2013460 (2017)","journal-title":"Open Eng."},{"key":"59_CR21","unstructured":"RakeSearch. https:\/\/rake.boincfast.ru\/rakesearch . Accessed 23 June 2019"},{"key":"59_CR22","unstructured":"Center for Collective Use of Karelian Research Center of the Russian Academy of Sciences. http:\/\/cluster.krc.karelia.ru\/index.php?plang=e . Accessed 23 June 2019"},{"key":"59_CR23","unstructured":"Nikitina, N.N., Manzyuk, M.O., Vatutin, E.I.: Employment of distributed computing to search and explore orthogonal diagonal Latin squares of rank 9. In: Proceedings of the XI(1) All-Russian Research and Practice Conference on Digital Technologies in Education, Science, Society, pp. 97\u2013100, November 2017. (in Russian)"},{"issue":"1","key":"59_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0012-365X(75)90108-9","volume":"11","author":"SE Bammel","year":"1975","unstructured":"Bammel, S.E., Rothstein, J.: The number of $$9\\times 9$$ Latin squares. Discrete Math. 11(1), 93\u201395 (1975)","journal-title":"Discrete Math."},{"key":"59_CR25","unstructured":"GitHub - Nevecie\/RakeSearch: Rake search of Diagonal Latin Squares. https:\/\/github.com\/Nevecie\/RakeSearch . Accessed 23 June 2019"},{"key":"59_CR26","unstructured":"Formula BOINC. http:\/\/formula-boinc.org\/ . Accessed 23 June 2019"},{"key":"59_CR27","first-page":"74","volume":"8","author":"EI Vatutin","year":"2018","unstructured":"Vatutin, E.I., Kochemazov, S.E., Zaikin, O.S., Manzuk, M.O., Nikitina, N.N., Titov, V.S.: Properties of central symmetry for diagonal Latin squares (in Russian). High-Perform. Comput. Syst. Technol. 8, 74\u201378 (2018)","journal-title":"High-Perform. Comput. Syst. Technol."},{"key":"59_CR28","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: International AAAI Conference on Weblogs and Social Media, pp. 1\u20132 (2009)","DOI":"10.1609\/icwsm.v3i1.13937"}],"container-title":["Communications in Computer and Information Science","Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36592-9_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T08:27:38Z","timestamp":1722155258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36592-9_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030365912","9783030365929"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36592-9_59","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuSCDays","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russian Supercomputing Days","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ruscdays2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/russianscdays.org\/en\/node\/1","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"127","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}