pith. sign in

arxiv: 2303.13486 · v2 · submitted 2023-03-23 · 🧮 math.MG · cs.CG

Complete invariants of atomic clouds under rigid motion with Lipschitz continuous metrics in a polynomial time

Vitaliy Kurlin This is my paper

Pith reviewed 2026-05-24 09:54 UTC · model grok-4.3

classification 🧮 math.MG cs.CG
keywords point cloudscomplete invariantsrigid motionsLipschitz metricpolynomial timemirror imagesunordered pointsisometry invariants
0
0 comments X

The pith

Unordered point clouds have a complete invariant under rigid motions that separates all mirror images and carries a Lipschitz metric computable in polynomial time for fixed dimension.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs an invariant that assigns to any finite unordered set of m points in n-dimensional Euclidean space a unique signature for its class under translations, rotations, and reflections. This signature is designed so that two clouds produce the same value precisely when one can be rigidly moved onto the other, including the case where one is the mirror image of the other. A metric is placed on the space of these signatures such that small changes in point positions produce proportionally small changes in the invariant value. All operations remain polynomial in m for any fixed n, avoiding the factorial cost of testing permutations.

Core claim

A complete invariant is defined for n-dimensional clouds of m unordered points under rigid motion, which distinguishes all mirror images in R^n. The key challenge was to design a distance on invariant values that is Lipschitz continuous under noise and computable in a polynomial time of cloud sizes, for a fixed dimension n.

What carries the argument

The complete invariant constructed from the unordered point set, together with the Lipschitz metric defined on its values.

If this is right

  • Molecular structures given as unordered atom lists can be compared for congruence, including chirality, without testing m! permutations.
  • Small coordinate perturbations in a cloud produce bounded changes in the invariant, enabling stable numerical comparison.
  • For any fixed dimension the entire procedure scales polynomially with the number of points, making large clouds tractable.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same construction could supply a practical distance for clustering conformational ensembles in structural biology.
  • If the invariant remains complete when points carry additional labels such as atom types, it would directly apply to labeled molecular graphs.
  • Extending the metric to allow partial matches might yield a robust tool for comparing substructures.

Load-bearing premise

That a single invariant object can be constructed from the unordered point set such that it is both complete for separating non-isometric clouds including mirrors and admits a Lipschitz metric while remaining polynomial-time for fixed n.

What would settle it

Two clouds that cannot be rigidly superimposed (including any mirror pair) but receive identical invariant values, or two clouds whose point positions differ by a small amount yet produce invariant values differing by an arbitrarily large factor.

Figures

Figures reproduced from arXiv: 2303.13486 by Vitaliy Kurlin.

Figure 1
Figure 1. Figure 1: Left: the cloud T = {(1, 1),(−1, 1),(−2, 0),(2, 0)}. Right: the kite K = {(0, 1),(−1, 0),(0, −1),(3, 0)}. T and K have the same 6 pairwise distances √ 2, √ 2, 2, √ 10, √ 10, 4. Condition (1.1b) asking for a continuous metric is stronger than the completeness in (1.1a). Detecting an isometry C ∼= C 0 gives a discontinuous metric, say d = 1 for all non-isometric clouds C 6∼= C 0 even if C, C0 are nearly iden… view at source ↗
Figure 2
Figure 2. Figure 2: Left: a cloud C = {p1, p2, p3} with distances a ≤ b ≤ c. Middle: the triangular cloud R = {(0, 0),(4, 0),(0, 3)}. Right: the square cloud S = {(1, 0),(−1, 0),(0, 1),(−1, 0)}. [5,   4 3 +  ], ORD(R; (p3, p1)) = [3,   5 4 +  ]. If we swap the points p1 ↔ p3, the last ORD above changes to the equivalent form ORD(R; (p1, p3)) = [3,   4 5 −  ], without affecting other ORDs. If we reflect R with resp… view at source ↗
read the original abstract

A basic representation of any real molecule is a finite cloud of unordered atoms, many of which are chemically indistinguishable. A natural equivalence on point clouds in any metric space is defined by isometries that are distance-preserving transformations. In a Euclidean space, any isometry is a composition of translations, rotations, and reflections. If points are ordered, the isometry class of this cloud is uniquely determined by the matrix of all pairwise distances. If m points are unordered, a naive metric based on distance matrices needs exponentially many m! permutations. We define a complete invariant for n-dimensional clouds of m unordered points under rigid motion, which distinguishes all mirror images in R^n. The key challenge was to design a distance on invariant values that is Lipschitz continuous under noise and computable in a polynomial time of cloud sizes, for a fixed dimension n.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper claims to define a complete invariant for n-dimensional clouds of m unordered points under rigid motions (including reflections), which distinguishes all non-isometric clouds, and to equip the space of these invariants with a Lipschitz continuous metric that remains computable in time polynomial in m for any fixed n.

Significance. If the claimed construction exists and satisfies all four properties simultaneously (invariance, completeness including mirrors, Lipschitz stability, and polynomial-time evaluation), the result would supply a stable, efficient descriptor for unordered point sets with direct applications to molecular comparison and computational geometry.

major comments (1)
  1. [Abstract] Abstract: the manuscript asserts that a single invariant object has been constructed satisfying invariance, completeness (including mirror separation), Lipschitz continuity of the induced metric, and polynomial-time computability for fixed n, yet supplies neither the explicit definition of the invariant nor any derivation or proof that these four properties hold simultaneously.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their review. We address the single major comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the manuscript asserts that a single invariant object has been constructed satisfying invariance, completeness (including mirror separation), Lipschitz continuity of the induced metric, and polynomial-time computability for fixed n, yet supplies neither the explicit definition of the invariant nor any derivation or proof that these four properties hold simultaneously.

    Authors: The abstract is a concise summary. The explicit definition of the invariant appears in Definition 3.1. Invariance under rigid motions including reflections and completeness (distinguishing mirrors) are proved in Theorem 4.2; Lipschitz continuity of the metric is shown in Theorem 5.1; polynomial-time evaluation for fixed n is established by the algorithm in Section 6 and Theorem 6.3. These sections contain the required definitions and derivations. revision: no

Circularity Check

0 steps flagged

No circularity: construction claimed but not reduced to inputs by definition or self-citation

full rationale

The abstract states that a complete invariant is defined and a Lipschitz metric is designed, but supplies no equations, no explicit construction steps, and no self-citations. No load-bearing claim reduces by construction to its own inputs (no fitted parameters renamed as predictions, no uniqueness imported from prior self-work, no ansatz smuggled via citation). The derivation chain is therefore self-contained at the level of the provided text; any circularity would require inspecting the explicit invariant definition in the full manuscript, which is not shown to collapse into tautology.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the central claim rests on the unshown construction of the invariant.

pith-pipeline@v0.9.0 · 5669 in / 1080 out tokens · 19142 ms · 2026-05-24T09:54:11.672726+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

69 extracted references · 69 canonical work pages · 1 internal anchor

  1. [1]

    Threat of adversarial at- tacks on deep learning in computer vision: A survey

    Naveed Akhtar and Ajmal Mian. Threat of adversarial at- tacks on deep learning in computer vision: A survey. IEEE Access, 6:14410–14430, 2018. 2

    work page 2018

  2. [2]

    Introduction to periodic geometry and topology

    Olga Anosova and Vitaliy Kurlin. Introduction to periodic geometry and topology. arXiv:2103.02749. 2

    work page arXiv

  3. [3]

    An isometry classification of periodic point sets

    Olga Anosova and Vitaliy Kurlin. An isometry classification of periodic point sets. In Proceedings of Discrete Geometry and Mathematical Morphology, 2021. 2

    work page 2021

  4. [4]

    Algorithms for continuous metrics on periodic crystals

    Olga Anosova and Vitaliy Kurlin. Algorithms for continuous metrics on periodic crystals. arxiv:2205.15298, 2022. 2

    work page arXiv 2022

  5. [5]

    Density functions of pe- riodic sequences

    Olga Anosova and Vitaliy Kurlin. Density functions of pe- riodic sequences. Lecture Notes in Computer Science (Pro- ceedings of DGMM), 2022. 2

    work page 2022

  6. [6]

    Density functions of periodic se- quences of continuous events

    O Anosova and V Kurlin. Density functions of periodic se- quences of continuous events. arXiv:2301.05137, 2023. 2

    work page arXiv 2023

  7. [7]

    Compact graph representation of crystals using Pointwise Distance Distributions

    Jonathan Balasingham, Viktor Zamaraev, and Vitaliy Kurlin. Compact graph representation of crystals using Pointwise Distance Distributions. arXiv:2212.11246, 2022. 2

    work page arXiv 2022

  8. [8]

    On reconstructing n- point configurations from the distribution of distances or ar- eas

    Mireille Boutin and Gregor Kemper. On reconstructing n- point configurations from the distribution of distances or ar- eas. Adv. Appl. Math., 32(4):709–735, 2004. 1

    work page 2004

  9. [9]

    Welcome to a continuous world of 3-dimensional lattices

    Matthew J Bright, Andrew I Cooper, and Vitaliy A Kurlin. Welcome to a continuous world of 3-dimensional lattices. arxiv:2109.11538, 2021. 2

    work page arXiv 2021

  10. [10]

    Geographic-style maps for 2-dimensional lattices

    Matthew J Bright, Andrew I Cooper, and Vitaliy A Kurlin. Geographic-style maps for 2-dimensional lattices. Acta Crystallographica Section A, 79(1):1–13, 2023. 2

    work page 2023

  11. [11]

    Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges

    Michael M Bronstein, Joan Bruna, Taco Cohen, and Petar Veliˇckovi´c. Geometric deep learning: grids, groups, graphs, geodesics, and gauges. arXiv:2104.13478, 2021. 2

    work page internal anchor Pith review Pith/arXiv arXiv 2021

  12. [12]

    Geometric deep learning: going beyond Euclidean data

    Michael M Bronstein, Joan Bruna, Yann LeCun, Arthur Szlam, and Pierre Vandergheynst. Geometric deep learning: going beyond Euclidean data. IEEE Signal Processing Mag- azine, 34(4):18–42, 2017. 2

    work page 2017

  13. [13]

    Subquadratic encodings for point configurations

    Jean Cardinal, Timothy Chan, John Iacono, Stefan Langer- man, and Aur´elien Ooms. Subquadratic encodings for point configurations. J Comp. Geometry, 10:99–126, 2019. 2

    work page 2019

  14. [14]

    Topology and data

    Gunnar Carlsson. Topology and data. Bulletin of the Ameri- can Mathematical Society, 46(2):255–308, 2009. 2

    work page 2009

  15. [15]

    Moduli spaces of morse functions for per- sistence

    Michael J Catanzaro, Justin M Curry, Brittany Terese Fasy, J¯anis Lazovskis, Greg Malen, Hans Riess, Bei Wang, and Matthew Zabka. Moduli spaces of morse functions for per- sistence. Journal of Applied and Computational Topology , 4(3):353–385, 2020. 2

    work page 2020

  16. [16]

    Enumerative combinatorics

    Charalambos A Charalambides. Enumerative combinatorics. Chapman and Hall/CRC, 2018. 7

    work page 2018

  17. [17]

    Equivariant point network for 3D point cloud anal- ysis

    Haiwei Chen, Shichen Liu, Weikai Chen, Hao Li, and Ran- dall Hill. Equivariant point network for 3D point cloud anal- ysis. In CVPR, pages 14514–14523, 2021. 2

    work page 2021

  18. [18]

    Geo- metric pattern matching in d-dimensional space

    Paul Chew, Dorit Dor, Alon Efrat, and Klara Kedem. Geo- metric pattern matching in d-dimensional space. Discrete & Computational Geometry, 21(2):257–274, 1999. 2 13

    work page 1999

  19. [19]

    Geometric pattern matching under Euclidean motion

    Paul Chew, Michael Goodrich, Daniel Huttenlocher, Klara Kedem, Jon Kleinberg, and Dina Kravets. Geometric pattern matching under Euclidean motion. Computational Geome- try, 7(1-2):113–124, 1997. 2, 10

    work page 1997

  20. [20]

    Improvements on geometric pattern matching problems

    Paul Chew and Klara Kedem. Improvements on geometric pattern matching problems. In Scandinavian Workshop on Algorithm Theory, pages 318–325, 1992. 2

    work page 1992

  21. [21]

    The Earth Mover’s Dis- tance: lower bounds and invariance under translation

    Scott Cohen and Leonidas Guibas. The Earth Mover’s Dis- tance: lower bounds and invariance under translation. Tech- nical report, Stanford University, 1997. 12

    work page 1997

  22. [22]

    The difficulty of computing stable and accurate neural net- works: On the barriers of deep learning and Smale’s 18th problem

    Matthew J Colbrook, Vegard Antun, and Anders C Hansen. The difficulty of computing stable and accurate neural net- works: On the barriers of deep learning and Smale’s 18th problem. PNAS, 119(12):e2107151119, 2022. 2

    work page 2022

  23. [23]

    The fiber of the persistence map for functions on the interval.Journal of Applied and Computational Topol- ogy, 2(3):301–321, 2018

    Justin Curry. The fiber of the persistence map for functions on the interval.Journal of Applied and Computational Topol- ogy, 2(3):301–321, 2018. 2

    work page 2018

  24. [24]

    Boosting adversarial at- tacks with momentum

    Yinpeng Dong, Fangzhou Liao, Tianyu Pang, Hang Su, Jun Zhu, Xiaolin Hu, and Jianguo Li. Boosting adversarial at- tacks with momentum. In Computer vision and pattern recognition, pages 9185–9193, 2018. 2

    work page 2018

  25. [25]

    The density fingerprint of a periodic point set

    H Edelsbrunner, T Heiss, V Kurlin, P Smith, and M Win- traecken. The density fingerprint of a periodic point set. In Proceedings of SoCG, pages 32:1–32:16, 2021. 2

    work page 2021

  26. [26]

    Topological persistence and simplification

    Herbert Edelsbrunner, David Letscher, and Afra Zomoro- dian. Topological persistence and simplification. In Foun- dations of Computer Science, pages 454–463, 2000. 2

    work page 2000

  27. [27]

    Geometry helps in bottleneck matching and related problems

    Alon Efrat, Alon Itai, and Matthew J Katz. Geometry helps in bottleneck matching and related problems. Algorithmica, 31(1):1–28, 2001. 9

    work page 2001

  28. [28]

    Elkin and V

    Y . Elkin and V . Kurlin. The mergegram of a dendrogram and its stability. In Proceedings of MFCS, 2020. 2

    work page 2020

  29. [29]

    Elkin and V

    Y . Elkin and V . Kurlin. Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram ex- tending 0d persistence. Mathematics, 9(17), 2021. 2

    work page 2021

  30. [30]

    Probabilistic number theory I , volume 239

    Peter Elliott. Probabilistic number theory I , volume 239. Springer Science & Business Media, 2012. 6, 7

    work page 2012

  31. [31]

    Fibonacci heaps and their uses in improved network optimization al- gorithms

    Michael L Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization al- gorithms. Journal ACM, 34:596–615, 1987. 9, 10

    work page 1987

  32. [32]

    Solving minimum-cost flow problems by successive approximation

    Andrew Goldberg and Robert Tarjan. Solving minimum-cost flow problems by successive approximation. In Proceedings of STOC, pages 7–18, 1987. 10

    work page 1987

  33. [33]

    Approximate geometric pattern matching under rigid motions

    Michael T Goodrich, Joseph SB Mitchell, and Mark W Or- letsky. Approximate geometric pattern matching under rigid motions. Transactions PAMI, 21:371–379, 1999. 2

    work page 1999

  34. [34]

    The n body matrix and its determinant

    Darij Grinberg and Peter J Olver. The n body matrix and its determinant. SIAM Journal on Applied Algebra and Geome- try, 3(1):67–86, 2019. 2

    work page 2019

  35. [35]

    Simple black-box adversar- ial attacks

    Chuan Guo, Jacob Gardner, Yurong You, Andrew Gordon Wilson, and Kilian Weinberger. Simple black-box adversar- ial attacks. In ICML, pages 2484–2493, 2019. 2

    work page 2019

  36. [36]

    Dimension und ¨auβeres maβ

    Felix Hausdorff. Dimension und ¨auβeres maβ. Mathematis- che Annalen, 79(2):157–179, 1919. 2

    work page 1919

  37. [37]

    Complete neural networks for Euclidean graphs

    Snir Hordan, Tal Amir, Steven J Gortler, and Nadav Dym. Complete neural networks for Euclidean graphs. arXiv:2301.13821, 2023. 2

    work page arXiv 2023

  38. [38]

    Comparing images using the Hausdorff distance

    Daniel Huttenlocher, Gregory Klanderman, and William Rucklidge. Comparing images using the Hausdorff distance. Transactions PAMI, 15:850–863, 1993. 2

    work page 1993

  39. [39]

    A complete isometry classification of 3d lat- tices

    Vitaliy Kurlin. A complete isometry classification of 3d lat- tices. arxiv:2201.10543, 2022. 2

    work page arXiv 2022

  40. [40]

    Computable complete invariants for fi- nite clouds of unlabeled points under Euclidean isometry

    Vitaliy Kurlin. Computable complete invariants for fi- nite clouds of unlabeled points under Euclidean isometry. arXiv:2207.08502, 2022. 2

    work page arXiv 2022

  41. [41]

    Exactly computable and continuous met- rics on isometry classes of finite and 1-periodic sequences

    Vitaliy Kurlin. Exactly computable and continuous met- rics on isometry classes of finite and 1-periodic sequences. arxiv:2205.04388, 2022. 2

    work page arXiv 2022

  42. [42]

    Mathematics of 2-dimensional lattices

    Vitaliy Kurlin. Mathematics of 2-dimensional lattices. Found. Comp. Mathematics, pages Dec 7: 1–59, 2022. 2

    work page 2022

  43. [43]

    Functional adversarial attacks

    Cassidy Laidlaw and Soheil Feizi. Functional adversarial attacks. Adv. Neural Inform. Proc. Systems, 32, 2019. 2

    work page 2019

  44. [44]

    Euclidean distance geometry

    Leo Liberti and Carlile Lavor. Euclidean distance geometry. Springer, 2017. 3

    work page 2017

  45. [45]

    Ap- proximating Gromov-Hausdorff distance in Euclidean space

    Sushovan Majhi, Jeffrey Vitter, and Carola Wenk. Ap- proximating Gromov-Hausdorff distance in Euclidean space. arXiv:1912.13008, 2019. 2

    work page arXiv 1912

  46. [46]

    The Gromov-Hausdorff distance between ultrametric spaces: its structure and computation

    Facundo M ´emoli, Zane Smith, and Zhengchao Wan. The Gromov-Hausdorff distance between ultrametric spaces: its structure and computation. arXiv:2110.03136, 2021. 2

    work page arXiv 2021

  47. [47]

    V oronoi-based similar- ity distances between arbitrary crystal lattices

    Marco M Mosca and Vitaliy Kurlin. V oronoi-based similar- ity distances between arbitrary crystal lattices. Crystal Re- search and Technology, 55(5):1900197, 2020. 2

    work page 2020

  48. [48]

    Equivariant representations for molecular hamiltonians and n-center atomic-scale properties

    Jigyasa Nigam, Michael J Willatt, and Michele Ceriotti. Equivariant representations for molecular hamiltonians and n-center atomic-scale properties. Journal of Chemical Physics, 156(1):014115, 2022. 2

    work page 2022

  49. [49]

    V olu- metric image registration from invariant keypoints

    Blaine Rister, Mark A Horowitz, and Daniel L Rubin. V olu- metric image registration from invariant keypoints. Transac- tions on Image Processing, 26(10):4900–4910, 2017. 2

    work page 2017

  50. [50]

    Fast predictions of lattice en- ergies by continuous isometry invariants of crystal structures

    Jakob Ropers, Marco M Mosca, Olga D Anosova, Vitaliy A Kurlin, and Andrew I Cooper. Fast predictions of lattice en- ergies by continuous isometry invariants of crystal structures. In International Conference on Data Analytics and Manage- ment in Data Intensive Domains, pages 178–192, 2022. 2

    work page 2022

  51. [51]

    Rubner, C

    Y . Rubner, C. Tomasi, and L. Guibas. The earth mover’s distance as a metric for image retrieval. Intern. Journal of Computer Vision, 40(2):99–121, 2000. 9, 10

    work page 2000

  52. [52]

    Computational aspects of the Gromov– Hausdorff distance and its application in non-rigid shape matching

    Felix Schmiedl. Computational aspects of the Gromov– Hausdorff distance and its application in non-rigid shape matching. Discrete Comp. Geometry, 57:854–880, 2017. 2

    work page 2017

  53. [53]

    Remarks to Maurice Frechet’s article “Sur la definition axiomatique d’une classe d’espace distances vectoriellement applicable sur l’espace de Hilbert

    Isaac Schoenberg. Remarks to Maurice Frechet’s article “Sur la definition axiomatique d’une classe d’espace distances vectoriellement applicable sur l’espace de Hilbert. Annals of Mathematics, pages 724–732, 1935. 2

    work page 1935

  54. [54]

    Neural descriptor fields: SE(3)- equivariant object representations for manipulation

    Anthony Simeonov, Yilun Du, Andrea Tagliasacchi, Joshua B Tenenbaum, Alberto Rodriguez, Pulkit Agrawal, and Vincent Sitzmann. Neural descriptor fields: SE(3)- equivariant object representations for manipulation. InICRA, pages 6394–6400, 2022. 2

    work page 2022

  55. [55]

    Cayley-Menger coor- dinates

    Manfred Sippl and Harold Scheraga. Cayley-Menger coor- dinates. PNAS, 83:2283–2287, 1986. 6, 7, 9

    work page 1986

  56. [56]

    Families of point sets with identical 1d persistence,

    Philip Smith and Vitaliy Kurlin. Families of point sets with identical 1d persistence,. arxiv:2202.00577, 2022. 2 14

    work page arXiv 2022

  57. [57]

    A practical algorithm for degree-k voronoi domains of three-dimensional periodic point sets

    Phil Smith and Vitaliy Kurlin. A practical algorithm for degree-k voronoi domains of three-dimensional periodic point sets. In Lecture Notes in Computer Science (Proceed- ings of ISVC), volume 13599, pages 377–391, 2022. 2

    work page 2022

  58. [58]

    Learning an effective equivariant 3d descriptor without su- pervision

    Riccardo Spezialetti, Samuele Salti, and Luigi Di Stefano. Learning an effective equivariant 3d descriptor without su- pervision. In ICCV, pages 6401–6410, 2019. 2

    work page 2019

  59. [59]

    Efficient and ro- bust model-to-image alignment using 3d scale-invariant fea- tures

    Matthew Toews and William M Wells III. Efficient and ro- bust model-to-image alignment using 3d scale-invariant fea- tures. Medical image analysis, 17(3):271–282, 2013. 2

    work page 2013

  60. [60]

    Molecular set transformer: Attending to the co-crystals in the cambridge structural database

    Aikaterini Vriza, Ioana Sovago, Daniel Widdowson, Peter Wood, Vitaliy Kurlin, and Matthew Dyer. Molecular set transformer: Attending to the co-crystals in the cambridge structural database. Digital Discovery, 1:834–850, 2022. 2

    work page 2022

  61. [61]

    Triangle

    E Weisstein. Triangle. https://mathworld. wolfram. com. 1

    work page

  62. [62]

    Shape matching in higher dimensions

    Carola Wenk. Shape matching in higher dimensions. PhD thesis, FU Berlin, 2003. 2

    work page 2003

  63. [63]

    Pointwise distance distributions of periodic point sets

    D Widdowson and V Kurlin. Pointwise distance distributions of periodic point sets. arxiv:2108.04798, 2021. 2

    work page arXiv 2021

  64. [64]

    Resolving the data ambiguity for periodic crystals

    Daniel Widdowson and Vitaliy Kurlin. Resolving the data ambiguity for periodic crystals. Advances in Neural Infor- mation Processing Systems (NeurIPS), 35, 2022. 2

    work page 2022

  65. [65]

    Recognizing rigid patterns of unlabeled point clouds by complete and continu- ous isometry invariants with no false negatives and no false positives

    Daniel Widdowson and Vitaliy Kurlin. Recognizing rigid patterns of unlabeled point clouds by complete and continu- ous isometry invariants with no false negatives and no false positives. In Proceedings of CVPR, 2023. 2, 8, 13

    work page 2023

  66. [66]

    Average minimum dis- tances of periodic point sets - foundational invariants for mapping all periodic crystals

    Daniel Widdowson, Marco M Mosca, Angeles Pulido, An- drew I Cooper, and Vitaliy Kurlin. Average minimum dis- tances of periodic point sets - foundational invariants for mapping all periodic crystals. MATCH Comm. in Math. and in Computer Chemistry, 87:529–559, 2022. 2

    work page 2022

  67. [67]

    The Gromov-Hausdorff space isn’t coarsely embed- dable into any Hilbert space

    N Zava. The Gromov-Hausdorff space isn’t coarsely embed- dable into any Hilbert space. arXiv:2303.04730, 2023. 2

    work page arXiv 2023

  68. [68]

    Analogy powered by prediction and structural invariants: Computationally-led discovery of a mesoporous hydrogen-bonded organic cage crystal

    Q Zhu, J Johal, D Widdowson, Z Pang, B Li, C Kane, V Kurlin, G Day, M Little, and A Cooper. Analogy powered by prediction and structural invariants: Computationally-led discovery of a mesoporous hydrogen-bonded organic cage crystal. J Amer. Chem. Soc., 144:9893–9901, 2022. 2

    work page 2022

  69. [69]

    Point cloud registration of arrester based on scale-invariant points feature histogram

    Wen Zhu, Lingchao Chen, Beiping Hou, Weihan Li, Tian- liang Chen, and Shixiong Liang. Point cloud registration of arrester based on scale-invariant points feature histogram. Scientific Reports, 12(1):1–13, 2022. 2 15

    work page 2022