{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:17:38Z","timestamp":1780049858257,"version":"3.53.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:00:00Z","timestamp":1775260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:00:00Z","timestamp":1775260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"DARPA ASKEM","award":["HR00112220038"],"award-info":[{"award-number":["HR00112220038"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Categor Struct"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    What is a time-varying graph, a time-varying topological space, or, more generally, a mathematical structure that evolves over time? In this work, we lay the foundations for a general theory of temporal data by introducing\n                    <jats:italic>categories of narratives<\/jats:italic>\n                    . These are sheaves on posets of time intervals that encode snapshots of a temporal object along with the relationships between them. This theory satisfies five desiderata distilled from the burgeoning field of time-varying graphs: (D1) it defines both time-varying objects and their morphisms; (D2) it distinguishes between cumulative and persistent interpretations and provides principled methods for transitioning between them; (D3) it systematically lifts static notions to their temporal analogues; (D4) it is object agnostic; (D5) it integrates with theories of dynamical systems. To achieve this, we build upon existing categorical and sheaf-theoretic approaches to temporal graph theory, generalizing them to any category with limits and colimits. We also formalize tacit intuitions that, while present, often remain implicit in temporal graph theory. Beyond synthesizing and reformulating existing ideas in categorical language, we introduce sheaf-theoretic constructions and prove results that, to our knowledge, have not appeared in the temporal data literature\u2014such as the adjunction between persistent and cumulative narratives. More importantly, we integrate these existing and novel elements into a consistent and coherent framework, setting the stage for a unified theory of time-varying data.\n                  <\/jats:p>","DOI":"10.1007\/s10485-026-09860-4","type":"journal-article","created":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:39:37Z","timestamp":1775302777000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a Unified Theory of Time-Varying Data"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8686-2319","authenticated-orcid":false,"given":"Benjamin Merlin","family":"Bumpus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9028-8815","authenticated-orcid":false,"given":"Wilmer","family":"Leal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1778-3350","authenticated-orcid":false,"given":"James","family":"Fairbanks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8919-343X","authenticated-orcid":false,"given":"Martti","family":"Karvonen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6419-6899","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Simard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,4]]},"reference":[{"key":"9860_CR1","doi-asserted-by":"publisher","DOI":"10.32408\/compositionality-6-2","author":"R Aduddell","year":"2024","unstructured":"Aduddell, R., Fairbanks, J., Kumar, A., Ocal, P.S., Patterson, E., Shapiro, B.T.: A compositional account of motifs, mechanisms, and dynamics in biochemical regulatory networks. Compositionality (2024). https:\/\/doi.org\/10.32408\/compositionality-6-2","journal-title":"Compositionality"},{"key":"9860_CR2","unstructured":"Augustine, S.: Confessions, Volume II: Books 9\u201313. Edited and translated by C J.-B. Hammond. Loeb Classical Library 27, ISBN 0-67499693-3. Harvard University Press, Cambridge (2016)"},{"key":"9860_CR3","volume-title":"Category Theory","author":"S Awodey","year":"2010","unstructured":"Awodey, S.: Category Theory. Oxford University Press, Oxford (2010)"},{"key":"9860_CR4","doi-asserted-by":"publisher","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: Membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201906, pp. 44\u201354. Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1150402.1150412","DOI":"10.1145\/1150402.1150412"},{"issue":"09","key":"9860_CR5","doi-asserted-by":"publisher","first-page":"1750028","DOI":"10.1142\/S0129055X17500283","volume":"29","author":"JC Baez","year":"2017","unstructured":"Baez, J.C., Pollard, B.S.: A compositional framework for reaction networks. Rev. Math. Phys. 29(09), 1750028 (2017)","journal-title":"Rev. Math. Phys."},{"key":"9860_CR6","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Pal, B.: On the enumeration of maximal ($$\\delta $$, $$\\gamma $$)-cliques of a temporal network. In: Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, pp. 112\u2013120 (2019)","DOI":"10.1145\/3297001.3297015"},{"key":"9860_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3325859","volume":"24","author":"M Bentert","year":"2019","unstructured":"Bentert, M., Himmel, A.-S., Molter, H., Morik, M., Niedermeier, R., Saitenmacher, R.: Listing all maximal k-plexes in temporal graphs. J. Exp. Algorithm. 24, 1\u201327 (2019)","journal-title":"J. Exp. Algorithm."},{"key":"9860_CR8","unstructured":"Bumpus, B.M.: Generalizing graph decompositions. PhD thesis, University of Glasgow (2021). https:\/\/theses.gla.ac.uk\/82496\/"},{"key":"9860_CR9","first-page":"1","volume":"2022","author":"BM Bumpus","year":"2022","unstructured":"Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. Algorithmica 2022, 1\u201329 (2022)","journal-title":"Algorithmica"},{"issue":"5","key":"9860_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012). https:\/\/doi.org\/10.1080\/17445760.2012.668546","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"9860_CR11","unstructured":"Curry, J.: Sheaves, cosheaves and applications. PhD thesis, University of Pennsylvania (2014). https:\/\/www2.math.upenn.edu\/grad\/dissertations\/CurryThesis.pdf"},{"issue":"2","key":"9860_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s13160-015-0173-9","volume":"32","author":"JM Curry","year":"2015","unstructured":"Curry, J.M.: Topological data analysis and cosheaves. Jpn. J. Ind. Appl. Math. 32(2), 333\u2013371 (2015). https:\/\/doi.org\/10.1007\/s13160-015-0173-9","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"9860_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.epidem.2018.04.003","volume":"24","author":"J Enright","year":"2018","unstructured":"Enright, J., Kao, R.R.: Epidemics on dynamic networks. Epidemics 24, 88\u201397 (2018)","journal-title":"Epidemics"},{"key":"9860_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.jcss.2020.08.001","volume":"115","author":"J Enright","year":"2021","unstructured":"Enright, J., Meeks, K., Skerman, F.: Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci. 115, 169\u2013186 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"9860_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jcss.2021.01.007","volume":"119","author":"J Enright","year":"2021","unstructured":"Enright, J., Meeks, K., Mertzios, G.B., Zamaraev, V.: Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. 119, 60\u201377 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"9860_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/9781108668804","volume-title":"An Invitation to Applied Category Theory: Seven Sketches in Compositionality","author":"B Fong","year":"2019","unstructured":"Fong, B., Spivak, D.I.: An Invitation to Applied Category Theory: Seven Sketches in Compositionality. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781108668804"},{"issue":"7","key":"9860_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0895-7177(97)00050-2","volume":"25","author":"F Harary","year":"1997","unstructured":"Harary, F., Gupta, G.: Dynamic graph models. Math. Comput. Model. 25(7), 79\u201387 (1997)","journal-title":"Math. Comput. Model."},{"key":"9860_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113885","volume":"2023","author":"D Hermelin","year":"2023","unstructured":"Hermelin, D., Itzhaki, Y., Molter, H., Niedermeier, R.: Temporal interval cliques and independent sets. Theoret. Comput. Sci. 2023, 113885 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"9860_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"A-S Himmel","year":"2017","unstructured":"Himmel, A.-S., Molter, H., Niedermeier, R., Sorge, M.: Adapting the bron-kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7, 1\u201316 (2017)","journal-title":"Soc. Netw. Anal. Min."},{"key":"9860_CR20","unstructured":"Hippo, A.: Confessions, Volume I: Books 1\u20138. Loeb Classical Library, vol. 26. Harvard University Press, Cambridge (1912)"},{"issue":"9","key":"9860_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88(9), 1\u201330 (2015)","journal-title":"Eur. Phys. J. B"},{"issue":"3","key":"9860_CR22","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.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"1","key":"9860_CR23","first-page":"1","volume":"5","author":"P Johnstone","year":"1999","unstructured":"Johnstone, P.: A note on discrete Conduch\u00e9 fibrations. Theory Appl. Categ. 5(1), 1\u201311 (1999)","journal-title":"Theory Appl. Categ."},{"key":"9860_CR24","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201903, pp. 137\u2013146. Association for Computing Machinery, New York (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"9860_CR25","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J.: Protocols and impossibility results for gossip-based communication mechanisms. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings, pp. 471\u2013480 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181971","DOI":"10.1109\/SFCS.2002.1181971"},{"issue":"4","key":"9860_CR26","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9860_CR27","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1007\/s00454-023-00590-1","volume":"71","author":"W Kim","year":"2024","unstructured":"Kim, W., M\u00e9moli, F.: Extracting persistent clusters in dynamic data via m\u00f6bius inversion. Discret. Comput. Geom. 71(4), 1276\u20131342 (2024). https:\/\/doi.org\/10.1007\/s00454-023-00590-1","journal-title":"Discret. Comput. Geom."},{"key":"9860_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S Lack","year":"2004","unstructured":"Lack, S., Sobocinski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) Foundations of Software Science and Computation Structures, pp. 273\u2013288. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_20"},{"key":"9860_CR29","doi-asserted-by":"publisher","unstructured":"Lavore, E.D., Leal, W., Paiva, V.: Dialectica petri nets. Fund. Inform.194(3), (2025). https:\/\/doi.org\/10.46298\/fi.13125","DOI":"10.46298\/fi.13125"},{"key":"9860_CR30","unstructured":"Le\u00a0Poidevin, R.: The experience and perception of time. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy, Summer 2019 edn. Metaphysics Research Lab, Stanford University, Stanford, CA (2019). Retrieved from the Summer 2019 edition. https:\/\/plato.stanford.edu\/archives\/sum2019\/entries\/time-experience\/"},{"key":"9860_CR31","unstructured":"Leal, W.: Exploration of chemical space: Formal, chemical and historical aspects. PhD thesis, Dissertation, Leipzig, Universit\u00e4t Leipzig, 2022 (2022). https:\/\/ul.qucosa.de\/api\/qucosa%3A82716\/attachment\/ATT-0\/"},{"issue":"26","key":"9860_CR32","doi-asserted-by":"publisher","first-page":"12660","DOI":"10.1073\/pnas.1816039116","volume":"116","author":"EJ Llanos","year":"2019","unstructured":"Llanos, E.J., Leal, W., Luu, D.H., Jost, J., Stadler, P.F., Restrepo, G.: Exploration of the chemical space and its three historical regimes. Proc. Natl. Acad. Sci. 116(26), 12660\u201312665 (2019). https:\/\/doi.org\/10.1073\/pnas.1816039116","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9860_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0927-0","volume-title":"Sheaves in Geometry and Logic: A First Introduction to Topos Theory","author":"S MacLane","year":"2012","unstructured":"MacLane, S., Moerdijk, I.: Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4612-0927-0"},{"key":"9860_CR34","doi-asserted-by":"publisher","unstructured":"Master, J.: The Open Algebraic Path Problem. In: Gadducci, F., Silva, A. (eds.) 9th Conference on Algebra and Coalgebra in Computer Science (CALCO 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 211, pp. 20\u201312020. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2021.20","DOI":"10.4230\/LIPIcs.CALCO.2021.20"},{"issue":"4","key":"9860_CR35","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"issue":"S1","key":"9860_CR36","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1017\/nws.2020.38","volume":"9","author":"H Molter","year":"2021","unstructured":"Molter, H., Niedermeier, R., Renken, M.: Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9(S1), 83\u2013105 (2021)","journal-title":"Netw. Sci."},{"key":"9860_CR37","doi-asserted-by":"publisher","unstructured":"Patterson, E., Lynch, O., Fairbanks, J.: Categorical Data Structures for Technical Computing. Compositionality 4 (2022) https:\/\/doi.org\/10.32408\/compositionality-4-5","DOI":"10.32408\/compositionality-4-5"},{"key":"9860_CR38","volume-title":"Category Theory in Context","author":"E Riehl","year":"2017","unstructured":"Riehl, E.: Category Theory in Context. Courier Dover Publications, Mineola (2017)"},{"key":"9860_CR39","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/12581.001.0001","volume-title":"Sheaf Theory Through Examples","author":"D Rosiak","year":"2022","unstructured":"Rosiak, D.: Sheaf Theory Through Examples. The MIT Press, Cambridge (2022). https:\/\/doi.org\/10.7551\/mitpress\/12581.001.0001"},{"issue":"1","key":"9860_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-021-00354-x","volume":"6","author":"A-S Ruget","year":"2021","unstructured":"Ruget, A.-S., Rossi, G., Pepler, P.T., Beaun\u00e9e, G., Banks, C.J., Enright, J., Kao, R.R.: Multi-species temporal network of livestock movements for disease spread. Appl. Netw. Sci. 6(1), 1\u201320 (2021)","journal-title":"Appl. Netw. Sci."},{"key":"9860_CR41","unstructured":"Schultz, P., Spivak, D.I.: Temporal type theory: A topos-theoretic approach to systems and behavior. Preprint at http:\/\/arxiv.org\/abs\/1710.10258 (2017)"},{"issue":"1","key":"9860_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10485-019-09565-x","volume":"28","author":"P Schultz","year":"2020","unstructured":"Schultz, P., Spivak, D.I., Vasilakopoulou, C.: Dynamical systems and sheaves. Appl. Categ. Struct. 28(1), 1\u201357 (2020)","journal-title":"Appl. Categ. Struct."},{"issue":"4","key":"9860_CR43","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1007\/s00454-016-9763-9","volume":"55","author":"V Silva","year":"2016","unstructured":"Silva, V., Munch, E., Patel, A.: Categorified reeb graphs. Discret. Comput. Geom. 55(4), 854\u2013906 (2016). https:\/\/doi.org\/10.1007\/s00454-016-9763-9","journal-title":"Discret. Comput. Geom."},{"key":"9860_CR44","doi-asserted-by":"crossref","unstructured":"Viard, J., Latapy, M.: Identifying roles in an ip network with temporal and structural density. In: 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 801\u2013806. IEEE (2014)","DOI":"10.1109\/INFCOMW.2014.6849333"},{"key":"9860_CR45","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theoret. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Applied Categorical Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10485-026-09860-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10485-026-09860-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10485-026-09860-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T09:59:23Z","timestamp":1780048763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10485-026-09860-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,4]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9860"],"URL":"https:\/\/doi.org\/10.1007\/s10485-026-09860-4","relation":{},"ISSN":["0927-2852","1572-9095"],"issn-type":[{"value":"0927-2852","type":"print"},{"value":"1572-9095","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,4]]},"assertion":[{"value":"21 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Figure 1 is corrected.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"23"}}