{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:45:48Z","timestamp":1770993948032,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031389054","type":"print"},{"value":"9783031389061","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:\/\/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-38906-1_23","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"340-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Differentially Private Range Query on\u00a0Shortest Paths"],"prefix":"10.1007","author":[{"given":"Chengyuan","family":"Deng","sequence":"first","affiliation":[]},{"given":"Jie","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Jalaj","family":"Upadhyay","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-642-22006-7_58","volume-title":"Automata, Languages and Programming","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-dimension and shortest path algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 690\u2013699. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_58"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Acs, G., Castelluccia, C., Chen, R.: Differentially private histogram publishing through lossy compression. In: 2012 IEEE 12th International Conference on Data Mining, pp. 1\u201310. IEEE (2012)","DOI":"10.1109\/ICDM.2012.80"},{"key":"23_CR3","unstructured":"Beimel, A., Moran, S., Nissim, K., Stemmer, U.: Private center points and learning of halfspaces. In: Conference on Learning Theory, pp. 269\u2013282. PMLR (2019)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-40328-6_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Beimel","year":"2013","unstructured":"Beimel, A., Nissim, K., Stemmer, U.: Private learning and sanitization: pure vs. approximate differential privacy. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2013. LNCS, vol. 8096, pp. 363\u2013378. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40328-6_26"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Dadush, D., Krishnaswamy, R., Talwar, K.: Unconditional differentially private mechanisms for linear queries. In: Proceedings of the forty-fourth annual ACM Symposium on Theory of computing, pp. 1269\u20131284 (2012)","DOI":"10.1145\/2213977.2214089"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the SuLQ framework. In: Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 128\u2013138 (2005)","DOI":"10.1145\/1065167.1065184"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2450142.2450148","volume":"60","author":"A Blum","year":"2013","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to noninteractive database privacy. J. ACM 60(2), 12 (2013)","journal-title":"J. ACM"},{"issue":"5","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1137\/15M1033587","volume":"47","author":"M Bun","year":"2018","unstructured":"Bun, M., Ullman, J., Vadhan, S.: Fingerprinting codes and the price of approximate differential privacy. SIAM J. Comput. 47(5), 1888\u20131938 (2018)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2043621.2043626","volume":"14","author":"THH Chan","year":"2011","unstructured":"Chan, T.H.H., Shi, E., Song, D.: Private and continual release of statistics. ACM Trans. Inf. Syst. Secur. (TISSEC) 14(3), 1\u201324 (2011)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Chen, J.Y., et al.: Differentially private all-pairs shortest path distances: improved algorithms and lower bounds. In: 2023 Symposium on Discrete Algorithm (SODA 2023) (2023)","DOI":"10.1137\/1.9781611977554.ch184"},{"issue":"10","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.14778\/3339490.3339496","volume":"12","author":"G Cormode","year":"2019","unstructured":"Cormode, G., Kulkarni, T., Srivastava, D.: Answering range queries under local differential privacy. Proc. VLDB Endowment 12(10), 1126\u20131138 (2019)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Cormode, G., Procopiuc, C., Srivastava, D., Shen, E., Yu, T.: Differentially private spatial decompositions. In: 2012 IEEE 28th International Conference on Data Engineering, pp. 20\u201331. IEEE (2012)","DOI":"10.1109\/ICDE.2012.16"},{"key":"23_CR13","unstructured":"Durfee, D., Rogers, R.M.: Practical differentially private top-k selection with pay-what-you-get composition. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019 (December), pp. 8\u201314. Vancouver, BC, Canada, pp. 3527\u20133537 (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/b139e104214a08ae3f2ebcce149cdf6e-Abstract.html"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_29"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.29012\/jpc.v7i3.405","volume":"7","author":"C Dwork","year":"2016","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. J. Priv. Confidentiality 7(3), 17\u201351 (2016)","journal-title":"J. Priv. Confidentiality"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends\u00ae Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","DOI":"10.1561\/0400000042"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.: Boosting and differential privacy. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 51\u201360. IEEE (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Fan, C., Li, P.: Distances release with differential privacy in tree and grid graph. arXiv preprint arXiv:2204.12488 (2022)","DOI":"10.1109\/ISIT50566.2022.9834836"},{"key":"23_CR19","unstructured":"Fan, C., Li, P., Li, X.: Breaking the linear error barrier in differentially private graph distance release. arXiv preprint arXiv:2204.14247 (2022)"},{"issue":"10","key":"23_CR20","doi-asserted-by":"publisher","first-page":"893","DOI":"10.14778\/2732951.2732963","volume":"7","author":"S Funke","year":"2014","unstructured":"Funke, S., Nusser, A., Storandt, S.: On k-path covers and their applications. Proc. VLDB Endowment 7(10), 893\u2013902 (2014)","journal-title":"Proc. VLDB Endowment"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10115-020-01520-w","volume":"63","author":"S Ghane","year":"2021","unstructured":"Ghane, S., Kulik, L., Ramamoharao, K.: A differentially private algorithm for range queries on trajectories. Knowl. Inf. Syst. 63(2), 277\u2013303 (2021)","journal-title":"Knowl. Inf. Syst."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Ding, J., Sarkar, R., Gao, J.: Differentially private range counting in planar graphs for spatial sensing. In: Proceedings of the 39th Annual IEEE International Conference on Computer Communications (INFOCOM 2020), pp. 2233\u20132242 (2020)","DOI":"10.1109\/INFOCOM41043.2020.9155480"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-28914-9_19","volume-title":"Theory of Cryptography","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 339\u2013356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_19"},{"key":"23_CR24","unstructured":"Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release. In: Advances in Neural Information Processing Systems, vol. 25 (2012)"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for privacy-preserving data analysis. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 61\u201370. IEEE (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Hardt, M., Talwar, K.: On the geometry of differential privacy. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 705\u2013714. ACM (2010)","DOI":"10.1145\/1806689.1806786"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Hay, M., Li, C., Miklau, G., Jensen, D.: Accurate estimation of the degree distribution of private networks. In: 2009 Ninth IEEE International Conference on Data Mining, pp. 169\u2013178. IEEE (2009)","DOI":"10.1109\/ICDM.2009.11"},{"key":"23_CR28","unstructured":"Hay, M., Rastogi, V., Miklau, G., Suciu, D.: Boosting the accuracy of differentially-private histograms through consistency. arXiv preprint arXiv:0904.0942 (2009)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Hong, Y.C., Chen, J.: Graph database to enhance supply chain resilience for industry 4.0. IJISSCM 15(1), 1\u201319 (2022)","DOI":"10.4018\/IJISSCM.2022010104"},{"key":"23_CR30","first-page":"13976","volume":"33","author":"H Kaplan","year":"2020","unstructured":"Kaplan, H., Mansour, Y., Stemmer, U., Tsfadia, E.: Private learning of halfspaces: simplifying the construction and reducing the sample complexity. Adv. Neural. Inf. Process. Syst. 33, 13976\u201313985 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Li, C., Hay, M., Rastogi, V., Miklau, G., McGregor, A.: Optimizing linear counting queries under differential privacy. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 123\u2013134. ACM (2010)","DOI":"10.1145\/1807085.1807104"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Li, C., Miklau, G.: Optimal error of query sets under the differentially-private matrix mechanism. In: Proceedings of the 16th International Conference on Database Theory, pp. 272\u2013283 (2013)","DOI":"10.1145\/2448496.2448529"},{"issue":"11","key":"23_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3569085","volume":"55","author":"Y Li","year":"2023","unstructured":"Li, Y., Purcell, M., Rakotoarivelo, T., Smith, D., Ranbaduge, T., Ng, K.S.: Private graph data release: a survey. ACM Comput. Surv. 55(11), 1\u201339 (2023). https:\/\/doi.org\/10.1145\/3569085","journal-title":"ACM Comput. Surv."},{"key":"23_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy","author":"J Matou\u0161ek","year":"1999","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy. Springer, Berlin Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-03942-3"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 94\u2013103. IEEE (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Nikolov, A.: Optimal private halfspace counting via discrepancy. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1285\u20131292 (2012)","DOI":"10.1145\/2213977.2214090"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Nikolov, A., Talwar, K., Zhang, L.: The geometry of differential privacy: the sparse and approximate cases. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 351\u2013360 (2013)","DOI":"10.1145\/2488608.2488652"},{"issue":"2\u20133","key":"23_CR38","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/09537287.2020.1810764","volume":"33","author":"NJ Ogbuke","year":"2022","unstructured":"Ogbuke, N.J., Yusuf, Y.Y., Dharma, K., Mercangoz, B.A.: Big data supply chain analytics: ethical, privacy and security challenges posed to business, industries and society. Prod. Plan. Control 33(2\u20133), 123\u2013137 (2022)","journal-title":"Prod. Plan. Control"},{"key":"23_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2020.113303","volume":"133","author":"T Pourhabibi","year":"2020","unstructured":"Pourhabibi, T., Ong, K.L., Kam, B.H., Boo, Y.L.: Fraud detection: a systematic literature review of graph-based anomaly detection approaches. Decis. Support Syst. 133, 113303 (2020)","journal-title":"Decis. Support Syst."},{"key":"23_CR40","doi-asserted-by":"crossref","unstructured":"Qardaji, W., Yang, W., Li, N.: Differentially private grids for geospatial data. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 757\u2013768. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544872"},{"issue":"14","key":"23_CR41","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.14778\/2556549.2556576","volume":"6","author":"W Qardaji","year":"2013","unstructured":"Qardaji, W., Yang, W., Li, N.: Understanding hierarchical methods for differentially private histograms. Proc. VLDB Endowment 6(14), 1954\u20131965 (2013)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR42","doi-asserted-by":"crossref","unstructured":"Qardaji, W., Yang, W., Li, N.: Priview: practical differentially private release of marginal contingency tables. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1435\u20131446 (2014)","DOI":"10.1145\/2588555.2588575"},{"key":"23_CR43","unstructured":"Qiao, G., Su, W.J., Zhang, L.: Oneshot differentially private top-k selection. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18\u201324 July 2021, Virtual Event. Proceedings of Machine Learning Research, vol. 139, pp. 8672\u20138681. PMLR (2021). http:\/\/proceedings.mlr.press\/v139\/qiao21b.html"},{"key":"23_CR44","first-page":"28286","volume":"34","author":"M Sadigurschi","year":"2021","unstructured":"Sadigurschi, M., Stemmer, U.: On the sample complexity of privately learning axis-aligned rectangles. Adv. Neural. Inf. Process. Syst. 34, 28286\u201328297 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Sealfon, A.: Shortest paths and distances with differential privacy. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 29\u201341 (2016)","DOI":"10.1145\/2902251.2902291"},{"issue":"2","key":"23_CR46","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MIC.2018.112102519","volume":"22","author":"S Sharma","year":"2018","unstructured":"Sharma, S., Chen, K., Sheth, A.: Toward practical privacy-preserving analytics for IoT and cloud-based healthcare systems. IEEE Internet Comput. 22(2), 42\u201351 (2018)","journal-title":"IEEE Internet Comput."},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Tao, Y., Sheng, C., Pei, J.: On k-skip shortest paths. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, SIGMOD 2011, pp. 421\u2013432. Association for Computing Machinery, New York (2011)","DOI":"10.1145\/1989323.1989368"},{"key":"23_CR48","unstructured":"Toth, C.D., O\u2019Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry (2017)"},{"key":"23_CR49","unstructured":"Tukey, J.W.: Mathematics and the picturing of data. In: Proceedings of the International Congress of Mathematicians, Vancouver, 1975, vol. 2, pp. 523\u2013531 (1975)"},{"key":"23_CR50","volume-title":"High-Dimensional Statistics: A Non-asymptotic Viewpoint","author":"MJ Wainwright","year":"2019","unstructured":"Wainwright, M.J.: High-Dimensional Statistics: A Non-asymptotic Viewpoint, vol. 48. Cambridge University Press, Cambridge (2019)"},{"issue":"8","key":"23_CR51","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/TKDE.2010.247","volume":"23","author":"X Xiao","year":"2010","unstructured":"Xiao, X., Wang, G., Gehrke, J.: Differential privacy via wavelet transforms. IEEE Trans. Knowl. Data Eng. 23(8), 1200\u20131214 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR52","unstructured":"Xiao, Y., Xiong, L., Fan, L., Goryczka, S.: DPCube: Differentially private histogram release through multidimensional partitioning. arXiv preprint arXiv:1202.5358 (2012)"},{"key":"23_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xiao, X., Xie, X.: Privtree: A differentially private algorithm for hierarchical decompositions. In: Proceedings of the 2016 International Conference on Management of Data, pp. 155\u2013170 (2016)","DOI":"10.1145\/2882903.2882928"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:07:58Z","timestamp":1690474078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_23","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":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"92","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":"47","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":"51% - 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":"10","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)"}}]}}