@misc{blank_general_2025,
	title = {The {General} {Expiration} {Streaming} {Model}: {Diameter}, \$k\$-{Center}, {Counting}, {Sampling}, and {Friends}},
	copyright = {arXiv.org perpetual, non-exclusive license},
	shorttitle = {The {General} {Expiration} {Streaming} {Model}},
	url = {https://arxiv.org/abs/2509.07587},
	doi = {10.48550/ARXIV.2509.07587},
	abstract = {An important thread in the study of data-stream algorithms focuses on settings where stream items are active only for a limited time. We introduce a new expiration model, where each item arrives with its own expiration time. The special case where items expire in the order that they arrive, which we call consistent expirations, contains the classical sliding-window model of Datar, Gionis, Indyk, and Motwani [SICOMP 2002] and its timestamp-based variant of Braverman and Ostrovsky [FOCS 2007].},
	language = {en},
	urldate = {2025-11-11},
	publisher = {arXiv},
	author = {Blank, Lotte and Cabello, Sergio and Hajiaghayi, MohammadTaghi and Krauthgamer, Robert and Mahabadi, Sepideh and Nusser, André and Phillips, Jeff M. and Sauer, Jonas},
	year = {2025},
	note = {Version Number: 1},
	keywords = {Data Structures and Algorithms (cs.DS), FOS: Computer and information sciences},
}

{"_id":"j3eNH37jR3SZ5ijjD","bibbaseid":"blank-cabello-hajiaghayi-krauthgamer-mahabadi-nusser-phillips-sauer-thegeneralexpirationstreamingmodeldiameterkcentercountingsamplingandfriends-2025","author_short":["Blank, L.","Cabello, S.","Hajiaghayi, M.","Krauthgamer, R.","Mahabadi, S.","Nusser, A.","Phillips, J. M.","Sauer, J."],"bibdata":{"bibtype":"misc","type":"misc","title":"The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends","copyright":"arXiv.org perpetual, non-exclusive license","shorttitle":"The General Expiration Streaming Model","url":"https://arxiv.org/abs/2509.07587","doi":"10.48550/ARXIV.2509.07587","abstract":"An important thread in the study of data-stream algorithms focuses on settings where stream items are active only for a limited time. We introduce a new expiration model, where each item arrives with its own expiration time. The special case where items expire in the order that they arrive, which we call consistent expirations, contains the classical sliding-window model of Datar, Gionis, Indyk, and Motwani [SICOMP 2002] and its timestamp-based variant of Braverman and Ostrovsky [FOCS 2007].","language":"en","urldate":"2025-11-11","publisher":"arXiv","author":[{"propositions":[],"lastnames":["Blank"],"firstnames":["Lotte"],"suffixes":[]},{"propositions":[],"lastnames":["Cabello"],"firstnames":["Sergio"],"suffixes":[]},{"propositions":[],"lastnames":["Hajiaghayi"],"firstnames":["MohammadTaghi"],"suffixes":[]},{"propositions":[],"lastnames":["Krauthgamer"],"firstnames":["Robert"],"suffixes":[]},{"propositions":[],"lastnames":["Mahabadi"],"firstnames":["Sepideh"],"suffixes":[]},{"propositions":[],"lastnames":["Nusser"],"firstnames":["André"],"suffixes":[]},{"propositions":[],"lastnames":["Phillips"],"firstnames":["Jeff","M."],"suffixes":[]},{"propositions":[],"lastnames":["Sauer"],"firstnames":["Jonas"],"suffixes":[]}],"year":"2025","note":"Version Number: 1","keywords":"Data Structures and Algorithms (cs.DS), FOS: Computer and information sciences","bibtex":"@misc{blank_general_2025,\n\ttitle = {The {General} {Expiration} {Streaming} {Model}: {Diameter}, \\$k\\$-{Center}, {Counting}, {Sampling}, and {Friends}},\n\tcopyright = {arXiv.org perpetual, non-exclusive license},\n\tshorttitle = {The {General} {Expiration} {Streaming} {Model}},\n\turl = {https://arxiv.org/abs/2509.07587},\n\tdoi = {10.48550/ARXIV.2509.07587},\n\tabstract = {An important thread in the study of data-stream algorithms focuses on settings where stream items are active only for a limited time. We introduce a new expiration model, where each item arrives with its own expiration time. The special case where items expire in the order that they arrive, which we call consistent expirations, contains the classical sliding-window model of Datar, Gionis, Indyk, and Motwani [SICOMP 2002] and its timestamp-based variant of Braverman and Ostrovsky [FOCS 2007].},\n\tlanguage = {en},\n\turldate = {2025-11-11},\n\tpublisher = {arXiv},\n\tauthor = {Blank, Lotte and Cabello, Sergio and Hajiaghayi, MohammadTaghi and Krauthgamer, Robert and Mahabadi, Sepideh and Nusser, André and Phillips, Jeff M. and Sauer, Jonas},\n\tyear = {2025},\n\tnote = {Version Number: 1},\n\tkeywords = {Data Structures and Algorithms (cs.DS), FOS: Computer and information sciences},\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n","author_short":["Blank, L.","Cabello, S.","Hajiaghayi, M.","Krauthgamer, R.","Mahabadi, S.","Nusser, A.","Phillips, J. M.","Sauer, J."],"key":"blank_general_2025","id":"blank_general_2025","bibbaseid":"blank-cabello-hajiaghayi-krauthgamer-mahabadi-nusser-phillips-sauer-thegeneralexpirationstreamingmodeldiameterkcentercountingsamplingandfriends-2025","role":"author","urls":{"Paper":"https://arxiv.org/abs/2509.07587"},"keyword":["Data Structures and Algorithms (cs.DS)","FOS: Computer and information sciences"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"misc","biburl":"https://bibbase.org/zotero-group/pratikmhatre/5933976","dataSources":["yJr5AAtJ5Sz3Q4WT4"],"keywords":["data structures and algorithms (cs.ds)","fos: computer and information sciences"],"search_terms":["general","expiration","streaming","model","diameter","center","counting","sampling","friends","blank","cabello","hajiaghayi","krauthgamer","mahabadi","nusser","phillips","sauer"],"title":"The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends","year":2025}