{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:26:38Z","timestamp":1767093998469,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,1,6]]},"DOI":"10.1145\/3772290.3772316","type":"proceedings-article","created":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:18Z","timestamp":1767093858000},"page":"138-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Precise and Closed-Form Solution for Edge-Ranking"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9679-9971","authenticated-orcid":false,"given":"Prajjwal","family":"Nijhara","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Jodhpur, Jodhpur, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9795-724X","authenticated-orcid":false,"given":"Jainan","family":"Tandel","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Bombay, Mumbai, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9907-7898","authenticated-orcid":false,"given":"Rohit","family":"Prajapati","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Jodhpur, Jodhpur, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0476-1224","authenticated-orcid":false,"given":"Dip Sankar","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Jodhpur, Jodhpur, India"}]}],"member":"320","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Djihad Arrar Nadjet Kamel and Abdelaziz Lakhfif. 2024. A comprehensive survey of link prediction methods: D. Arrar et al.The journal of supercomputing 80 3 (2024) 3902\u20133942.","DOI":"10.1007\/s11227-023-05591-8"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"crossref","unstructured":"Hung-Hsuan Chen and C\u00a0Lee Giles. 2015. ASCOS++ an asymmetric similarity measure for weighted networks to address the problem of simrank. ACM Transactions on Knowledge Discovery from Data (TKDD) 10 2 (2015) 1\u201326.","DOI":"10.1145\/2776894"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Daniel Fogaras and Balazs Racz. 2007. Practical algorithms and lower bounds for similarity search in massive graphs. IEEE transactions on knowledge and Data Engineering 19 5 (2007) 585\u2013598.","DOI":"10.1109\/TKDE.2007.1008"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_3_1_9_2","first-page":"937","volume-title":"Proceedings of the VLDB Endowment","volume":"8","author":"Jiang Minhao","year":"2015","unstructured":"Minhao Jiang, Ada Wai-Chee Fu, Raymond Chi-Wing Wong, and Ke Xu. 2015. READS: a random walk approach for efficient and accurate dynamic SimRank. In Proceedings of the VLDB Endowment , Vol.\u00a08. VLDB Endowment, 937\u2013948."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.109"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Dmitry Lizorkin Pavel Velikhov Maxim Grinev and Denis Turdakov. 2008. Accuracy estimate and optimization techniques for simrank computation. Proceedings of the VLDB Endowment 1 1 (2008) 422\u2013433.","DOI":"10.14778\/1453856.1453904"},{"key":"e_1_3_3_1_13_2","first-page":"847","volume-title":"Proceedings of the VLDB Endowment","volume":"7","author":"Shao Yingxia","year":"2014","unstructured":"Yingxia Shao, Bin Chen, Junjie Ma, and Bin Cui. 2014. Efficient top-k SimRank-based similarity join. In Proceedings of the VLDB Endowment , Vol.\u00a07. VLDB Endowment, 847\u2013858."},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Weiren Yu Xuemin Lin Wenjie Zhang and Julie\u00a0A McCann. 2014. Fast all-pairs SimRank assessment on large graphs and bipartite domains. IEEE Transactions on Knowledge and Data Engineering 27 7 (2014) 1810\u20131823.","DOI":"10.1109\/TKDE.2014.2339828"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Weiren Yu Xuemin Lin Wenjie Zhang Jian Pei and Julie\u00a0A McCann. 2019. SimRank*: Effective and scalable pairwise similarity search based on graph topology. The VLDB Journal 28 (2019) 401\u2013426.","DOI":"10.1007\/s00778-018-0536-3"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Weiren Yu and Julie\u00a0A McCann. 2015. Efficient partial-pairs simrank search on large networks. Proceedings of the VLDB Endowment 8 5 (2015) 569\u2013580.","DOI":"10.14778\/2735479.2735489"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646025"}],"event":{"name":"ICDCN 2026: 27th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2026","location":"Nara Japan"},"container-title":["Proceedings of the 27th International Conference on Distributed Computing and Networking"],"original-title":[],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:25Z","timestamp":1767093865000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772290.3772316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":17,"alternative-id":["10.1145\/3772290.3772316","10.1145\/3772290"],"URL":"https:\/\/doi.org\/10.1145\/3772290.3772316","relation":{},"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"2026-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}