{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:02:19Z","timestamp":1767772939017,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031226762"},{"type":"electronic","value":"9783031226779"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22677-9_15","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:04:32Z","timestamp":1673341472000},"page":"273-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["GEM: Execution-Aware Cache Management for\u00a0Graph Analytics"],"prefix":"10.1007","author":[{"given":"Mo","family":"Zou","sequence":"first","affiliation":[]},{"given":"Mingyu","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Wenming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhimin","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Xiaochun","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Dongrui","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Andreou, A., Silva, M., Benevenuto, F., Goga, O., Loiseau, P., Mislove, A.: Measuring the facebook advertising ecosystem. In: NDSS 2019-Proceedings of the Network and Distributed System Security Symposium, pp. 1\u201315 (2019)","DOI":"10.14722\/ndss.2019.23280"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"The Semantic Web","author":"S Auer","year":"2007","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: Aberer, K. (ed.) ASWC\/ISWC -2007. LNCS, vol. 4825, pp. 722\u2013735. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76298-0_52"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Balaji, V., Crago, N., Jaleel, A., Lucia, B.: P-OPT: practical optimal cache replacement for graph analytics. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 668\u2013681. IEEE (2021)","DOI":"10.1109\/HPCA51647.2021.00062"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Basak, A., et al.: Analysis and optimization of the memory hierarchy for graph processing workloads. In: 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 373\u2013386. IEEE (2019)","DOI":"10.1109\/HPCA.2019.00051"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Beamer, S., Asanovic, K., Patterson, D.: Direction-optimizing breadth-first search. In: SC\u201912: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, pp. 1\u201310. IEEE (2012)","DOI":"10.1109\/SC.2012.50"},{"key":"15_CR6","unstructured":"Beamer, S., Asanovi\u0107, K., Patterson, D.: The gap benchmark suite. arXiv preprint arXiv:1508.03619 (2015)"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"6","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Cha, M., Haddadi, H., Benevenuto, F., Gummadi, K.: Measuring user influence in twitter: The million follower fallacy. In: Proceedings of the International AAAI Conference on Web and Social Media. vol. 4 (2010)","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Collins, J.D., Tullsen, D.M.: Hardware identification of cache conflict misses. In: MICRO-32. Proceedings of the 32nd Annual ACM\/IEEE International Symposium on Microarchitecture, pp. 126\u2013135. IEEE (1999)","DOI":"10.1109\/MICRO.1999.809450"},{"issue":"1","key":"15_CR11","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.chb.2015.03.051","volume":"49","author":"M Dehghani","year":"2015","unstructured":"Dehghani, M., Tumer, M.: A research on effectiveness of facebook advertising on enhancing purchase intention of consumers. Comput. Hum. Behav. 49, 597\u2013600 (2015)","journal-title":"Comput. Hum. Behav."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Faldu, P., Diamond, J., Grot, B.: A closer look at lightweight graph reordering. In: 2019 IEEE International Symposium on Workload Characterization (IISWC), pp. 1\u201313. IEEE (2019)","DOI":"10.1109\/IISWC47752.2019.9041948"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Faldu, P., Diamond, J., Grot, B.: Domain-specialized cache management for graph analytics. In: 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 234\u2013248. IEEE (2020)","DOI":"10.1109\/HPCA47549.2020.00028"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M Faloutsos","year":"1999","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. ACM SIGCOMM Comput. Commun. Rev. 29(4), 251\u2013262 (1999)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. In: Proceedings of the 15th International Conference on Database Theory, pp. 8\u201321 (2012)","DOI":"10.1145\/2274576.2274578"},{"key":"15_CR17","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: $$\\{$$PowerGraph$$\\}$$: Distributed $$\\{$$Graph-Parallel$$\\}$$ computation on natural graphs. In: 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2012), pp. 17\u201330 (2012)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, S., Gao, H., Zhou, H.: Adaptive cache bypassing for inclusive last level caches. In: 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp. 1243\u20131253. IEEE (2013)","DOI":"10.1109\/IPDPS.2013.16"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Hassan, H., et al.: Crow: A low-cost substrate for improving dram performance, energy efficiency, and reliability. In: Proceedings of the 46th International Symposium on Computer Architecture, pp. 129\u2013142 (2019)","DOI":"10.1145\/3307650.3322231"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"205395172090587","DOI":"10.1177\/2053951720905874","volume":"7","author":"JCT Ho","year":"2020","unstructured":"Ho, J.C.T.: How biased is the sample? Reverse engineering the ranking algorithm of facebook\u2019s graph application programming interface. Big Data Soc. 7(1), 2053951720905874 (2020)","journal-title":"Big Data Soc."},{"issue":"3","key":"15_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1816038.1815971","volume":"38","author":"A Jaleel","year":"2010","unstructured":"Jaleel, A., Theobald, K.B., Steely, S.C., Jr., Emer, J.: High performance cache replacement using re-reference interval prediction (RRIP). ACM SIGARCH Comput. Archit. News 38(3), 60\u201371 (2010)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"John, L.K., Subramanian, A.: Design and performance evaluation of a cache assist to implement selective caching. In: Proceedings International Conference on Computer Design VLSI in Computers and Processors, pp. 510\u2013518. IEEE (1997)","DOI":"10.1109\/ICCD.1997.628916"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Lehmberg, O., Meusel, R., Bizer, C.: Graph structure in the web: aggregated by pay-level domain. In: Proceedings of the 2014 ACM Conference on Web Science, pp. 119\u2013128 (2014)","DOI":"10.1145\/2615569.2615674"},{"key":"15_CR25","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (Jun 2014)"},{"issue":"2","key":"15_CR26","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/LCA.2020.2973991","volume":"19","author":"S Li","year":"2020","unstructured":"Li, S., Yang, Z., Reddy, D., Srivastava, A., Jacob, B.: DRAMsim3: a cycle-accurate, thermal-capable dram simulator. IEEE Comput. Archit. Lett. 19(2), 106\u2013109 (2020)","journal-title":"IEEE Comput. Archit. Lett."},{"issue":"11","key":"15_CR27","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0111430","volume":"9","author":"A Lovrics","year":"2014","unstructured":"Lovrics, A., et al.: Boolean modelling reveals new regulatory connections between transcription factors orchestrating the development of the ventral spinal cord. PLoS ONE 9(11), e111430 (2014)","journal-title":"PLoS ONE"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Maass, S., Min, C., Kashyap, S., Kang, W., Kumar, M., Kim, T.: Mosaic: processing a trillion-edge graph on a single machine. In: Proceedings of the Twelfth European Conference on Computer Systems, pp. 527\u2013543 (2017)","DOI":"10.1145\/3064176.3064191"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Madduri, K., Ediger, D., Jiang, K., Bader, D.A., Chavarria-Miranda, D.: A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. In: 2009 IEEE International Symposium on Parallel and Distributed Processing, pp. 1\u20138. IEEE (2009)","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Malkowski, K., Link, G., Raghavan, P., Irwin, M.J.: Load miss prediction-exploiting power performance trade-offs. In: 2007 IEEE International Parallel and Distributed Processing Symposium, pp. 1\u20138. IEEE (2007)","DOI":"10.1109\/IPDPS.2007.370536"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342 (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Mukkara, A., Beckmann, N., Abeydeera, M., Ma, X., Sanchez, D.: Exploiting locality in graph analytics through hardware-accelerated traversal scheduling. In: 2018 51st Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 1\u201314. IEEE (2018)","DOI":"10.1109\/MICRO.2018.00010"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Mukkara, A., Beckmann, N., Sanchez, D.: PHI: architectural support for synchronization-and bandwidth-efficient commutative scatter updates. In: Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, pp. 1009\u20131022 (2019)","DOI":"10.1145\/3352460.3358254"},{"issue":"2","key":"15_CR34","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1089\/cmb.2008.11TT","volume":"16","author":"S Navlakha","year":"2009","unstructured":"Navlakha, S., Schatz, M.C., Kingsford, C.: Revealing biological modules via graph summarization. J. Comput. Biol. 16(2), 253\u2013264 (2009)","journal-title":"J. Comput. Biol."},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Rahman, S., Abu-Ghazaleh, N., Gupta, R.: GraphPulse: an event-driven hardware accelerator for asynchronous graph processing. In: 2020 53rd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 908\u2013921. IEEE (2020)","DOI":"10.1109\/MICRO50266.2020.00078"},{"issue":"2","key":"15_CR36","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/342001.339668","volume":"28","author":"S Rixner","year":"2000","unstructured":"Rixner, S., Dally, W.J., Kapasi, U.J., Mattson, P., Owens, J.D.: Memory access scheduling. ACM SIGARCH Comput. Archit. News 28(2), 128\u2013138 (2000)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"issue":"3","key":"15_CR37","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/2508148.2485963","volume":"41","author":"D Sanchez","year":"2013","unstructured":"Sanchez, D., Kozyrakis, C.: ZSim: fast and accurate microarchitectural simulation of thousand-core systems. ACM SIGARCH Comput. Archit. News 41(3), 475\u2013486 (2013)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 135\u2013146 (2013)","DOI":"10.1145\/2442516.2442530"},{"key":"15_CR39","doi-asserted-by":"crossref","unstructured":"Spiliotopoulos, T., Pereira, D., Oakley, I.: Predicting tie strength with the facebook API. In: Proceedings of the 18th Panhellenic Conference on Informatics, pp. 1\u20135 (2014)","DOI":"10.1145\/2645791.2645817"},{"key":"15_CR40","doi-asserted-by":"crossref","unstructured":"Sundaram, N., et al.: GraphMat: high performance graph analytics made productive. arXiv preprint arXiv:1503.07241 (2015)","DOI":"10.14778\/2809974.2809983"},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Sutton, M., Ben-Nun, T., Barak, A.: Optimizing parallel graph connectivity computation via subgraph sampling. In: 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 12\u201321. IEEE (2018)","DOI":"10.1109\/IPDPS.2018.00012"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Talati, N., et al.: Prodigy: improving the memory latency of data-indirect irregular workloads using hardware-software co-design. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 654\u2013667. IEEE (2021)","DOI":"10.1109\/HPCA51647.2021.00061"},{"key":"15_CR43","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_16","volume-title":"Managing and Mining Graph Data","author":"L Tang","year":"2010","unstructured":"Tang, L., Liu, H.: Graph mining applications to social network analysis. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data. Advances in Database Systems, vol. 40. Springer, Boston (2010)"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Yan, M., et al.: Alleviating irregularity in graph analytics acceleration: a hardware\/software co-design approach. In: Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, pp. 615\u2013628 (2019)","DOI":"10.1145\/3352460.3358318"},{"issue":"1","key":"15_CR45","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inf. Syst."},{"issue":"2","key":"15_CR46","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1145\/3296957.3173197","volume":"53","author":"D Zhang","year":"2018","unstructured":"Zhang, D., Ma, X., Thomson, M., Chiou, D.: Minnow: Lightweight offload engines for worklist management and worklist-directed prefetching. ACM SIGPLAN Not. 53(2), 593\u2013607 (2018)","journal-title":"ACM SIGPLAN Not."},{"key":"15_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, Y., et al.: DepGraph: a dependency-driven accelerator for efficient iterative graph processing. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 371\u2013384. IEEE (2021)","DOI":"10.1109\/HPCA51647.2021.00039"},{"key":"15_CR48","doi-asserted-by":"crossref","unstructured":"Zhang, Y., et al.: Optimizing ordered graph algorithms with graphit. arXiv preprint arXiv:1911.07260 (2019)","DOI":"10.1145\/3368826.3377909"},{"key":"15_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Kiriansky, V., Mendis, C., Amarasinghe, S., Zaharia, M.: Making caches work for graph analytics. In: 2017 IEEE International Conference on Big Data (Big Data), pp. 293\u2013302. IEEE (2017)","DOI":"10.1109\/BigData.2017.8257937"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22677-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T22:40:37Z","timestamp":1728686437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22677-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031226762","9783031226779"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22677-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2022","order":10,"name":"conference_id","label":"Conference ID","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":"91","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":"33","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":"10","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":"36% - 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":"5","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)"}}]}}