Pith. sign in

REVIEW 3 major objections 5 minor 34 references

How Molecular Generative Models Organize Molecular Identity

T0 review · 3 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Across three molecular generative architectures, the paper shows that trained models arrange the molecules they can produce into piecewise-constant identity regions separated by coarse-to-fine boundaries, so a continuous latent space…

desk verdict A genuinely useful framework for studying how generative models organize molecular identity, with solid probes and one fixable overreach: the Abstract generalizes the piecewise-constant claim from 2D slices to the full internal repertoire. read the letter →

arxiv 2608.06956 v1 pith:NUIAVLIM submitted 2026-08-07 cs.LG physics.chem-ph

Raul Ortega-Ochoa , Tejs Vegge , Jens S. Bakander , Luis Mantilla Calderon , Alan Aspuru-Guzik , Tonio Buonassisi This is my paper · ORCID
classification cs.LGphysics.chem-ph
keywords moleculargenerativemodelslatentspaceorganizationidentitypullbackpartitionpiecewise-constantregionschemicalnavigationequivalencerelationscoarse-to-fineboundaries
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Generative models of molecules are usually judged by what they sample, while their latent coordinates are used for interpolation and design as if closeness in coordinate space meant chemical closeness. This paper makes molecular identity explicit—as an equivalence relation on representations such as canonical SMILES, InChIKey-14, formula, elements, or Murcko scaffold—and pulls those identities back through the generator to reveal what it calls the internal repertoire: the regions of coordinate space that produce the same molecule. Across three architectures, these regions are piecewise-constant, separated by sharp coarse-to-fine boundaries, but their organization depends on the representation probed, the identity convention, the decoder's randomness, and the metric used to compare coordinates. The consequence the paper draws is that a continuous generative coordinate space does not by itself establish a navigable chemical space; navigation requires measuring whether the chosen identity resolution, representation, and metric align with the chemistry of interest.

What carries the argument

The load-bearing construction is the pullback of molecular identity through the generative process. An identity convention is an equivalence relation ∼ on the output space X; the paper takes six conventions, from exact canonical SMILES to element sets. Exposing decoder stochasticity as a random tape η makes the forward map deterministic on (z, η), and the fiber of each equivalence class defines a cell in Z × E whose mass is the probability of generating that molecule. This identity-cell partition exists by construction; the paper's contribution is to measure its sectional structure, chemical cohesiveness, persistence across randomness, relation to coordinate metrics, and training evolution. The piecewise-constant hypothesis is motivated by two existing results: networks with piecewise-linear activations partition input space into affine regions, and neural decision regions tend toward convexity.

What would settle it

Decode many random pairs of points inside a single small ball in the full-dimensional space Z (not a 2D slice) and measure whether the decoded identity is constant on a positive-volume subset; if almost every pair in the ball decodes to different molecules, the piecewise-constant regions seen in slices are artifacts of slicing rather than a property of the partition. Equivalently, check whether the boundary structure is preserved under random linear projections of the full space instead of coordinate-aligned sections.

Watch

Extended reading notes

Core claim

By exposing each stochastic generator's randomness as a random tape η so that a pair (z, η) deterministically produces one output, the paper constructs a pullback partition of Z × E by molecular identity and then probes it empirically. In fixed-randomness sections, all three models show contiguous patches over which decoded identity is constant, with broad territories subdivided by finer boundaries. MolMiner and HierVAE additionally show that neighborhoods are chemically cohesive (within-neighborhood molecules are more similar than across, AUC(W,A) ≈ 0.84–0.87), distinct neighborhoods occupy distinct coarse chemistry, and Euclidean distance or cosine similarity between centers fails to track chemical similarity in HierVAE (R² ≈ 0.05). GDSS shows almost no exact-identity persistence at fine resolution (99.95% of decodes are unique SMILES at a fixed coordinate) and organizes only under coarse conventions such as element or scaffold. In MolMiner, the coarse-to-fine boundaries are traced to sequential decoding: early partial structures establish broad lineages that later decoding decisions subdivide, with occasional reconsolidation of distinct construction orders into the same molecule. During training in both MolMiner and HierVAE, chemical cohesiveness stabilizes early while the number of distinct identities per neighborhood continues to evolve, so local organization and molecular granularity are separate properties of the learned map.

Load-bearing premise

The central claim that identity regions are piecewise-constant rests on probes of low-dimensional cross-sections and small fixed-radius balls; the paper does not validate that these probes are representative of the full high-dimensional coordinate space, and it explicitly notes that the sections are illustrative.

Editorial extensions

If this is right

  • Interpolation, local search, and novelty radii in a molecular generator should be validated against the identity-cell partition before being treated as chemical operations; the paper shows this fails for Euclidean distances in HierVAE even where local cohesiveness is strong.
  • Evaluation of generative models should include internal organization, not just output validity and diversity; the paper shows that architectures with comparable local cohesiveness can differ sharply in how their coordinate metrics track chemistry, and that GDSS differs from both.
  • A model that appears unstructured at fine identity resolution can still be organized at coarser conventions; GDSS is navigable only at element or scaffold level, so the identity convention must be matched to the design task.
  • The coarse-to-fine structure of identity regions suggests that novel molecules arise from shared partial trajectories that branch during decoding, giving a mechanistic handle on how generative novelty is created.
  • Training-time decoupling of cohesiveness and granularity means early stopping criteria should distinguish 'chemically organized' from 'repertoire settled'—they are not the same milestone.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Extending the paper's framework to the obvious next step, one could report a per-task 'navigability certificate'—the probability that a small step in the chosen metric preserves the chosen identity convention; the paper stops short of proposing such a summary.
  • Because the authors probe only 2D sections and small balls, an independent check is to decode random point pairs inside full-dimensional balls; if identities vary almost everywhere, the piecewise-constant picture is a slicing artifact rather than a property of the partition.
  • The same pullback construction transfers to proteins and crystals, where identity conventions already exist, making it a general template for auditing generative spaces beyond molecules.
  • GDSS's near-unique decodes at fixed coordinates suggest its stochastic sampler carries identity; a testable design change is to lower decoder entropy and see whether fine-resolution organization then emerges.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper formalizes molecular identity as an equivalence relation on the output representation space and pulls this relation back through the generative map, defining cells C_{[x]} on Z×E (Eq. 2). Using three molecular generative architectures (MolMiner, HierVAE, GDSS), it probes these cells with 1D/2D fixed-tape slices, stochastic decoding along paths, fixed-radius ball neighborhoods, training checkpoints, and a sequential decoding-depth analysis for MolMiner. The main empirical findings are: identity regions are piecewise-constant in the probed sections; the organization depends on representation, identity convention, decoder stochasticity, and metric; MolMiner and HierVAE show chemically cohesive neighborhoods while GDSS shows little exact-identity persistence; HierVAE's Euclidean/cosine distances do not track chemical similarity; and during training chemical cohesiveness stabilizes before molecular granularity.

Significance. The paper's framework is conceptually useful and its cautionary message—a continuous coordinate space is not by itself a navigable chemical space—is well taken. Strengths include the explicit pullback formalism, multiple complementary probes across three architectures, two fingerprint types, random baseline controls, slice-direction robustness checks (SI Section A), public checkpoints for GDSS, and frank statements of limitations (e.g., Section 4.5, the 'illustrative' note in Section 4.6). The main weakness is that the headline claim of a 'repertoire arranged into piecewise-constant regions separated by recurring coarse-to-fine boundaries' is made for the full internal repertoire while the direct evidence is from low-dimensional sections and low-radius balls; the paper's own Section 5 qualifier does not appear in the Abstract.

major comments (3)
  1. [Abstract, Sections 3.1 and 4.1] The Abstract and the Introduction's second paragraph assert that the trained model's internal repertoire is arranged into piecewise-constant regions separated by recurring coarse-to-fine boundaries. The direct structural evidence, however, comes exclusively from 1D paths and 2D fixed-coordinate sections (Section 3.1) and from 30-60 fixed-radius balls (Section 3.3). A 2D slice of a piecewise-constant map is always piecewise-constant, so these probes cannot establish the global cell-size distribution, boundary nesting, or coarse-to-fine hierarchy of the full partition on Z×E. The paper itself shows slice-direction dependence (SI Figure S3: GDSS gives 1-13 cells in atom-feature slices vs 61-65 in adjacency slices) and states in Section 4.6 that the fixed sections are 'illustrative' and should not be interpreted as statements about connectivity in the full space. The Section 5 disclaimer 'Our conclusions apply to the coordinates probed here' does not cover the unqualified wording of the Abstract. Please either rephrase the headline claims to refer to the probed cross-sections, or add a high-dimensional validation (e.g., randomized 1D paths and stratified cell-size estimation).
  2. [Section 4.2] The claim that GDSS's stochastic decoding is 'structureless' at SMILES resolution rests on a single fixed z (102,400 realizations yielding 102,348 distinct SMILES). One coordinate is a single data point for a statement about the model's behavior. Please report the same statistic for several z's (e.g., 10 randomly chosen z's) or acknowledge the single-sample limitation in the text.
  3. [Section 4.6 and SI Table S1] The MolMiner training analysis is restricted to 20 of 30 neighborhoods because of early 'runaway' decodes. The number of unique identities per neighborhood is the quantity most directly affected by this selection: neighborhoods that terminate at all checkpoints may not be representative of the full set at early epochs, and the paper does not show whether the K=20 subset's AUC and n_unique at later epochs match the full K=30 statistics. Please provide a comparison at later checkpoints or a sensitivity analysis.
minor comments (5)
  1. [Section 3.3] Please report bootstrap or permutation confidence intervals for the AUC(W,A) values; the 0.526 for GDSS is close to chance, and an interval would make the 'near chance' claim precise.
  2. [Section 2, Eq. (2)] The measure ρ(z,η) is introduced but never defined; the subsequent experiments use uniform sampling in balls, so clarify that Eq. (2) is schematic.
  3. [SI Figure S3 caption] Typo 'V AE' should be 'VAE'.
  4. [Section 3.4 and Figure 5] Please state explicitly which checkpoint 'best (val)' corresponds to (epoch number) in Figure 5a and Table S1.
  5. [Section 4.2] The flow-plots in Figure 2 use ~5,000 resamples at each of 200 points; a brief description of how the flow-plot segments were computed (e.g., any threshold for minor classes) would help reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the pullback partition is defined by construction and its claimed properties are measured empirically, not derived from the definition or from self-citation.

full rationale

The paper's derivation chain is: choose an external identity convention (e.g., canonical SMILES, InChIKey-14), expose decoder stochasticity as a random tape, define cells C[x] as preimages of identity classes under the deterministic decode map, and then empirically probe these cells via slices, fixed-radius balls, and training checkpoints. The paper explicitly states in Section 2 that 'the partition exists by construction; its sectional structure, chemical cohesiveness, persistence across decoder randomness, alignment with coordinate metrics, and evolution during training are empirical properties.' No fitted parameter is renamed as a prediction; the AUC, Jaccard, and R^2 quantities are direct measurements of decoded outputs. The piecewise-constant hypothesis is motivated by external results on piecewise-linear networks and convex decision regions, then tested by decoding, so it is not an ansatz smuggled in via citation. The use of MolMiner, a prior architecture by one of the authors, is not load-bearing: MolMiner is retrained in-house and compared against two external architectures, and the central comparative conclusions do not depend on any unverified claim from the MolMiner paper. The limitation that structural evidence comes from low-dimensional cross-sections and small balls is an external-validity concern about generalization to the full high-dimensional partition, not a circularity: the reported observations are still genuine empirical measurements of the probed sections. There is no self-definitional reduction, no fitted-input-called-prediction step, and no uniqueness theorem imported from the authors, so the derivation is self-contained and the circularity burden is essentially zero.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The paper introduces no fitted model parameters; the numerical values in the ledger are experimental probe settings (radii, ball counts, sample sizes). The identity conventions and deterministic-tape construction are explicit domain assumptions rather than hidden axioms, and no new physical entities are postulated.

free parameters (3)
  • Neighborhood radius r = 0.1 (Sections 3.3, 4.3) and 0.5 (Sections 3.4, 4.6)
    Hand-chosen scale for fixed-radius balls; chemical organization and granularity results depend on this scale, and no sensitivity analysis is provided.
  • Number of neighborhoods K = 30 (MolMiner, GDSS), 60 (HierV AE)
    Chosen per architecture; the small number of centers could affect aggregate AUC and Jaccard estimates.
  • Decodes per neighborhood N = 100,000 (main analysis), 2,000 (training checkpoints)
    Computational budget choices; training-time estimates are noisier due to the smaller sample size.
assumptions (4)
  • domain assumption Molecular identity is defined by an equivalence relation on representation space (canonical SMILES, InChIKey-14, formula, elements, Murcko, Murcko-generic).
    Section 2: the choice of identity convention is external to the representation space; the results depend on which convention is used, and the paper explores this dependence.
  • domain assumption The generator is deterministic given latent z and random tape eta.
    Section 2: all stochasticity is exposed via eta so that (z, eta) fixes the output; this is a construction required to define cells in Z x E.
  • standard math Piecewise-linear activations partition input space into polyhedral regions (Montufar et al. 2014; Balestriero and Baraniuk 2018).
    Section 2: used to motivate the hypothesis that identity regions are piecewise-constant; not used as a derivation of the empirical findings.
  • domain assumption Invalid or failed representations map to a null molecule.
    Section 2: introduced to handle invalid SMILES or graph outputs; affects identity counts but not qualitative structure.

how reviews work

0 comments
Cite this review

Pith. "Pith review of How Molecular Generative Models Organize Molecular Identity." pith.science (2026). https://pith.science/paper/NUIAVLIM

@misc{pith2026260806956,
  author       = {Pith},
  title        = {Pith review of: How Molecular Generative Models Organize Molecular Identity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NUIAVLIM}},
  note         = {Machine review of arXiv:2608.06956}
}
read the original abstract

Generative models for matter are often evaluated as samplers over output representations, and their latent spaces are commonly used as proxies for navigating chemical space. Much less is known about how these models internally arrange discrete chemical identities within those representations. We study this arrangement by making molecular identity explicit and pulling it back through the generative process. Through these pullbacks we probe the regions that generate the same object, exposing the trained model's internal repertoire: a fixed partition that determines which objects (novel or not) the model can produce. Across three molecular generative architectures, we find that this repertoire is arranged into piecewise-constant regions separated by recurring coarse-to-fine boundaries. Its organization depends on the representation probed, the identity convention, decoder stochasticity, and the metric used to compare coordinates. During training, local chemical organization stabilizes while the number of distinct molecular identities represented within each neighborhood continues to change. Internal organization must therefore be characterized, rather than assumed, before a generative space can be treated as chemically navigable.

Figures

Figures reproduced from arXiv: 2608.06956 by the authors.

Figure 1
Figure 1. Two-dimensional fixed-η sections. Each grid point is decoded with a fixed random seed and colored by canonical-SMILES identity. These maps visualize sections of the partition. For MolMiner, the section varies the first two conditioning coordinates, corresponding to logP and QED. Colors cycle within each panel and do not identify the same molecule across panels or models. 4.2 Molecular persistence: same z ∈ Z, differ… view at source ↗
Figure 2
Figure 2. Dependence of decoded molecules along a path (stochastic). Straight-line paths in Z for MolMiner and HierVAE with ∼ 5,000 resamples per z. At each of 200 intermediate points z, the decoder is sampled repeatedly with varying random seed, resulting in a distribution over molecules. Segment heights reflect relative frequency. In both models, which molecules are decoded varies systematically along the path, indicating t… view at source ↗
Figure 3
Figure 3. Distributions of pairwise Tanimoto similarity on ECFP fingerprints for within-neighborhood ( [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: shows the resulting sequence. Early decoding steps divide the section into broad regions associated with different initial fragments; the blue and orange regions mark two such lineages. As decoding proceeds, new boundaries appear predominantly within each lineage, whil…
Figure 5
Figure 5. Figure 5: Training-time evolution of local chemical organization and molecular granularity. Statistics computed at coordinate neighbor￾hoods (r = 0.5, N = 2000 deterministic decodes/neighborhood) across training checkpoints. (a) MolMiner across epochs. (b) HierVAE across optimiz…
Figure 6
Figure 6. Figure 6: Evolution of a MolMiner cross-section during training. The same fixed two-dimensional section is decoded across different checkpoints. Regions are colored by molecular identity. The six most persistent identities across all snapshots are highlighted, while all other id…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 19 canonical work pages

  1. [1]

    SMILES, a chemical language and information system

    David Weininger. SMILES, a chemical language and information system. 1. introduction to methodology and encoding rules.Journal of Chemical Information and Computer Sciences, 28(1):31–36, 1988. doi: 10.1021/ci00057a005. URLhttps://doi.org/10.1021/ci00057a005

    doi:10.1021/ci00057a005 1988

  2. [2]

    Weininger

    David Weininger, Arthur Weininger, and Joseph L. Weininger. SMILES. 2. algorithm for generation of unique SMILES notation.Journal of Chemical Information and Computer Sciences, 29(2):97–101, 05 2002. ISSN 0095-2338. doi: 10.1021/ci00062a008. URLhttps://doi.org/10.1021/ci00062a008

    doi:10.1021/ci00062a008 2002

  3. [3]

    Heller, Alan McNaught, Igor Pletnev, Stephen Stein, and Dmitrii Tchekhovskoi

    Stephen R. Heller, Alan McNaught, Igor Pletnev, Stephen Stein, and Dmitrii Tchekhovskoi. InChI, the IUPAC international chemical identifier.Journal of Cheminformatics, 7(1):23, May 2015. ISSN 1758-2946. doi: 10.1186/s13321-015-0068-4. URLhttps://doi.org/10.1186/s13321-015-0068-4

    doi:10.1186/s13321-015-0068-4 2015

  4. [4]

    Wei, David Duvenaud, Jos ´e Miguel Hern ´andez-Lobato, Benjam´ın S´anchez-Lengeling, Dennis Sheberla, Jorge Aguilera-Iparraguirre, Timothy D

    Rafael G ´omez-Bombarelli, Jennifer N. Wei, David Duvenaud, Jos ´e Miguel Hern ´andez-Lobato, Benjam´ın S´anchez-Lengeling, Dennis Sheberla, Jorge Aguilera-Iparraguirre, Timothy D. Hirzel, Ryan P. Adams, and Al´an Aspuru-Guzik. Automatic chemical design using a data-driven continuous representation of molecules. ACS Central Science, 4(2):268–276, January ...

    doi:10.1021/acscentsci.7b00572 2018

  5. [5]

    Inverse molecular design using machine learning: Generative models for matter engineering.Science, 361(6400):360–365, 2018

    Benjamin Sanchez-Lengeling and Al ´an Aspuru-Guzik. Inverse molecular design using machine learning: Generative models for matter engineering.Science, 361(6400):360–365, 2018. doi: 10.1126/science. aat2663. URLhttps://www.science.org/doi/abs/10.1126/science.aat2663

    doi:10.1126/science 2018

  6. [6]

    Characterizing the latent space of molecular deep generative models with persistent homology metrics

    Yair Schiff, Payel Das, Vijil Chenthamarakshan, and Karthikeyan Natesan Ramamurthy. Characterizing the latent space of molecular deep generative models with persistent homology metrics. InNeurIPS 2020 Workshop on TDA & Beyond, 2020. URLhttps://openreview.net/forum?id=AN6v6MkWG__

    work page 2020

  7. [7]

    Junction tree variational autoencoder for molecular graph generation

    Wengong Jin, Regina Barzilay, and Tommi Jaakkola. Junction tree variational autoencoder for molecular graph generation. In Jennifer Dy and Andreas Krause, editors,Proceedings of the 35th International Con- ference on Machine Learning, volume 80 ofProceedings of Machine Learning Research, pages 2323–2332. PMLR, 10–15 Jul 2018. URLhttps://proceedings.mlr.pr...

    work page 2018

  8. [8]

    SALSA: Semantically- aware latent space autoencoder

    Kathryn E Kirchoff, Travis Maxfield, Alexander Tropsha, and Shawn M Gomez. SALSA: Semantically- aware latent space autoencoder. InNeurIPS 2023 Workshop on New Frontiers of AI for Drug Discovery and Development, 2023. URLhttps://openreview.net/forum?id=CPzuoJAVHm

    work page 2023

Show all 34 references
  1. [9]

    On convex decision regions in deep net- work representations.Nature Communications, 16(1):5419, 2025

    Lenka T ˇetkov´a, Thea Br ¨usch, Teresa Dorszewski, Fabian Martin Mager, Rasmus Ørtoft Aagaard, Jonathan Foldager, Tommy Sonne Alstrøm, and Lars Kai Hansen. On convex decision regions in deep net- work representations.Nature Communications, 16(1):5419, 2025. ISSN 2041-1723. do...

    2025 doi

  2. [10]

    The MIT Press, 03 2000

    Peter G ¨ardenfors.Conceptual Spaces: The Geometry of Thought. The MIT Press, 03 2000. ISBN 9780262273558. doi: 10.7551/mitpress/2076.001.0001. URLhttps://doi.org/10.7551/ mitpress/2076.001.0001

    2000 doi

  3. [11]

    MolMiner: Toward controllable, three-dimensional-aware, fragment-based molecular design.Advanced Intelligent Discovery, page e70138, 2026

    Raul Ortega-Ochoa, Tejs Vegge, and Jes Frellsen. MolMiner: Toward controllable, three-dimensional-aware, fragment-based molecular design.Advanced Intelligent Discovery, page e70138, 2026. doi: 10.1002/aidi. 70138. URLhttps://advanced.onlinelibrary.wiley.com/doi/abs/10.1002/aidi. 70138

    2026 doi

  4. [12]

    Hierarchical generation of molecular graphs using structural motifs

    Wengong Jin, Regina Barzilay, and Tommi Jaakkola. Hierarchical generation of molecular graphs using structural motifs. InProceedings of the 37th International Conference on Machine Learning, ICML’20. JMLR.org, 2020

    2020

  5. [13]

    Score-based generative modeling of graphs via the system of stochastic differential equations

    Jaehyeong Jo, Seul Lee, and Sung Ju Hwang. Score-based generative modeling of graphs via the system of stochastic differential equations. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors,Proceedings of the 39th Internation...

    2022

  6. [14]

    Bemis and Mark A

    Guy W. Bemis and Mark A. Murcko. The properties of known drugs. 1. molecular frameworks.Journal of Medicinal Chemistry, 39(15):2887–2893, 1996. doi: 10.1021/jm9602928. URLhttps://doi.org/ 10.1021/jm9602928

    1996 doi

  7. [15]

    Latent space oddity: on the curvature of deep generative models

    Georgios Arvanitidis, Lars Kai Hansen, and Søren Hauberg. Latent space oddity: on the curvature of deep generative models. InInternational Conference on Learning Representations, 2018. URLhttps:// openreview.net/forum?id=SJzRZ-WCZ

    2018

  8. [16]

    On the number of linear re- gions of deep neural networks

    Guido Mont ´ufar, Razvan Pascanu, Kyunghyun Cho, and Yoshua Bengio. On the number of linear re- gions of deep neural networks. InNeural Information Processing Systems, 2014. URLhttps://api. semanticscholar.org/CorpusID:5941770

    2014

  9. [17]

    A spline theory of deep learning

    Randall Balestriero and Richard Baraniuk. A spline theory of deep learning. In Jennifer Dy and Andreas Krause, editors,Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pages 374–383. PMLR, 10–15 Jul 20...

    2018

  10. [18]

    Kingma and Max Welling

    Diederik P. Kingma and Max Welling. Auto-encoding variational Bayes. InProceedings of the 2nd Interna- tional Conference on Learning Representations (ICLR), 2014

    2014

  11. [19]

    Irwin, Teague Sterling, Michael M

    John J. Irwin, Teague Sterling, Michael M. Mysinger, Erin S. Bolstad, and Ryan G. Coleman. ZINC: A free tool to discover chemistry for biology.Journal of Chemical Information and Modeling, 52(7):1757–1768,

  12. [20]

    Wildman and Gordon M

    Scott A. Wildman and Gordon M. Crippen. Prediction of physicochemical parameters by atomic contribu- tions.Journal of Chemical Information and Computer Sciences, 39(5):868–873, 08 1999. ISSN 0095-2338. doi: 10.1021/ci990307l. URLhttps://doi.org/10.1021/ci990307l

    1999 doi

  13. [21]

    Richard Bickerton, Gaia V

    G. Richard Bickerton, Gaia V . Paolini, J´er´emy Besnard, Sorel Muresan, and Andrew L. Hopkins. Quantifying the chemical beauty of drugs.Nature Chemistry, 4(2):90–98, Feb 2012. ISSN 1755-4349. doi: 10.1038/ nchem.1243. URLhttps://doi.org/10.1038/nchem.1243

    2012 doi

  14. [22]

    On decompositional algorithms for uniform sampling from n-spheres and n-balls.Journal of Multivariate Analysis, 101(10):2297–2304, 2010

    Radoslav Harman and Vladim´ır Lacko. On decompositional algorithms for uniform sampling from n-spheres and n-balls.Journal of Multivariate Analysis, 101(10):2297–2304, 2010. ISSN 0047-259X. doi: 10. 1016/j.jmva.2010.06.002. URLhttps://www.sciencedirect.com/science/article/pii/...

    2010

  15. [23]

    ´Etude comparative de la distribution florale dans une portion des Alpes et du Jura

    Paul Jaccard. ´Etude comparative de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Soci´et´e vaudoise des sciences naturelles. Impr. Corbaz, 1901. URLhttps://books.google.com/ books?id=JCNdmgEACAAJ

    1901

  16. [24]

    Tanimoto.An Elementary Mathematical Theory of Classification and Prediction

    T.T. Tanimoto.An Elementary Mathematical Theory of Classification and Prediction. International Business Machines Corporation, 1958. URLhttps://books.google.com/books?id=yp34HAAACAAJ

    1958

  17. [25]

    H. L. Morgan. The generation of a unique machine description for chemical structures—a technique de- veloped at chemical abstracts service.Journal of Chemical Documentation, 5(2):107–113, 1965. doi: 10.1021/c160017a018. URLhttps://doi.org/10.1021/c160017a018

    1965 doi

  18. [26]

    Extended-connectivity fingerprints.Journal of Chemical Information and Modeling, 50(5):742–754, 2010

    David Rogers and Mathew Hahn. Extended-connectivity fingerprints.Journal of Chemical Information and Modeling, 50(5):742–754, 2010. doi: 10.1021/ci100050t. URLhttps://doi.org/10.1021/ ci100050t

    2010 doi

  19. [27]

    Durant, Burton A

    Joseph L. Durant, Burton A. Leland, Douglas R. Henry, and James G. Nourse. Reoptimization of MDL keys for use in drug discovery.Journal of Chemical Information and Computer Sciences, 42(6):1273–1280, 2002. doi: 10.1021/ci010132r. URLhttps://doi.org/10.1021/ci010132r

    2002 doi

  20. [28]

    Latent generative landscapes as maps of functional diversity in protein sequence space.Nature Communications, 14(1):2222, Apr

    Cheyenne Ziegler, Jonathan Martin, Claude Sinner, and Faruck Morcos. Latent generative landscapes as maps of functional diversity in protein sequence space.Nature Communications, 14(1):2222, Apr

  21. [29]

    Resolving the data ambiguity for periodic crystals

    Daniel Widdowson and Vitaliy Kurlin. Resolving the data ambiguity for periodic crystals. In Sanmi Koyejo, S. Mohamed, A. Agarwal, Danielle Belgrave, K. Cho, and A. Oh, editors,Ad- vances in Neural Information Processing Systems 35: Annual Conference on Neural Informa- tion Pro...

    2022

  22. [30]

    Pointwise distance distributions for detecting near-duplicates in large materials databases, 2021

    Daniel Widdowson and Vitaliy Kurlin. Pointwise distance distributions for detecting near-duplicates in large materials databases, 2021

    2021

  23. [31]

    Anosova, Daniel E

    Olga D. Anosova, Daniel E. Widdowson, and Vitaliy A. Kurlin. Recognition of near-duplicate periodic patterns by continuous metrics with approximation guarantees.Pattern Recognition, 171:112108, 2026. ISSN 0031-3203. doi: 10.1016/j.patcog.2025.112108. URLhttps://www.sciencedire...

    2026

  24. [32]

    The importance of definitions in crystallography

    Olga Anosova, Vitaliy Kurlin, and Marjorie Senechal. The importance of definitions in crystallography. IUCrJ, 11(4):453–463, May 2024. ISSN 2052-2525. doi: 10.1107/s2052252524004056. URLhttp: //dx.doi.org/10.1107/S2052252524004056. 14 Supporting Information How Molecular Gener...

    2024

  25. [2012]

    URLhttps://doi.org/10.1021/ci3001277

    doi: 10.1021/ci3001277. URLhttps://doi.org/10.1021/ci3001277

    doi

  26. [2023]

    doi: 10.1038/s41467-023-37958-z

    ISSN 2041-1723. doi: 10.1038/s41467-023-37958-z. URLhttps://doi.org/10.1038/ s41467-023-37958-z

    doi

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.