- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposed GRAPH BYTE TRIPLE ENCODING, where the merge rule is based on two adjacent tokens and the canonical representation of their merged subgraph, to address the enumeration dependence and inconsistent subgraph tokenization issue of SMILES, and connectivity uncertainty in pair-based merging.
Critical strengths
- The motivation is very clear, the proposed method is reasonable to reduce the ambiguity of a graph representation compare to baseline methods.
- The paper is well organized, the figures and examples are illustrative, the experiment set-up and results looks reasonable and promising.
Critical weaknesses
- The inconsistent subgraph tokenization is not fully resolved, because the order of nodes is not deterministic so that tokenization results could be different.
For example, Figure 2 Example M2 could have 2 different orders, given vocab (C, O, N, (C, O, C-O)), COCN is tokenized to (C, O, C-O)-C-N while NCOC corresponds to N-(C, O, C-O)-C. In Algorithm 1 Line 7: for adjacent token pairs (a,b) in G; Algorithm 2 Line 4: for adjacent tokens in G_token, the order of G is not described. - Structural Ambiguity still exists: although the original atom connection is preserved during the merging to construct the canonical subgraph, once the merge is done, the connection information of 2 subgraph is still missing in the final representation. e.g. in N-(C, O, C-O)-C, if N connects to C or O is not represented.
- SPE plays an important role in improving the metrics, the author should also compare with the GraphBPE+SPE to make fair comparison.
Questions for authors
NA
Dear reviewers,
The rebuttal period is ending soon. Please read the authors rebuttal and check if they addressed your concerns. Please acknowledge the rebuttal and adjust your scores accordingly.
Thanks.
-AC