{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:45:07Z","timestamp":1783035907034,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T00:00:00Z","timestamp":1699660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3581784.3607110","type":"proceedings-article","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T20:34:48Z","timestamp":1698698088000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["PeeK: A Prune-Centric Approach for K Shortest Path Computation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5960-7584","authenticated-orcid":false,"given":"Wang","family":"Feng","sequence":"first","affiliation":[{"name":"University of North Texas, Denton, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-7865","authenticated-orcid":false,"given":"Shiyang","family":"Chen","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6323-7388","authenticated-orcid":false,"given":"Hang","family":"Liu","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2419-6592","authenticated-orcid":false,"given":"Yuede","family":"Ji","sequence":"additional","affiliation":[{"name":"University of North Texas, Denton, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,11]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"[n. d.]. Block indirect sort algorithm. https:\/\/www.boost.org\/doc\/libs\/1_81_0\/libs\/sort\/doc\/html\/sort\/parallel.html#sort.parallel.block_indirect_sort."},{"key":"e_1_3_2_2_2_1","unstructured":"[n. d.]. Distributed Sorting Algorithms. https:\/\/brunomaga.github.io\/Distributed-Sort."},{"key":"e_1_3_2_2_3_1","unstructured":"[n. d.]. Graph500: reference implementations. https:\/\/github.com\/graph500\/graph500."},{"key":"e_1_3_2_2_4_1","unstructured":"[n. d.]. Texas Advanced Computing Center. https:\/\/www.tacc.utexas.edu."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225075"},{"key":"e_1_3_2_2_6_1","volume-title":"SEA 2020-18th International Symposium on Experimental Algorithms","volume":"160","author":"Zoobi Ali Al","year":"2020","unstructured":"Ali Al Zoobi, David Coudert, and Nicolas Nisse. 2020. Space and time trade-off for the k shortest simple paths problem. In SEA 2020-18th International Symposium on Experimental Algorithms, Vol. 160. 13."},{"key":"e_1_3_2_2_7_1","volume-title":"Finding the k Shortest Simple Paths: Time and Space trade-offs. Ph. D. Dissertation. Inria","author":"Zoobi Ali Al","unstructured":"Ali Al Zoobi, David Coudert, and Nicolas Nisse. 2021. Finding the k Shortest Simple Paths: Time and Space trade-offs. Ph. D. Dissertation. Inria; I3S, Universit\u00e9 C\u00f4te d'Azur."},{"key":"e_1_3_2_2_8_1","volume-title":"Spacex non-geostationary satellite system: Attachment a technical information to supplement schedules. US Fed. Commun. Comm","author":"Albulet M","year":"2016","unstructured":"M Albulet. 2016. Spacex non-geostationary satellite system: Attachment a technical information to supplement schedules. US Fed. Commun. Comm., Washington, DC, USA, Rep. SAT-OA-20161115-00118 (2016)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_2_11_1","volume-title":"The GAP benchmark suite. arXiv preprint arXiv:1508.03619","author":"Beamer Scott","year":"2015","unstructured":"Scott Beamer, Krste Asanovi\u0107, and David Patterson. 2015. The GAP benchmark suite. arXiv preprint arXiv:1508.03619 (2015)."},{"key":"e_1_3_2_2_13_1","volume-title":"Learning Dynamic Coherence with Graph Attention Network for Biomedical Entity Linking. In 2021 International Joint Conference on Neural Networks (IJCNN). IEEE, 1--8.","author":"Bo Mumeng","year":"2021","unstructured":"Mumeng Bo and Meihui Zhang. 2021. Learning Dynamic Coherence with Graph Attention Network for Biomedical Entity Linking. In 2021 International Joint Conference on Neural Networks (IJCNN). IEEE, 1--8."},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the 23rd International Symposium on Research in Attacks, Intrusions and Defenses (RAID).","author":"Bowman Benjamin","unstructured":"Benjamin Bowman, Craig Laprade, Yuede Ji, and H. Howie Huang. 2020. Detecting Lateral Movement in Enterprise Computer Networks with Unsupervised Graph AI. In Proceedings of the 23rd International Symposium on Research in Attacks, Intrusions and Defenses (RAID)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584053"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-014-0330-9"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598054"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526057"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314598"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Edsger W Dijkstra. 2022. A note on two problems in connexion with graphs. In Edsger Wybe Dijkstra: His Life Work and Legacy. 287--290.","DOI":"10.1145\/3544585.3544600"},{"key":"e_1_3_2_2_23_1","series-title":"SIAM Journal on computing 28, 2","volume-title":"Finding the k shortest paths","author":"Eppstein David","year":"1998","unstructured":"David Eppstein. 1998. Finding the k shortest paths. SIAM Journal on computing 28, 2 (1998), 652--673."},{"key":"e_1_3_2_2_24_1","volume-title":"Stopping the cyberattack in the early stage: assessing the security risks of social network users. Security and Communication Networks 2019","author":"Feng Bo","year":"2019","unstructured":"Bo Feng, Qiang Li, Yuede Ji, Dong Guo, and Xiangyu Meng. 2019. Stopping the cyberattack in the early stage: assessing the security risks of social network users. Security and Communication Networks 2019 (2019)."},{"key":"e_1_3_2_2_25_1","first-page":"6","article-title":"Finding k Shortest Simple Paths in Directed Graphs","volume":"64","author":"Feng Gang","year":"2014","unstructured":"Gang Feng. 2014. Finding k Shortest Simple Paths in Directed Graphs: A Node Classification Algorithm. Networks 64, 1 (2014), 6--17.","journal-title":"A Node Classification Algorithm. Networks"},{"key":"e_1_3_2_2_26_1","unstructured":"Rod Fleck. 2019. Application of Kuiper Systems LLC for Authority to Launch and Operate a Non-Geostationary Satellite Orbit System in Ka-band Frequencies."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3502181.3531467"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288320"},{"key":"e_1_3_2_2_29_1","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Giuliari Giacomo","year":"2021","unstructured":"Giacomo Giuliari, Tommaso Ciussani, Adrian Perrig, and Ankit Singla. 2021. {ICARUS}: Attacking low earth orbit satellite networks. In 2021 USENIX Annual Technical Conference (USENIX ATC 21). 317--331."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.12.015"},{"key":"e_1_3_2_2_31_1","volume-title":"Parallel prefix sum (scan) with CUDA. GPU gems 3, 39","author":"Harris Mark","year":"2007","unstructured":"Mark Harris, Shubhabrata Sengupta, and John D Owens. 2007. Parallel prefix sum (scan) with CUDA. GPU gems 3, 39 (2007), 851--876."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00013"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1177\/1550147717694170"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359582"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/320998.321004"},{"key":"e_1_3_2_2_37_1","volume-title":"BugGraph: Differentiating Source-Binary Code Similarity with Graph Triplet-Loss Network. In 16th ACM ASIA Conference on Computer and Communications Security (AsiaCCS).","author":"Ji Yuede","unstructured":"Yuede Ji, Lei Cui, and H. Howie Huang. 2021. BugGraph: Differentiating Source-Binary Code Similarity with Graph Triplet-Loss Network. In 16th ACM ASIA Conference on Computer and Communications Security (AsiaCCS)."},{"key":"e_1_3_2_2_38_1","volume-title":"BugGraph: Differentiating Source-Binary Code Similarity with Graph Triplet-Loss Network. In 16th ACM ASIA Conference on Computer and Communications Security (ASIACCS).","author":"Ji Yuede","unstructured":"Yuede Ji, Lei Cui, and H. Howie Huang. 2021. BugGraph: Differentiating Source-Binary Code Similarity with Graph Triplet-Loss Network. In 16th ACM ASIA Conference on Computer and Communications Security (ASIACCS)."},{"key":"e_1_3_2_2_39_1","volume-title":"Vestige: Identifying Binary Code Provenance for Vulnerability Detection. In International Conference on Applied Cryptography and Network Security (ACNS). Springer, 287--310","author":"Ji Yuede","year":"2021","unstructured":"Yuede Ji, Lei Cui, and H Howie Huang. 2021. Vestige: Identifying Binary Code Provenance for Vulnerability Detection. In International Conference on Applied Cryptography and Network Security (ACNS). Springer, 287--310."},{"key":"e_1_3_2_2_40_1","volume-title":"DEFInit: An Analysis of Exposed Android Init Routines. In 30th USENIX Security Symposium (USENIX Security).","author":"Ji Yuede","year":"2021","unstructured":"Yuede Ji, Mohamed Elsabagh, Ryan Johnson, and Angelos Stavrou. 2021. DEFInit: An Analysis of Exposed Android Init Routines. In 30th USENIX Security Symposium (USENIX Security)."},{"key":"e_1_3_2_2_41_1","volume-title":"Combating the evasion mechanisms of social bots. Computers & Security","author":"Ji Yuede","year":"2016","unstructured":"Yuede Ji, Yukun He, Xinyang Jiang, Jian Cao, and Qiang Li. 2016. Combating the evasion mechanisms of social bots. Computers & Security (2016)."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/PADSW.2014.7097824"},{"key":"e_1_3_2_2_43_1","volume-title":"International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE, 731--742","author":"Ji Yuede","unstructured":"Yuede Ji, Hang Liu, and H. Howie Huang. 2018. iSpan: Parallel Identification of Strongly Connected Components with Spanning Trees. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE, 731--742."},{"key":"e_1_3_2_2_44_1","volume-title":"SwarmGraph: Analyzing Large-Scale In-Memory Graphs on GPUs. In International Conference on High Performance Computing and Communications (HPCC). IEEE.","author":"Ji Yuede","unstructured":"Yuede Ji, Hang Liu, and H. Howie Huang. 2020. SwarmGraph: Analyzing Large-Scale In-Memory Graphs on GPUs. In International Conference on High Performance Computing and Communications (HPCC). IEEE."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2010.5534599"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_2_47_1","volume-title":"27th International Symposium on Algorithms and Computation","author":"Kurz Denis","year":"2016","unstructured":"Denis Kurz and Petra Mutzel. 2016. A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph. 27th International Symposium on Algorithms and Computation (2016)."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833179.2833188"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.7.401"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1002\/prot.24993"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0033393"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.106"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2014.37"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00227"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767844"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICINIS.2008.147"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2834882.2834886"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457313"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.04.002"},{"key":"e_1_3_2_2_61_1","unstructured":"Robert Sedgewick. 2001. Algorithms in C part 5: graph algorithms. Pearson Education."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts212"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.04.103"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470406"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316548"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1364\/NFOEC.2011.JWA055"},{"key":"e_1_3_2_2_67_1","volume-title":"Packed compressed sparse row: A dynamic graph representation. In 2018 IEEE High Performance extreme Computing Conference (HPEC)","author":"Wheatman Brian","unstructured":"Brian Wheatman and Helen Xu. 2018. Packed compressed sparse row: A dynamic graph representation. In 2018 IEEE High Performance extreme Computing Conference (HPEC). IEEE, 1--7."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976472.3"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.44"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5477"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606611"}],"event":{"name":"SC '23: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver CO USA","acronym":"SC '23","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3581784.3607110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:23Z","timestamp":1750178183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,11]]},"references-count":71,"alternative-id":["10.1145\/3581784.3607110","10.1145\/3581784"],"URL":"https:\/\/doi.org\/10.1145\/3581784.3607110","relation":{},"subject":[],"published":{"date-parts":[[2023,11,11]]},"assertion":[{"value":"2023-11-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}