{"id":"https://openalex.org/W7134087870","doi":"https://doi.org/10.48550/arxiv.2603.05221","title":"Reachability in VASS Extended with Integer Counters","display_name":"Reachability in VASS Extended with Integer Counters","publication_year":2026,"publication_date":"2026-03-05","ids":{"openalex":"https://openalex.org/W7134087870","doi":"https://doi.org/10.48550/arxiv.2603.05221"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.05221","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013851110","display_name":"Clotilde Bizi\u00e8re","orcid":"https://orcid.org/0009-0003-6469-1170"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bizi\u00e8re, Clotilde","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128241247","display_name":"Wojciech Czerwi\u0144ski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Czerwi\u0144ski, Wojciech","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085414641","display_name":"Roland Guttenberg","orcid":"https://orcid.org/0000-0001-6140-6707"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guttenberg, Roland","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014652670","display_name":"J\u00e9r\u00f4me Leroux","orcid":"https://orcid.org/0000-0002-7214-9467"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leroux, J\u00e9r\u00f4me","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049669533","display_name":"Vincent Michielini","orcid":"https://orcid.org/0000-0002-1413-9316"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michielini, Vincent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128262396","display_name":"\u0141ukasz Orlikowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orlikowski, \u0141ukasz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128256676","display_name":"Antoni Puch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Puch, Antoni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054654967","display_name":"Henry Sinclair-Banks","orcid":"https://orcid.org/0000-0003-1653-4069"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sinclair-Banks, Henry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28667897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.5572999715805054,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.5572999715805054,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13009999692440033,"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/T10142","display_name":"Formal Methods in Verification","score":0.07490000128746033,"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/reachability","display_name":"Reachability","score":0.9039999842643738},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.8503000140190125},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7239000201225281},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6848000288009644},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5709999799728394},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5024999976158142},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4884999990463257},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4361000061035156}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9039999842643738},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8503000140190125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7590000033378601},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7239000201225281},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6848000288009644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6827999949455261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.616100013256073},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5709999799728394},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5024999976158142},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4884999990463257},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4361000061035156},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3244999945163727},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3215000033378601},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C11821877","wikidata":"https://www.wikidata.org/wiki/Q187959","display_name":"Distributive property","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2581000030040741}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.05221","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.05221","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.05221","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.05221","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,36,53,133,153],"consider":[1],"a":[2,79],"variant":[3],"of":[4,40,49,69,127],"VASS":[5,119],"extended":[6],"with":[7,16,108,120],"integer":[8,121],"counters,":[9],"denoted":[10],"VASS+Z.":[11],"These":[12],"are":[13,23],"automata":[14],"equipped":[15],"N":[17],"and":[18,28,171],"Z":[19],"counters;":[20],"the":[21,29,38,41,47,90,99,106,125],"N-counters":[22,50,128],"required":[24],"to":[25,130],"remain":[26],"nonnegative":[27],"Z-counters":[30,107,143],"do":[31],"not":[32],"have":[33],"this":[34,144],"restriction.":[35],"study":[37],"complexity":[39,91,103,170],"reachability":[42,56,85,136,157,165],"problem":[43],"for":[44],"VASS+Z":[45],"when":[46,62],"number":[48,126],"is":[51,57,64,140,147,161,173],"fixed.":[52],"show":[54,116],"that":[55,84,117,135,156],"NP-complete":[58],"in":[59,86,89,137,150,158,166,176],"1-VASS+Z":[60],"(i.e.":[61],"there":[63],"only":[65,148,174],"one":[66],"N-counter)":[67],"regardless":[68],"unary":[70,138,159],"or":[71],"binary":[72],"encoding.":[73],"For":[74],"$d":[75],"\\geq":[76],"2$,":[77],"using":[78],"KLMST-based":[80],"algorithm,":[81],"we":[82,115],"prove":[83,134,155],"d-VASS+Z":[87],"lies":[88],"class":[92],"$\\mathcal{F}_{d+2}$.":[93],"Our":[94],"upper":[95,113],"bound":[96,146],"improves":[97],"on":[98],"naively":[100],"obtained":[101],"Ackermannian":[102],"by":[104],"simulating":[105],"N-counters.":[109],"To":[110],"complement":[111],"our":[112],"bounds,":[114],"extending":[118],"counters":[122],"significantly":[123],"lowers":[124],"needed":[129],"exhibit":[131],"hardness.":[132],"2-VASS+Z":[139],"PSPACE-hard;":[141],"without":[142],"lower":[145],"known":[149,175],"dimension":[151,177],"5.":[152],"also":[154],"3-VASS+Z":[160],"TOWER-hard.":[162],"Without":[163],"Z-counters,":[164],"3-VASS":[167],"has":[168],"elementary":[169],"TOWER-hardness":[172],"8.":[178]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-07T00:00:00"}