{"id":"https://openalex.org/W4386066474","doi":"https://doi.org/10.1109/isit54713.2023.10206473","title":"The Learning and Communication Complexity of Subsequence Containment","display_name":"The Learning and Communication Complexity of Subsequence Containment","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386066474","doi":"https://doi.org/10.1109/isit54713.2023.10206473"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206473","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206473","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081061182","display_name":"Mason DiCicco","orcid":"https://orcid.org/0000-0002-9311-4036"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mason DiCicco","raw_affiliation_strings":["Worcester Polytechnic Institute"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081855980","display_name":"Daniel Reichman","orcid":"https://orcid.org/0000-0003-0566-7528"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Reichman","raw_affiliation_strings":["Worcester Polytechnic Institute"],"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081061182"],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":0.1744,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56068665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"322","last_page":"327"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.8717383742332458},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.6879492402076721},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6488375663757324},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6155188083648682},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5642389059066772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5428909659385681},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48080435395240784},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4603211283683777},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4434627294540405},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.41495466232299805},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3670509457588196},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36458712816238403},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33096325397491455},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32456541061401367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2617499828338623},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.0686120092868805}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.8717383742332458},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.6879492402076721},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6488375663757324},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6155188083648682},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5642389059066772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5428909659385681},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48080435395240784},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4603211283683777},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4434627294540405},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.41495466232299805},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3670509457588196},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36458712816238403},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33096325397491455},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32456541061401367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2617499828338623},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0686120092868805},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206473","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206473","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1599370812","https://openalex.org/W1801581302","https://openalex.org/W1970630090","https://openalex.org/W1997164983","https://openalex.org/W2014342457","https://openalex.org/W2025177415","https://openalex.org/W2025722669","https://openalex.org/W2031816626","https://openalex.org/W2045313701","https://openalex.org/W2065937173","https://openalex.org/W2078427855","https://openalex.org/W2089797683","https://openalex.org/W2107740972","https://openalex.org/W2113049098","https://openalex.org/W2117745860","https://openalex.org/W2130942839","https://openalex.org/W2294581520","https://openalex.org/W2490907619","https://openalex.org/W2550291951","https://openalex.org/W2607102194","https://openalex.org/W2790235314","https://openalex.org/W2895104589","https://openalex.org/W2898584994","https://openalex.org/W2912739023","https://openalex.org/W2935783436","https://openalex.org/W2963412269","https://openalex.org/W2977350080","https://openalex.org/W3090420770","https://openalex.org/W3096909393","https://openalex.org/W3115612779","https://openalex.org/W3168996404","https://openalex.org/W4235132786","https://openalex.org/W4236362309","https://openalex.org/W4293399083","https://openalex.org/W4386066474","https://openalex.org/W6625667212","https://openalex.org/W6656576250","https://openalex.org/W6670054909","https://openalex.org/W6679436768","https://openalex.org/W6755163526","https://openalex.org/W6755642093","https://openalex.org/W6760258363"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W1974063126","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":{"We":[0,70],"consider":[1],"the":[2,11,39,76,82,86,90,97,109],"learning":[3,12,83,102],"and":[4,43,51,85],"communication":[5,40,87,91],"complexity":[6,78,88,99],"of":[7,68,81,89,100],"subsequence":[8,63,110],"containment.":[9],"In":[10,38],"problem,":[13,41],"we":[14],"seek":[15],"to":[16,55],"learn":[17],"a":[18,23,30,36,62,65],"classifier":[19],"that":[20,96],"positively":[21],"labels":[22],"binary":[24,32],"string":[25,33],"x":[26,42,58],"if":[27,57],"it":[28],"contains":[29,59],"fixed":[31],"y":[34,44,60],"as":[35,61],"subsequence.":[37],"are":[45],"partitioned":[46],"between":[47],"two":[48],"players,":[49],"Alice":[50],"Bob,":[52],"who":[53],"wish":[54],"determine":[56],"using":[64],"minimal":[66],"amount":[67],"communication.":[69],"devise":[71],"asymptotically":[72],"tight":[73],"bounds":[74],"for":[75],"sample":[77,98],"(VC":[79],"dimension)":[80],"problem":[84,103],"problem.":[92],"Our":[93],"results":[94],"illustrate":[95],"our":[101],"can":[104],"be":[105],"considerably":[106],"larger":[107],"when":[108],"occurs":[111],"in":[112],"non-contiguous":[113],"locations.":[114]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}