{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XLUJXCITD57IRAP6Q2M7E335ZY","short_pith_number":"pith:XLUJXCIT","canonical_record":{"source":{"id":"1705.10218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:42:14Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"0e2d2ce5188e815ca4378b9e7e062acee8c61d2e7017dedfc58816e7d4f97070","abstract_canon_sha256":"9fa4760469d6c248bf8542b55af6685cf1a85ec5d9b2f1d173e271e1a4831ef8"},"schema_version":"1.0"},"canonical_sha256":"bae89b89131f7e8881fe8699f26f7dce3d8aedf5eb27a834f707f9d6cb40c10f","source":{"kind":"arxiv","id":"1705.10218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10218","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10218v1","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10218","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"XLUJXCITD57I","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XLUJXCITD57IRAP6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XLUJXCIT","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XLUJXCITD57IRAP6Q2M7E335ZY","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:42:14Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"0e2d2ce5188e815ca4378b9e7e062acee8c61d2e7017dedfc58816e7d4f97070","abstract_canon_sha256":"9fa4760469d6c248bf8542b55af6685cf1a85ec5d9b2f1d173e271e1a4831ef8"},"schema_version":"1.0"},"canonical_sha256":"bae89b89131f7e8881fe8699f26f7dce3d8aedf5eb27a834f707f9d6cb40c10f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.293651Z","signature_b64":"YK3bCeJG7Qr8vCZQjmIFIy+U8XKGaUDu+TRgb345GGHULali2JptxBhtZO9ic5EsMnJ/SXqcv+YMBBHdfK6lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae89b89131f7e8881fe8699f26f7dce3d8aedf5eb27a834f707f9d6cb40c10f","last_reissued_at":"2026-05-18T00:43:20.293090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.293090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10218","source_version":1,"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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLy5MXpkvdhfHfoGyMHKB9gVCAKH4+01wXshO33qmYD8i9eVcPzx+QneGH5wbjTpaT52mz5OPTpOLAmUQmq9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:15:54.746375Z"},"content_sha256":"c617b4df9e01b29bd9459b7c924143b5cd6f3c739b67ac39f65139075a4fdf19","schema_version":"1.0","event_id":"sha256:c617b4df9e01b29bd9459b7c924143b5cd6f3c739b67ac39f65139075a4fdf19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XLUJXCITD57IRAP6Q2M7E335ZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Alfio Lazzaro, Joost VandeVondele, Juerg Hutter, Ole Schuett","submitted_at":"2017-05-29T14:42:14Z","abstract_excerpt":"Matrix-matrix multiplication is a basic operation in linear algebra and an essential building block for a wide range of algorithms in various scientific fields. Theory and implementation for the dense, square matrix case are well-developed. If matrices are sparse, with application-specific sparsity patterns, the optimal implementation remains an open question. Here, we explore the performance of communication reducing 2.5D algorithms and one-sided MPI communication in the context of linear scaling electronic structure theory. In particular, we extend the DBCSR sparse matrix library, which is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10218","kind":"arxiv","version":1},"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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0mUtGkZ6L/pJL7ZlogmIJKD0dJMr58gpE+8mMpp2b+volHeBkfsDtXo/aHQWxBc9YZTiNOKq8qBJtQVIfikCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:15:54.747146Z"},"content_sha256":"6a9e249ad316a1402ec60d2172fc7d46e93566d9f10cc550836b2aa27ee7b281","schema_version":"1.0","event_id":"sha256:6a9e249ad316a1402ec60d2172fc7d46e93566d9f10cc550836b2aa27ee7b281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/bundle.json","state_url":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLUJXCITD57IRAP6Q2M7E335ZY/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-11T21:15:54Z","links":{"resolver":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY","bundle":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/bundle.json","state":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLUJXCITD57IRAP6Q2M7E335ZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XLUJXCITD57IRAP6Q2M7E335ZY","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":"9fa4760469d6c248bf8542b55af6685cf1a85ec5d9b2f1d173e271e1a4831ef8","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:42:14Z","title_canon_sha256":"0e2d2ce5188e815ca4378b9e7e062acee8c61d2e7017dedfc58816e7d4f97070"},"schema_version":"1.0","source":{"id":"1705.10218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10218","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10218v1","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10218","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"XLUJXCITD57I","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XLUJXCITD57IRAP6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XLUJXCIT","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:6a9e249ad316a1402ec60d2172fc7d46e93566d9f10cc550836b2aa27ee7b281","target":"graph","created_at":"2026-05-18T00:43:20Z","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":"Matrix-matrix multiplication is a basic operation in linear algebra and an essential building block for a wide range of algorithms in various scientific fields. Theory and implementation for the dense, square matrix case are well-developed. If matrices are sparse, with application-specific sparsity patterns, the optimal implementation remains an open question. Here, we explore the performance of communication reducing 2.5D algorithms and one-sided MPI communication in the context of linear scaling electronic structure theory. In particular, we extend the DBCSR sparse matrix library, which is t","authors_text":"Alfio Lazzaro, Joost VandeVondele, Juerg Hutter, Ole Schuett","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:42:14Z","title":"Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10218","kind":"arxiv","version":1},"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:c617b4df9e01b29bd9459b7c924143b5cd6f3c739b67ac39f65139075a4fdf19","target":"record","created_at":"2026-05-18T00:43:20Z","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":"9fa4760469d6c248bf8542b55af6685cf1a85ec5d9b2f1d173e271e1a4831ef8","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:42:14Z","title_canon_sha256":"0e2d2ce5188e815ca4378b9e7e062acee8c61d2e7017dedfc58816e7d4f97070"},"schema_version":"1.0","source":{"id":"1705.10218","kind":"arxiv","version":1}},"canonical_sha256":"bae89b89131f7e8881fe8699f26f7dce3d8aedf5eb27a834f707f9d6cb40c10f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bae89b89131f7e8881fe8699f26f7dce3d8aedf5eb27a834f707f9d6cb40c10f","first_computed_at":"2026-05-18T00:43:20.293090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:20.293090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YK3bCeJG7Qr8vCZQjmIFIy+U8XKGaUDu+TRgb345GGHULali2JptxBhtZO9ic5EsMnJ/SXqcv+YMBBHdfK6lAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:20.293651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c617b4df9e01b29bd9459b7c924143b5cd6f3c739b67ac39f65139075a4fdf19","sha256:6a9e249ad316a1402ec60d2172fc7d46e93566d9f10cc550836b2aa27ee7b281"],"state_sha256":"8848c6851badbe911b67f0ed2f8fd1c00aad06f27398a3dc27ab6600a2c5f629"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PkHY6EoPM/n+eLexWzlO5zVBSZ4pk6Tw84Q3J2m1Lwq/0E3bo+lY/+3C6bS3WsbNQFxqZwpejoaGRK3y8sqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:15:54.751648Z","bundle_sha256":"5ed205b67b57ea2cd89a1632b38abc73a67e816d006d172b47cf8027fb582600"}}