{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:20:20Z","timestamp":1765545620213,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[[2010,7,25]]},"DOI":"10.1145\/1835804.1835937","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"1059-1068","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":146,"title":["Finding effectors in social networks"],"prefix":"10.1145","author":[{"given":"Theodoros","family":"Lappas","sequence":"first","affiliation":[{"name":"UC Riverside, Riverside, USA"}]},{"given":"Evimaria","family":"Terzi","sequence":"additional","affiliation":[{"name":"Boston University, Boston, USA"}]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[{"name":"University of Athens, Athens, Greece"}]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341559"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.02.003"},{"key":"e_1_3_2_2_3_1","first-page":"306","volume-title":"WINE","author":"Bharathi S.","year":"2007","unstructured":"S. Bharathi , D. Kempe , and M. Salek . Competitive influence maximization in social networks . In WINE , pages 306 -- 311 , 2007 . S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In WINE, pages 306--311, 2007."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284680.1284681"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1042"},{"key":"e_1_3_2_2_6_1","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"Chu Y.","year":"1965","unstructured":"Y. Chu and T. Liu . On the shortest arborescence of a directed graph . Science Sinica , 14 : 1396 -- 1400 , 1965 . Y. Chu and T. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396--1400, 1965.","journal-title":"Science Sinica"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065191"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"e_1_3_2_2_11_1","volume-title":"Using complex systems analysis to advance marketing theory development","author":"Goldenberg J.","year":"2001","unstructured":"J. Goldenberg , B. Libai , and E. Muller . Using complex systems analysis to advance marketing theory development . Academy of Marketing Science Review , 2001 . J. Goldenberg, B. Libai, and E. Muller. Using complex systems analysis to advance marketing theory development. Academy of Marketing Science Review, 2001."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1046456.1046462"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_14_1","volume-title":"UAI","author":"Koivisto M.","year":"2006","unstructured":"M. Koivisto . Advances in exact bayesian structure discovery in bayesian networks . In UAI , 2006 . M. Koivisto. Advances in exact bayesian structure discovery in bayesian networks. In UAI, 2006."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150433"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.103"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516442"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014138"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00021-1"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523690"}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Washington DC USA","acronym":"KDD '10"},"container-title":["Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835804.1835937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:09:03Z","timestamp":1750248543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":21,"alternative-id":["10.1145\/1835804.1835937","10.1145\/1835804"],"URL":"https:\/\/doi.org\/10.1145\/1835804.1835937","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}