{"id":"2606.19185","title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network","url":"https://codeofpaper.com/paper/2606.19185","arxiv_url":"https://arxiv.org/abs/2606.19185","published":"2026-06-17","code":"official","best":{"full_name":"LabRAI/AGDN","url":"https://github.com/LabRAI/AGDN","tier":"official","stars":1,"license":"MIT","framework":null,"language":"Python","last_commit":"2026-06-01T19:18:17"},"most_starred_community":null,"implementations":[{"full_name":"LabRAI/AGDN","url":"https://github.com/LabRAI/AGDN","tier":"official","stars":1,"license":"MIT","framework":null,"language":"Python","last_commit":"2026-06-01T19:18:17"}],"possible_matches":0}