{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L7NKVPJJKQHAAIRQAQU4CKIN4Z","short_pith_number":"pith:L7NKVPJJ","canonical_record":{"source":{"id":"1501.07800","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-30T15:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"a7b90d0416800cac2e35b36cfd6faef79f8882a155b1b280ca1ff776018dc642","abstract_canon_sha256":"4a752ed43706b48dfd251a2870105f5fbea48fdf7802e6b6f308a0e774436880"},"schema_version":"1.0"},"canonical_sha256":"5fdaaabd29540e0022300429c1290de67e9824a108c1ef19e1ac9f415f899ac5","source":{"kind":"arxiv","id":"1501.07800","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07800","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07800v4","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07800","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"L7NKVPJJKQHA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7NKVPJJKQHAAIRQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7NKVPJJ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L7NKVPJJKQHAAIRQAQU4CKIN4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07800","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-30T15:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"a7b90d0416800cac2e35b36cfd6faef79f8882a155b1b280ca1ff776018dc642","abstract_canon_sha256":"4a752ed43706b48dfd251a2870105f5fbea48fdf7802e6b6f308a0e774436880"},"schema_version":"1.0"},"canonical_sha256":"5fdaaabd29540e0022300429c1290de67e9824a108c1ef19e1ac9f415f899ac5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.397836Z","signature_b64":"1VUeR4Ku3NZ36URoDyHbqet7YWlBVsT18AnLrSzbjD1I31SQE4vrg6P8oLvorrDmPWGJzeQJgn8KT4nWVbjfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fdaaabd29540e0022300429c1290de67e9824a108c1ef19e1ac9f415f899ac5","last_reissued_at":"2026-05-18T01:11:18.397341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.397341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07800","source_version":4,"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-18T01:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+D0AV8JXEoPmPIPfPjFI5bse7BuT3lfISIGWWZpLoRY5FTgxVl+kD987GS3YsWMsvbFM994Ru845jlxXUlzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:12:28.625406Z"},"content_sha256":"7debca41f15ed4bc25b95441b266aa4dfe67213d2ac41c2d2f236bf6f2c400f7","schema_version":"1.0","event_id":"sha256:7debca41f15ed4bc25b95441b266aa4dfe67213d2ac41c2d2f236bf6f2c400f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L7NKVPJJKQHAAIRQAQU4CKIN4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locality-aware parallel block-sparse matrix-matrix multiplication using the Chunks and Tasks programming model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Elias Rudberg, Emanuel H. Rubensson","submitted_at":"2015-01-30T15:15:22Z","abstract_excerpt":"We present a method for parallel block-sparse matrix-matrix multiplication on distributed memory clusters. By using a quadtree matrix representation, data locality is exploited without prior information about the matrix sparsity pattern. A distributed quadtree matrix representation is straightforward to implement due to our recent development of the Chunks and Tasks programming model [Parallel Comput. 40, 328 (2014)]. The quadtree representation combined with the Chunks and Tasks model leads to favorable weak and strong scaling of the communication cost with the number of processes, as shown b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07800","kind":"arxiv","version":4},"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-18T01:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beZY2/fXm7xZ/vj7XR6p9nQ6XOPRtyBi5nqKJyl2ZRim86av6J9hSXREJ4d7XgRiREVQ5y/Yzk07xc6jZlmACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:12:28.626076Z"},"content_sha256":"950cd1b8a05d4201265311da8c6273b0f27efc15ae1affd086d7c3e6a92f40e3","schema_version":"1.0","event_id":"sha256:950cd1b8a05d4201265311da8c6273b0f27efc15ae1affd086d7c3e6a92f40e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7NKVPJJKQHAAIRQAQU4CKIN4Z/bundle.json","state_url":"https://pith.science/pith/L7NKVPJJKQHAAIRQAQU4CKIN4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7NKVPJJKQHAAIRQAQU4CKIN4Z/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-08T15:12:28Z","links":{"resolver":"https://pith.science/pith/L7NKVPJJKQHAAIRQAQU4CKIN4Z","bundle":"https://pith.science/pith/L7NKVPJJKQHAAIRQAQU4CKIN4Z/bundle.json","state":"https://pith.science/pith/L7NKVPJJKQHAAIRQAQU4CKIN4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7NKVPJJKQHAAIRQAQU4CKIN4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L7NKVPJJKQHAAIRQAQU4CKIN4Z","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":"4a752ed43706b48dfd251a2870105f5fbea48fdf7802e6b6f308a0e774436880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-30T15:15:22Z","title_canon_sha256":"a7b90d0416800cac2e35b36cfd6faef79f8882a155b1b280ca1ff776018dc642"},"schema_version":"1.0","source":{"id":"1501.07800","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07800","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07800v4","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07800","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"L7NKVPJJKQHA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L7NKVPJJKQHAAIRQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L7NKVPJJ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:950cd1b8a05d4201265311da8c6273b0f27efc15ae1affd086d7c3e6a92f40e3","target":"graph","created_at":"2026-05-18T01:11:18Z","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":"We present a method for parallel block-sparse matrix-matrix multiplication on distributed memory clusters. By using a quadtree matrix representation, data locality is exploited without prior information about the matrix sparsity pattern. A distributed quadtree matrix representation is straightforward to implement due to our recent development of the Chunks and Tasks programming model [Parallel Comput. 40, 328 (2014)]. The quadtree representation combined with the Chunks and Tasks model leads to favorable weak and strong scaling of the communication cost with the number of processes, as shown b","authors_text":"Elias Rudberg, Emanuel H. Rubensson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-30T15:15:22Z","title":"Locality-aware parallel block-sparse matrix-matrix multiplication using the Chunks and Tasks programming model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07800","kind":"arxiv","version":4},"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:7debca41f15ed4bc25b95441b266aa4dfe67213d2ac41c2d2f236bf6f2c400f7","target":"record","created_at":"2026-05-18T01:11:18Z","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":"4a752ed43706b48dfd251a2870105f5fbea48fdf7802e6b6f308a0e774436880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-30T15:15:22Z","title_canon_sha256":"a7b90d0416800cac2e35b36cfd6faef79f8882a155b1b280ca1ff776018dc642"},"schema_version":"1.0","source":{"id":"1501.07800","kind":"arxiv","version":4}},"canonical_sha256":"5fdaaabd29540e0022300429c1290de67e9824a108c1ef19e1ac9f415f899ac5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fdaaabd29540e0022300429c1290de67e9824a108c1ef19e1ac9f415f899ac5","first_computed_at":"2026-05-18T01:11:18.397341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:18.397341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1VUeR4Ku3NZ36URoDyHbqet7YWlBVsT18AnLrSzbjD1I31SQE4vrg6P8oLvorrDmPWGJzeQJgn8KT4nWVbjfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:18.397836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07800","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7debca41f15ed4bc25b95441b266aa4dfe67213d2ac41c2d2f236bf6f2c400f7","sha256:950cd1b8a05d4201265311da8c6273b0f27efc15ae1affd086d7c3e6a92f40e3"],"state_sha256":"ade3d2f7924bcd507834101c4a01db907d7a46cd12a1a6db3fd20705c041607e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jp8gWPdr3aY4Ba5Mng/ADvVIGQbmhe/p945Lj7nMAGmhWkSYxmTt/qimTCHctKF3gHyRJXyJBmD6So2Kit8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:12:28.629882Z","bundle_sha256":"ec576901a2f439621929ed1f25bed26ccb34b5830a3d699316999fca7329bae6"}}