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 demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures in extremal combinatorics and graph theory. Amongst the conjectures we refute are a question of Brualdi and Cao about maximizing permanents of pattern avoiding matrices, and several problems related to the adjacency and distance eigenvalues of graphs.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.14516")
get_code_for_paper("2104.14516")
have("2104.14516")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.14516.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.14516)
Connect an agent — have() is free.