{"id":"https://openalex.org/W7165367027","doi":"https://doi.org/10.48550/arxiv.2606.20399","title":"Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?","display_name":"Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?","publication_year":2026,"publication_date":"2026-06-18","ids":{"openalex":"https://openalex.org/W7165367027","doi":"https://doi.org/10.48550/arxiv.2606.20399"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.20399","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20399","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":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.20399","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020514641","display_name":"Benjamin Carleton","orcid":"https://orcid.org/0000-0003-2369-4423"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carleton, Benjamin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061361547","display_name":"Michael C. Chavrimootoo","orcid":"https://orcid.org/0000-0002-0510-6002"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chavrimootoo, Michael C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138478816","display_name":"Lane A. Hemaspaandra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hemaspaandra, Lane A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077178084","display_name":"David E. Narv\u00e1ez","orcid":"https://orcid.org/0000-0003-3704-1060"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Narv\u00e1ez, David E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028754725","display_name":"Conor Taliancich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Taliancich, Conor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112804040","display_name":"Melissa Welsh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Welsh, Melissa","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":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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8508999943733215,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8508999943733215,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.055399999022483826,"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/T10237","display_name":"Cryptography and Data Security","score":0.030799999833106995,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.7245000004768372},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6277999877929688},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5856000185012817},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.5605999827384949},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5317000150680542},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5166000127792358},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.4832000136375427},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.45980000495910645},{"id":"https://openalex.org/keywords/arrow","display_name":"Arrow","score":0.4410000145435333}],"concepts":[{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.7245000004768372},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6913999915122986},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6277999877929688},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5856000185012817},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.5605999827384949},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5317000150680542},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5166000127792358},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4832000136375427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46720001101493835},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.45980000495910645},{"id":"https://openalex.org/C2780339515","wikidata":"https://www.wikidata.org/wiki/Q3074698","display_name":"Arrow","level":2,"score":0.4410000145435333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40790000557899475},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4002000093460083},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.39820000529289246},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.35670000314712524},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.3492000102996826},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.3075999915599823},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.257999986410141},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.20399","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20399","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":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.20399","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.20399","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":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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Ambiguity-bounded":[0],"versions":[1],"of":[2,12,24,62,81,91,206,224,246,249],"$\\mathrm{NP}$,":[3],"denoted":[4],"$\\mathrm{UP}_{\\leq":[5],"f(n)}$,":[6],"bound":[7,44,52],"by":[8],"$f(n)$":[9],"the":[10,15,49,127,247],"number":[11],"accepting":[13],"paths":[14],"nondeterministic":[16],"polynomial-time":[17],"Turing":[18],"machine":[19],"can":[20],"have":[21,83],"on":[22,237],"inputs":[23],"length":[25],"$n$.":[26],"Such":[27],"classes":[28,64],"range":[29],"from":[30],"Valiant's":[31],"completely":[32],"unambiguous":[33],"($f(n)=1$)":[34],"class":[35,205,223],"$\\mathrm{UP}$":[36],"to":[37,59,70,142,194],"$\\mathrm{NP}$":[38],"itself,":[39],"where":[40],"there":[41,47,146],"is":[42,48,147,166],"no":[43,264],"or,":[45],"equivalently,":[46],"toothless":[50],"exponential":[51],"($f(n)":[53],"=":[54,106,111,154,173,181],"2^{n^{O(1)}}$).":[55],"This":[56],"paper":[57],"seeks":[58],"understand":[60],"which":[61,89,117,136,184],"these":[63],"stand":[65],"and":[66,130,242],"fall":[67],"together":[68],"as":[69],"whether":[71],"they":[72],"equal":[73],"deterministic":[74],"polynomial":[75],"time.":[76],"Informally":[77],"put,":[78],"what":[79],"ranges":[80],"ambiguities":[82,239],"linked":[84],"fates?":[85],"That":[86],"is,":[87],"for":[88,116,135,259],"pairs":[90,118,137],"nondecreasing":[92],"functions,":[93],"$(f_1":[94],",f_2)$,":[95],"satisfying":[96],"$(\\forall":[97],"n)[f_1(n)":[98],"\\leq":[99],"f_2(n)]$,":[100],"does":[101,119,138],"it":[102,124],"hold":[103,121,143],"that":[104,120,139,152,170,210,234,258],"$\\mathrm{P}":[105],"\\mathrm{UP}_{\\leq":[107,112,155,158,174,182],"f_1(n)}":[108],"\\implies":[109,176],"\\mathrm{P}":[110,172],"f_2(n)}$.":[113],"More":[114],"particularly,":[115],"robustly,":[122,144],"i.e.,":[123,145],"holds":[125,186,266],"in":[126],"real":[128],"world":[129],"every":[131],"relativized":[132],"world?":[133],"And":[134],"implication":[140],"fail":[141],"an":[148],"oracle":[149],"$A$":[150],"such":[151],"$\\mathrm{P}^A":[153],"f_1(n)}^A":[156],"\\subsetneq":[157],"f_2(n)}^A$?":[159],"The":[160],"only":[161,193],"previously":[162],"known":[163],"positive":[164,199],"result":[165,169],"Watanabe's":[167],"1988":[168],"$":[171],"1}":[175],"(\\forall":[177],"k":[178],"\\geq":[179],"1)[\\mathrm{P}":[180],"k}]$,":[183],"even":[185,213,236],"robustly.":[187,267],"His":[188],"result,":[189,200],"though":[190],"lovely,":[191],"applies":[192],"constant-bounded":[195],"ambiguities.":[196],"As":[197,253],"our":[198,222],"we":[201,226,256],"present":[202],"a":[203,230,243],"new":[204,244],"cases":[207],"(Theorem":[208,240],"3.8)":[209],"apply":[211],"(and":[212],"robustly":[214],"apply)":[215],"at":[216],"greater":[217],"ambiguity":[218],"levels.":[219],"To":[220],"give":[221],"cases,":[225,263],"leverage":[227],"two":[228],"approaches:":[229],"novel":[231],"path-poisoning":[232],"approach":[233],"works":[235],"superconstant":[238],"3.5)":[241],"application":[245],"power":[248],"padding":[250],"(Theorems":[251],"3.3/3.4).":[252],"negative":[254],"results,":[255],"show":[257],"essentially":[260],"all":[261],"other":[262],"linkage":[265]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-20T00:00:00"}