{"id":"https://openalex.org/W4415240543","doi":"https://doi.org/10.4230/lipics.icalp.2026.184","title":"Approximating 1-In-3 SAT by Linearly Ordered Hypergraph 3-Colouring Is NP-Hard","display_name":"Approximating 1-In-3 SAT by Linearly Ordered Hypergraph 3-Colouring Is NP-Hard","publication_year":2025,"publication_date":"2025-08-20","ids":{"openalex":"https://openalex.org/W4415240543","doi":"https://doi.org/10.4230/lipics.icalp.2026.184"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2508.14606","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.14606","pdf_url":"https://arxiv.org/pdf/2508.14606","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2508.14606","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003558662","display_name":"Andrei Krokhin","orcid":"https://orcid.org/0000-0003-4373-8227"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Krokhin, Andrei","raw_affiliation_strings":["Durham University, UK"],"raw_orcid":"https://orcid.org/0000-0003-4373-8227","affiliations":[{"raw_affiliation_string":"Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091295658","display_name":"Danny Vagnozzi","orcid":null},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Vagnozzi, Danny","raw_affiliation_strings":["Durham University, UK"],"raw_orcid":"https://orcid.org/0000-0001-9528-3557","affiliations":[{"raw_affiliation_string":"Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9430000185966492,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9387999773025513,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/hypergraph","display_name":"Hypergraph","score":0.6881999969482422},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.48489999771118164},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.46459999680519104},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.42640000581741333},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4246000051498413},{"id":"https://openalex.org/keywords/algebraic-topology","display_name":"Algebraic topology","score":0.4196000099182129},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.3197000026702881},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.30300000309944153}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6881999969482422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5551999807357788},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.48489999771118164},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.46459999680519104},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.42640000581741333},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C145054310","wikidata":"https://www.wikidata.org/wiki/Q212803","display_name":"Algebraic topology","level":3,"score":0.4196000099182129},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4092000126838684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3813999891281128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35030001401901245},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2728999853134155},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C2989065042","wikidata":"https://www.wikidata.org/wiki/Q7378971","display_name":"Algebraic properties","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:arXiv.org:2508.14606","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.14606","pdf_url":"https://arxiv.org/pdf/2508.14606","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26572","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.184","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.184/LIPIcs.ICALP.2026.184.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.icalp.2026.184","is_oa":true,"landing_page_url":"http://www.dagstuhl.de/dagpub/978-3-95977-003-3","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":"ConferencePaper"},{"id":"pmh:oai:durham-repository.worktribe.com:5445855","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/5445855","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"Presentation / Conference Contribution"},{"id":"doi:10.48550/arxiv.2508.14606","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2508.14606","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"},{"id":"doi:10.4230/lipics.icalp.2026.184","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.184","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2508.14606","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.14606","pdf_url":"https://arxiv.org/pdf/2508.14606","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3441472509","display_name":"Promise Constraint Satisfaction Problem: Structure and Complexity","funder_award_id":"EP/X033201/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415240543.pdf","grobid_xml":"https://content.openalex.org/works/W4415240543.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"1-in-3":[0,15,56,113,166],"SAT":[1,57,114,167],"is":[2,18,48,116,120,177],"a":[3,11,22,35,39,49,66,107,194],"classical":[4],"NP-hard":[5,19,124],"constraint":[6],"satisfaction":[7],"problem":[8,75,141,173],"(CSP).":[9],"Given":[10],"satisfiable":[12],"instance":[13],"of":[14,71,142,146,188],"SAT,":[16],"it":[17,28],"to":[20,32,38,90,132,139,159],"find":[21,34],"satisfying":[23],"assignment":[24],"for":[25,68,79,127,174,191],"it,":[26],"but":[27],"may":[29],"be":[30,102],"possible":[31],"efficiently":[33],"solution":[36],"subject":[37],"weaker":[40,72],"(not":[41],"necessarily":[42],"Boolean)":[43],"predicate":[44,176],"than":[45],"\"1-in-3\".":[46],"There":[47],"conjecture,":[50,58],"which":[51,96],"we":[52],"call":[53],"the":[54,74,80,83,91,140,164,172,182,186,189],"Approximate":[55,112,165],"made":[59],"independently":[60],"by":[61,104,181],"several":[62,153],"researchers,":[63],"that":[64,171],"predicts":[65],"dichotomy:":[67],"certain":[69],"choices":[70,82],"predicates":[73,192],"becomes":[76],"tractable":[77],"and":[78],"remaining":[81],"task":[84],"remains":[85],"NP-hard.":[86],"Such":[87],"problems":[88],"belong":[89],"Promise":[92],"CSP":[93,100],"(PCSP)":[94],"framework,":[95],"studies":[97],"how":[98],"one":[99],"can":[101],"approximated":[103],"another,":[105],"in":[106,152,162],"specific":[108,136],"qualitative":[109],"sense.":[110],"The":[111],"conjecture":[115,126,190],"notable":[117],"because":[118],"there":[119],"no":[121],"P":[122],"versus":[123],"dichotomy":[125],"general":[128],"PCSPs":[129],"yet":[130],"(due":[131],"insufficient":[133],"evidence).":[134],"One":[135],"predicate,":[137],"corresponding":[138],"linearly":[143],"ordered":[144],"3-colouring":[145],"3-uniform":[147],"hypergraphs,":[148],"has":[149],"been":[150],"mentioned":[151],"recent":[154],"papers":[155],"as":[156,179],"an":[157],"obstacle":[158],"further":[160],"progress":[161],"proving":[163],"conjecture.":[168,183],"We":[169],"prove":[170],"this":[175],"NP-hard,":[178],"predicted":[180],"This":[184],"completes":[185],"proof":[187],"on":[193],"3-element":[195],"domain.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-16T00:00:00"}