{"id":"https://openalex.org/W7164535418","doi":"https://doi.org/10.48550/arxiv.2606.12647","title":"Token Complexity Theory for AI-Augmented Computing","display_name":"Token Complexity Theory for AI-Augmented Computing","publication_year":2026,"publication_date":"2026-06-10","ids":{"openalex":"https://openalex.org/W7164535418","doi":"https://doi.org/10.48550/arxiv.2606.12647"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.12647","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.12647","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.12647","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138524455","display_name":"Jie Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wang, Jie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5138524455"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.6852999925613403,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.6852999925613403,"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/T14347","display_name":"Big Data and Digital Economy","score":0.03620000183582306,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.03590000048279762,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.7285000085830688},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4948999881744385},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4645000100135803},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4449000060558319},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.38510000705718994},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.34139999747276306},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.31769999861717224},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.30250000953674316},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3018999993801117}],"concepts":[{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.7285000085830688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7171000242233276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5321000218391418},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4948999881744385},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4449000060558319},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38510000705718994},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.31769999861717224},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.30250000953674316},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.2703999876976013},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26739999651908875},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.2612999975681305},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.2551000118255615},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.12647","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.12647","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.12647","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.12647","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"AI-augmented":[0],"computing":[1],"delegates":[2],"natural":[3],"language":[4],"queries,":[5],"code":[6],"generation":[7],"requests,":[8],"and":[9,22,45,78,117,153,190,195],"other":[10],"open-ended":[11],"tasks":[12,163],"to":[13,44,67],"a":[14,28,50,56,69,76,80,105,111],"cluster":[15],"of":[16,41,72,88,99,155,162,182],"AI":[17,83],"models":[18],"that":[19,31,125,174],"processes":[20],"queries":[21,43],"generates":[23],"responses.":[24],"This":[25],"paradigm":[26],"introduces":[27],"resource":[29,58,185],"dimension":[30],"neither":[32],"classical":[33],"time":[34],"nor":[35],"space":[36],"complexity":[37,95,127,160,176],"captures:":[38],"the":[39,62,86,97,168,175,180],"cost":[40,66,151,170],"sending":[42],"receiving":[46],"responses":[47],"from":[48],"such":[49],"cluster.":[51],"We":[52,92,120,172],"introduce":[53],"token":[54,65,94,126,159],"complexity,":[55],"formal":[57],"measure":[59],"defined":[60,178],"as":[61,129,179],"minimum":[63],"expected":[64],"achieve":[68],"specified":[70],"level":[71],"output":[73],"quality":[74,133],"on":[75,167],"task,":[77],"develop":[79,93],"taxonomy":[81],"classifying":[82],"systems":[84],"by":[85],"strength":[87],"their":[89],"probabilistic":[90,106],"properties.":[91],"within":[96],"framework":[98],"AI-Oracle":[100],"Turing":[101,107],"machines,":[102],"in":[103,187],"which":[104],"machine":[108],"interacts":[109],"with":[110],"stochastic":[112],"oracle":[113],"via":[114],"dedicated":[115],"query":[116],"response":[118],"tapes.":[119],"prove":[121,173],"basic":[122],"theorems":[123],"establishing":[124],"behaves":[128],"expected:":[130],"monotonicity":[131],"(higher":[132],"costs":[134],"more":[135,142],"tokens),":[136],"convexity":[137],"(quality":[138],"improvements":[139],"become":[140],"progressively":[141],"expensive),":[143],"price":[144,147],"sensitivity":[145],"(small":[146],"changes":[148],"produce":[149],"bounded":[150],"changes),":[152],"price-relativity":[154],"task":[156],"ordering":[157,161],"(the":[158],"can":[164],"reverse":[165],"depending":[166],"query-to-response":[169],"ratio).":[171],"frontier,":[177],"set":[181],"all":[183],"feasible":[184],"bounds":[186],"tokens,":[188],"time,":[189],"space,":[191],"is":[192],"non-empty,":[193],"upward-closed,":[194],"convex.":[196]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-13T00:00:00"}