We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We show how graph neural networks can be used to solve the canonical graph coloring problem. We frame graph coloring as a multi-class node classification problem and utilize an unsupervised training strategy based on the statistical physics Potts model. Generalizations to other multi-class problems such as community detection, data clustering, and the minimum clique cover problem are straightforward. We provide numerical benchmark results and illustrate our approach with an end-to-end application for a real-world scheduling use case within a comprehensive encode-process-decode framework. Our optimization approach performs on par or outperforms existing solvers, with the ability to scale to problems with millions of variables.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.01606")
get_code_for_paper("2202.01606")
have("2202.01606")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.01606.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.01606)
Connect an agent — have() is free.