{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:50:36Z","timestamp":1777614636630,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"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":[[2021,6,9]]},"DOI":"10.1145\/3448016.3459243","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"671-684","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient and Effective Algorithms for Revenue Maximization in Social Advertising"],"prefix":"10.1145","author":[{"given":"Kai","family":"Han","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benwei","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Tang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuang","family":"Cui","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cigdem","family":"Aslay","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laks V.S.","family":"Lakshmanan","sequence":"additional","affiliation":[{"name":"The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741648"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187888"},{"key":"e_1_3_2_2_3_1","volume-title":"Viral marketing: What it is and how to make it work for you. https:\/\/adespresso.com\/blog\/viral-marketing-examples-tips\/ Retrieved","year":"2020","unstructured":"Animalz. 2020. Viral marketing: What it is and how to make it work for you. https:\/\/adespresso.com\/blog\/viral-marketing-examples-tips\/ Retrieved August 12, 2020 from Animalz. 2020. Viral marketing: What it is and how to make it work for you. https:\/\/adespresso.com\/blog\/viral-marketing-examples-tips\/ Retrieved August 12, 2020 from"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137635"},{"key":"e_1_3_2_2_6_1","first-page":"822","article-title":"Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret","volume":"8","author":"dem Aslay C","year":"2015","unstructured":"c C ig dem Aslay , Wei Lu , Francesco Bonchi , Amit Goyal , and Laks V. S. Lakshmanan . 2015 . Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret . Proceedings of the VLDB Endowment , Vol. 8 , 7 (2015), 822 -- 833 . cC igdem Aslay, Wei Lu, Francesco Bonchi, Amit Goyal, and Laks V. S. Lakshmanan. 2015. Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret. Proceedings of the VLDB Endowment, Vol. 8, 7 (2015), 822--833.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.7"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Nicola Barbieri Francesco Bonchi and Giuseppe Manco. 2012. Topic-aware social influence propagation models. In ICDM. 81--90.  Nicola Barbieri Francesco Bonchi and Giuseppe Manco. 2012. Topic-aware social influence propagation models. In ICDM. 81--90.","DOI":"10.1109\/ICDM.2012.122"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397244"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634144"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745853"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839655"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735706"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Chi Wang and Yajun Wang. 2010a. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD. 1029--1038.  Wei Chen Chi Wang and Yajun Wang. 2010a. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD. 1029--1038.","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609592"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505541"},{"key":"e_1_3_2_2_22_1","unstructured":"Gary K. Clark. 2020. 1000 Social Media Marketing Secrets: Viral Advertising and Personal Brand Secrets to Grow Your Business with YouTube Facebook Instagram - Become an Influence with Over One Million Followers .Aprilis Publishing LLC. https:\/\/www.amazon.com\/1000-Social-Media-Marketing-Secrets\/dp\/164745042X  Gary K. Clark. 2020. 1000 Social Media Marketing Secrets: Viral Advertising and Personal Brand Secrets to Grow Your Business with YouTube Facebook Instagram - Become an Influence with Over One Million Followers .Aprilis Publishing LLC. https:\/\/www.amazon.com\/1000-Social-Media-Marketing-Secrets\/dp\/164745042X"},{"key":"e_1_3_2_2_23_1","volume-title":"Werneck","author":"Cohen Edith","year":"2014","unstructured":"Edith Cohen , Daniel Delling , Thomas Pajor , and Renato F . Werneck . 2014 . Sketch-Based Influence Maximization and Computation: Scaling Up with Guarantees. In Proc. ACM CIKM. 629--638. Edith Cohen, Daniel Delling, Thomas Pajor, and Renato F. Werneck. 2014. Sketch-Based Influence Maximization and Computation: Scaling Up with Guarantees. In Proc. ACM CIKM. 629--638."},{"key":"e_1_3_2_2_24_1","volume-title":"Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete applied mathematics","author":"Conforti Michele","year":"1984","unstructured":"Michele Conforti and G\u00e9rard Cornu\u00e9jols . 1984. Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete applied mathematics , Vol. 7 , 3 ( 1984 ), 251--274. Michele Conforti and G\u00e9rard Cornu\u00e9jols. 1984. Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete applied mathematics, Vol. 7, 3 (1984), 251--274."},{"key":"e_1_3_2_2_25_1","unstructured":"Robert Denares. 2020. Instagram Marketing For Viral Influence: Proven Secrets To Build Personal Branding For Business Advertising And 10x Your Followers To Make Money Online: Easy Influencer Guide Beginners Friendly! Independently published. https:\/\/www.amazon.com\/Instagram-Marketing-Viral-Influence-Advertising\/dp\/B086MM2HNP  Robert Denares. 2020. Instagram Marketing For Viral Influence: Proven Secrets To Build Personal Branding For Business Advertising And 10x Your Followers To Make Money Online: Easy Influencer Guide Beginners Friendly! Independently published. https:\/\/www.amazon.com\/Instagram-Marketing-Viral-Influence-Advertising\/dp\/B086MM2HNP"},{"key":"e_1_3_2_2_26_1","volume-title":"How much are brands paying influencers? https:\/\/www.emarketer.com\/content\/how-much-are-brands-paying-influencers Retrieved","author":"Droesch Blake","year":"2019","unstructured":"Blake Droesch . 2019. How much are brands paying influencers? https:\/\/www.emarketer.com\/content\/how-much-are-brands-paying-influencers Retrieved July 16, 2019 from Blake Droesch. 2019. How much are brands paying influencers? https:\/\/www.emarketer.com\/content\/how-much-are-brands-paying-influencers Retrieved July 16, 2019 from"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.55"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882929"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742725"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_3_2_2_31_1","volume-title":"Lakshmanan","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal , Wei Lu , and Laks V.S . Lakshmanan . 2011 b. CELF+: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks. In Proc. WWW Companion . 47--48. Amit Goyal, Wei Lu, and Laks V.S. Lakshmanan. 2011b. CELF+: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks. In Proc. WWW Companion. 47--48."},{"key":"e_1_3_2_2_32_1","volume-title":"Lakshmanan","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal , Wei Lu , and Laks V. S . Lakshmanan . 2011 c. SIMPATH : An Efficient Algorithm for Influence Maximization Under the Linear Threshold Model. In Proc. IEEE ICDM. 211--220. Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011c. SIMPATH: An Efficient Algorithm for Influence Maximization Under the Linear Threshold Model. In Proc. IEEE ICDM. 211--220."},{"key":"e_1_3_2_2_33_1","volume-title":"Reynold CK Cheng, and Laks VS Lakshmanan","author":"Grubenmann Tobias","year":"2020","unstructured":"Tobias Grubenmann , Reynold CK Cheng, and Laks VS Lakshmanan . 2020 . TSA : A truthful mechanism for social advertising. In Web Search and Data Mining (WSDM) . 214--222. Tobias Grubenmann, Reynold CK Cheng, and Laks VS Lakshmanan. 2020. TSA: A truthful mechanism for social advertising. In Web Search and Data Mining (WSDM). 214--222."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389740"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213883"},{"key":"e_1_3_2_2_37_1","volume-title":"A social networks approach to viral advertising: The role of primary, contextual, and low influencers. Social Media+Society","author":"Himelboim Itai","year":"2019","unstructured":"Itai Himelboim and Guy J Golan . 2019. A social networks approach to viral advertising: The role of primary, contextual, and low influencers. Social Media+Society , Vol. 5 , 3 ( 2019 ), 2056305119847516. Itai Himelboim and Guy J Golan. 2019. A social networks approach to viral advertising: The role of primary, contextual, and low influencers. Social Media+Society, Vol. 5, 3 (2019), 2056305119847516."},{"key":"e_1_3_2_2_38_1","volume-title":"2020 a. Efficient Approximation Algorithms for Adaptive Influence Maximization. The VLDB Journal","author":"Huang Keke","year":"2020","unstructured":"Keke Huang , Jing Tang , Kai Han , Xiaokui Xiao , Wei Chen , Aixin Sun , Xueyan Tang , and Andrew Lim . 2020 a. Efficient Approximation Algorithms for Adaptive Influence Maximization. The VLDB Journal ( 2020 ). Keke Huang, Jing Tang, Kai Han, Xiaokui Xiao, Wei Chen, Aixin Sun, Xueyan Tang, and Andrew Lim. 2020 a. Efficient Approximation Algorithms for Adaptive Influence Maximization. The VLDB Journal (2020)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00062"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"e_1_3_2_2_41_1","unstructured":"Andrew Hutchinson. 2016. Facebook adds new tools to amplify word-of-mouth recommendations boost response. https:\/\/www.socialmediatoday.com\/social-business\/facebook-adds-new-tools-amplify-word-mouth-recommendations-boost-response Retrieved October 19 2016 from  Andrew Hutchinson. 2016. Facebook adds new tools to amplify word-of-mouth recommendations boost response. https:\/\/www.socialmediatoday.com\/social-business\/facebook-adds-new-tools-amplify-word-mouth-recommendations-boost-response Retrieved October 19 2016 from"},{"key":"e_1_3_2_2_42_1","volume-title":"Doing more to support creators on instagram. https:\/\/about.instagram.com\/blog\/announcements\/supporting-creators-on-instagram Retrieved","year":"2020","unstructured":"Instagram. 2020. Doing more to support creators on instagram. https:\/\/about.instagram.com\/blog\/announcements\/supporting-creators-on-instagram Retrieved May 27, 2020 from Instagram. 2020. Doing more to support creators on instagram. https:\/\/about.instagram.com\/blog\/announcements\/supporting-creators-on-instagram Retrieved May 27, 2020 from"},{"key":"e_1_3_2_2_44_1","volume-title":"Bilmes","author":"Iyer Rishabh K.","year":"2013","unstructured":"Rishabh K. Iyer and Jeff A . Bilmes . 2013 . Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints. In Proc. NIPS. 2436--2444. Rishabh K. Iyer and Jeff A. Bilmes. 2013. Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints. In Proc. NIPS. 2436--2444."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon M. Kleinberg and \u00c9 va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD. 137--146.  David Kempe Jon M. Kleinberg and \u00c9 va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD. 137--146.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.60"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2580063"},{"key":"e_1_3_2_2_50_1","unstructured":"Paige Leskin. 2020. Instagram will let influencers make money off ads on IGTV content following in the footsteps of YouTube's revenue-sharing model. https:\/\/www.businessinsider.com\/instagram-influencers-monetize-igtv-ads-revenue-sharing-content-creators-badges-2020--5 Retrieved May 28 2020 from  Paige Leskin. 2020. Instagram will let influencers make money off ads on IGTV content following in the footsteps of YouTube's revenue-sharing model. https:\/\/www.businessinsider.com\/instagram-influencers-monetize-igtv-ads-revenue-sharing-content-creators-badges-2020--5 Retrieved May 28 2020 from"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_2_52_1","volume-title":"SNAP datasets: Stanford large network dataset collection. URL: http:\/\/snap.stanford.edu\/","author":"Leskovec Jure","year":"2014","unstructured":"Jure Leskovec and Andrej Krevl . 2014. SNAP datasets: Stanford large network dataset collection. URL: http:\/\/snap.stanford.edu\/ ( 2014 ). Jure Leskovec and Andrej Krevl. 2014. SNAP datasets: Stanford large network dataset collection. URL: http:\/\/snap.stanford.edu\/ (2014)."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1080\/00913367.2020.1795758"},{"key":"e_1_3_2_2_54_1","volume-title":"Everything you need to know about facebook sponsored stories. https:\/\/www.jonloomer.com\/facebook-sponsored-stories\/ Retrieved","author":"Loomer Jon","year":"2013","unstructured":"Jon Loomer . 2013. Everything you need to know about facebook sponsored stories. https:\/\/www.jonloomer.com\/facebook-sponsored-stories\/ Retrieved June 3, 2013 from Jon Loomer. 2013. Everything you need to know about facebook sponsored stories. https:\/\/www.jonloomer.com\/facebook-sponsored-stories\/ Retrieved June 3, 2013 from"},{"key":"e_1_3_2_2_55_1","volume-title":"Instagram wants its influencers to make more money. https:\/\/www.nytimes.com\/2020\/05\/27\/style\/instagram-influencer-monetization-live-igtv.html Retrieved","author":"Lorenz Taylor","year":"2020","unstructured":"Taylor Lorenz . 2020. Instagram wants its influencers to make more money. https:\/\/www.nytimes.com\/2020\/05\/27\/style\/instagram-influencer-monetization-live-igtv.html Retrieved May 27, 2020 from Taylor Lorenz. 2020. Instagram wants its influencers to make more money. https:\/\/www.nytimes.com\/2020\/05\/27\/style\/instagram-influencer-monetization-live-igtv.html Retrieved May 27, 2020 from"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487649"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850581"},{"key":"e_1_3_2_2_58_1","volume-title":"Proc. IJCAI. 2076--2082","author":"Lu Wei-Xue","year":"2015","unstructured":"Wei-Xue Lu , Peng Zhang , Chuan Zhou , Chunyi Liu , and Li Gao . 2015 b. Influence Maximization in Big Networks: An Incremental Algorithm for Streaming Subgraph Influence Spread Estimation . In Proc. IJCAI. 2076--2082 . Wei-Xue Lu, Peng Zhang, Chuan Zhou, Chunyi Liu, and Li Gao. 2015b. Influence Maximization in Big Networks: An Incremental Algorithm for Streaming Subgraph Influence Spread Estimation. In Proc. IJCAI. 2076--2082."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_2_60_1","volume-title":"Dinh","author":"Nguyen Hung T.","year":"2016","unstructured":"Hung T. Nguyen , My T. Thai , and Thang N . Dinh . 2016 . Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-Scale Networks. In Proc. ACM SIGMOD. 695--710. Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 2016. Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-Scale Networks. In Proc. ACM SIGMOD. 695--710."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380564"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/2893873.2893897"},{"key":"e_1_3_2_2_63_1","volume-title":"Instagram will (finally) pay influencers. https:\/\/www.wired.com\/story\/instagram-finally-pay-influencers-badges-igtv-ads\/ Retrieved","author":"Pardes Arielle","year":"2020","unstructured":"Arielle Pardes . 2020. Instagram will (finally) pay influencers. https:\/\/www.wired.com\/story\/instagram-finally-pay-influencers-badges-igtv-ads\/ Retrieved May 27, 2020 from Arielle Pardes. 2020. Instagram will (finally) pay influencers. https:\/\/www.wired.com\/story\/instagram-finally-pay-influencers-badges-igtv-ads\/ Retrieved May 27, 2020 from"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319881"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Jing Tang Xueyan Tang Xiaokui Xiao and Junsong Yuan. 2018b. Online Processing Algorithms for Influence Maximization. In SIGMOD. 991--1005.  Jing Tang Xueyan Tang Xiaokui Xiao and Junsong Yuan. 2018b. Online Processing Algorithms for Influence Maximization. In SIGMOD. 991--1005.","DOI":"10.1145\/3183713.3183749"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2787757"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Yanchen Shi and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In SIGMOD. 1539--1554.  Youze Tang Yanchen Shi and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In SIGMOD. 1539--1554.","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Xiaokui Xiao and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD. 75--86.  Youze Tang Xiaokui Xiao and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD. 75--86.","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2624734"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577336"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.55"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401961"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3459243","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3459243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:04Z","timestamp":1750195504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3459243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":70,"alternative-id":["10.1145\/3448016.3459243","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3459243","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}