{"id":"https://openalex.org/W7161676152","doi":"https://doi.org/10.48550/arxiv.2605.17760","title":"Tolerant Testing for Unique Games","display_name":"Tolerant Testing for Unique Games","publication_year":2026,"publication_date":"2026-05-18","ids":{"openalex":"https://openalex.org/W7161676152","doi":"https://doi.org/10.48550/arxiv.2605.17760"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.17760","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17760","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":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.2605.17760","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136468680","display_name":"Yuichi Yoshida","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yoshida, Yuichi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5136468680"],"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.5421000123023987,"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.5421000123023987,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.16590000689029694,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.12389999628067017,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/fraction","display_name":"Fraction (chemistry)","score":0.7258999943733215},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6365000009536743},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.3555999994277954},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.29919999837875366},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.29089999198913574},{"id":"https://openalex.org/keywords/transposition","display_name":"Transposition (logic)","score":0.287200003862381}],"concepts":[{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.7258999943733215},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6365000009536743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5224999785423279},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49790000915527344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46000000834465027},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4138999879360199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4041000008583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3824999928474426},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C12455157","wikidata":"https://www.wikidata.org/wiki/Q7835331","display_name":"Transposition (logic)","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.17760","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17760","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":"doi:10.48550/arxiv.2605.17760","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17760","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":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":{"We":[0,71],"give":[1,73],"tolerant":[2,16],"testers":[3,17],"with":[4,58,140],"sublinear":[5],"query":[6],"complexity":[7],"in":[8,128],"the":[9,29,79,90,100,107,144],"adjacency-list":[10],"model":[11],"for":[12,51,77],"Unique":[13,27,84,102],"Games.":[14,85],"Prior":[15],"required":[18],"structural":[19],"assumptions":[20],"such":[21],"as":[22],"expansion":[23],"or":[24],"clusterability.":[25],"For":[26],"Games,":[28],"tester":[30,76,91,109],"distinguishes":[31,110],"instances":[32,57],"whose":[33,45],"optimum":[34,46],"fraction":[35,123,137],"of":[36,83,124,138],"violated":[37],"constraints":[38],"is":[39,47],"at":[40,48,119,133],"most":[41,120],"$\\varepsilon$":[42,122],"from":[43,126],"those":[44],"least":[49,134],"$\u03c1$,":[50],"$0<\\varepsilon<\u03c1<1$,":[52],"assuming":[53,147],"$\\varepsilon\\log":[54,148],"n\\lesssim\u03c1^4$.":[55],"On":[56],"$n$":[59],"vertices":[60],"and":[61,96],"$m$":[62],"constraints,":[63],"it":[64],"uses":[65],"$\\widetilde":[66,151],"O(\\sqrt":[67,152],"m\\,\u03c1^{-13/2}+n\u03c1^{-2}/\\sqrt":[68],"m)$":[69],"queries.":[70,155],"also":[72],"a":[74,135],"specialized":[75],"bipartiteness,":[78],"$Q=2$":[80],"transposition":[81],"case":[82],"Exploiting":[86],"its":[87],"signed":[88],"structure,":[89],"achieves":[92],"substantially":[93],"better":[94],"tolerance":[95],"query-complexity":[97],"guarantees":[98],"than":[99],"generic":[101],"Games":[103],"tester.":[104],"Writing":[105],"$\u03bb=\u03c1/(1+\\log(1/\u03c1))$,":[106],"bipartiteness":[108],"graphs":[111,127],"that":[112],"can":[113],"be":[114],"made":[115],"bipartite":[116],"by":[117],"deleting":[118],"an":[121],"edges":[125,139],"which":[129],"every":[130],"bipartition":[131],"has":[132],"$\u03c1$":[136],"both":[141],"endpoints":[142],"on":[143],"same":[145],"side,":[146],"n\\lesssim\u03bb^2$,":[149],"using":[150],"m/\u03bb^2+n/(\\sqrt":[153],"m\\,\u03bb))$":[154]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-20T00:00:00"}