{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:07:46Z","timestamp":1778497666647,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":56,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819682942","type":"print"},{"value":"9789819682959","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8295-9_4","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:47:15Z","timestamp":1750355235000},"page":"58-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Survey on\u00a0Efficient Graph Reachability Queries"],"prefix":"10.1007","author":[{"given":"Huangleshuai","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1772-6863","authenticated-orcid":false,"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenke","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/2601412","volume":"47","author":"CC Aggarwal","year":"2014","unstructured":"Aggarwal, C.C., Subbian, K.: Evolutionary network analysis: a survey. ACM Comput. Surv. (CSUR) 47(1), 10 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of ACM SIGMOD International Conference on Management Data, pp. 253\u2013262 (1989)","DOI":"10.1145\/67544.66950"},{"issue":"7","key":"4_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"5","key":"4_CR4","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TKDE.2009.117","volume":"22","author":"R Bramandia","year":"2010","unstructured":"Bramandia, R., Choi, B., Ng, W.K.: Incremental maintenance of 2-hop labeling of large graphs. IEEE Trans. Knowl. Data Eng. 22(5), 682\u2013698 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cai, J., Poon, C.K.: Path-hop: Efficiently indexing large graphs for reachability queries. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 119\u2013128 (2010)","DOI":"10.1145\/1871437.1871457"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Carranza, A.G., Rossi, R.A., Rao, A., Koh, E.: Higher-order clustering in complex heterogeneous networks. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 25\u201335. KDD \u201920, Association for Computing Machinery, New York, NY, USA (2020)","DOI":"10.1145\/3394486.3403045"},{"key":"4_CR8","unstructured":"Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on DAGs. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB 2005) (2005)"},{"issue":"8","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.14778\/3529337.3529348","volume":"15","author":"X Chen","year":"2022","unstructured":"Chen, X., Peng, Y., Wang, S., Yu, J.X.: DLCR: efficient indexing for label-constrained reachability queries on large dynamic graphs. Proc. VLDB Endowment 15(8), 1645\u20131657 (2022)","journal-title":"Proc. VLDB Endowment"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, J., Huang, S., Wu, H., Fu, A.W.C.: TF-label: a topological-folding labeling scheme for reachability querying in a large graph. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. Kenneth A. Ross, Divesh Srivastava, and Dimitris Papadias (Eds.), ACM, pp. 193\u2013204 (2013)","DOI":"10.1145\/2463676.2465286"},{"issue":"11","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.14778\/2350229.2350247","volume":"5","author":"J Cheng","year":"2012","unstructured":"Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: K-reach: who is in your small world. Proc. VLDB Endow. 5(11), 1292\u20131303 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","DOI":"10.1137\/S0097539702403098"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dhia, I.B.: Access control in social networks: a reachability-based approach. In: Proceedings of the 2012 Joint EDBT\/ICDT Workshops, pp. 227\u2013232 (2012)","DOI":"10.1145\/2320765.2320828"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Fu, C., Zheng, G., Huang, C., Yu, Y., Dong, J.: Multiplex heterogeneous graph neural network with behavior pattern modeling. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 482\u2013494. KDD \u201923 (2023)","DOI":"10.1145\/3580305.3599441"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Hanauer, K., Schulz, C., Trummer, J.: O\u2019Reach: even faster reachability in large graphs. J. Exp. Algorithmics 27(4), 4.2 (2022)","DOI":"10.1145\/3556540"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Physics Reports (2012)","DOI":"10.1007\/978-3-642-36461-7"},{"issue":"14","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1978","DOI":"10.14778\/2556549.2556578","volume":"6","author":"R Jin","year":"2013","unstructured":"Jin, R., Wang, G.: Simple, fast, and scalable reachability oracle. Proc. VLDB Endowment 6(14), 1978\u20131989 (2013)","journal-title":"Proc. VLDB Endowment"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 813\u2013826. SIGMOD \u201909 (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H.: efficiently answering reachability queries on very large directed graphs. In: Proceedings of ACM SIGMOD International Conference on Management Data, pp. 595\u2013608 (2008)","DOI":"10.1145\/1376616.1376677"},{"issue":"11","key":"4_CR20","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5(11), 558\u2013562 (1962)","journal-title":"Commun. ACM"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1146\/annurev-financial-110716-032429","volume":"9","author":"M Kaminski","year":"2017","unstructured":"Kaminski, M., Mahoney, M.W.: Dynamic financial networks and applications. Annu. Rev. Financ. Econ. 9, 259\u2013299 (2017)","journal-title":"Annu. Rev. Financ. Econ."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Kiss, I.Z., Miller, J.C., Simon, P.L.: Mathematics of Epidemics on Networks: From Exact to Approximate Models. Springer (2017)","DOI":"10.1007\/978-3-319-50806-1"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: Hop-constrained s-t simple path enumeration in billion-scale labelled graphs. In: Web Information Systems Engineering \u2013 WISE 2022: 23rd International Conference, pp. 49\u201364. Springer-Verlag, Berlin, Heidelberg (2022)","DOI":"10.1007\/978-3-031-20891-1_5"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Luo, L., Fang, Y., Cao, X., Zhang, X., Zhang, W.: Detecting communities from heterogeneous graphs: a context path-based graph neural network model. In: CIKM \u201921: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1 - 5, 2021, pp. 1170\u20131180. ACM (2021)","DOI":"10.1145\/3459637.3482250"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Lyu, Q., Li, Y., He, B., Gong, B.: DBL: efficient reachability queries on dynamic graphs, pp. 761\u2013777 (2021)","DOI":"10.1007\/978-3-030-73197-7_52"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Merz, F., Sanders, P.: PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies. In: Proceedings of the European Symposium on Algorithms, pp. 701\u2013712 (2014)","DOI":"10.1007\/978-3-662-44777-2_58"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Pang, Y., Zou, L., Liu, Y.: IFCA: index-free community-aware reachability processing over large dynamic graphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE) (2023)","DOI":"10.1109\/ICDE55515.2023.00172"},{"issue":"12","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.14778\/3229863.3229874","volume":"11","author":"X Qiu","year":"2018","unstructured":"Qiu, X., et al.: Real-time constrained cycle detection in large dynamic graphs. Proc. VLDB Endowment 11(12), 1876\u20131888 (2018)","journal-title":"Proc. VLDB Endowment"},{"issue":"11\u201312","key":"4_CR29","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T Reps","year":"1998","unstructured":"Reps, T.: Program analysis via graph reachability. Inf. Softw. Technol. 40(11\u201312), 701\u2013726 (1998)","journal-title":"Inf. Softw. Technol."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"van Schaik, S.J., de\u00a0Moor, O.: A memory efficient reachability data structure through bit vector compression. In: Proceedings of ACM SIGMOD International Conference on Management Data, pp. 913\u2013924 (2011)","DOI":"10.1145\/1989323.1989419"},{"key":"4_CR31","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In: Proceedings of the 21st International Conference on Data Engineering, pp. 360\u2013371 (2005)"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Scholz, B., Zhang, C., Cifuentes, C.: User-input dependence analysis via graph reachability. In: Proceedings of the 2008 8th IEEE International Working Conference on Source Code Analysis and Manipulation, pp. 25\u201334 (2008)","DOI":"10.1109\/SCAM.2008.22"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Sengupta, N., Bagchi, A., Ramanath, M., Bedathur, S.: ARROW: approximating reachability using random walks over web-scale graphs. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, pp. 470\u2013481. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00049"},{"key":"4_CR34","first-page":"1009","volume":"2013","author":"S Seufert","year":"2013","unstructured":"Seufert, S., Anand, A., Bedathur, S.J., Weikum, G.: FERRARI: flexible and efficient reachability range assignment for graph indexing. Proc. IEEE Int. Conf. Data Eng. 2013, 1009\u20131020 (2013)","journal-title":"Proc. IEEE Int. Conf. Data Eng."},{"issue":"1","key":"4_CR35","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","volume":"7","author":"M Sharir","year":"1981","unstructured":"Sharir, M.: A strong-connectivity algorithm and its applications in data flow analysis. Comput. Math. Appl. 7(1), 67\u201372 (1981)","journal-title":"Comput. Math. Appl."},{"issue":"1\u20133","key":"4_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(88)90032-1","volume":"58","author":"K Simon","year":"1988","unstructured":"Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. Theoretical Comput. Sci. 58(1\u20133), 325\u2013346 (1988)","journal-title":"Theoretical Comput. Sci."},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29 (2017)","DOI":"10.1109\/TKDE.2016.2631160"},{"issue":"11","key":"4_CR38","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: PathSim: meta path-based top-k similarity search in heterogeneous information networks. Proc. VLDB Endowment 4(11), 992\u20131003 (2011)","journal-title":"Proc. VLDB Endowment"},{"issue":"2","key":"4_CR39","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Tri\u00dfl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data (SIGMOD 2007). ACM (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"4_CR41","unstructured":"Veloso, R.R., Cerf, L., Jr., W.M., Zaki, M.J.: Reachability queries in very large graphs: a fast refined online search approach. In: Proceedings of 17th International Conference on Extending Database Technology, pp. 511\u2013522 (2014)"},{"key":"4_CR42","unstructured":"Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: answering graph reachability queries in constant time. In: Proceedings of IEEE 29th International Conference on Data Engineering (2006)"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. VLDB J. 27 1\u201326 (2018)","DOI":"10.1007\/s00778-017-0468-3"},{"key":"4_CR44","doi-asserted-by":"publisher","unstructured":"Wen, D., Yang, B., Zhang, Y., Qin, L., Cheng, D., Zhang, W.: Span-reachability querying in large temporal graphs. VLDB J. 1\u201319 (2021). https:\/\/doi.org\/10.1007\/s00778-021-00715-z","DOI":"10.1007\/s00778-021-00715-z"},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"Xu, Z., Yang, Z., Chen, X., He, H., Cao, X.: Efficient answering of k-reachability on temporal bipartite graphs. In: Databases Theory and Applications, pp. 224\u2013238. Springer Nature Singapore, Singapore (2025)","DOI":"10.1007\/978-981-96-1242-0_17"},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"Yano, Y., Akiba, T., Iwata, Y., Yoshida, Y.: Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. 22nd CIKM 2013: San Francisco, CA, USA (2013)","DOI":"10.1145\/2505515.2505724"},{"key":"4_CR47","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: DAGGER: A scalable index for reachability queries in large dynamic graphs (2013)"},{"key":"4_CR48","unstructured":"Yu, D., Ma, H., Li, S., Chen, J.: Reachability constrained reinforcement learning. In: International Conference on Machine Learning, 17-23 July 2022, Baltimore, Maryland, USA. Proceedings of Machine Learning Research"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Cheng, J.: Graph reachability queries: a survey. In: Managing and Mining Graph Data, Advances in Database Systems, vol.\u00a040, pp. 181\u2013215. Springer (2010)","DOI":"10.1007\/978-1-4419-6045-0_6"},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"Y\u0131ld\u0131r\u0131m, H., Chaoji, V., Zaki, M.J.: GRAIL: a scalable index for reachability queries in very large graphs. VLDB J. 21(4), 509\u2013534 (2012)","DOI":"10.1007\/s00778-011-0256-4"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, C., Bonifati, A., \u00d6zsu, M.T.: An overview of reachability indexes on graphs. In: Companion of the 2023 International Conference on Management of Data, SIGMOD\/PODS 2023, pp. 61\u201368. ACM (2023)","DOI":"10.1145\/3555041.3589408"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Yu, J.X., Qin, L., Chang, L., Lin, X.: I\/O efficient: computing SCCs in massive graphs. In: SIGMOD Conference, pp. 181\u2013192 (2013)","DOI":"10.1145\/2463676.2463703"},{"issue":"2","key":"4_CR53","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00778-018-0495-8","volume":"27","author":"J Zhou","year":"2018","unstructured":"Zhou, J., Yu, J.X., Li, N., Wei, H., Chen, Z., Tang, X.: Accelerating reachability query processing based on DAG reduction. VLDB J. 27(2), 271\u2013296 (2018)","journal-title":"VLDB J."},{"key":"4_CR54","volume-title":"Fast reachability queries answering based on RCN reduction","author":"J Zhou","year":"2023","unstructured":"Zhou, J., Yu, J.X., Qiu, Y., Tang, X., Chen, Z., Du, M.: Fast reachability queries answering based on RCN reduction. IEEE Trans. Knowl, Data Eng (2023)"},{"key":"4_CR55","doi-asserted-by":"crossref","unstructured":"Zhou, J., Zhou, S., Yu, J.X., Wei, H., Chen, Z., Tang, X.: Dag reduction: fast answering reachability queries. In: SIGMOD Conference, pp. 375\u2013390 (2017)","DOI":"10.1145\/3035918.3035927"},{"key":"4_CR56","doi-asserted-by":"crossref","unstructured":"Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: A total order approach, pp. 1323\u20131334 (2014)","DOI":"10.1145\/2588555.2612181"}],"container-title":["Lecture Notes in Computer Science","Data Science: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8295-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:47:29Z","timestamp":1750355249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8295-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819682942","9789819682959"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8295-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}