{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T16:32:21Z","timestamp":1791477141741,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["TD1210"],"award-info":[{"award-number":["TD1210"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007352","name":"Staatssekretariat f\u00fcr Bildung, Forschung und Innovation","doi-asserted-by":"publisher","award":["C14.0036"],"award-info":[{"award-number":["C14.0036"]}],"id":[{"id":"10.13039\/501100007352","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,13]]},"DOI":"10.1145\/3097983.3098145","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T14:35:54Z","timestamp":1501857354000},"page":"1037-1046","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["When is a Network a Network?"],"prefix":"10.1145","author":[{"given":"Ingo","family":"Scholtes","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Statistical inference about Markov chains. The Annals of Mathematical Statistics","author":"Anderson Theodore W","year":"1957","unstructured":"Theodore W Anderson and Leo A Goodman 1957. Statistical inference about Markov chains. The Annals of Mathematical Statistics ( 1957 ), 89--110. Theodore W Anderson and Leo A Goodman 1957. Statistical inference about Markov chains. The Annals of Mathematical Statistics (1957), 89--110."},{"key":"e_1_3_2_1_2_1","volume-title":"Revisiting the foundations of network analysis. science","author":"Butts Carter T","year":"2009","unstructured":"Carter T Butts . 2009. Revisiting the foundations of network analysis. science , Vol. 325 , 5939 ( 2009 ), 414--416. Carter T Butts. 2009. Revisiting the foundations of network analysis. science, Vol. 325, 5939 (2009), 414--416."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Igor Cadez David Heckerman Christopher Meek Padhraic Smyth and Steven White. 2000. Visualization of Navigation Patterns on a Web Site Using Model-based Clustering Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '00). 280--284.  Igor Cadez David Heckerman Christopher Meek Padhraic Smyth and Steven White. 2000. Visualization of Navigation Patterns on a Web Site Using Model-based Clustering Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '00). 280--284.","DOI":"10.1145\/347090.347151"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187919"},{"key":"e_1_3_2_1_5_1","first-page":"758","article-title":"A Combinatorial Problem. Koninklijke Nederlandse Akademie v","volume":"49","author":"de Bruijn N. G.","year":"1946","unstructured":"N. G. de Bruijn . 1946 . A Combinatorial Problem. Koninklijke Nederlandse Akademie v . Wetenschappen Vol. 49 (1946), 758 -- 764 . N. G. de Bruijn. 1946. A Combinatorial Problem. Koninklijke Nederlandse Akademie v. Wetenschappen Vol. 49 (1946), 758--764.","journal-title":"Wetenschappen"},{"key":"e_1_3_2_1_6_1","volume-title":"RSC: Mining and Modeling Temporal Activity in Social Media Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15)","author":"Costa Alceu Ferraz","year":"2015","unstructured":"Alceu Ferraz Costa , Yuto Yamaguchi , Agma Juci Machado Traina , Caetano Traina , Jr., and Christos Faloutsos 2015 . RSC: Mining and Modeling Temporal Activity in Social Media Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15) . 269--278. Alceu Ferraz Costa, Yuto Yamaguchi, Agma Juci Machado Traina, Caetano Traina, Jr., and Christos Faloutsos 2015. RSC: Mining and Modeling Temporal Activity in Social Media Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15). 269--278."},{"key":"e_1_3_2_1_7_1","unstructured":"Transport for London. 2014. Rolling Origin and Destination Survey (RODS) database. (2014). showURL%http:\/\/www.tfl.gov.uk\/info-for\/open-data-users\/our-feeds  Transport for London. 2014. Rolling Origin and Destination Survey (RODS) database. (2014). showURL%http:\/\/www.tfl.gov.uk\/info-for\/open-data-users\/our-feeds"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2015.10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2015-60657-4"},{"key":"e_1_3_2_1_10_1","volume-title":"Controllability of temporal networks: An analysis using higher-order networks. ArXiv","author":"Zhang Yan","year":"2017","unstructured":"Yan Zhang , Antonios Garas , and Ingo Scholtes . 2017. Controllability of temporal networks: An analysis using higher-order networks. ArXiv ( 2017 ). showeprint[arxiv]physics.soc-ph\/1701.06331 Yan Zhang, Antonios Garas, and Ingo Scholtes. 2017. Controllability of temporal networks: An analysis using higher-order networks. ArXiv (2017). showeprint[arxiv]physics.soc-ph\/1701.06331"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_3_2_1_12_1","first-page":"137","article-title":"Good versus optimal: Why network analytic methods need more systematic evaluation","volume":"1","author":"Zweig Katharina A","year":"2011","unstructured":"Katharina A Zweig . 2011 . Good versus optimal: Why network analytic methods need more systematic evaluation . Central Europ. J. Computer Science Vol. 1 , 1 (2011), 137 -- 153 . endthebibliography Katharina A Zweig. 2011. Good versus optimal: Why network analytic methods need more systematic evaluation. Central Europ. J. Computer Science Vol. 1, 1 (2011), 137--153. endthebibliography","journal-title":"Central Europ. J. Computer Science"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098145","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:30:02Z","timestamp":1750203002000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098145"}},"subtitle":["Multi-Order Graphical Model Selection in Pathways and Temporal Networks"],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"references-count":12,"alternative-id":["10.1145\/3097983.3098145","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098145","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]},"assertion":[{"value":"2017-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}