{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T06:42:20Z","timestamp":1768804940714,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR19-CE46-0008 DATAREDUX"],"award-info":[{"award-number":["ANR19-CE46-0008 DATAREDUX"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR19-CE46-0008 DATAREDUX"],"award-info":[{"award-number":["ANR19-CE46-0008 DATAREDUX"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR19-CE46-0008 DATAREDUX"],"award-info":[{"award-number":["ANR19-CE46-0008 DATAREDUX"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR19-CE46-0008 DATAREDUX"],"award-info":[{"award-number":["ANR19-CE46-0008 DATAREDUX"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR19-CE46-0008 DATAREDUX"],"award-info":[{"award-number":["ANR19-CE46-0008 DATAREDUX"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001942","name":"CHIST-ERA","doi-asserted-by":"publisher","award":["19-XAI-006"],"award-info":[{"award-number":["19-XAI-006"]}],"id":[{"id":"10.13039\/501100001942","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001942","name":"CHIST-ERA","doi-asserted-by":"publisher","award":["FWF I 5205-N SAI"],"award-info":[{"award-number":["FWF I 5205-N SAI"]}],"id":[{"id":"10.13039\/501100001942","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Laboratory for Health Security","award":["RRF-2.3.1-21-2022-00006"],"award-info":[{"award-number":["RRF-2.3.1-21-2022-00006"]}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["H2020 - 871042 SoBigData++"],"award-info":[{"award-number":["H2020 - 871042 SoBigData++"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Pairwise temporal interactions between entities can be represented as temporal networks, which code the propagation of processes such as epidemic spreading or information cascades, evolving on top of them. The largest outcome of these processes is directly linked to the structure of the underlying network. Indeed, a node of a network at\u00a0a given time cannot affect more nodes in the future than it can reach via time-respecting paths. This set of nodes reachable from a source defines an out-component, which identification is costly. In this paper, we propose an efficient matrix algorithm to tackle this issue and show that it outperforms other state-of-the-art methods. Secondly, we propose a hashing framework to coarsen large temporal networks into smaller proxies on which out-components are more easily estimated, and then recombined to obtain the initial components. Our graph hashing solution has implications in privacy respecting representation of temporal networks.<\/jats:p>","DOI":"10.1007\/s41109-023-00609-9","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T11:02:47Z","timestamp":1705489367000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Temporal network compression via network hashing"],"prefix":"10.1007","volume":"9","author":[{"given":"R\u00e9mi","family":"Vaudaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Borgnat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo","family":"Gon\u00e7alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Gribonval","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rton","family":"Karsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,17]]},"reference":[{"key":"609_CR1","doi-asserted-by":"publisher","unstructured":"Adhikari B, Zhang Y, Bharadwaj A, Prakash B (2017) Condensing temporal networks using propagation, pp 417\u2013425. https:\/\/doi.org\/10.1137\/1.9781611974973.47","DOI":"10.1137\/1.9781611974973.47"},{"key":"609_CR2","doi-asserted-by":"publisher","unstructured":"Allen AJ, Moore C, H\u00e9bert-Dufresne L (2022) A network compression approach for quantifying the importance of temporal contact chronology. https:\/\/doi.org\/10.48550\/ARXIV.2205.11566. arXiv:2205.11566","DOI":"10.48550\/ARXIV.2205.11566"},{"key":"609_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.052303","volume":"101","author":"A Badie-Modiri","year":"2020","unstructured":"Badie-Modiri A, Karsai M, Kivel\u00e4 M (2020) Efficient limited-time reachability estimation in temporal networks. Phys Rev E 101:052303. https:\/\/doi.org\/10.1103\/PhysRevE.101.052303","journal-title":"Phys Rev E"},{"key":"609_CR4","doi-asserted-by":"publisher","unstructured":"Bernardo GD, Brisaboa NR, Caro D, Rodr\u00edguez MA (2013) Compact data structures for temporal graphs. In: 2013 data compression conference, p 477. https:\/\/doi.org\/10.1109\/DCC.2013.59","DOI":"10.1109\/DCC.2013.59"},{"issue":"6","key":"609_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/2070781.2024192","volume":"30","author":"N Bonneel","year":"2011","unstructured":"Bonneel N, Panne M, Paris S, Heidrich W (2011) Displacement interpolation using Lagrangian mass transport. ACM Trans Graph 30(6):158. https:\/\/doi.org\/10.1145\/2070781.2024192","journal-title":"ACM Trans Graph"},{"issue":"2","key":"609_CR6","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10115-015-0908-6","volume":"49","author":"D Caro","year":"2016","unstructured":"Caro D, Rodr\u00edguez MA, Brisaboa NR, Fari\u00f1a A (2016) Compressed kd-tree for temporal graphs. Knowl Inf Syst 49(2):553\u2013595. https:\/\/doi.org\/10.1007\/s10115-015-0908-6","journal-title":"Knowl Inf Syst"},{"key":"609_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork C, McSherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. In: Halevi S, Rabin T (eds) Theory of cryptography. Springer, Berlin, pp 265\u2013284"},{"key":"609_CR8","doi-asserted-by":"crossref","unstructured":"Flajolet P, Fusy, Gandouet O, Meunier F (2007) Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: AOFA \u201907: proceedings of the 2007 international conference on analysis of algorithms","DOI":"10.46298\/dmtcs.3545"},{"issue":"78","key":"609_CR9","first-page":"1","volume":"22","author":"R Flamary","year":"2021","unstructured":"Flamary R, Courty N, Gramfort A, Alaya MZ, Boisbunon A, Chambon S, Chapel L, Corenflos A, Fatras K, Fournier N, Gautheron L, Gayraud NTH, Janati H, Rakotomamonjy A, Redko I, Rolet A, Schutz A, Seguy V, Sutherland DJ, Tavenard R, Tong A, Vayer T (2021) POT: python optimal transport. J Mach Learn Res 22(78):1\u20138","journal-title":"J Mach Learn Res"},{"issue":"3","key":"609_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125. https:\/\/doi.org\/10.1016\/j.physrep.2012.03.001","journal-title":"Phys Rep"},{"issue":"1","key":"609_CR11","doi-asserted-by":"publisher","first-page":"12357","DOI":"10.1038\/s41598-018-29577-2","volume":"8","author":"M Kivel\u00e4","year":"2018","unstructured":"Kivel\u00e4 M, Cambe J, Saram\u00e4ki J, Karsai M (2018) Mapping temporal-network percolation to weighted, static event graphs. Sci Rep 8(1):12357","journal-title":"Sci Rep"},{"key":"609_CR12","doi-asserted-by":"publisher","unstructured":"Liakos P, Papakonstantinopoulou K, Stefou T, Delis A (2022) On compressing temporal graphs. In: 2022 IEEE 38th international conference on data engineering (ICDE), pp 1301\u20131313. https:\/\/doi.org\/10.1109\/ICDE53745.2022.00102","DOI":"10.1109\/ICDE53745.2022.00102"},{"key":"609_CR13","unstructured":"Li X, Sharpnack J (2017) Compression of spatio-temporal networks via point-to-point process models. In: Proceedings of the 13th international workshop on mining and learning with graphs (MLG)"},{"key":"609_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-018-0491-4","author":"Y Liu","year":"2018","unstructured":"Liu Y, Safavi T, Shah N, Koutra D (2018) Reducing large graphs to small supergraphs: a unified approach. Soc Netw Anal Min. https:\/\/doi.org\/10.1007\/s13278-018-0491-4","journal-title":"Soc Netw Anal Min"},{"key":"609_CR15","unstructured":"Loukas A, Vandergheynst P (2018) Spectrally approximating large graphs with smaller graphs. In: International conference on machine learning"},{"issue":"32","key":"609_CR16","doi-asserted-by":"publisher","first-page":"2023473118","DOI":"10.1073\/pnas.2023473118","volume":"118","author":"CW Lynn","year":"2021","unstructured":"Lynn CW, Bassett DS (2021) Quantifying the compressibility of complex networks. Proc Natl Acad Sci 118(32):2023473118. https:\/\/doi.org\/10.1073\/pnas.2023473118","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"609_CR17","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1093\/comnet\/cnx048","volume":"6","author":"A Mellor","year":"2017","unstructured":"Mellor A (2017) The temporal event graph. J Complex Netw 6(4):639\u2013659. https:\/\/doi.org\/10.1093\/comnet\/cnx048","journal-title":"J Complex Netw"},{"key":"609_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"M Newman","year":"2018","unstructured":"Newman M (2018) Networks. Oxford University Press"},{"key":"609_CR19","unstructured":"Thorup M, Zhang Y (2004) Tabulation based 4-universal hashing with applications to second moment estimation. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms. SODA \u201904. Society for Industrial and Applied Mathematics, USA, pp 615\u2013624"},{"key":"609_CR20","unstructured":"Vaudaine R, Gribonval R, Gon\u00e7alves P, Borgnat P, Karsai M (2023) Code for the article temporal network compression via network hashing. https:\/\/inria.hal.science\/hal-04330187"},{"key":"609_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00683-y","author":"M Yousuf","year":"2020","unstructured":"Yousuf M, Kim S (2020) Guided sampling for large graphs. Data Min Knowl Discov. https:\/\/doi.org\/10.1007\/s10618-020-00683-y","journal-title":"Data Min Knowl Discov"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00609-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-023-00609-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00609-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T11:04:57Z","timestamp":1705489497000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-023-00609-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,17]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["609"],"URL":"https:\/\/doi.org\/10.1007\/s41109-023-00609-9","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,17]]},"assertion":[{"value":"11 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}