{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:16Z","timestamp":1773376576129,"version":"3.50.1"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206473","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"322-327","source":"Crossref","is-referenced-by-count":1,"title":["The Learning and Communication Complexity of Subsequence Containment"],"prefix":"10.1109","author":[{"given":"Mason","family":"DiCicco","sequence":"first","affiliation":[{"name":"Worcester Polytechnic Institute"}]},{"given":"Daniel","family":"Reichman","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Sequence to sequence learning with neural networks","volume":"27","author":"sutskever","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1120582.1120586"},{"key":"ref12","article-title":"String matching: Communication, circuits, and learning","author":"golovnev","year":"2019","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206473"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050018"},{"key":"ref14","first-page":"173","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"Departmental Papers (CIS)"},{"key":"ref36","article-title":"Computational separation between convolutional and fully-connected networks","author":"shalev-shwartz","year":"2020","journal-title":"International Conference on Learning Representations"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00153-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90026-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200047999"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/140962486"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682253"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-3165(03)00103-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50953-2_29"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.37236\/9452"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-7125-x"},{"key":"ref16","first-page":"336","article-title":"The communication and streaming complexity of computing the longest common and increasing subsequences","author":"sun","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27821-4_24"},{"key":"ref24","first-page":"1319","article-title":"The optimal sample complexity of pac learning","volume":"17","author":"hanneke","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90002-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574948"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032036"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283980"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.22"},{"key":"ref29","article-title":"Sketching, streaming, and fine-grained complexity of (weighted) lcs","author":"bringmann","year":"2018","journal-title":"38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824078"},{"key":"ref7","article-title":"Envelope-based anomaly detection for high-speed manufacturing processes","author":"mirylenka","year":"2013","journal-title":"EUROPEAN ADVANCED PROCESS CONTROL AND MANUFACTURING CONFERENCE"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.068"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3035032"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220670"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HealthCom.2016.7749493"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0034-6"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206473.pdf?arnumber=10206473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:32Z","timestamp":1773347192000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206473\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206473","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}