{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:56Z","timestamp":1750306856002,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,3]],"date-time":"2014-07-03T00:00:00Z","timestamp":1404345600000},"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":[[2014,7,3]]},"DOI":"10.1145\/2600428.2609459","type":"proceedings-article","created":{"date-parts":[[2014,7,8]],"date-time":"2014-07-08T12:20:11Z","timestamp":1404822011000},"page":"859-862","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Sig-SR"],"prefix":"10.1145","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[{"name":"Imperial College London, London, United Kingdom"}]},{"given":"Julie A.","family":"McCann","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2014,7,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536349.2536350"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"e_1_3_2_1_6_1","volume-title":"Stanford InfoLab","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd , \" The PageRank citation ranking: Bringing order to the web,\" tech. rep ., Stanford InfoLab , 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd, \"The PageRank citation ranking: Bringing order to the web,\" tech. rep., Stanford InfoLab, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544859"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0168-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-010-0100-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060839"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.109"},{"key":"e_1_3_2_1_12_1","volume-title":"Fast incremental SimRank on link-evolving graphs,\" in ICDE","author":"Yu W.","year":"2014","unstructured":"W. Yu , X. Lin , and W. Zhang , \" Fast incremental SimRank on link-evolving graphs,\" in ICDE , 2014 . W. Yu, X. Lin, and W. Zhang, \"Fast incremental SimRank on link-evolving graphs,\" in ICDE, 2014."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.91"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732221"},{"key":"e_1_3_2_1_15_1","volume-title":"Matrix Analysis and Applied Linear Algebra","author":"Meyer C.","year":"2001","unstructured":"C. Meyer , Matrix Analysis and Applied Linear Algebra . SIAM , Feb. 2001 . C. Meyer, Matrix Analysis and Applied Linear Algebra. SIAM, Feb. 2001."}],"event":{"name":"SIGIR '14: The 37th International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Gold Coast Queensland Australia","acronym":"SIGIR '14"},"container-title":["Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600428.2609459","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600428.2609459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:27Z","timestamp":1750234227000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600428.2609459"}},"subtitle":["SimRank search over singular graphs"],"short-title":[],"issued":{"date-parts":[[2014,7,3]]},"references-count":15,"alternative-id":["10.1145\/2600428.2609459","10.1145\/2600428"],"URL":"https:\/\/doi.org\/10.1145\/2600428.2609459","relation":{},"subject":[],"published":{"date-parts":[[2014,7,3]]},"assertion":[{"value":"2014-07-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}