{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:30Z","timestamp":1750306110796,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":106,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["257575"],"award-info":[{"award-number":["257575"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1617580"],"award-info":[{"award-number":["CCF-1617580"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055496","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"653-664","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Succinct hitting sets and barriers to proving algebraic circuits lower bounds"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Forbes","sequence":"first","affiliation":[{"name":"Simons Institute for the Theory of Computing Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben Lee","family":"Volk","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Scott Aaronson. 2016.  Scott Aaronson. 2016."},{"volume-title":"Open Problems in Mathematics","author":"P","key":"e_1_3_2_2_2_1"},{"key":"e_1_3_2_2_3_1","unstructured":"Scott Aaronson and Andrew Drucker. 2008. Arithmetic natural proofs theory is sought. (2008). http:\/\/www.scottaaronson.com\/blog\/?p=336 Blog post http: \/\/www.scottaaronson.com\/blog\/?p=336.  Scott Aaronson and Andrew Drucker. 2008. Arithmetic natural proofs theory is sought. (2008). http:\/\/www.scottaaronson.com\/blog\/?p=336 Blog post http: \/\/www.scottaaronson.com\/blog\/?p=336."},{"key":"e_1_3_2_2_4_1","unstructured":"Scott Aaronson and Avi Wigderson. 2009.  Scott Aaronson and Avi Wigderson. 2009."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Algebrization: A New Barrier in Complexity Theory. TOCT 1 1 (2009) 2:1\u20132:54. DOI:http:\/\/dx.  Algebrization: A New Barrier in Complexity Theory. TOCT 1 1 (2009) 2:1\u20132:54. DOI:http:\/\/dx.","DOI":"10.1145\/1490270.1490272"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_6"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/140975103"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.32"},{"key":"e_1_3_2_2_9_1","unstructured":"Mikl\u00f3s Ajtai. 1983.  Mikl\u00f3s Ajtai. 1983."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"\u03a3 1 1 -formulae on finite structures. Annals of pure and applied logic 24 1 (1983) 1\u201348. DOI:http:\/\/dx.  \u03a3 1 1 -formulae on finite structures. Annals of pure and applied logic 24 1 (1983) 1\u201348. DOI:http:\/\/dx.","DOI":"10.1016\/0168-0072(83)90038-6"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00227-2"},{"key":"e_1_3_2_2_12_1","unstructured":"Noga Alon and Ravi B. Boppana. 1987.  Noga Alon and Ravi B. Boppana. 1987."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579196"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90110-X"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90018-8"},{"volume-title":"Perspectives in Computational Complexity","author":"Bl\u00e4ser Markus","key":"e_1_3_2_2_17_1"},{"key":"e_1_3_2_2_18_1","unstructured":"Peter B\u00fcrgisser Michael Clausen and Mohammad A. Shokrollahi. 1997.  Peter B\u00fcrgisser Michael Clausen and Mohammad A. Shokrollahi. 1997."},{"key":"e_1_3_2_2_19_1","unstructured":"Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften Vol. 315. Springer-Verlag. DOI:http:\/\/dx.  Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften Vol. 315. Springer-Verlag. DOI:http:\/\/dx."},{"key":"e_1_3_2_2_20_1","unstructured":"Suryajith Chillara Mrinal Kumar Ramprasad Saptharishi and V. Vinay. 2016.  Suryajith Chillara Mrinal Kumar Ramprasad Saptharishi and V. Vinay. 2016."},{"key":"e_1_3_2_2_21_1","unstructured":"The Chasm at Depth Four and Tensor Rank : Old results new insights. Electronic Colloquium on Computational Complexity (ECCC) 23 (2016) 96. http:\/\/eccc. hpiweb.de\/report\/2016\/096  The Chasm at Depth Four and Tensor Rank : Old results new insights. Electronic Colloquium on Computational Complexity (ECCC) 23 (2016) 96. http:\/\/eccc. hpiweb.de\/report\/2016\/096"},{"key":"e_1_3_2_2_22_1","unstructured":"Richard A. DeMillo and Richard J. Lipton. 1978.  Richard A. DeMillo and Richard J. Lipton. 1978."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"A Probabilistic Remark on Algebraic Program Testing. Inform. Process. Lett. 7 4 (1978) 193\u2013195. DOI: http:\/\/dx.  A Probabilistic Remark on Algebraic Program Testing. Inform. Process. Lett. 7 4 (1978) 193\u2013195. DOI: http:\/\/dx.","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1957995.1957999"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897564"},{"key":"e_1_3_2_2_26_1","unstructured":"Michael A. Forbes and Venkatesan Guruswami. 2015.  Michael A. Forbes and Venkatesan Guruswami. 2015."},{"volume":"40","volume-title":"Rank Condensers. In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM 2015)","author":"Dimension Expanders","key":"e_1_3_2_2_27_1"},{"key":"e_1_3_2_2_28_1","unstructured":"Michael A. Forbes Ramprasad Saptharishi and Amir Shpilka. 2014.  Michael A. Forbes Ramprasad Saptharishi and Amir Shpilka. 2014."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591816"},{"key":"e_1_3_2_2_30_1","unstructured":"Michael A. Forbes and Amir Shpilka. 2012.  Michael A. Forbes and Amir Shpilka. 2012."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213995"},{"key":"e_1_3_2_2_32_1","unstructured":"Michael A. Forbes and Amir Shpilka. 2013.  Michael A. Forbes and Amir Shpilka. 2013."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.34"},{"key":"e_1_3_2_2_34_1","first-page":"7","article-title":"Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds","volume":"24","author":"Forbes Michael A.","year":"2017","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_2_35_1","unstructured":"Herv\u00e9 Fournier Nutan Limaye Guillaume Malod and Srikanth Srinivasan. 2014.  Herv\u00e9 Fournier Nutan Limaye Guillaume Malod and Srikanth Srinivasan. 2014."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591824"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-008-2259-3"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_2_40_1","unstructured":"Joshua A. Grochow. 2015.  Joshua A. Grochow. 2015."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-015-0103-x"},{"key":"e_1_3_2_2_42_1","unstructured":"Joshua A. Grochow Mrinal Kumar Michael Saks and Shubhangi Saraf. 2017.  Joshua A. Grochow Mrinal Kumar Michael Saks and Shubhangi Saraf. 2017."},{"key":"e_1_3_2_2_43_1","unstructured":"Towards an algebraic natural proofs barrier via polynomial identity testing. CoRR abs\/1701.01717 (2017). https:\/\/arxiv.org\/abs\/1701.01717  Towards an algebraic natural proofs barrier via polynomial identity testing. CoRR abs\/1701.01717 (2017). https:\/\/arxiv.org\/abs\/1701.01717"},{"key":"e_1_3_2_2_44_1","unstructured":"Joshua A. Grochow Ketan D. Mulmuley and Youming Qiao. 2016.  Joshua A. Grochow Ketan D. Mulmuley and Youming Qiao. 2016."},{"volume":"55","volume-title":"VP and VNP. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016)","author":"Boundaries","key":"e_1_3_2_2_45_1"},{"key":"e_1_3_2_2_46_1","unstructured":"Ankit Gupta Pritish Kamath Neeraj Kayal and Ramprasad Saptharishi. 2014.  Ankit Gupta Pritish Kamath Neeraj Kayal and Ramprasad Saptharishi. 2014."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629541"},{"key":"e_1_3_2_2_48_1","unstructured":"Ankit Gupta Pritish Kamath Neeraj Kayal and Ramprasad Saptharishi. 2016.  Ankit Gupta Pritish Kamath Neeraj Kayal and Ramprasad Saptharishi. 2016."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Arithmetic Circuits: A Chasm at Depth 3. SIAM J. Comput. 45 3 (2016) 1064\u20131079. DOI:http:\/\/dx.  Arithmetic Circuits: A Chasm at Depth 3. SIAM J. Comput. 45 3 (2016) 1064\u20131079. DOI:http:\/\/dx.","DOI":"10.1137\/140957123"},{"key":"e_1_3_2_2_50_1","first-page":"182","article-title":"Linear Matroid Intersection is in quasi-NC","volume":"23","author":"Gurjar Rohit","year":"2016","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"volume-title":"Randomness and Computation","author":"H\u00e5stad Johan","key":"e_1_3_2_2_52_1"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_2_54_1","unstructured":"Joos Heintz and Claus-Peter Schnorr. 1980.  Joos Heintz and Claus-Peter Schnorr. 1980."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804674"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0182-6"},{"key":"e_1_3_2_2_57_1","unstructured":"Neeraj Kayal. 2012.  Neeraj Kayal. 2012."},{"key":"e_1_3_2_2_58_1","unstructured":"An exponential lower bound for the sum of powers of bounded degree polynomials. In Electronic Colloquium on Computational Complexity (ECCC)TR12-081. http:\/\/eccc.hpi-web.de\/report\/2012\/081  An exponential lower bound for the sum of powers of bounded degree polynomials. In Electronic Colloquium on Computational Complexity (ECCC)TR12-081. http:\/\/eccc.hpi-web.de\/report\/2012\/081"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.15"},{"key":"e_1_3_2_2_60_1","unstructured":"Neeraj Kayal Chandan Saha and Ramprasad Saptharishi. 2014.  Neeraj Kayal Chandan Saha and Ramprasad Saptharishi. 2014."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591847"},{"key":"e_1_3_2_2_62_1","unstructured":"Adam Klivans and Daniel A. Spielman. 2001.  Adam Klivans and Daniel A. Spielman. 2001."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380801"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.041"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370100002"},{"key":"e_1_3_2_2_66_1","unstructured":"Mrinal Kumar and Shubhangi Saraf. 2014.  Mrinal Kumar and Shubhangi Saraf. 2014."},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.46"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_2_69_1","unstructured":"Meena Mahajan and V. Vinay. 1997.  Meena Mahajan and V. Vinay. 1997."},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970038715X"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796378"},{"key":"e_1_3_2_2_72_1","unstructured":"Noam Nisan and Avi Wigderson. 1997.  Noam Nisan and Avi Wigderson. 1997."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294256"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a006"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502797"},{"key":"e_1_3_2_2_76_1","unstructured":"Ran Raz. 2010.  Ran Raz. 2010."},{"key":"e_1_3_2_2_77_1","unstructured":"Elusive Functions and Lower Bounds for Arithmetic Circuits. Theory of Computing 6 1 (2010) 135\u2013177. DOI:http:\/\/dx.  Elusive Functions and Lower Bounds for Arithmetic Circuits. Theory of Computing 6 1 (2010) 135\u2013177. DOI:http:\/\/dx."},{"key":"e_1_3_2_2_78_1","unstructured":"v006a007  v006a007"},{"key":"e_1_3_2_2_79_1","unstructured":"Ran Raz and Amir Yehudayoff. 2008.  Ran Raz and Amir Yehudayoff. 2008."},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0254-0"},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0270-8"},{"key":"e_1_3_2_2_82_1","unstructured":"Alexander A Razborov. 1985.  Alexander A Razborov. 1985."},{"key":"e_1_3_2_2_83_1","unstructured":"Alexander A. Razborov. 1987.  Alexander A. Razborov. 1987."},{"key":"e_1_3_2_2_84_1","doi-asserted-by":"crossref","unstructured":"Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathematical notes of the Academy of Sciences of the USSR 41 4 (1987) 333\u2013338. DOI:http:\/\/dx.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathematical notes of the Academy of Sciences of the USSR 41 4 (1987) 333\u2013338. DOI:http:\/\/dx.","DOI":"10.1007\/BF01137685"},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"e_1_3_2_2_86_1","unstructured":"Ramprasad Saptharishi. 2016. A survey of lower bounds in arithmetic circuit complexity. (2016). https:\/\/github.com\/dasarpmar\/lowerboundssurvey\/releases\/ Github survey https:\/\/github.com\/dasarpmar\/lowerboundssurvey\/.  Ramprasad Saptharishi. 2016. A survey of lower bounds in arithmetic circuit complexity. (2016). https:\/\/github.com\/dasarpmar\/lowerboundssurvey\/releases\/ Github survey https:\/\/github.com\/dasarpmar\/lowerboundssurvey\/."},{"key":"e_1_3_2_2_87_1","unstructured":"Nitin Saxena. 2009.  Nitin Saxena. 2009."},{"key":"e_1_3_2_2_88_1","unstructured":"Progress on Polynomial Identity Testing. Bulletin of the EATCS 99 (2009) 49\u201379. http:\/\/eccc.hpi-web.de\/report\/2009\/101\/  Progress on Polynomial Identity Testing. Bulletin of the EATCS 99 (2009) 49\u201379. http:\/\/eccc.hpi-web.de\/report\/2009\/101\/"},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"crossref","unstructured":"Nitin Saxena. 2014. Progress on Polynomial Identity Testing - II. In Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume. 131\u2013146. DOI:http:\/\/dx.  Nitin Saxena. 2014. Progress on Polynomial Identity Testing - II. In Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume. 131\u2013146. DOI:http:\/\/dx.","DOI":"10.1007\/978-3-319-05446-9_7"},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"volume-title":"Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS","year":"1990","author":"Shamir Adi","key":"e_1_3_2_2_91_1"},{"key":"e_1_3_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-015-0105-8"},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"e_1_3_2_2_95_1","unstructured":"28404  28404"},{"key":"e_1_3_2_2_96_1","unstructured":"Volker Strassen. 1973.  Volker Strassen. 1973."},{"key":"e_1_3_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01436566"},{"key":"e_1_3_2_2_98_1","unstructured":"\u00c9va Tardos. 1988.  \u00c9va Tardos. 1988."},{"key":"e_1_3_2_2_99_1","doi-asserted-by":"crossref","unstructured":"The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8 1 (1988) 141\u2013142. DOI:http: \/\/dx.  The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8 1 (1988) 141\u2013142. DOI:http: \/\/dx.","DOI":"10.1007\/BF02122563"},{"key":"e_1_3_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.09.004"},{"key":"e_1_3_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_2_102_1","unstructured":"Leslie G. Valiant Sven Skyum S. Berkowitz and Charles Rackoff. 1983.  Leslie G. Valiant Sven Skyum S. Berkowitz and Charles Rackoff. 1983."},{"key":"e_1_3_2_2_103_1","doi-asserted-by":"crossref","unstructured":"Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12 4 (1983) 641\u2013644. DOI:http:\/\/dx.  Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12 4 (1983) 641\u2013644. DOI:http:\/\/dx.","DOI":"10.1137\/0212043"},{"key":"e_1_3_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.1137\/130938219"},{"key":"e_1_3_2_2_105_1","unstructured":"Andrew Chi-Chih Yao. 1985.  Andrew Chi-Chih Yao. 1985."},{"key":"e_1_3_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.49"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055496","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":106,"alternative-id":["10.1145\/3055399.3055496","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055496","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}