{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:42:57Z","timestamp":1743050577969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_5","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"78-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Real $$\\tau $$-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization"],"prefix":"10.1007","author":[{"given":"Pranjal","family":"Dutta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"17","key":"5_CR1","doi-asserted-by":"publisher","first-page":"8107","DOI":"10.1073\/pnas.1901272116","volume":"116","author":"M Agrawal","year":"2019","unstructured":"Agrawal, M., Ghosh, S., Saxena, N.: Bootstrapping variables in algebraic circuits. Proc. Natl. Acad. Sci. 116(17), 8107\u20138118 (2019). https:\/\/doi.org\/10.1073\/pnas.1901272116. Earlier in Symposium on Theory of Computing, 2018 (STOC 2018)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Vinay, V.: Arithmetic circuits: a chasm at depth four. In: Foundations of Computer Science. In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 67\u201375. IEEE (2008)","DOI":"10.1109\/FOCS.2008.32"},{"issue":"1\u20132","key":"5_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)00227-2","volume":"209","author":"E Allender","year":"1998","unstructured":"Allender, E., Jiao, J., Mahajan, M., Vinay, V.: Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theor. Comput. Sci. 209(1\u20132), 47\u201386 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00227-2","journal-title":"Theor. Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Alman, J., Chen, L.: Efficient construction of rigid matrices using an NP oracle. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1034\u20131055. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00067"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0022-0000(05)80027-3","volume":"48","author":"N Alon","year":"1994","unstructured":"Alon, N., Pudlak, P.: Superconcentrators of depths 2 and 3; odd levels help (rarely). J. Comput. Syst. Sci. 48(1), 194\u2013202 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Algebraic settings for the problem \u201cP$$\\ne $$ NP\u201d. In: The Collected Papers of Stephen Smale, vol. 3, pp. 1540\u20131559. World Scientific (2000)","DOI":"10.1142\/9789812792839_0025"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. New Ser. Am. Math. Soc. 21(1), 1\u201346 (1989)","journal-title":"Bull. New Ser. Am. Math. Soc."},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.20926","volume":"57","author":"I Briquel","year":"2020","unstructured":"Briquel, I., B\u00fcrgisser, P.: The real tau-conjecture is true on average. Random Struct. Algorithms 57(2), 279\u2013303 (2020)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00037-009-0260-x","volume":"18","author":"P B\u00fcrgisser","year":"2009","unstructured":"B\u00fcrgisser, P.: On defining integers and proving arithmetic circuit lower bounds. Comput. Complex. 18(1), 81\u2013103 (2009)","journal-title":"Comput. Complex."},{"key":"5_CR10","series-title":"Algorithms and computation in mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04179-6","volume-title":"Completeness and Reduction in Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"2013","unstructured":"B\u00fcrgisser, P.: Completeness and Reduction in Algebraic Complexity Theory. Algorithms and computation in mathematics. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-04179-6"},{"key":"5_CR11","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-38896-5","volume-title":"Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"2013","unstructured":"B\u00fcrgisser, P., Clausen, M.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften. Springer, Berlin, Heidelberg (2013)"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"RA Demillo","year":"1978","unstructured":"Demillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Proc. Lett. 7(4), 193\u2013195 (1978)","journal-title":"Inf. Proc. Lett."},{"key":"5_CR13","unstructured":"Dutta, P., Saxena, N., Thierauf, T.: A largish sum-of-squares implies circuit hardness and derandomization. In: 12th Innovations in Theoretical Computer Science (ITCS) (2021)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Golovnev, A., Weinstein, O.: Static data structure lower bounds imply rigidity. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 967\u2013978 (2019)","DOI":"10.1145\/3313276.3316348"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01303207","volume":"13","author":"J Friedman","year":"1993","unstructured":"Friedman, J.: A note on matrix rigidity. Combinatorica 13(2), 235\u2013239 (1993)","journal-title":"Combinatorica"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-662-48054-0_30","volume-title":"Mathematical Foundations of Computer Science 2015","author":"I Garcia-Marco","year":"2015","unstructured":"Garcia-Marco, I., Koiran, P., Tavenas, S.: Log-concavity and lower bounds for arithmetic circuits. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 361\u2013371. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_30"},{"key":"5_CR17","unstructured":"Grigoriev, D.Y.: Using the notions of seperability and independence for proving the lower bounds on the circuit complexity. notes of the leningrad branch of the steklov mathematical institute (1976)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00037-015-0103-x","volume":"24","author":"JA Grochow","year":"2015","unstructured":"Grochow, J.A.: Unifying known lower bounds via geometric complexity theory. Comput. Complex. 24(2), 393\u2013475 (2015)","journal-title":"Comput. Complex."},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Guo, Z., Kumar, M., Saptharishi, R., Solomon, N.: Derandomization from algebraic hardness: treading the borders. In: 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pp. 147\u2013157 (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00018 online version: https:\/\/mrinalkr. bitbucket. io\/papers\/newprg. pdf","DOI":"10.1109\/FOCS.2019.00018"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kamath, P., Kayal, N., Saptharishi, R.: Arithmetic circuits: A chasm at depth three. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 578\u2013587. IEEE (2013)","DOI":"10.1109\/FOCS.2013.68"},{"issue":"1","key":"5_CR21","first-page":"403","volume":"9","author":"P Hrubes","year":"2013","unstructured":"Hrubes, P.: On the Real $$\\tau $$-Conjecture and the Distribution of Complex Roots. Theor. Comput. 9(1), 403\u2013411 (2013)","journal-title":"Theor. Comput."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"103137","DOI":"10.1016\/j.ejc.2020.103137","volume":"89","author":"P Hrubes","year":"2020","unstructured":"Hrubes, P.: On the distribution of runners on a circle. Eur. J. Comb. 89, 103137 (2020). https:\/\/doi.org\/10.1016\/j.ejc.2020.103137","journal-title":"Eur. J. Comb."},{"issue":"1\u20132","key":"5_CR23","first-page":"1","volume":"13","author":"V Kabanets","year":"2004","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Computat. Complex. 13(1\u20132), 1\u201346 (2004)","journal-title":"Computat. Complex."},{"key":"5_CR24","unstructured":"Koiran, P.: Shallow circuits with high-powered inputs. In: Innovations in Computer Science - ICS (2011)"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2012.03.041","volume":"448","author":"P Koiran","year":"2012","unstructured":"Koiran, P.: Arithmetic circuits: The chasm at depth four gets wider. Theor. Comput. Sci. 448, 56\u201365 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10208-014-9216-x","volume":"15","author":"P Koiran","year":"2015","unstructured":"Koiran, P., Portier, N., Tavenas, S., Thomass\u00e9, S.: A $$\\tau $$-Conjecture for newton polygons. Found. Comput. Math. 15(1), 185\u2013197 (2015)","journal-title":"Found. Comput. Math."},{"key":"5_CR27","unstructured":"Kumar, M., Volk, B.L.: Lower Bounds for Matrix Factorization. In: Proceedings of the 35th Computational Complexity Conference (CCC) (2020)"},{"issue":"3","key":"5_CR28","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1080\/00029890.1992.11995845","volume":"99","author":"DC Kurtz","year":"1992","unstructured":"Kurtz, D.C.: A sufficient condition for all the roots of a polynomial to be real. Am. Math. Mon. 99(3), 259\u2013263 (1992)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"5_CR29","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/070693709","volume":"49","author":"JB Lasserre","year":"2007","unstructured":"Lasserre, J.B.: A sum of squares approximation of nonnegative polynomials. SIAM Rev. 49(4), 651\u2013669 (2007)","journal-title":"SIAM Rev."},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, New York, NY (2009). https:\/\/doi.org\/10.1007\/978-0-387-09686-5_7"},{"key":"5_CR31","series-title":"Progress in Computer Science and Applied Logic","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-05446-9_4","volume-title":"Perspectives in Computational Complexity","author":"M Mahajan","year":"2014","unstructured":"Mahajan, M.: Algebraic complexity classes. In: Agrawal, M., Arvind, V. (eds.) Perspectives in Computational Complexity. PCSAL, vol. 26, pp. 51\u201375. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05446-9_4"},{"issue":"1","key":"5_CR32","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1090\/jams\/864","volume":"30","author":"K Mulmuley","year":"2017","unstructured":"Mulmuley, K.: Geometric complexity theory V: efficient algorithms for noether normalization. J. Am. Math. Soc. 30(1), 225\u2013309 (2017)","journal-title":"J. Am. Math. Soc."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Mulmuley, K.D.: Geometric complexity theory V: equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether\u2019s normalization lemma. In: FOCS, pp. 629\u2013638 (2012)","DOI":"10.1109\/FOCS.2012.15"},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"5_CR35","first-page":"15","volume":"1","author":"O Ore","year":"1922","unstructured":"Ore, O.: \u00dcber h\u00f6here kongruenzen. Nor. Mat. Foren. Skr. 1(7), 15 (1922)","journal-title":"Nor. Mat. Foren. Skr."},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Pfister, A.: Hilbert\u2019s seventeenth problem and related problems on definite forms. In: Mathematical Developments Arising from Hilbert Problems, Proc. Sympos. Pure Math, vol. 28, pp. 483\u2013489 (1976)","DOI":"10.1090\/pspum\/028.2\/9905"},{"issue":"2","key":"5_CR37","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0206022","volume":"6","author":"N Pippenger","year":"1977","unstructured":"Pippenger, N.: Superconcentrators. SIAM J. Comput. 6(2), 298\u2013304 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR38","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01215351","volume":"14","author":"P Pudlak","year":"1994","unstructured":"Pudlak, P.: Communication in bounded depth circuits. Combinatorica 14(2), 203\u2013216 (1994)","journal-title":"Combinatorica"},{"issue":"1","key":"5_CR39","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math. 13(1), 2\u201324 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR40","first-page":"11","volume":"19","author":"S Ramanujan","year":"1917","unstructured":"Ramanujan, S.: On the expression of a number in the form ax$$\\hat{\\,\\,}$$ 2+ by$$\\hat{\\,\\,}$$ 2+ cz$$\\hat{\\,\\,}$$ 2+ du$$\\hat{\\,\\,}$$ 2. Proc. Camb. Philos. Soc. 19, 11\u201321 (1917)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"5_CR41","unstructured":"Ramya, C.: Recent progress on matrix rigidity\u2013a survey. arXiv preprint arXiv:2009.09460 (2020)"},{"issue":"1","key":"5_CR42","doi-asserted-by":"publisher","first-page":"135","DOI":"10.4086\/toc.2010.v006a007","volume":"6","author":"R Raz","year":"2010","unstructured":"Raz, R.: Elusive functions and lower bounds for arithmetic circuits. Theor. Comput. 6(1), 135\u2013177 (2010). https:\/\/doi.org\/10.4086\/toc.2010.v006a007","journal-title":"Theor. Comput."},{"issue":"2","key":"5_CR43","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1215\/S0012-7094-78-04519-2","volume":"45","author":"B Reznick","year":"1978","unstructured":"Reznick, B.: Extremal PSD forms with few terms. Duke Math. J. 45(2), 363\u2013374 (1978)","journal-title":"Duke Math. J."},{"key":"5_CR44","unstructured":"Saptharishi, R.: A survey of lower bounds in arithmetic circuit complexity. Github survey (2019)"},{"issue":"4","key":"5_CR45","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"issue":"6","key":"5_CR46","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(97)00190-7","volume":"64","author":"MA Shokrollahi","year":"1997","unstructured":"Shokrollahi, M.A., Spielman, D.A., Stemann, V.: A remark on matrix rigidity. Inf. Proc. Lett. 64(6), 283\u2013285 (1997)","journal-title":"Inf. Proc. Lett."},{"issue":"3\u20134","key":"5_CR47","first-page":"207","volume":"5","author":"A Shpilka","year":"2010","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: a survey of recent results and open questions. Found. Theor. Comput. Sci. 5(3\u20134), 207\u2013388 (2010)","journal-title":"Found. Theor. Comput. Sci."},{"issue":"1","key":"5_CR48","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1215\/S0012-7094-95-08105-8","volume":"81","author":"M Shub","year":"1995","unstructured":"Shub, M., Smale, S.: On the intractability of Hilbert\u2019s Nullstellensatz and an algebraic version of \u201cNP$$\\ne $$ P?\u201d. Duke Math. J. 81(1), 47\u201354 (1995)","journal-title":"Duke Math. J."},{"issue":"2","key":"5_CR49","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF03025291","volume":"20","author":"S Smale","year":"1998","unstructured":"Smale, S.: Mathematical problems for the next century. Math. Intell. 20(2), 7\u201315 (1998)","journal-title":"Math. Intell."},{"key":"5_CR50","unstructured":"Tavenas, S.: Bornes inferieures et superieures dans les circuits arithmetiques. Ph.D. Thesis (2014)"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: On non-linear lower bounds in computational complexity. In: Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, pp. 45\u201353 (1975)","DOI":"10.1145\/800116.803752"},{"key":"5_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-08353-7_135","volume-title":"Mathematical Foundations of Computer Science 1977","author":"LG Valiant","year":"1977","unstructured":"Valiant, L.G.: Graph-theoretic arguments in low-level complexity. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, pp. 162\u2013176. Springer, Heidelberg (1977). https:\/\/doi.org\/10.1007\/3-540-08353-7_135"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the 11th Annual ACM symposium on Theory of computing, pp. 249\u2013261. ACM (1979)","DOI":"10.1145\/800135.804419"},{"issue":"4","key":"5_CR54","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/0212043","volume":"12","author":"LG Valiant","year":"1983","unstructured":"Valiant, L.G., Skyum, S., Berkowitz, S., Rackoff, C.: Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12(4), 641\u2013644 (1983). https:\/\/doi.org\/10.1137\/0212043","journal-title":"SIAM J. Comput."},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, pp. 216\u2013226. EUROSAM 1979 (1979)","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:20:27Z","timestamp":1623972027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"41% - 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.1","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":"9.2","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)"}}]}}