pith. sign in
Pith Number

pith:QZYS7BZ6

pith:2026:QZYS7BZ6GV2LSTIDRRFD2GQZW7
not attested not anchored not stored refs resolved

ParamSpMM: Adaptive and Efficient Sparse Matrix-Matrix Multiplication on GPUs for GNNs

Guanhua Ye, Hongzheng Li, Lixing Zhang, Shigang Li, Yingxia Shao

ParamSpMM adapts SpMM on GPUs to graph inputs via a flexible data structure and ML predictor for better GNN efficiency.

arxiv:2605.15695 v1 · 2026-05-15 · cs.DC

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{QZYS7BZ6GV2LSTIDRRFD2GQZW7}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Our evaluations demonstrate that ParamSpMM outperforms Nvidia cuSPARSE with an average speedup of 1.92x, significantly enhancing GNN training efficiency.

C2weakest assumption

The ML-based SpMM-decider can reliably predict optimal configurations from the crafted input features across diverse graph characteristics.

C3one line summary

ParamSpMM uses a Parameterized Compressed Sparse Row format and an ML-based decider to adapt SpMM optimizations for GNNs, delivering 1.92x average speedup over cuSPARSE.

References

32 extracted · 32 resolved · 0 Pith anchors

[1] Arai, J., Shiokawa, H., Yamamuro, T., Onizuka, M., Iwamura, S.: Rabbit order: Just-in-time parallel reordering for fast graph analysis. In: (IPDPS). pp. 22–31 (2016) 2016
[2] Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: 10th dimacs implementa- tion challenge-graph partitioning and graph clustering (2011) 2011
[3] Waschington University in St 2009
[4] Dai, G., Huang, G., Yang, S., Yu, Z., Zhang, H., Ding, Y., Xie, Y., Yang, H., Wang, Y.: Heuristic adaptability to input dynamics for spmm on gpus. p. 595–600. DAC ’22 (2022) 2022
[5] Fan, R., Wang, W., Chu, X.: Fast sparse gpu kernels for accelerated training of graph neural networks. In: (IPDPS). pp. 501–511 (2023) 2023

Formal links

1 machine-checked theorem link

Receipt and verification
First computed 2026-05-20T00:01:12.968184Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

86712f873e3574b94d038c4a3d1a19b7f0d6a243f0d5c9eb7f23c17ee0130ab8

Aliases

arxiv: 2605.15695 · arxiv_version: 2605.15695v1 · doi: 10.48550/arxiv.2605.15695 · pith_short_12: QZYS7BZ6GV2L · pith_short_16: QZYS7BZ6GV2LSTID · pith_short_8: QZYS7BZ6
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/QZYS7BZ6GV2LSTIDRRFD2GQZW7 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 86712f873e3574b94d038c4a3d1a19b7f0d6a243f0d5c9eb7f23c17ee0130ab8
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "c9942ec6402e6c8017786a136e67d988352da8e1245359aa6ab5e795e249410e",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.DC",
    "submitted_at": "2026-05-15T07:38:04Z",
    "title_canon_sha256": "ae9587f0b25d2e2918d5f5dba1086758c9de9bb56d6deec4e7c4e4c13a0a6623"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15695",
    "kind": "arxiv",
    "version": 1
  }
}