{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:32:37Z","timestamp":1767652357462,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T00:00:00Z","timestamp":1473638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP140103256, DP140101587, DE140100275"],"award-info":[{"award-number":["DP140103256, DP140101587, DE140100275"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,9,12]]},"DOI":"10.1145\/2970398.2970404","type":"proceedings-article","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T14:28:57Z","timestamp":1473431337000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient and Effective Higher Order Proximity Modeling"],"prefix":"10.1145","author":[{"given":"Xiaolu","family":"Lu","sequence":"first","affiliation":[{"name":"RMIT University, Melbourne, Australia"}]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}]},{"given":"J. Shane","family":"Culpepper","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2016,9,12]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767728"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348408"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009998"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094072.2094077"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148285"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/188490.188589"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-7557-6_14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(99)00017-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312664"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063873"},{"key":"e_1_3_2_1_12_1","first-page":"131","volume-title":"Proc. TREC","author":"Hawking D.","year":"1995","unstructured":"D. Hawking and P. Thistlewaite . Proximity operators: So near and yet so far . In Proc. TREC , pages 131 -- 143 , 1995 . D. Hawking and P. Thistlewaite. Proximity operators: So near and yet so far. In Proc. TREC, pages 131--143, 1995."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.03.007"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661894"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559168"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/1532-2890(2000)9999:9999%3C::AID-ASI1075%3E3.3.CO;2-R"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277891"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806467"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571994"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2037661.2037662"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321478"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076115"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277937"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291008"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1757788.1757808"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630270302"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. TREC","author":"Robertson S. E.","year":"1994","unstructured":"S. E. Robertson , S. Walker , S. Jones , M. Hancock-Beaulieu , and M. Gatford . Okapi at TREC-3 . In Proc. TREC , 1994 . S. E. Robertson, S. Walker, S. Jones, M. Hancock-Beaulieu, and M. Gatford. Okapi at TREC-3. In Proc. TREC, 1994."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793274.1793317"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835477"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277794"},{"key":"e_1_3_2_1_33_1","first-page":"40","volume-title":"Proc. SIGIR 2012 Wrkshp. Open Source Inf. Retr.","author":"Trotman A.","year":"2012","unstructured":"A. Trotman , X. Jia , and M. Crane . Towards an efficient and effective search engine . In Proc. SIGIR 2012 Wrkshp. Open Source Inf. Retr. , pages 40 -- 47 , 2012 . A. Trotman, X. Jia, and M. Crane. Towards an efficient and effective search engine. In Proc. SIGIR 2012 Wrkshp. Open Source Inf. Retr., pages 40--47, 2012."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2682862.2682863"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1457561"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009941"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"ICTIR '16: ACM SIGIR International Conference on the Theory of Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Newark Delaware USA","acronym":"ICTIR '16"},"container-title":["Proceedings of the 2016 ACM International Conference on the Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970398.2970404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2970398.2970404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:40:07Z","timestamp":1750218007000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970398.2970404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,12]]},"references-count":35,"alternative-id":["10.1145\/2970398.2970404","10.1145\/2970398"],"URL":"https:\/\/doi.org\/10.1145\/2970398.2970404","relation":{},"subject":[],"published":{"date-parts":[[2016,9,12]]},"assertion":[{"value":"2016-09-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}