Pith. sign in

REVIEW 4 major objections 5 minor 51 references

RingFormer: A Ring-Enhanced Graph Transformer for Organic Solar Cell Property Prediction

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Pith's one-line read RingFormer, a graph transformer that represents organic solar cell molecules at both atom and ring levels, predicts power conversion efficiency and related properties more accurately than existing fingerprint, GNN, and transformer…

desk verdict Sensible architecture and a promising CEPDB result, but the headline 22.77% margin is not yet trustworthy because the deep baselines were tuned to RingFormer's capacity rather than their own. read the letter →

arxiv 2412.09030 v1 pith:GABCS4NG submitted 2024-12-12 cs.LG cs.AI

classification cs.LGcs.AI
keywords graphtransformerorganicsolarcellsmolecularpropertypredictionringsystemshierarchicalpowerconversionefficiencycross-attentionmessagepassing
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

RingFormer is a graph transformer for predicting properties of organic solar cell (OSC) molecules, with power conversion efficiency (PCE) as the main target. The paper's central claim is that a molecule should be read at two structural levels at once—its atoms and the rings that form its conjugated core—and that models which ignore the ring system are leaving out the feature that most determines OSC performance. On the large CEPDB dataset, RingFormer reports a test MAE of 0.189 for PCE, a 22.8% relative improvement over the best competing model at 0.244, and it also wins on three of four smaller experimental datasets. If this holds, cheap computational screening of candidate OSC molecules becomes more reliable, since the model captures exactly the kind of fused and non-fused ring architectures that synthetic chemists vary.

What carries the argument

The central object is the hierarchical OSC graph $\mathcal{G} = \{\mathcal{G}_A, \mathcal{G}_R, \mathcal{G}_I\}$. A molecule's smallest rings—closed loops with no proper subset forming a smaller ring—become ring nodes; rings are connected when they share atoms or are linked by a non-aromatic chain, and the edge attribute records how they connect. A bipartite inter-level graph joins each ring to its constituent atoms. The mechanism that does the main work is the ring-level cross-attention: for each ring node, the query is the node itself, the keys and values are formed by concatenating a neighboring ring's representation with the connection-type edge attribute, and attention is restricted to immediate ring neighbours plus a virtual molecule node that carries global information. This keeps edge semantics in the output representation and avoids quadratic all-pairs attention, which is what makes the model both more expressive for ring systems and scalable to the 2.3-million-molecule CEPDB database.

What would settle it

Re-run the CEPDB PCE benchmark with the ring-level graph built from two different smallest-ring extraction algorithms (or from an exhaustive enumeration of all simple rings) on the same train/validation/test split; if the test MAE moves away from 0.189 or the ranking against baselines changes, the central claim depends on an arbitrary preprocessing choice rather than on the ring system itself.

Watch

Extended reading notes

Core claim

The paper claims that OSC property prediction is substantially improved by encoding a molecule as a hierarchical graph with three levels: the atom-level bonding graph, a ring-level graph whose nodes are the molecule's smallest rings and whose edges encode fusions or linking chains between rings, and an inter-level bipartite graph that ties each ring to its constituent atoms. RingFormer layers then combine local message passing on the atom graph, a ring-level cross-attention that folds edge attributes into keys and values and uses a virtual molecule node for global communication, and inter-level message passing, fusing hierarchies before pooling atom and ring representations separately into the final descriptor. The claim is that this design captures ring systems—especially interconnections between rings—that fingerprints, ordinary GNNs, and generic graph transformers miss, and the reported experiments support the claim with consistent wins across five datasets and a 22.77% relative improvement on CEPDB.

Load-bearing premise

The load-bearing premise is that a molecule has a well-defined set of 'smallest rings' that can be extracted consistently; for fused ring systems the set of smallest rings can be algorithm-dependent, and if the extraction is not unique, the entire hierarchical graph is not uniquely determined by the molecule.

Editorial extensions

If this is right

  • If the reported gains are real, the same hierarchical atom-plus-ring encoding should improve prediction of other electronic properties of conjugated molecules, and the multi-task results on CEPDB for HOMO, LUMO, band gap, $V_{oc}$, and $J_{sc}$ already point that way.
  • Molecules with larger fused ring systems should benefit the most; the paper shows that RingFormer's relative improvement over baselines grows with the number of rings.
  • Because the ring-level cross-attention only looks at ring neighbours plus a virtual node, it should scale to very large molecular libraries where full graph transformers become too slow.
  • The architecture is not tied to one GNN backbone; the paper reports that swapping GINE for GraphSAGE or GatedGCN keeps RingFormer ahead of the best deep competitor on four of five datasets.
  • The two-level pooling scheme gives a principled replacement for fingerprint-plus-random-forest pipelines in OSC screening, since it works on raw molecular graphs and still beats ECFP on the experimental datasets.

Reading between the lines

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

  • The ring-level representation is likely transferable to other chemistry domains, such as predicting properties of drug-like molecules with fused aromatic cores, but the paper does not test this.
  • Because the paper does not specify the smallest-ring extraction algorithm, a reproducibility check would be to rebuild the ring-level graphs with two different ring-set algorithms on fused-ring molecules; if the reported 22.8% gain depends on the algorithm, the representation is not uniquely defined by the molecule.
  • The largest gain appears on the DFT-computed CEPDB database; experimental datasets are smaller and noisier, so the method's practical advantage for screening real synthesized molecules could be smaller than the headline number.
  • The combination of hierarchical representation with a linear-cost virtual-node attention suggests a natural test in active learning: use the model's uncertainty to prioritise which candidate OSC molecules to synthesize.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 5 minor

Summary. The paper introduces RingFormer, a graph-transformer model for predicting organic solar cell (OSC) properties. It constructs a hierarchical graph with an atom-level graph, a ring-level graph of 'smallest rings' and their connections, and a bipartite inter-level graph connecting atoms to rings. Each RingFormer layer performs atom-level message passing, ring-level cross-attention with a virtual node, inter-level message passing, and a fusion MLP. The model is evaluated on five OSC datasets under scaffold splitting, with PCE as the main target, and is reported to outperform 11 baselines, including a 22.77% relative improvement on the large CEPDB dataset. Ablations and additional analyses of ring-system complexity are provided.

Significance. If the reported gains are robust, RingFormer is a meaningful advance for OSC property prediction: it is among the first graph transformers to explicitly model ring systems and their interconnections, it is evaluated on a very large DFT-computed dataset (CEPDB), and the authors release code. The multi-task results on CEPDB and the layer/backbone robustness checks are useful. The significance is tempered, however, by the fixed hyperparameters imposed on all deep baselines and by unspecified ring-extraction details, so the magnitude of the headline improvement is not yet fully established.

major comments (4)
  1. [Appendix: Implementation Details] The protocol fixes the number of layers to 8, hidden dimension to 512, and attention heads to 4 for all deep baselines except GraphViT, rather than tuning each model on the validation split. This is load-bearing for the headline CEPDB result (Table 2), since a 22.77% relative improvement over an undertuned GraphViT may reflect capacity mismatch rather than the ring-level representation. Please report per-model hyperparameter selection on the validation set, or compare against the best numbers reported in the original papers, and detail the search ranges.
  2. [Ring-level Graph Construction] The 'smallest ring' definition ('no proper subset of its nodes can form a smaller ring') does not specify a unique set of rings for fused or bridged polycycles, and the paper does not name the algorithm used (e.g., RDKit's SSSR or GetSymmSSSR). Because the ring-level graph and all subsequent modules depend on this set, the representation is not uniquely determined by the molecular graph as presented. Specify the exact ring-perception routine and discuss how non-uniqueness is handled.
  3. [Model Analysis, Tables 4, 5, 7, 8] These tables report single MAE values, although the experimental setup section states that five seeds are run and mean ± std are reported. Several ablation comparisons are close (e.g., Table 5, Cross-attention vs. without virtual node on CEPDB is 0.1886 vs 0.1860; Table 4, G\GI vs G on HOPV is 1.497 vs 1.477). Without variance or significance tests, the claims that all graph levels and the cross-attention module are necessary are not supported. Please report standard deviations and, where helpful, paired tests across seeds.
  4. [Overall Performance / Abstract] The claim that RingFormer 'consistently outperforms existing methods' is stronger than Table 2 supports: on PFD, RingFormer's MAE (1.776) is slightly worse than MACCS (1.770), and on HOPV its mean is tied with GraphViT within one standard deviation (1.477±0.021 vs 1.479±0.061). Please qualify the claim, e.g., 'best or second-best on all datasets, and best on the large-scale CEPDB dataset.'
minor comments (5)
  1. [The RingFormer Method] There are typos: 'firsts constructs' should be 'first constructs', and 'formulaiton' in the problem formulation section should be 'formulation'.
  2. [Table 7] Table 7 uses dataset names 'PolymerFA', 'nNFA', 'pNFA', while the rest of the paper uses 'PFD', 'NFA', 'PD'; please use consistent naming throughout.
  3. [Figure 4] One panel of Figure 4 is labeled 'PFA', which should be 'PFD' to match the dataset name used elsewhere.
  4. [Introduction] The introduction calls RingFormer 'the first graph transformer framework capturing ring systems'; since O-GNN also captures rings but is not a transformer, consider rephrasing to 'the first graph transformer that explicitly models ring systems and ring-ring connections'.
  5. [Datasets and Evaluation Metrics] The paper says 'we curate 5 OSC molecule datasets' for datasets that already exist in the literature; consider saying 'we compile and preprocess' to avoid implying the data were newly collected.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: ring-level features and architecture are independent of the predicted labels, and the headline improvement is measured on a held-out test split.

full rationale

RingFormer's derivation chain is self-contained and does not reduce to its inputs. The ring-level graph is constructed from the molecular graph by a fixed ring-extraction rule ('the smallest ring is defined as a ring such that no proper subset of its nodes can form a smaller ring') plus one-hot ring type and connection-type attributes; this is feature engineering on the input structure, with no dependence on the target PCE values. The cross-attention, virtual node, inter-level message passing, and hierarchical fusion are all architectural mechanisms with learned parameters trained by MAE loss on training splits, and performance is reported on scaffold-based held-out test splits, so there is no fitted parameter renamed as a prediction. The claimed 22.77% CEPDB improvement is computed from test MAE values (0.1886 vs 0.2442) rather than from any equation that defines the output in terms of the input. The paper contains no load-bearing self-citation chain, no author-imported uniqueness theorem, and no ansatz justified solely by prior work of the same authors; citations such as GINE and Exphormer provide external architectural ingredients, not the paper's own conclusions. The only notable weaknesses, such as the unspecified concrete algorithm for extracting smallest rings and the fixed hyperparameters imposed on baselines, are correctness or reproducibility concerns, not circularity, because they do not make the reported predictions equivalent to the training inputs by construction.

Assumptions & free parameters 5 free parameters · 5 assumptions · 1 invented entities

The central claim rests on the ring extraction, the scaffold split, the max-PCE label curation, and the virtual-node attention design. All but the ring extraction are standard practices, but the max-PCE curation and split choice are not justified with sensitivity analyses.

free parameters (5)
  • Number of RingFormer layers L = 8
    Tuned on validation; Figure 4 shows performance varies with L and degrades beyond 8 on small datasets.
  • Hidden dimension d = 512
    Fixed for all models, not tuned per dataset.
  • Attention heads C = 4
    Fixed for RingFormer and baselines.
  • Maximum learning rate = one of {0.001, 0.0005, 0.0001, 0.00005} (not reported per dataset)
    Selected on validation set.
  • Virtual node embedding dimension d_p = not specified
    Used for degree-based position encoding; value not stated.
assumptions (5)
  • domain assumption The set of 'smallest rings' can be extracted uniquely from a molecular graph.
    Section 'Ring-level Graph Construction' defines smallest rings but does not specify an algorithm; for fused rings, the smallest set of smallest rings is not unique.
  • domain assumption Scaffold-based splitting with 6:2:2 gives a realistic generalization benchmark.
    Used in all experiments; no analysis of split sensitivity.
  • domain assumption For molecules with multiple PCE measurements, the largest value is the correct ground truth.
    Applied to PFD, NFA, PD in Appendix Dataset Details.
  • domain assumption DFT-computed PCE on CEPDB is a meaningful target for OSC property prediction.
    CEPDB properties are DFT-calculated, so the main improvement is on computed labels, not experimental ones.
  • ad hoc to paper A virtual node plus localized attention is sufficient to capture global ring-system patterns.
    This design choice is validated only empirically via ablations without error bars.
invented entities (1)
  • Virtual molecule node
    purpose: Connects all ring nodes to propagate global information without full pairwise attention.
    It is a model construct, not a physical entity; its benefit is shown only in ablations with no significance testing.

how reviews work

0 comments
Cite this review

Pith. "Pith review of RingFormer: A Ring-Enhanced Graph Transformer for Organic Solar Cell Property Prediction." pith.science (2026). https://pith.science/paper/GABCS4NG

@misc{pith2026241209030,
  author       = {Pith},
  title        = {Pith review of: RingFormer: A Ring-Enhanced Graph Transformer for Organic Solar Cell Property Prediction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GABCS4NG}},
  note         = {Machine review of arXiv:2412.09030}
}
read the original abstract

Organic Solar Cells (OSCs) are a promising technology for sustainable energy production. However, the identification of molecules with desired OSC properties typically involves laborious experimental research. To accelerate progress in the field, it is crucial to develop machine learning models capable of accurately predicting the properties of OSC molecules. While graph representation learning has demonstrated success in molecular property prediction, it remains underexplored for OSC-specific tasks. Existing methods fail to capture the unique structural features of OSC molecules, particularly the intricate ring systems that critically influence OSC properties, leading to suboptimal performance. To fill the gap, we present RingFormer, a novel graph transformer framework specially designed to capture both atom and ring level structural patterns in OSC molecules. RingFormer constructs a hierarchical graph that integrates atomic and ring structures and employs a combination of local message passing and global attention mechanisms to generate expressive graph representations for accurate OSC property prediction. We evaluate RingFormer's effectiveness on five curated OSC molecule datasets through extensive experiments. The results demonstrate that RingFormer consistently outperforms existing methods, achieving a 22.77% relative improvement over the nearest competitor on the CEPDB dataset.

Figures

Figures reproduced from arXiv: 2412.09030 by the authors.

Figure 1
Figure 1. Example of OSC molecules. semi-conducting materials for the active layer of OSCs. Such molecules function as electron acceptors or donors to create photovoltaic effects with efficacy linked to their con￾jugated structure, such as aromatic rings (Solak and Irmak 2023). In chemistry, rings are closed loops of atoms con￾nected through covalent bonds (Jonathan Clayden 2012), and the design of complex ring systems has be… view at source ↗
Figure 2
Figure 2. The RingFormer framework. For clarity, we showcase the framework with [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. (a) Performance improvement on molecules with [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: PCE (%) prediction performance of RingFormer by test MAE when the number of RingFormer layers [PITH_FULL_IMAGE:figures/full_fig_p012_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

51 extracted references · 41 canonical work pages

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address archivePrefix author booktitle chapter edition editor eid eprint howpublished institution isbn journal key month note number organization pages publisher school series title type volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.a...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    Akhtaruzzaman, M.; and Selvanathan, V. 2021. Comprehensive guide on organic and inorganic solar cells: fundamental concepts to fabrication methods. Academic Press

  4. [4]

    Bresson, X.; and Laurent, T. 2017. Residual gated graph convnets. arXiv preprint arXiv:1711.07553

  5. [5]

    Chen, Z.; Chen, L.; Villar, S.; and Bruna, J. 2020. Can graph neural networks count substructures? Advances in neural information processing systems, 33: 10383--10395

  6. [6]

    Ching, M.-C.; and Isabelle, K. 2023. Impact of Alkyl-Based Side Chains in Conjugated Materials for Bulk Heterojunction Organic Photovoltaic Cells A Review . Energies, 16(18): 6639

  7. [7]

    Degen, J.; Wegscheid-Gerlach, C.; Zaliani, A.; and Rarey, M. 2008. On the Art of Compiling and Using'Drug-Like'Chemical Fragment Spaces. ChemMedChem: Chemistry Enabling Drug Discovery, 3(10): 1503--1507

  8. [8]

    L.; Leland, B

    Durant, J. L.; Leland, B. A.; Henry, D. R.; and Nourse, J. G. 2002. Reoptimization of MDL keys for use in drug discovery. Journal of chemical information and computer sciences, 42(6): 1273--1280

Show all 51 references
  1. [9]

    Eibeck, A.; Nurkowski, D.; Menon, A.; Bai, J.; Wu, J.; Zhou, L.; Mosbach, S.; Akroyd, J.; and Kraft, M. 2021. Predicting power conversion efficiency of organic photovoltaics: models and data analysis. ACS omega, 6(37): 23764--23775

  2. [10]

    Gao, H.; Han, C.; Wan, X.; and Chen, Y. 2023. Recent Progress in Non-Fused Ring Electron Acceptors for High Performance Organic Solar Cells. Industrial Chemistry & Materials, 1(1): 60--78

  3. [11]

    Gao, H.; and Ji, S. 2019. Graph u-nets. In international conference on machine learning, 2083--2092. PMLR

  4. [12]

    S.; Riley, P

    Gilmer, J.; Schoenholz, S. S.; Riley, P. F.; Vinyals, O.; and Dahl, G. E. 2017. Neural message passing for quantum chemistry. In International conference on machine learning, 1263--1272. PMLR

  5. [13]

    Griffith, J.; and Orgel, L. 1957. Ligand-field theory. Quarterly Reviews, Chemical Society, 11(4): 381--393

  6. [14]

    S.; Gold-Parker, A.; Vogt, L.; Brockway, A

    Hachmann, J.; Olivares-Amaya, R.; Atahan-Evrenk, S.; Amador-Bedolla, C.; S \'a nchez-Carrera, R. S.; Gold-Parker, A.; Vogt, L.; Brockway, A. M.; and Aspuru-Guzik, A. 2011. The Harvard clean energy project: large-scale computational screening and design of organic photovoltaics...

  7. [15]

    L.; Ying, R.; and Leskovec, J

    Hamilton, W. L.; Ying, R.; and Leskovec, J. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems, 1025--1035

  8. [16]

    He, X.; Hooi, B.; Laurent, T.; Perold, A.; LeCun, Y.; and Bresson, X. 2023. A generalization of vit/mlp-mixer to graphs. In International Conference on Machine Learning, 12724--12745. PMLR

  9. [17]

    Hu, W.; Liu, B.; Gomes, J.; Zitnik, M.; Liang, P.; Pande, V.; and Leskovec, J. 2019. Strategies for Pre-training Graph Neural Networks. In International Conference on Learning Representations

  10. [18]

    Hussain, C. M. 2018. Handbook of nanomaterials for industrial applications. Elsevier

  11. [19]

    W., Nick Greeves

    Jonathan Clayden, S. W., Nick Greeves. 2012. Organic chemistry. Oxford University Press

  12. [20]

    Kim, J.; Lee, S.; Kim, D.; Ahn, S.; and Park, J. 2022. Substructure-Atom Cross Attention for Molecular Representation Learning

  13. [21]

    Kramer, O.; and Kramer, O. 2016. Scikit-learn. Machine learning for evolution strategies, 45--53

  14. [22]

    Kreuzer, D.; Beaini, D.; Hamilton, W.; L \'e tourneau, V.; and Tossou, P. 2021. Rethinking graph transformers with spectral attention. Advances in Neural Information Processing Systems, 34: 21618--21629

  15. [23]

    Lee et al., J. 2019. Self-attention graph pooling. In International conference on machine learning, 3734--3743. PMLR

  16. [24]

    A.; Pyzer-Knapp, E

    Lopez, S. A.; Pyzer-Knapp, E. O.; Simm, G. N.; Lutzow, T.; Li, K.; Seress, L. R.; Hachmann, J.; and Aspuru-Guzik, A. 2016. The Harvard organic photovoltaic dataset. Scientific data, 3(1): 1--7

  17. [25]

    Loukas, A. 2019. What graph neural networks cannot learn: depth vs width. In International Conference on Learning Representations

  18. [26]

    McInnes, L. 2018. Umap: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426

  19. [27]

    Miyake, Y.; and Saeki, A. 2021. Machine learning-assisted development of organic solar cell materials: issues, analyses, and outlooks. The Journal of Physical Chemistry Letters, 12(51): 12391--12401

  20. [28]

    Nagasawa et al., S. 2018. Computer-aided screening of conjugated polymers for organic solar cell: classification by random forest. The Journal of Physical Chemistry Letters, 9(10): 2639--2646

  21. [29]

    P.; Luu, A

    Ramp \'a s ek, L.; Galkin, M.; Dwivedi, V. P.; Luu, A. T.; Wolf, G.; and Beaini, D. 2022. Recipe for a general, powerful, scalable graph transformer. Advances in Neural Information Processing Systems, 35: 14501--14515

  22. [30]

    Ramsundar, B. 2018. Molecular machine learning with DeepChem. Ph.D. thesis, Stanford University

  23. [31]

    Rogers et al., D. 2010. Extended-connectivity fingerprints. Journal of chemical information and modeling, 50(5): 742--754

  24. [32]

    Rong, Y.; Bian, Y.; Xu, T.; Xie, W.; Wei, Y.; Huang, W.; and Huang, J. 2020. Self-supervised graph transformer on large-scale molecular data. Advances in Neural Information Processing Systems, 33: 12559--12571

  25. [33]

    S.; Saqib, M.; Javed, M.; Elshahat, S.; and Kamal, G

    Saleh, J.; Haider, S.; Akhtar, M. S.; Saqib, M.; Javed, M.; Elshahat, S.; and Kamal, G. M. 2023. Energy Level Prediction of Organic Semiconductors for Photodetectors and Mining of a Photovoltaic Database to Search for New Building Units. Molecules, 28(3): 1240

  26. [34]

    Schweda, B.; Reinfelds, M.; Hofstadler, P.; Trimmel, G.; and Rath, T. 2021. Recent Progress in the Design of Fused-Ring Non-Fullerene Acceptors Relations between Molecular Structure and Optical, Electronic, and Photovoltaic Properties. ACS Applied Energy Materials, 4(11): 11899--11981

  27. [35]

    Sebesty \'e n, V. 2021. Renewable and Sustainable Energy Reviews: Environmental impact networks of renewable energy power plants. Renewable and Sustainable Energy Reviews, 151: 111626

  28. [36]

    J.; and Sinop, A

    Shirzad, H.; Velingker, A.; Venkatachalam, B.; Sutherland, D. J.; and Sinop, A. K. 2023. Exphormer: Sparse transformers for graphs. In International Conference on Machine Learning

  29. [37]

    L.; Amosa, T

    Sikiru, S.; Oladosu, T. L.; Amosa, T. I.; Kolawole, S. Y.; and Soleimani, H. 2022. Recent advances and impact of phase change materials on solar energy: A comprehensive review. Journal of Energy Storage, 53: 105200

  30. [38]

    N.; and Topin, N

    Smith, L. N.; and Topin, N. 2019. Super-convergence: Very fast training of neural networks using large learning rates. In Artificial intelligence and machine learning for multi-domain operations applications, volume 11006, 369--386. SPIE

  31. [39]

    K.; and Irmak, E

    Solak, E. K.; and Irmak, E. 2023. Advances in Organic Photovoltaic Cells: A Comprehensive Review of Materials, Technologies, and Performance. RSC Advances, 13(18): 12244--12269

  32. [40]

    Sun, W.; Li, M.; Li, Y.; Wu, Z.; Sun, Y.; Lu, S.; Xiao, Z.; Zhao, B.; and Sun, K. 2019. The use of deep learning to fast evaluate organic photovoltaic materials. Advanced Theory and Simulations, 2(1): 1800116

  33. [41]

    N.; Kaiser, .; and Polosukhin, I

    Vaswani, A.; Shazeer, N.; Parmar, N.; Uszkoreit, J.; Jones, L.; Gomez, A. N.; Kaiser, .; and Polosukhin, I. 2017. Attention is all you need. Advances in neural information processing systems, 30

  34. [42]

    Wang, J.-L.; Xiao, F.; Yan, J.; Wu, Z.; Liu, K.-K.; Chang, Z.-F.; Zhang, R.-B.; Chen, H.; Wu, H.-B.; and Cao, Y. 2016. Difluorobenzothiadiazole-Based Small-Molecule Organic Solar Cells with 8.7\ Advanced Functional Materials, 26(11): 1803--1812

  35. [43]

    N.; Gomes, J.; Geniesse, C.; Pappu, A

    Wu, Z.; Ramsundar, B.; Feinberg, E. N.; Gomes, J.; Geniesse, C.; Pappu, A. S.; Leswing, K.; and Pande, V. 2018. MoleculeNet: a benchmark for molecular machine learning. Chemical science, 9(2): 513--530

  36. [44]

    Xiong, Z.; Wang, D.; Liu, X.; Zhong, F.; Wan, X.; Li, X.; Li, Z.; Luo, X.; Chen, K.; Jiang, H.; et al. 2019. Pushing the boundaries of molecular representation for drug discovery with the graph attention mechanism. Journal of medicinal chemistry, 63(16): 8749--8760

  37. [45]

    Xu, K.; Hu, W.; Leskovec, J.; and Jegelka, S. 2018. How Powerful are Graph Neural Networks? In International Conference on Learning Representations

  38. [46]

    Xu, X.; Yu, L.; Meng, H.; Dai, L.; Yan, H.; Li, R.; and Peng, Q. 2022. Polymer solar cells with 18.74\ Advanced Functional Materials, 32(4): 2108797

  39. [47]

    Ying, C.; Cai, T.; Luo, S.; Zheng, S.; Ke, G.; He, D.; Shen, Y.; and Liu, T.-Y. 2021. Do transformers really perform badly for graph representation? Advances in Neural Information Processing Systems, 34: 28877--28888

  40. [48]

    Yu, Z.; and Gao, H. 2022. Molecular representation learning via heterogeneous motif graph neural networks. In International Conference on Machine Learning, 25581--25594. PMLR

  41. [49]

    Zang et al., X. 2023. Hierarchical molecular graph self-supervised learning for property prediction. Communications Chemistry, 6(1): 34

  42. [50]

    Zhang, Z.; Liu, Q.; Wang, H.; Lu, C.; and Lee, C.-K. 2021. Motif-based graph self-supervised learning for molecular property prediction. Advances in Neural Information Processing Systems, 34: 15870--15882

  43. [51]

    Zhu, J.; Wu, K.; Wang, B.; Xia, Y.; Xie, S.; Meng, Q.; Wu, L.; Qin, T.; Zhou, W.; Li, H.; et al. 2023. O -GNN: incorporating ring priors into molecular modeling. In ICLR

Pith tools

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