{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:32:36Z","timestamp":1757539956850,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"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":[[2023,10,23]]},"DOI":"10.1145\/3565287.3610261","type":"proceedings-article","created":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T19:59:44Z","timestamp":1695931184000},"page":"81-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Age of Information Diffusion on Social Networks: Optimizing Multi-Stage Seeding Strategies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3941-8490","authenticated-orcid":false,"given":"Songhua","family":"Li","sequence":"first","affiliation":[{"name":"Engineering Systems and Design Pillar, Singapore University of Technology and Design, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0217-6507","authenticated-orcid":false,"given":"Lingjie","family":"Duan","sequence":"additional","affiliation":[{"name":"Engineering Systems and Design Pillar, Singapore University of Technology and Design, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-020-01461-4"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.3390\/e23111542"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2019.000034"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2915521"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344424"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.im.2019.103171"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.65"},{"volume-title":"Computers and Intractability","author":"Garey Michael R","key":"e_1_3_2_2_8_1","unstructured":"Michael R Garey and David S Johnson . 2002. Computers and Intractability , vol. 29 . Michael R Garey and David S Johnson. 2002. Computers and Intractability, vol. 29."},{"key":"e_1_3_2_2_9_1","volume-title":"A best possible heuristic for the k-center problem. Mathematics of operations research 10, 2","author":"Hochbaum Dorit S","year":"1985","unstructured":"Dorit S Hochbaum and David B Shmoys . 1985. A best possible heuristic for the k-center problem. Mathematics of operations research 10, 2 ( 1985 ), 180--184. Dorit S Hochbaum and David B Shmoys. 1985. A best possible heuristic for the k-center problem. Mathematics of operations research 10, 2 (1985), 180--184."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006590"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062058"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486307"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2873606"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_16_1","volume-title":"Line graphs as social networks. Physica A: Statistical Mechanics and its Applications 390, 13","author":"Krawczyk Ma\u0142gorzata J","year":"2011","unstructured":"Ma\u0142gorzata J Krawczyk , Lev Muchnik , Anna Ma\u0144ka-Kraso\u0144 , and Krzysztof Ku\u0142akowski . 2011. Line graphs as social networks. Physica A: Statistical Mechanics and its Applications 390, 13 ( 2011 ), 2611--2618. Ma\u0142gorzata J Krawczyk, Lev Muchnik, Anna Ma\u0144ka-Kraso\u0144, and Krzysztof Ku\u0142akowski. 2011. Line graphs as social networks. Physica A: Statistical Mechanics and its Applications 390, 13 (2011), 2611--2618."},{"key":"e_1_3_2_2_17_1","volume-title":"Learning to discover social circles in ego networks. Advances in neural information processing systems 25","author":"Leskovec Jure","year":"2012","unstructured":"Jure Leskovec and Julian Mcauley . 2012. Learning to discover social circles in ego networks. Advances in neural information processing systems 25 ( 2012 ). Jure Leskovec and Julian Mcauley. 2012. Learning to discover social circles in ego networks. Advances in neural information processing systems 25 (2012)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3156866"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3135494"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2451624"},{"key":"e_1_3_2_2_21_1","volume-title":"An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser , Laurence A Wolsey , and Marshall L Fisher . 1978. An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1 ( 1978 ), 265--294. George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions---I. Mathematical programming 14, 1 (1978), 265--294."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0921"},{"volume-title":"Pin Duo Duo","key":"e_1_3_2_2_23_1","unstructured":"Pinduoduo. 2023. Pin Duo Duo , More Savings : Together More Fun . https:\/\/m.pinduoduo.com\/en\/.htm Pinduoduo. 2023. Pin Duo Duo, More Savings: Together More Fun. https:\/\/m.pinduoduo.com\/en\/.htm"},{"key":"e_1_3_2_2_24_1","volume-title":"The study of e-commerce service systems in global viral marketing strategy. Available at SSRN 2190787","author":"Raja V","year":"2012","unstructured":"V Raja . 2012. The study of e-commerce service systems in global viral marketing strategy. Available at SSRN 2190787 ( 2012 ). V Raja. 2012. The study of e-commerce service systems in global viral marketing strategy. Available at SSRN 2190787 (2012)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"LI Songhua and Duan Lingjie. 2023. Age of Information on Social Networks: Optimization Multi-Stage Seeding Strategies. https:\/\/www.researchgate.net\/publication\/372515862_Age_of_Information_Diffusion_on_Social_Networks_Optimizing_Multi-Stage_Seeding_Strategies LI Songhua and Duan Lingjie. 2023. Age of Information on Social Networks: Optimization Multi-Stage Seeding Strategies. https:\/\/www.researchgate.net\/publication\/372515862_Age_of_Information_Diffusion_on_Social_Networks_Optimizing_Multi-Stage_Seeding_Strategies","DOI":"10.1145\/3565287.3610261"},{"key":"e_1_3_2_2_26_1","unstructured":"SNAP Stanford. 2023. Stanford Large Network Dataset Collection. https:\/\/snap.stanford.edu\/data\/#socnets SNAP Stanford. 2023. Stanford Large Network Dataset Collection. https:\/\/snap.stanford.edu\/data\/#socnets"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262777"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492866.3549719"},{"key":"e_1_3_2_2_29_1","volume-title":"Age optimal information gathering and dissemination on graphs","author":"Tripathi Vishrant","year":"2021","unstructured":"Vishrant Tripathi , Rajat Talak , and Eytan Modiano . 2021. Age optimal information gathering and dissemination on graphs . IEEE Transactions on Mobile Computing ( 2021 ). Vishrant Tripathi, Rajat Talak, and Eytan Modiano. 2021. Age optimal information gathering and dissemination on graphs. IEEE Transactions on Mobile Computing (2021)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3174114"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3033501"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065072"}],"event":{"name":"MobiHoc '23: Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Washington DC USA","acronym":"MobiHoc '23"},"container-title":["Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565287.3610261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:43Z","timestamp":1750178263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565287.3610261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":32,"alternative-id":["10.1145\/3565287.3610261","10.1145\/3565287"],"URL":"https:\/\/doi.org\/10.1145\/3565287.3610261","relation":{},"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"2023-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}