{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T01:38:59Z","timestamp":1772933939453,"version":"3.50.1"},"reference-count":59,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,8]]},"DOI":"10.1109\/bigdata66926.2025.11402111","type":"proceedings-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:57:57Z","timestamp":1772830677000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["GraphRouter: Adaptive Acyclic $k$\u2014Path Counting with High Precision"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-4159-5467","authenticated-orcid":false,"given":"Yongming","family":"Yi","sequence":"first","affiliation":[{"name":"National University of Defense Technology,Dept. Key Laboratory of High-end Equipment Digitalization Software,Changsha,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6489-5757","authenticated-orcid":false,"given":"Yuyang","family":"Peng","sequence":"additional","affiliation":[{"name":"Independent Researcher (Unaffiliated)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiejun","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Defense Technology,Dept. Computer Research Institute,Changsha,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongxu","family":"Jin","sequence":"additional","affiliation":[{"name":"Zunyi Normal University,Dept. College of Computer Science,Guizhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3622-1772","authenticated-orcid":false,"given":"Xinbiao","family":"Gan","sequence":"additional","affiliation":[{"name":"National University of Defense Technology,Dept. Key Laboratory of High-end Equipment Digitalization Software,Changsha,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2020.3035706"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(82)90044-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_52"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055502"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988727"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2011.58"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.73.026120"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2012.2234508"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2014.2314858"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36136-7_40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11269-0_1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1798596.1798607"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188902"},{"key":"ref16","article-title":"Approximate counting of k-paths: Deterministic and in polynomial space","author":"Bj\u00f6rklund","year":"2019","journal-title":"Int. Colloq. Automata, Languages Program."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96193-4_1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.107005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/adfm.202201437"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/754"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.2002.1181978"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/20M1383811"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3153168"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.032"},{"key":"ref25","article-title":"Path-based algebraic foundations of graph query languages","author":"Angles","year":"2024","journal-title":"arXiv preprint"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412757"},{"key":"ref27","first-page":"440","article-title":"Watts, duncan j.\/strogatz, steven h. (1998). collective dynamics of small- world networks","volume":"393","author":"Lietz","year":"2018","journal-title":"nature"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-024-05119-8"},{"key":"ref29","first-page":"57","volume-title":"Small world phenomena","author":"M.","year":"2018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2018.2889473"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2020.12.003"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2015.2424425"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_26"},{"key":"ref35","volume-title":"Snap datasets: stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127221"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.02.054"},{"key":"ref39","first-page":"1080","article-title":"A tight lower bound for counting hamiltonian cycles via matrix rank","volume-title":"Proc. 58th Annu. IEEE Symp. Found. Comput. Sci.","author":"Curticapeay","year":"2017"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3531267"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2022.3219399"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.09.034"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1038\/s41596-018-0103-9"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0195-3"},{"key":"ref45","article-title":"The simple, little and slow things count: on parameterized counting complexity","volume":"120","author":"Curticapean","year":"2015","journal-title":"Bull. EATCS"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3100785"},{"key":"ref47","first-page":"160","article-title":"GraphCube: Interconnection hierarchy-aware graph processing","volume-title":"Proc. 29th ACM SIGPLAN Annu. Symp. Principles Pract. Parallel Program. (PPOPP 2024)","author":"Xinbiao","year":"2024"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3676846"},{"key":"ref49","first-page":"1785","article-title":"TianheEngine: Hierarchy-aware adaptive partitioning system for trillion-scale graph processing","volume-title":"Proc. Int. Conf. High Perform. Comput. Networking, Storage Anal. (SC \u201925)","author":"Xinbiao","year":"2025"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3750450"},{"key":"ref51","article-title":"GraphCSR: A space and time-efficient sparse matrix representation for web-scale graph processing","author":"Xinbiao","year":"2025","journal-title":"World Wide Web"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3689341"},{"key":"ref53","article-title":"GraphCom: Communication hierarchyaware graph engine for distributed model training","author":"Xinbiao","year":"2025","journal-title":"World Wide Web"},{"key":"ref54","first-page":"11918","article-title":"GraphWorld: Ultra-fast graph engine for world-wide web searching","volume-title":"Proc. 33rd ACM Int. Conf. Multimedia (MM \u201925)","author":"Xinbiao","year":"2025"},{"key":"ref55","article-title":"XTree: Traversal-based partitioning for extreme-scale graph processing on supercomputers","volume-title":"Proc. IEEE Int. Conf. Data Eng.","author":"Xinbiao","year":"2022"},{"key":"ref56","first-page":"8984","article-title":"GraphMedia: Communicationbalanced graph searching for billion-scale social media access","volume-title":"Proc. ACM Int. Conf. Multimedia","author":"Xinbiao","year":"2023"},{"key":"ref57","first-page":"8984","article-title":"GraphMedia: Communicationbalanced graph searching for billion-scale social media access","volume-title":"Proc. ACM Int. Conf. Multimedia","author":"Xinbiao","year":"2023"},{"key":"ref58","first-page":"158","article-title":"SuperCSR: A space-time-efficient CSR representation for large-scale graph applications on supercomputers","volume-title":"Proc. Int. Conf. Parallel Process.","author":"Xinbiao","year":"2024"},{"key":"ref59","first-page":"240","article-title":"FT-topo: Architecture-driven folded-triangle partitioning for communication-efficient graph processing","volume-title":"Proc. ACM Int. Conf. Supercomput.","author":"Xinbiao","year":"2023"}],"event":{"name":"2025 IEEE International Conference on Big Data (BigData)","location":"Macau, China","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,11]]}},"container-title":["2025 IEEE International Conference on Big Data (BigData)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11400704\/11400712\/11402111.pdf?arnumber=11402111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T06:55:48Z","timestamp":1772866548000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11402111\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":59,"URL":"https:\/\/doi.org\/10.1109\/bigdata66926.2025.11402111","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}