{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:26Z","timestamp":1750306406236,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,25]],"date-time":"2015-08-25T00:00:00Z","timestamp":1440460800000},"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":[[2015,8,25]]},"DOI":"10.1145\/2808797.2809392","type":"proceedings-article","created":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T14:56:02Z","timestamp":1447426562000},"page":"504-507","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Forecasting High Tide"],"prefix":"10.1145","author":[{"given":"Jimpei","family":"Harada","sequence":"first","affiliation":[{"name":"Center for Complexity in Business, University of Maryland, College Park, MD 20740"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Darmon","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Maryland, College Park, MD 20740"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michelle","family":"Girvan","sequence":"additional","affiliation":[{"name":"Department of Physics, University of Maryland, College Park, MD 20740 and Santa Fe Institute, 1399 Hyde Park Rd, Santa Fe, NM 87501"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Rand","sequence":"additional","affiliation":[{"name":"Center for Complexity in Business, University of Maryland, College Park, MD 20740"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,8,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1609611","article-title":"Fresh is best: The effect of source activity on the decision to retransmit content in social media","author":"Stephen A. T.","year":"2014","unstructured":"A. T. Stephen , Y. Dover , L. Muchnik , and J. Goldenberg , \" Fresh is best: The effect of source activity on the decision to retransmit content in social media ,\" Available at SSRN 1609611 , 2014 . A. T. Stephen, Y. Dover, L. Muchnik, and J. Goldenberg, \"Fresh is best: The effect of source activity on the decision to retransmit content in social media,\" Available at SSRN 1609611, 2014.","journal-title":"Available at SSRN"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.2013.0773"},{"key":"e_1_3_2_1_3_1","volume-title":"Extracting diurnal patterns of real world activity from social media.\" in ICWSM","author":"Grinberg N.","year":"2013","unstructured":"N. Grinberg , M. Naaman , B. Shaw , and G. Lotan , \" Extracting diurnal patterns of real world activity from social media.\" in ICWSM , 2013 . N. Grinberg, M. Naaman, B. Shaw, and G. Lotan, \"Extracting diurnal patterns of real world activity from social media.\" in ICWSM, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/81\/48002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557077"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187871"},{"key":"e_1_3_2_1_7_1","volume-title":"Mathematical models of fads explain the temporal dynamics of internet memes.\" in ICWSM","author":"Bauckhage C.","year":"2013","unstructured":"C. Bauckhage , K. Kersting , and F. Hadiji , \" Mathematical models of fads explain the temporal dynamics of internet memes.\" in ICWSM , 2013 . C. Bauckhage, K. Kersting, and F. Hadiji, \"Mathematical models of fads explain the temporal dynamics of internet memes.\" in ICWSM, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577298"},{"volume-title":"Prediction of topic","author":"Ruan Y.","key":"e_1_3_2_1_9_1","unstructured":"Y. Ruan , H. Purohit , D. Fuhry , S. Parthasarathy , and A. Sheth , \" Prediction of topic volume on twitter,\" WebSci (short papers), 2012 . Y. Ruan, H. Purohit, D. Fuhry, S. Parthasarathy, and A. Sheth, \"Prediction of topic volume on twitter,\" WebSci (short papers), 2012."},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"2014 World Symposium on. IEEE","author":"Alwagait E.","year":"2014","unstructured":"E. Alwagait and B. Shahzad , \" Maximization of tweet's viewership with respect to time,\" in Computer Applications & Research (WSCAR) , 2014 World Symposium on. IEEE , 2014 , pp. 1 -- 5 . E. Alwagait and B. Shahzad, \"Maximization of tweet's viewership with respect to time,\" in Computer Applications & Research (WSCAR), 2014 World Symposium on. IEEE, 2014, pp. 1--5."},{"key":"e_1_3_2_1_11_1","article-title":"Modeling temporal activity patterns in dynamic social networks","author":"Raghavan V.","year":"2013","unstructured":"V. Raghavan , G. Ver Steeg , A. Galstyan , and A. G. Tartakovsky , \" Modeling temporal activity patterns in dynamic social networks ,\" IEEE Transactions on Computational Social Systems , 2013 . V. Raghavan, G. Ver Steeg, A. Galstyan, and A. G. Tartakovsky, \"Modeling temporal activity patterns in dynamic social networks,\" IEEE Transactions on Computational Social Systems, 2013.","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1304179110"},{"key":"e_1_3_2_1_13_1","first-page":"504","volume-title":"Blind construction of optimal nonlinear recursive predictors for discrete sequences,\" in Uncertainty in Artificial Intelligence: Proceedings of the Twentieth Conference (UAI","author":"Shalizi C. R.","year":"2004","unstructured":"C. R. Shalizi and K. L. Klinkner , \" Blind construction of optimal nonlinear recursive predictors for discrete sequences,\" in Uncertainty in Artificial Intelligence: Proceedings of the Twentieth Conference (UAI 2004 ), M. Chickering and J. Y. Halpern , Eds. Arlington, Virginia : AUAI Press , 2004, pp. 504 -- 511 . {Online}. Available: http:\/\/arxiv.org\/abs\/cs.LG\/0406011 C. R. Shalizi and K. L. Klinkner, \"Blind construction of optimal nonlinear recursive predictors for discrete sequences,\" in Uncertainty in Artificial Intelligence: Proceedings of the Twentieth Conference (UAI 2004), M. Chickering and J. Y. Halpern, Eds. Arlington, Virginia: AUAI Press, 2004, pp. 504--511. {Online}. Available: http:\/\/arxiv.org\/abs\/cs.LG\/0406011"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2009.12-07-678"}],"event":{"name":"ASONAM '15: Advances in Social Networks Analysis and Mining 2015","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Paris France","acronym":"ASONAM '15"},"container-title":["Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808797.2809392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2808797.2809392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:35Z","timestamp":1750223255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808797.2809392"}},"subtitle":["Predicting Times of Elevated Activity in Online Social Media"],"short-title":[],"issued":{"date-parts":[[2015,8,25]]},"references-count":14,"alternative-id":["10.1145\/2808797.2809392","10.1145\/2808797"],"URL":"https:\/\/doi.org\/10.1145\/2808797.2809392","relation":{},"subject":[],"published":{"date-parts":[[2015,8,25]]},"assertion":[{"value":"2015-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}