{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GSDWDBPEOYTWY2EWG7BDGRMVBW","short_pith_number":"pith:GSDWDBPE","canonical_record":{"source":{"id":"1612.08060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-23T18:40:46Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"3d97b59041a666975621cde6c41e5a74976e1d8bdecc1ff3fe804752ccef465a","abstract_canon_sha256":"8fd6de829990ba9683aa3ab38d466a37680a405aaa6795937746420eee7a022a"},"schema_version":"1.0"},"canonical_sha256":"34876185e476276c689637c23345950d99f3ea7c75dfaf9e43f111141728afcd","source":{"kind":"arxiv","id":"1612.08060","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08060","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08060v3","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08060","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"GSDWDBPEOYTW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GSDWDBPEOYTWY2EW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GSDWDBPE","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GSDWDBPEOYTWY2EWG7BDGRMVBW","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-23T18:40:46Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"3d97b59041a666975621cde6c41e5a74976e1d8bdecc1ff3fe804752ccef465a","abstract_canon_sha256":"8fd6de829990ba9683aa3ab38d466a37680a405aaa6795937746420eee7a022a"},"schema_version":"1.0"},"canonical_sha256":"34876185e476276c689637c23345950d99f3ea7c75dfaf9e43f111141728afcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:30.645541Z","signature_b64":"jfDN/R+bmF847zmN+n0a1BBswTPFDcFudiE9U3mSpB0hBBqL3FHzMrPRWmSIi97335miIX8JpggMYDetscF/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34876185e476276c689637c23345950d99f3ea7c75dfaf9e43f111141728afcd","last_reissued_at":"2026-05-18T00:30:30.644923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:30.644923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08060","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MC7W03VFQmC5HOviGQjw1LMLQv/vO2vQRvns8h2GNy0uHCCyefaClnG+wEkXpPIh4cdpS16p1rbmjv0uIExCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:04:32.543533Z"},"content_sha256":"835a78c2f42338e12d0ed6fc8c45bdb350a5f83ca9987a795be0c1a7b73e5059","schema_version":"1.0","event_id":"sha256:835a78c2f42338e12d0ed6fc8c45bdb350a5f83ca9987a795be0c1a7b73e5059"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GSDWDBPEOYTWY2EWG7BDGRMVBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Aware Sparse Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Amanda Bienz, Luke N. Olson, William D. Gropp","submitted_at":"2016-12-23T18:40:46Z","abstract_excerpt":"The sparse matrix-vector multiply (SpMV) operation is a key computational kernel in many simulations and linear solvers. The large communication requirements associated with a reference implementation of a parallel SpMV result in poor parallel scalability. The cost of communication depends on the physical locations of the send and receive processes: messages injected into the network are more costly than messages sent between processes on the same node. In this paper, a node aware parallel SpMV (NAPSpMV) is introduced to exploit knowledge of the system topology, specifically the node-processor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08060","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xV5eGAKz3yw1z2NTlqsPkYOqPSISXpHIw1wDCcU2d3TLQlM61m5UqSlaMwqdZU+JLpwP7kBYBFD/4jfx4wdSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:04:32.543885Z"},"content_sha256":"2caef39c613909e82170c08d00dd74c6152bddf62b804879c3dae3bd9a315177","schema_version":"1.0","event_id":"sha256:2caef39c613909e82170c08d00dd74c6152bddf62b804879c3dae3bd9a315177"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSDWDBPEOYTWY2EWG7BDGRMVBW/bundle.json","state_url":"https://pith.science/pith/GSDWDBPEOYTWY2EWG7BDGRMVBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSDWDBPEOYTWY2EWG7BDGRMVBW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T11:04:32Z","links":{"resolver":"https://pith.science/pith/GSDWDBPEOYTWY2EWG7BDGRMVBW","bundle":"https://pith.science/pith/GSDWDBPEOYTWY2EWG7BDGRMVBW/bundle.json","state":"https://pith.science/pith/GSDWDBPEOYTWY2EWG7BDGRMVBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSDWDBPEOYTWY2EWG7BDGRMVBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GSDWDBPEOYTWY2EWG7BDGRMVBW","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":"8fd6de829990ba9683aa3ab38d466a37680a405aaa6795937746420eee7a022a","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-23T18:40:46Z","title_canon_sha256":"3d97b59041a666975621cde6c41e5a74976e1d8bdecc1ff3fe804752ccef465a"},"schema_version":"1.0","source":{"id":"1612.08060","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08060","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08060v3","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08060","created_at":"2026-05-18T00:30:30Z"},{"alias_kind":"pith_short_12","alias_value":"GSDWDBPEOYTW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GSDWDBPEOYTWY2EW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GSDWDBPE","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2caef39c613909e82170c08d00dd74c6152bddf62b804879c3dae3bd9a315177","target":"graph","created_at":"2026-05-18T00:30:30Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The sparse matrix-vector multiply (SpMV) operation is a key computational kernel in many simulations and linear solvers. The large communication requirements associated with a reference implementation of a parallel SpMV result in poor parallel scalability. The cost of communication depends on the physical locations of the send and receive processes: messages injected into the network are more costly than messages sent between processes on the same node. In this paper, a node aware parallel SpMV (NAPSpMV) is introduced to exploit knowledge of the system topology, specifically the node-processor","authors_text":"Amanda Bienz, Luke N. Olson, William D. Gropp","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-23T18:40:46Z","title":"Node Aware Sparse Matrix-Vector Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08060","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:835a78c2f42338e12d0ed6fc8c45bdb350a5f83ca9987a795be0c1a7b73e5059","target":"record","created_at":"2026-05-18T00:30:30Z","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":"8fd6de829990ba9683aa3ab38d466a37680a405aaa6795937746420eee7a022a","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-12-23T18:40:46Z","title_canon_sha256":"3d97b59041a666975621cde6c41e5a74976e1d8bdecc1ff3fe804752ccef465a"},"schema_version":"1.0","source":{"id":"1612.08060","kind":"arxiv","version":3}},"canonical_sha256":"34876185e476276c689637c23345950d99f3ea7c75dfaf9e43f111141728afcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34876185e476276c689637c23345950d99f3ea7c75dfaf9e43f111141728afcd","first_computed_at":"2026-05-18T00:30:30.644923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:30.644923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfDN/R+bmF847zmN+n0a1BBswTPFDcFudiE9U3mSpB0hBBqL3FHzMrPRWmSIi97335miIX8JpggMYDetscF/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:30.645541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08060","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:835a78c2f42338e12d0ed6fc8c45bdb350a5f83ca9987a795be0c1a7b73e5059","sha256:2caef39c613909e82170c08d00dd74c6152bddf62b804879c3dae3bd9a315177"],"state_sha256":"427b9f5f4ea57c53c1ade8ed6ffc35613b207d475f50fb441436b2645b4dffb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxY156hbGEcytxUlZuj/zymMX8gaXYUVG87gNCGwXh4BFAo0n+xL/yNTnM6zF+UF9h3x5wc62p1PdRfazwuDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:04:32.546084Z","bundle_sha256":"abfd1d926fcad13662782f51f9d43eee91f3e909880c4d772a7aaff2a6c75d51"}}