{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:31Z","timestamp":1760245051418,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Intel the Israel Innovation Authority"},{"name":"Israel Science Foundation"},{"name":"European Research Council under the FP7 ERC grant MoDaS agreement 291071"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3269212","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"1919-1922","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["IM Balanced"],"prefix":"10.1145","author":[{"given":"Shay","family":"Gershtein","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Tova","family":"Milo","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Brit","family":"Youngmann","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Gal","family":"Zeevi","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"volume-title":"https:\/\/aminer.org\/data","year":"2018","author":"Miner Miner","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Chayes J. Borgs C. Brautbar M. and Lucier B. 2014. Maximizing Social Influence in Nearly Optimal Time. In SODA.   Chayes J. Borgs C. Brautbar M. and Lucier B. 2014. Maximizing Social Influence in Nearly Optimal Time. In SODA.","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_3_2_1_3_1","unstructured":"Straszak D. Celis L E. and Vishnoi N K. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 (2017).  Straszak D. Celis L E. and Vishnoi N K. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 (2017)."},{"volume":"201","journal-title":"Stoyanovich J.","author":"Pitoura E. Drosou M., Jagadish","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269212"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_8_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014).  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794376"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983724"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_3_2_1_12_1","unstructured":"Gomez R. M. Zafar M. B. Valera I. and Gummadi K. P. 2017. Fairness constraints: Mechanisms for fair classification. arXiv preprint arXiv:1507.05259 (2017).  Gomez R. M. Zafar M. B. Valera I. and Gummadi K. P. 2017. Fairness constraints: Mechanisms for fair classification. arXiv preprint arXiv:1507.05259 (2017)."},{"key":"e_1_3_2_1_13_1","unstructured":"Castillo C. Hajian S. Megahed M. Zehlike M Bonchi F. and Baeza-Yates R. 2017. Fa* ir: A fair top-k ranking algorithm. In CIKM. ACM.  Castillo C. Hajian S. Megahed M. Zehlike M Bonchi F. and Baeza-Yates R. 2017. Fa* ir: A fair top-k ranking algorithm. In CIKM. ACM."}],"event":{"name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Torino Italy","acronym":"CIKM '18"},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269212","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3269212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:19Z","timestamp":1750207459000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269212"}},"subtitle":["Influence Maximization Under Balance Constraints"],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":13,"alternative-id":["10.1145\/3269206.3269212","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3269212","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}