{"id":"https://openalex.org/W7160919652","doi":"https://doi.org/10.48550/arxiv.2605.09815","title":"Towards infinite PCSP: a dichotomy for monochromatic cliques","display_name":"Towards infinite PCSP: a dichotomy for monochromatic cliques","publication_year":2026,"publication_date":"2026-05-10","ids":{"openalex":"https://openalex.org/W7160919652","doi":"https://doi.org/10.48550/arxiv.2605.09815"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.09815","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09815","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":"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.09815","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098728123","display_name":"Demian Banakh","orcid":"https://orcid.org/0009-0008-7159-3735"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Banakh, Demian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135952230","display_name":"Alexey Barsukov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barsukov, Alexey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072517256","display_name":"Tamio-Vesa Nakajima","orcid":"https://orcid.org/0000-0003-3684-9412"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nakajima, Tamio-Vesa","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/T10374","display_name":"Advanced Graph Theory Research","score":0.6057000160217285,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.6057000160217285,"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.22300000488758087,"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.05310000106692314,"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/hypergraph","display_name":"Hypergraph","score":0.7639999985694885},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6237999796867371},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5317999720573425},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5192000269889832},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5081999897956848},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.44449999928474426},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4083000123500824},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.38600000739097595}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7639999985694885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6682000160217285},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6237999796867371},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5317999720573425},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5192000269889832},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5081999897956848},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.44449999928474426},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4083000123500824},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.38600000739097595},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.29899999499320984},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29429998993873596},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2734000086784363},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.09815","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09815","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":"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.09815","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09815","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":"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":{"The":[0],"logic":[1,10],"MMSNP":[2,29,50],"is":[3,63,141,157,172],"a":[4,13,52,67,94,106,116,127,151,161,164],"well-studied":[5],"fragment":[6],"of":[7,48,55,87,121,134,175,179,193,202,207],"Existential":[8],"Second-Order":[9],"that,":[11],"from":[12,90],"computational":[14],"perspective,":[15],"captures":[16],"finite-domain":[17,42],"Constraint":[18],"Satisfaction":[19],"Problems":[20],"(CSPs)":[21],"modulo":[22],"polynomial-time":[23],"reductions.":[24],"At":[25],"the":[26,46,74,79,85,112,122,144,176,190,203],"same":[27],"time,":[28],"contains":[30],"many":[31],"problems":[32],"that":[33,59,139,198],"are":[34],"expressible":[35],"as":[36,41],"$\u03c9$-categorical":[37],"CSPs":[38],"but":[39],"not":[40],"ones.":[43],"We":[44,57,82],"initiate":[45],"study":[47],"Promise":[49,69],"(PMMSNP),":[51],"promise":[53,80,97],"analogue":[54],"MMSNP.":[56],"show":[58,197],"every":[60],"PMMSNP":[61],"problem":[62],"poly-time":[64],"equivalent":[65],"to":[66,78,148,159],"(finite-domain)":[68],"CSP":[70],"(PCSP),":[71],"thereby":[72],"extending":[73],"classical":[75],"MMSNP-CSP":[76],"correspondence":[77],"setting.":[81],"then":[83],"investigate":[84],"complexity":[86,108],"PMMSNPs":[88],"arising":[89],"forbidding":[91],"monochromatic":[92],"cliques,":[93],"class":[95],"encompassing":[96],"graph":[98],"colouring":[99,162,205],"problems.":[100],"For":[101],"this":[102,194],"class,":[103],"we":[104,137,196],"obtain":[105],"full":[107],"classification":[109],"conditional":[110],"on":[111],"Rich":[113,145],"2-to-1":[114,146],"Conjecture,":[115,147],"recently":[117],"proposed":[118],"perfect-completeness":[119],"surrogate":[120],"Unique":[123],"Games":[124],"Conjecture.":[125],"As":[126],"key":[128],"intermediate":[129],"step":[130],"which":[131],"may":[132],"be":[133],"independent":[135],"interest,":[136],"prove":[138],"it":[140,156,199],"NP-hard,":[142],"under":[143],"properly":[149],"colour":[150],"uniform":[152],"hypergraph":[153],"even":[154],"if":[155],"promised":[158],"admit":[160],"satisfying":[163],"certain":[165],"technical":[166],"condition":[167],"called":[168],"reconfigurability.":[169],"This":[170],"proof":[171],"an":[173],"extension":[174],"recent":[177],"work":[178],"Braverman,":[180],"Khot,":[181],"Lifshitz":[182],"and":[183,210],"Minzer":[184],"(Adv.":[185],"Math.":[186],"2025).":[187],"To":[188],"illustrate":[189],"broad":[191],"applicability":[192],"theorem,":[195],"implies":[200],"most":[201],"linearly-ordered":[204],"conjecture":[206],"Barto,":[208],"Battistelli,":[209],"Berg":[211],"(STACS":[212],"2021).":[213]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}