{'fraction_non_alphanumeric': 0.017526777020447908, 'fraction_numerical': 0.0, 'mean_word_length': 5.632258064516129, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Matching crystal structures atom-to-atom.

Finding an optimal match between two different crystal structures underpins many important materials science problems, including describing solid-solid phase transitions and developing models for interface and grain boundary structures. In this work, we formulate the matching of crystals as an optimization problem where the goal is to find the alignment and the atom-to-atom map that minimize a given cost function such as the Euclidean distance between the atoms. We construct an algorithm that directly solves this problem for large finite portions of the crystals and retrieves the periodicity of the match subsequently. We demonstrate its capacity to describe transformation pathways between known polymorphs and to reproduce experimentally realized structures of semi-coherent interfaces. Additionally, from our findings, we define a rigorous metric for measuring distances between crystal structures that can be used to properly quantify their geometric (Euclidean) closeness.