{"paper":{"title":"Classification of string links up to $2n$-moves and link-homotopy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Akira Yasuhara, Haruko A. Miyazawa, Kodai Wada","submitted_at":"2019-02-16T10:02:12Z","abstract_excerpt":"Two string links are equivalent up to $2n$-moves and link-homotopy if and only if their all Milnor link-homotopy invariants are congruent modulo $n$. Moreover, the set of the equivalence classes forms a finite group generated by elements of order $n$. The classification induces that if two string links are equivalent up to $2n$-moves for every $n>0$, then they are link-homotopic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06079","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}