{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:43:36Z","timestamp":1768347816305,"version":"3.49.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031377082","type":"print"},{"value":"9783031377099","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":197,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Logic locking was designed to be a formidable barrier to IP piracy: given a logic design, logic locking modifies the logic design such that the circuit operates correctly only if operated with the \u201ccorrect\u201d<jats:italic>secret<\/jats:italic>key. However, strong attacks (like SAT-based attacks) soon exposed the weakness of this defense.<jats:italic>Stripped functionality logic locking<\/jats:italic>(SFLL) was recently proposed as a strong variant of logic locking. SFLL was designed to be resilient against SAT attacks, which was the bane of conventional logic locking techniques. However, all SFLL-protected designs share certain \u201ccircuit patterns\u201d that expose them to new attacks that employ<jats:italic>structural analysis<\/jats:italic>of the locked circuits.<\/jats:p><jats:p>In this work, we propose a new methodology\u2014<jats:italic>Structurally Robust SFLL<\/jats:italic>(<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal{S}\\mathcal{R}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>S<\/mml:mi><mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula><jats:sc>-SFLL<\/jats:sc>)\u2014that uses the power of modern satisfiability and synthesis engines to produce semantically equivalent circuits that are resilient against such structural attacks. On our benchmarks,<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal{S}\\mathcal{R}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>S<\/mml:mi><mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula><jats:sc>-SFLL<\/jats:sc>was able to defend all circuit instances against both structural and SAT attacks, while all of them were broken when defended using SFLL. Further, we show that designing such defenses is challenging: we design a variant of our proposal,<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal{S}\\mathcal{R}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>S<\/mml:mi><mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula><jats:sc>-SFLL(0)<\/jats:sc>, that is also robust against existing structural attacks but succumbs to a new attack,<jats:sc>SyntAk<\/jats:sc>(also proposed in this work).<jats:sc>SyntAk<\/jats:sc>uses synthesis technology to compile<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal{S}\\mathcal{R}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>S<\/mml:mi><mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula><jats:sc>-SFLL(0)<\/jats:sc>locked circuits into semantically equivalent variants that have structural vulnerabilities.<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal{S}\\mathcal{R}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>S<\/mml:mi><mml:mi>R<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula><jats:sc>-SFLL<\/jats:sc>, however, remains resilient to<jats:sc>SyntAk<\/jats:sc>.<\/jats:p>","DOI":"10.1007\/978-3-031-37709-9_10","type":"book-chapter","created":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:01:21Z","timestamp":1689501681000},"page":"190-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["SR-SFLL: Structurally Robust Stripped Functionality Logic Locking"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8700-3428","authenticated-orcid":false,"given":"Gourav","family":"Takhar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3394-023X","authenticated-orcid":false,"given":"Subhajit","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"key":"10_CR1","unstructured":"ABC: System for sequential logic synthesis and formal verification. https:\/\/github.com\/berkeley-abc\/abc. Accessed 2 Jan 2022"},{"key":"10_CR2","unstructured":"ISCAS\u201985 benchmarks. https:\/\/filebox.ece.vt.edu\/~mhsiao\/iscas85.html. Accessed 8 Jan 2022"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Akshay, S., Chakraborty, S., Goel, S., Kulal, S., Shah, S.: What\u2019s hard about boolean functional synthesis? In: CAV, pp. 251\u2013269. Springer (2018)","DOI":"10.1007\/978-3-319-96145-3_14"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Alrahis, L., et al.: GNNUnlock: graph neural networks-based oracle-less unlocking scheme for provably secure logic locking. In: DATE, pp. 780\u2013785. IEEE (2021)","DOI":"10.23919\/DATE51398.2021.9474039"},{"key":"10_CR5","unstructured":"Alur, R., D\u2019Antoni, L., Gulwani, S., Kini, D., Viswanathan, M.: Automated grading of DFA constructions. In: IJCAI, pp. 1976\u20131982 (2013)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bao, J., Trivedi, N., Pathak, D., Hsu, J., Roy, S.: Data-driven invariant learning for probabilistic programs. In: CAV, pp. 33\u201354. Springer (2022)","DOI":"10.1007\/978-3-031-13185-1_3"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MDT.2010.24","volume":"27","author":"A Baumgarten","year":"2010","unstructured":"Baumgarten, A., Tyagi, A., Zambreno, J.: Preventing IC piracy using reconfigurable logic barriers. IEEE Des. Test Comput. 27(1), 66\u201375 (2010)","journal-title":"IEEE Des. Test Comput."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bavishi, R., Pandey, A., Roy, S.: Regression aware debugging for mobile applications. In: Mobile! 2016, pp. 21\u201322. ACM (2016)","DOI":"10.1145\/2983990.2984014"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Bavishi, R., Pandey, A., Roy, S.: To be precise: regression aware debugging. In: OOPSLA, pp. 897\u2013915. ACM (2016)","DOI":"10.1145\/3022671.2984014"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Chakraborty, R.S., Bhunia, S.: Hardware protection and authentication through netlist level obfuscation. In: IEEE\/ACM ICCAD, pp. 674\u2013677. IEEE (2008)","DOI":"10.1109\/ICCAD.2008.4681649"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Dupuis, S., Ba, P.S., Di Natale, G., Flottes, M.L., Rouzeyre, B.: A novel hardware logic encryption technique for thwarting illegal overproduction and hardware trojans. In: IEEE IOLTS, pp. 49\u201354. IEEE (2014)","DOI":"10.1109\/IOLTS.2014.6873671"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-662-48288-9_7","volume-title":"Static Analysis","author":"A Garg","year":"2015","unstructured":"Garg, A., Roy, S.: Synthesizing heap manipulations via integer linear programming. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 109\u2013127. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48288-9_7"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-030-53291-8_31","volume-title":"Computer Aided Verification","author":"P Golia","year":"2020","unstructured":"Golia, P., Roy, S., Meel, K.S.: Manthan: a data-driven approach for boolean function synthesis. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 611\u2013633. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_31"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Golia, P., Slivovsky, F., Roy, S., Meel, K.S.: Engineering an efficient boolean functional synthesis engine. In: IEEE\/ACM ICCAD, pp. 1\u20139. IEEE (2021)","DOI":"10.1109\/ICCAD51958.2021.9643583"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Jha, S., Tiwari, A., Venkatesan,R.: Synthesis of loop-free programs. In: PLDI, pp. 62\u201373. ACM (2011)","DOI":"10.1145\/1993316.1993506"},{"key":"10_CR17","unstructured":"Hurtarte, J.S., Wolsheimer, E.A., Tafoya, L.M.: Understanding fabless ic technology. Newnes (2011)"},{"key":"10_CR18","unstructured":"Kalita, P.K., Kumar, M.J., Roy, S.: Synthesis of semantic actions in attribute grammars. In: IEEE FMCAD, pp. 304\u2013314. IEEE (2022)"},{"issue":"OOPSLA2","key":"10_CR19","first-page":"1291","volume":"6","author":"PK Kalita","year":"2022","unstructured":"Kalita, P.K., Muduli, S.K., D\u2019Antoni, L., Reps, T., Roy, S.: Synthesizing abstract transformers. PACMPL 6(OOPSLA2), 1291\u20131319 (2022)","journal-title":"Synthesizing abstract transformers. PACMPL"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Lahiri, S., Roy, S.: Almost correct invariants: Synthesizing inductive invariants by fuzzing proofs. In: ISSTA, pp. 352\u2013364. ACM (2022)","DOI":"10.1145\/3533767.3534381"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Leung, A., Sarracino, J., Lerner, S.: Interactive parser synthesis by example. In: PLDI, pp. 565\u2013574. ACM (2015)","DOI":"10.1145\/2813885.2738002"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Padhi, S., Sharma, R., Millstein, T.D.: Data-driven precondition inference with learned features. In: PLDI, pp. 42\u201356. ACM (2016)","DOI":"10.1145\/2980983.2908099"},{"issue":"6","key":"10_CR23","first-page":"961","volume":"34","author":"SM Plaza","year":"2015","unstructured":"Plaza, S.M., Markov, I.L.: Solving the third-shift problem in ic piracy with test-aware logic locking. IEEE TCADICS 34(6), 961\u2013971 (2015)","journal-title":"IEEE TCADICS"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Qiu, X., Solar-Lezama, A.: Natural synthesis of provably-correct data-structure manipulations. In: OOPSLA, pp. 1\u201328. ACM (2017)","DOI":"10.1145\/3133889"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-96142-2_17","volume-title":"Computer Aided Verification","author":"MN Rabe","year":"2018","unstructured":"Rabe, M.N., Tentrup, L., Rasmussen, C., Seshia, S.A.: Understanding and extending incremental determinization for 2QBF. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10982, pp. 256\u2013274. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96142-2_17"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Rajendran, J., Pino, Y., Sinanoglu, O., Karri, R.: Security analysis of logic obfuscation. In: DAC, pp. 83\u201389 (2012)","DOI":"10.1145\/2228360.2228377"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-38856-9_9","volume-title":"Static Analysis","author":"S Roy","year":"2013","unstructured":"Roy, S.: From concrete examples to heap manipulating programs. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol. 7935, pp. 126\u2013149. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38856-9_9"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Roy, S., Hsu, J., Albarghouthi, A.: Learning differentially private mechanisms. In: S &P, pp. 852\u2013865. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00060"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Roy, S., Pandey, A., Dolan-Gavitt, B., Hu, Y.: Bug synthesis: Challenging bug-finding tools with deep faults. In: ESEC\/FSE, pp. 224\u2013234. ACM (2018)","DOI":"10.1145\/3236024.3236084"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Shamsi, K., Li, M., Meade, T., Zhao, Z., Pan, D.Z., Jin, Y.: AppSAT: Approximately deobfuscating integrated circuits. In: HOST, pp. 95\u2013100. IEEE (2017)","DOI":"10.1109\/HST.2017.7951805"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Singal, D., Agarwal, P., Jhunjhunwala, S., Roy, S.: Parse condition: symbolic encoding of LL(1) parsing. In: LPAR, pp. 637\u2013655. EasyChair (2018)","DOI":"10.29007\/2ndp"},{"key":"10_CR32","first-page":"2514","volume":"15","author":"D Sirone","year":"2020","unstructured":"Sirone, D., Subramanyan, P.: Functional analysis attacks on logic locking. IEEE TIFS 15, 2514\u20132527 (2020)","journal-title":"IEEE TIFS"},{"key":"10_CR33","first-page":"475","volume":"15","author":"A Solar-Lezama","year":"2013","unstructured":"Solar-Lezama, A.: Program sketching. Springer STTT 15, 475\u2013495 (2013)","journal-title":"Program sketching. Springer STTT"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Subramanyan, P., Ray, S., Malik, S.: Evaluating the security of logic encryption algorithms. In: HOST, pp. 137\u2013143. IEEE (2015)","DOI":"10.1109\/HST.2015.7140252"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-99524-9_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Takhar","year":"2022","unstructured":"Takhar, G., Karri, R., Pilato, C., Roy, S.: HOLL: program synthesis for higher order logic locking. In: TACAS 2022. LNCS, vol. 13243, pp. 3\u201324. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_1"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Verma, A., Kalita, P.K., Pandey, A., Roy, S.: Interactive debugging of concurrent programs under relaxed memory models. In: CGO, pp. 68\u201380. ACM (2020)","DOI":"10.1145\/3368826.3377910"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Verma, S., Roy, S.: Synergistic debug-repair of heap manipulations. In: ESEC\/FSE, pp. 163\u2013173. ACM (2017)","DOI":"10.1145\/3106237.3106263"},{"issue":"3","key":"10_CR38","first-page":"399","volume":"58","author":"S Verma","year":"2021","unstructured":"Verma, S., Roy, S.: Debug-localize-repair: a symbiotic construction for heap manipulations. Springer FMSD 58(3), 399\u2013439 (2021)","journal-title":"Springer FMSD"},{"issue":"2","key":"10_CR39","first-page":"199","volume":"38","author":"Y Xie","year":"2018","unstructured":"Xie, Y., Srivastava, A.: Anti-SAT: mitigating SAT attack on logic locking. IEEE TCADICS 38(2), 199\u2013207 (2018)","journal-title":"IEEE TCADICS"},{"issue":"10","key":"10_CR40","first-page":"2778","volume":"14","author":"F Yang","year":"2019","unstructured":"Yang, F., Tang, M., Sinanoglu, O.: Stripped functionality logic locking with hamming distance-based restore unit (SFLL-hd)-unlocked. IEEE TIFS 14(10), 2778\u20132786 (2019)","journal-title":"IEEE TIFS"},{"key":"10_CR41","unstructured":"Yang, S.: Logic synthesis and optimization benchmarks user guide: version 3.0. Microelectronics Center of North Carolina (MCNC) (1991)"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Yasin, M., Mazumdar, B., Rajendran, J.J., Sinanoglu, O.: SARLock: SAT attack resistant logic locking. In: HOST, pp. 236\u2013241. IEEE (2016)","DOI":"10.1109\/HST.2016.7495588"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Yasin, M., Mazumdar, B., Sinanoglu, O., Rajendran, J.: Security analysis of anti-sat. In: ASP-DAC, pp. 342\u2013347. IEEE (2017)","DOI":"10.1109\/ASPDAC.2017.7858346"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Yasin, M., Sengupta, A., Nabeel, M.T., Ashraf, M., Rajendran, J., Sinanoglu, O.: Provably-secure logic locking: from theory to practice. In: ACM CCS, pp. 1601\u20131618 (2017)","DOI":"10.1145\/3133956.3133985"},{"key":"10_CR45","unstructured":"Zeng, H., Zhou, H., Srivastava, A., Kannan, R., Prasanna, V.: GraphSAINT: graph sampling based inductive learning method. In: ICLR (2020)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37709-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T06:56:52Z","timestamp":1729753012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37709-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377082","9783031377099"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37709-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i-cav.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"hotcrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"261","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":"67","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":"26% - 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":"11","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)"}}]}}