{"id":"https://openalex.org/W7134849141","doi":"https://doi.org/10.48550/arxiv.2603.07176","title":"Learning to Rank the Initial Branching Order of SAT Solvers","display_name":"Learning to Rank the Initial Branching Order of SAT Solvers","publication_year":2026,"publication_date":"2026-03-07","ids":{"openalex":"https://openalex.org/W7134849141","doi":"https://doi.org/10.48550/arxiv.2603.07176"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.07176","is_oa":true,"landing_page_url":null,"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":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046624075","display_name":"Arvid Eriksson","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Eriksson, Arvid","raw_affiliation_strings":["KTH Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127847833","display_name":"Gabriel Poesia","orcid":null},"institutions":[{"id":"https://openalex.org/I4210157861","display_name":"Harvard Stem Cell Institute","ror":"https://ror.org/04kj1hn59","country_code":"US","type":"facility","lineage":["https://openalex.org/I136199984","https://openalex.org/I4210157861"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Poesia, Gabriel","raw_affiliation_strings":["Kempner Institute at Harvard University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kempner Institute at Harvard University","institution_ids":["https://openalex.org/I4210157861"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128671970","display_name":"Roman Bresson","orcid":null},"institutions":[{"id":"https://openalex.org/I4210113480","display_name":"Mohamed bin Zayed University of Artificial Intelligence","ror":"https://ror.org/0258gkt32","country_code":"AE","type":"education","lineage":["https://openalex.org/I4210113480"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"Bresson, Roman","raw_affiliation_strings":["Mohamed Bin Zayed University of Artificial Intelligence"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mohamed Bin Zayed University of Artificial Intelligence","institution_ids":["https://openalex.org/I4210113480"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128651660","display_name":"Karl Henrik Johansson","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johansson, Karl Henrik","raw_affiliation_strings":["KTH Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073873489","display_name":"David Broman","orcid":"https://orcid.org/0000-0001-8457-4105"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Broman, David","raw_affiliation_strings":["KTH Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30126669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10142","display_name":"Formal Methods in Verification","score":0.4528999924659729,"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/T10142","display_name":"Formal Methods in Verification","score":0.4528999924659729,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.4503999948501587,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.013899999670684338,"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/branching","display_name":"Branching (polymer chemistry)","score":0.7208999991416931},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5669999718666077},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5072000026702881},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46399998664855957},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4551999866962433},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.29350000619888306}],"concepts":[{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.7208999991416931},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5669999718666077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5357000231742859},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49309998750686646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46399998664855957},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4551999866962433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4043999910354614},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39259999990463257},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3434000015258789},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32249999046325684},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29179999232292175},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.26809999346733093},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2567000091075897}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.07176","is_oa":true,"landing_page_url":null,"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":"Article"},{"id":"doi:10.48550/arxiv.2603.07176","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.07176","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":"pmh:doi:10.48550/arxiv.2603.07176","is_oa":true,"landing_page_url":null,"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":"Article"},"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":{"Finding":[0],"good":[1,28,77],"branching":[2,14,29,42,90,106],"orders":[3,15,43,91,107],"is":[4,16],"key":[5],"to":[6,25,52,66,86,103,129,156,168],"solving":[7],"SAT":[8,57,72],"problems":[9],"efficiently,":[10],"but":[11],"finding":[12],"such":[13,88],"a":[17,21,27,49,76,93,99,114],"difficult":[18,149],"problem.":[19],"Using":[20],"learning":[22,55],"based":[23],"approach":[24],"predict":[26,104],"order":[30],"before":[31],"solving,":[32],"therefore,":[33],"has":[34],"potential.":[35],"In":[36],"this":[37,155],"paper,":[38],"we":[39,81,97,138],"investigate":[40],"predicting":[41],"using":[44],"graph":[45,100],"neural":[46,101],"networks":[47],"as":[48],"preprocessing":[50],"step":[51],"conflict-driven":[53],"clause":[54],"(CDCL)":[56],"solvers.":[58],"We":[59,153],"show":[60,109],"that":[61,113,141],"there":[62],"are":[63],"significant":[64,118],"gains":[65],"be":[67],"made":[68],"in":[69,92],"existing":[70],"CDCL":[71],"solvers":[73],"by":[74],"providing":[75],"initial":[78,89],"branching.":[79],"Further,":[80],"provide":[82],"three":[83],"labeling":[84],"methods":[85],"find":[87,140],"tractable":[94],"way.":[95],"Finally,":[96],"train":[98],"network":[102],"these":[105,172],"and":[108,123,150,167],"through":[110],"our":[111],"evaluations":[112],"GNN-initialized":[115],"ordering":[116],"yields":[117],"speedups":[119],"on":[120],"random":[121],"3-CNF":[122],"pseudo-industrial":[124],"benchmarks,":[125],"with":[126],"generalization":[127],"capabilities":[128],"instances":[130],"much":[131],"larger":[132],"than":[133],"the":[134,142,157,164,169],"training":[135],"set.":[136],"However,":[137],"also":[139],"predictions":[143],"fail":[144],"at":[145],"speeding":[146],"up":[147],"more":[148],"industrial":[151],"instances.":[152],"attribute":[154],"solver's":[158],"dynamic":[159],"heuristics,":[160],"which":[161],"rapidly":[162],"overwrite":[163],"provided":[165],"initialization,":[166],"complexity":[170],"of":[171],"instances,":[173],"making":[174],"GNN":[175],"prediction":[176],"hard.":[177]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-11T00:00:00"}