{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QZYS7BZ6GV2LSTIDRRFD2GQZW7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15695","created_at":"2026-05-20T00:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15695v1","created_at":"2026-05-20T00:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15695","created_at":"2026-05-20T00:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"QZYS7BZ6GV2L","created_at":"2026-05-20T00:01:12Z"},{"alias_kind":"pith_short_16","alias_value":"QZYS7BZ6GV2LSTID","created_at":"2026-05-20T00:01:12Z"},{"alias_kind":"pith_short_8","alias_value":"QZYS7BZ6","created_at":"2026-05-20T00:01:12Z"}],"graph_snapshots":[{"event_id":"sha256:a2bacb36d56ce159dfddeb4d8ce3fc3152fac1ec7add4615a4837721ad927c91","target":"graph","created_at":"2026-05-20T00:01:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our evaluations demonstrate that ParamSpMM outperforms Nvidia cuSPARSE with an average speedup of 1.92x, significantly enhancing GNN training efficiency."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The ML-based SpMM-decider can reliably predict optimal configurations from the crafted input features across diverse graph characteristics."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ParamSpMM adapts SpMM on GPUs to graph inputs via a flexible data structure and ML predictor for better GNN efficiency."}],"snapshot_sha256":"1ef72aa7f8cfcdcb524961bc97319c0ecb18915187d17475352c995600ee0205"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"25666ce2ca02b5688b2a440549a4caf793bf62101f96a3f6ee3ec7976492b6aa"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.221162Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:41:03.222476Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:29.218344Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:56.038578Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15695/integrity.json","findings":[],"snapshot_sha256":"330779e39c764c3bd12423d104a466ca4e27f623312535f180a4da5bad3531f0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fueled by the ability to mine real-world graph data, GNN applications have experienced phenomenal growth. Sparse Matrix-Matrix Multiplication (SpMM) is a critical operator in GNNs. However, existing SpMM designs for GNNs struggle to adapt to diverse input characteristics. In this paper, we first conduct a comprehensive analysis of existing SpMM optimizations, revealing their limitations through statistical and empirical evidence. Based on this analysis, we introduce ParamSpMM, a parametric approach for highly adaptive and efficient SpMM computation in GNNs. It incorporates a new data structure","authors_text":"Guanhua Ye, Hongzheng Li, Lixing Zhang, Shigang Li, Yingxia Shao","cross_cats":[],"headline":"ParamSpMM adapts SpMM on GPUs to graph inputs via a flexible data structure and ML predictor for better GNN efficiency.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-15T07:38:04Z","title":"ParamSpMM: Adaptive and Efficient Sparse Matrix-Matrix Multiplication on GPUs for GNNs"},"references":{"count":32,"internal_anchors":0,"resolved_work":32,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"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)","work_id":"a8461479-56bf-4291-890a-ad2880deca74","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: 10th dimacs implementa- tion challenge-graph partitioning and graph clustering (2011)","work_id":"8d88f590-5041-4ca3-a655-03354b5de463","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Waschington University in St","work_id":"a8c415f1-dac3-4b00-96b1-bbfed3ba3b6b","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"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)","work_id":"fe2bd51e-5ac6-4c29-9fdc-79800ea0f10e","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Fan, R., Wang, W., Chu, X.: Fast sparse gpu kernels for accelerated training of graph neural networks. In: (IPDPS). pp. 501–511 (2023)","work_id":"5b6017c0-6221-409d-984a-750aa5c96c8c","year":2023}],"snapshot_sha256":"0ed6b87ff91dd5047cf9386db7b26c4bfaa3c0afa27b98073bb0ef30de88dd6f"},"source":{"id":"2605.15695","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:32:01.448336Z","id":"491632c6-e661-44e5-b607-0fadba193968","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ParamSpMM adapts SpMM on GPUs to graph inputs via a flexible data structure and ML predictor for better GNN efficiency.","strongest_claim":"Our evaluations demonstrate that ParamSpMM outperforms Nvidia cuSPARSE with an average speedup of 1.92x, significantly enhancing GNN training efficiency.","weakest_assumption":"The ML-based SpMM-decider can reliably predict optimal configurations from the crafted input features across diverse graph characteristics."}},"verdict_id":"491632c6-e661-44e5-b607-0fadba193968"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8072b0efb58fb9e03a410586bcb65d1bc235b4c393635d692f9bf386c9c18d07","target":"record","created_at":"2026-05-20T00:01:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"86712f873e3574b94d038c4a3d1a19b7f0d6a243f0d5c9eb7f23c17ee0130ab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86712f873e3574b94d038c4a3d1a19b7f0d6a243f0d5c9eb7f23c17ee0130ab8","first_computed_at":"2026-05-20T00:01:12.968184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:12.968184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qrm1PyIOMm6YjyTRiOPnEn4MyhfSIdVVVONQ/OK0LLboT/9saOj+N8GQrPRXyfz3kb2KD4FA9QRNwjSVmrTJCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:12.969028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8072b0efb58fb9e03a410586bcb65d1bc235b4c393635d692f9bf386c9c18d07","sha256:a2bacb36d56ce159dfddeb4d8ce3fc3152fac1ec7add4615a4837721ad927c91"],"state_sha256":"16b8e6b642d962245ea935a9e4798c1430080695576e66293328050526b239e5"}