{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:23:50Z","timestamp":1752283430422,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":22,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF Center for Science of Information (CSoI)","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}]},{"name":"NIH","award":["1U01CA198941-01"],"award-info":[{"award-number":["1U01CA198941-01"]}]},{"name":"NSF","award":["CSR-1422338","CCF-1524312"],"award-info":[{"award-number":["CSR-1422338","CCF-1524312"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186105","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"389-398","source":"Crossref","is-referenced-by-count":4,"title":["TIMES"],"prefix":"10.1145","author":[{"given":"Abram N.","family":"Magner","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jithin K.","family":"Sreedharan","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananth Y.","family":"Grama","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186105-1","unstructured":"Jacqueline Banks, Scott Garrabrant, Mark L Huber, and Anne Perizzolo. 2010. Using TPA to count linear extensions. arXiv preprint arXiv:1010.4981 (2010)."},{"key":"key-10.1145\/3178876.3186105-2","doi-asserted-by":"crossref","unstructured":"Albert-László Barabási and Réka Albert. 1999. Emergence of Scaling in Random Networks. Science Vol. 286, 5439 (1999), 509--512.","DOI":"10.1126\/science.286.5439.509"},{"key":"key-10.1145\/3178876.3186105-3","unstructured":"Bharat B Biswal, Maarten Mennes, Xi-Nian Zuo, Suril Gohel, Clare Kelly, Steve M Smith, Christian F Beckmann, Jonathan S Adelstein, Randy L Buckner, Stan Colcombe, et al. 2010. Toward discovery science of human brain function. Proceedings of the National Academy of Sciences Vol. 107, 10 (2010), 4734--4739."},{"key":"key-10.1145\/3178876.3186105-4","doi-asserted-by":"crossref","unstructured":"Graham Brightwell and Peter Winkler. 1991. Counting Linear Extensions is #P-complete. In Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, NY, USA, 175--181.","DOI":"10.1145\/103418.103441"},{"key":"key-10.1145\/3178876.3186105-5","unstructured":"Sébastien Bubeck, Luc Devroye, and Gábor Lugosi. 2016. Finding Adam in random growing trees. Random Structures & Algorithms (2016)."},{"key":"key-10.1145\/3178876.3186105-6","unstructured":"John A. Capra, Alexander G. Williams, and Katherine S. Pollard. 2012. ProteinHistorian: Tools for the Comparative Analysis of Eukaryote Protein Origin. PLOS Computational Biology Vol. 8 (06. 2012), 1--9."},{"key":"key-10.1145\/3178876.3186105-7","unstructured":"KONECT The Koblenz Network Collection. 2016. Preferential attachment exponent. Available on http:\/\/konect.uni-koblenz.de\/statistics\/prefatt [Accessed: 30 April 2017]. (2016)."},{"key":"key-10.1145\/3178876.3186105-8","doi-asserted-by":"crossref","unstructured":"Colin Cooper. 2006. Distribution of vertex degree in web-graphs. Combinatorics, Probability and Computing Vol. 15, 05 (2006), 637--661.","DOI":"10.1017\/S096354830600753X"},{"key":"key-10.1145\/3178876.3186105-9","doi-asserted-by":"crossref","unstructured":"Colin Cooper and Alan Frieze. 2003. A general model of web graphs. Random Structures & Algorithms Vol. 22, 3 (2003), 311--335.","DOI":"10.1002\/rsa.10084"},{"key":"key-10.1145\/3178876.3186105-10","doi-asserted-by":"crossref","unstructured":"Alan Frieze, Wesley Pegden, et al. 2017. Looking for vertex number one. The Annals of Applied Probability Vol. 27, 1 (2017), 582--630.","DOI":"10.1214\/16-AAP1212"},{"key":"key-10.1145\/3178876.3186105-11","unstructured":"International Neuroimaging Data-Sharing Initiative. 2017. The 1000 Functional Connectomes Project. http:\/\/fcon_1000.projects.nitrc.org\/index.html. (2017). [Online; accessed 11-February-2018]."},{"key":"key-10.1145\/3178876.3186105-12","unstructured":"Brian J Jellison, Aaron S Field, Joshua Medow, Mariana Lazar, M Shariar Salamat, and Andrew L Alexander. 2004. Diffusion tensor imaging of cerebral white matter: a pictorial review of physics, fiber tract anatomy, and tumor imaging patterns. American Journal of Neuroradiology Vol. 25, 3 (2004), 356--369."},{"key":"key-10.1145\/3178876.3186105-13","doi-asserted-by":"crossref","unstructured":"Alexander Karzanov and Leonid Khachiyan. 1991. On the conductance of order Markov chains. Order Vol. 8, 1 (1991), 7--15.","DOI":"10.1007\/BF00385809"},{"key":"key-10.1145\/3178876.3186105-14","unstructured":"Jérôme Kunegis, Marcel Blattner, and Christine Moser. 2013. Preferential attachment in online networks: Measurement and explanations Proceedings of the 5th Annual ACM Web Science Conference. ACM, 205--214."},{"key":"key-10.1145\/3178876.3186105-15","unstructured":"Tomasz Łuczak, Abram Magner, and Wojciech Szpankowski. 2017. Asymmetry and structural information in preferential attachment graphs. arXiv preprint arXiv:1607.04102 (2017)."},{"key":"key-10.1145\/3178876.3186105-16","doi-asserted-by":"crossref","unstructured":"Abram Magner, Ananth Grama, Jithin Sreedharan, and Wojciech Szpankowski. 2017. Recovery of Vertex Orderings in Dynamic Graphs. In Proceedings of the IEEE International Symposium on Information Theory (ISIT).","DOI":"10.1109\/ISIT.2017.8006792"},{"key":"key-10.1145\/3178876.3186105-17","doi-asserted-by":"crossref","unstructured":"S. M. Vijay Mahantesh, Sudarshan Iyengar, M. Vijesh, Shruthi R. Nayak, and Nikitha Shenoy. 2012. Prediction of Arrival of Nodes in a Scale Free Network Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM). 517--521.","DOI":"10.1109\/ASONAM.2012.89"},{"key":"key-10.1145\/3178876.3186105-18","unstructured":"Dimbinaina Ralaivaosaona and Stephan Wagner. 2016. Additive functionals ofd-ary increasing trees. In Proceedings of the 27th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms. 1--12."},{"key":"key-10.1145\/3178876.3186105-19","doi-asserted-by":"crossref","unstructured":"Devavrat Shah and Tauhid Zaman. 2011. Rumors in a network: Who's the culprit? IEEE Transactions on information theory Vol. 57, 8 (2011), 5163--5181.","DOI":"10.1109\/TIT.2011.2158885"},{"key":"key-10.1145\/3178876.3186105-20","unstructured":"Mansi Srivastava, Oleg Simakov, Jarrod Chapman, Bryony Fahey, Marie EA Gauthier, Therese Mitros, Gemma S Richards, Cecilia Conaco, Michael Dacre, Uffe Hellsten, et al. 2010. The Amphimedon queenslandica genome and the evolution of animal complexity. Nature Vol. 466, 7307 (2010), 720--726."},{"key":"key-10.1145\/3178876.3186105-21","unstructured":"Petra E Vértes, Aaron F Alexander-Bloch, Nitin Gogtay, Jay N Giedd, Judith L Rapoport, and Edward T Bullmore. 2012. Simple models of human brain functional networks. Proceedings of the National Academy of Sciences Vol. 109, 15 (2012), 5868--5873."},{"key":"key-10.1145\/3178876.3186105-22","doi-asserted-by":"crossref","unstructured":"Kai Zhu and Lei Ying. 2016. Information source detection in the SIR model: A sample-path-based approach. IEEE\/ACM Transactions on Networking Vol. 24, 1 (2016), 408--421.","DOI":"10.1109\/TNET.2014.2364972"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186105&ftid=1957475&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:28Z","timestamp":1750212688000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186105"}},"subtitle":["Temporal Information Maximally Extracted from Structures"],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186105","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}