{"id":"https://openalex.org/W7163358630","doi":"https://doi.org/10.48550/arxiv.2606.03923","title":"Contrastive Neural Algorithmic Reasoning for Graph Coloring","display_name":"Contrastive Neural Algorithmic Reasoning for Graph Coloring","publication_year":2026,"publication_date":"2026-06-02","ids":{"openalex":"https://openalex.org/W7163358630","doi":"https://doi.org/10.48550/arxiv.2606.03923"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.03923","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03923","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.2606.03923","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034331422","display_name":"Thien Le","orcid":"https://orcid.org/0000-0002-0111-7273"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Le, Thien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137716367","display_name":"Tianyu Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Tianyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137748090","display_name":"Melanie Weber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weber, Melanie","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/T11273","display_name":"Advanced Graph Neural Networks","score":0.6085000038146973,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.6085000038146973,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.09099999815225601,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.029999999329447746,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5623000264167786},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4586000144481659},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45570001006126404},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.39149999618530273},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.3831000030040741},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.3822999894618988},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.3774000108242035}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5623000264167786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5164999961853027},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4790000021457672},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4611000120639801},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45570001006126404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4442000091075897},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.39149999618530273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38830000162124634},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3831000030040741},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3822999894618988},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.3774000108242035},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3325999975204468},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.3310000002384186},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.30559998750686646},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2962000072002411},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2874999940395355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27959999442100525},{"id":"https://openalex.org/C104597421","wikidata":"https://www.wikidata.org/wiki/Q5148529","display_name":"Color-coding","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2587999999523163}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.03923","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03923","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.2606.03923","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03923","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graph":[0],"coloring":[1,88],"seeks":[2],"to":[3,6,32,49,135],"assigns":[4],"colors":[5,20,37],"a":[7,81,124,136,162,172,177],"graph's":[8],"nodes":[9,13,95,129],"so":[10],"that":[11,85,120,188],"adjacent":[12,98],"receive":[14],"different":[15],"colors,":[16],"using":[17],"as":[18,21,58],"few":[19],"possible.":[22],"Here,":[23],"we":[24,118],"study":[25],"approximate":[26],"$k$-coloring,":[27],"where":[28,90],"the":[29,40,91,108,131,151],"goal":[30],"is":[31,47,155],"use":[33],"at":[34],"most":[35],"$k$":[36],"while":[38,97],"minimizing":[39],"number":[41],"of":[42,93,128,130],"monochromatic":[43],"edges.":[44],"This":[45,145],"problem":[46],"central":[48],"graph":[50,74],"theory":[51],"and":[52,60,76,140,154,184,194,199],"has":[53,171],"applications":[54],"in":[55,150],"areas":[56],"such":[57],"scheduling":[59],"resource":[61],"allocation.":[62],"Recent":[63],"unsupervised":[64],"GNN":[65,190],"approaches":[66],"optimize":[67],"each":[68],"instance":[69],"directly,":[70],"precluding":[71],"generalization":[72],"across":[73],"sizes":[75],"distributions.":[77],"We":[78,106],"instead":[79],"propose":[80],"contrastive":[82,189],"learning":[83],"framework":[84],"learns":[86],"transferable":[87],"geometry":[89,146],"embeddings":[92],"same-color":[94],"align,":[96],"nodes'":[99],"representations":[100],"are":[101],"pushed":[102],"toward":[103],"distinct":[104],"directions.":[105],"analyze":[107],"resulting":[109],"population":[110],"objective":[111],"over":[112],"bounded-size":[113],"graphs.":[114],"For":[115],"unit-norm":[116],"embeddings,":[117],"show":[119,187],"its":[121],"optima":[122],"have":[123],"line-prototype":[125],"structure:":[126],"Representations":[127],"same":[132],"color":[133],"collapse":[134],"shared":[137],"one-dimensional":[138],"subspace,":[139],"edges":[141],"connect":[142],"orthogonal":[143],"subspaces.":[144],"yields":[147],"stationarity":[148],"conditions":[149],"supervised":[152],"setting":[153],"preserved":[156],"by":[157,176],"projected":[158],"subgradient":[159],"dynamics":[160],"under":[161],"balanced-coloring":[163],"assumption.":[164],"In":[165],"an":[166],"unnormalized":[167],"variant,":[168],"gradient":[169],"descent":[170],"max-margin":[173],"bias":[174],"governed":[175],"quotient-graph":[178],"hard-margin":[179],"problem.":[180],"Experiments":[181],"on":[182,202],"synthetic":[183],"real-world":[185],"graphs":[186],"encoders":[191],"generalize":[192],"effectively":[193],"produce":[195],"low-conflict":[196],"colorings,":[197],"matching":[198],"sometimes":[200],"improving":[201],"greedy":[203],"approaches.":[204]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-04T00:00:00"}