HP-JEPA learns graph representations by predicting masked targets in latent space across a hierarchy of graph partitions. Combining features from coarse and fine partitions lets downstream models use local, regional, and global structure. The approach is evaluated on graph classification and regression tasks.