{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:05Z","timestamp":1750307345721,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,24]],"date-time":"2011-07-24T00:00:00Z","timestamp":1311465600000},"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":[[2011,7,24]]},"DOI":"10.1145\/2009916.2010099","type":"proceedings-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T14:09:37Z","timestamp":1311689377000},"page":"1161-1162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Recommending interesting activity-related local entities"],"prefix":"10.1145","author":[{"given":"Jie","family":"Tang","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryen W.","family":"White","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Bailey","sequence":"additional","affiliation":[{"name":"Microsoft Bing, Bellevue, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Maximal flow through a network. Canadian Journal of Mathematics, 399--404","author":"Ford L.R.","year":"1956","unstructured":"Ford , L.R. and Fulkerson , D.R . ( 1956 ). Maximal flow through a network. Canadian Journal of Mathematics, 399--404 . Ford, L.R. and Fulkerson, D.R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 399--404."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658810701626186"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458145"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076107"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242576"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367798.1367812"}],"event":{"name":"SIGIR '11: The 34th International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"SIGIR '11"},"container-title":["Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2009916.2010099","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2009916.2010099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:29Z","timestamp":1750244789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2009916.2010099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,24]]},"references-count":6,"alternative-id":["10.1145\/2009916.2010099","10.1145\/2009916"],"URL":"https:\/\/doi.org\/10.1145\/2009916.2010099","relation":{},"subject":[],"published":{"date-parts":[[2011,7,24]]},"assertion":[{"value":"2011-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}