Peanut DualCutoff LearnedBoundary Architecture
This model extends the PEANUT architecture by introducing learned, element-pair–dependent cutoff distances and soft distance-based gating to interpolate between close-range and non-close-range interactions.
Graph construction
For a molecular structure, construct a single directed neighbor graph with atoms as nodes and edges connecting all atom pairs within a global cutoff radius \(r_{\mathrm{cut}}\).
The neighbor graph is fixed per forward pass. Interaction regimes are distinguished at the edge message level.
Learned atom-pairwise cutoff distances
Let \(Z_i, Z_j \in \{0, \dots, N_{\mathrm{el}}-1\}\) denote atomic numbers.
Pair index mapping
Map the unordered element pair \((Z_i, Z_j)\) to a unique index \(p(i,j)\):
Learned pairwise cutoff
Each element pair is assigned a learnable scalar parameter \(\theta_p \in \mathbb{R}\). The effective cutoff distance is
which ensures
Soft distance-based gating
Define a smooth distance-dependent gating function
where \(r_{ij}\) is the interatomic distance. At the learned cutoff,
Dual edge message functions
Edge features are given by
Two separate message functions are applied:
with
Distance-weighted message combination
The final edge message is computed as
This yields a smooth, fully differentiable interpolation between short-range and long-range interaction regimes.