{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VRQPFBNXVLKNECAPH67F3OLJDR","short_pith_number":"pith:VRQPFBNX","canonical_record":{"source":{"id":"1409.2908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-09T22:28:36Z","cross_cats_sorted":["cs.MS","cs.NA"],"title_canon_sha256":"8fc7af936e1939ceeb19657b2640a56f671ee12252fbbb4b86fe7dda31f67bc8","abstract_canon_sha256":"518ec1417ce6201ab38be5e097a8b48f14f710e5ccffc4e59e03ea8c67418326"},"schema_version":"1.0"},"canonical_sha256":"ac60f285b7aad4d2080f3fbe5db9691c575c94fad119c611d479b8e0427bf4d1","source":{"kind":"arxiv","id":"1409.2908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2908","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2908v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2908","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"VRQPFBNXVLKN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VRQPFBNXVLKNECAP","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VRQPFBNX","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VRQPFBNXVLKNECAPH67F3OLJDR","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-09T22:28:36Z","cross_cats_sorted":["cs.MS","cs.NA"],"title_canon_sha256":"8fc7af936e1939ceeb19657b2640a56f671ee12252fbbb4b86fe7dda31f67bc8","abstract_canon_sha256":"518ec1417ce6201ab38be5e097a8b48f14f710e5ccffc4e59e03ea8c67418326"},"schema_version":"1.0"},"canonical_sha256":"ac60f285b7aad4d2080f3fbe5db9691c575c94fad119c611d479b8e0427bf4d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.415292Z","signature_b64":"pVG2Hz7+g31MNkt1vZIGa4lqqGKwaauAGP50svU2CRk/I2ANlSovlbJnvRVWI6uKyPmzHPaSja3JDUjxa1+wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac60f285b7aad4d2080f3fbe5db9691c575c94fad119c611d479b8e0427bf4d1","last_reissued_at":"2026-05-18T00:26:47.414694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.414694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2908","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:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WdZsMjXCKhqDSbvlPsmpKrn2sxHoPBrrMRCyKo0OczcreOdtwHI2g+GhyA7ArlYYLddrVXMKOBYZsmAqmZsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:05:07.541767Z"},"content_sha256":"7b69530d48a8ccae47ec1b6a5bdd784c0449e7a975bb563536151c86000c1d0c","schema_version":"1.0","event_id":"sha256:7b69530d48a8ccae47ec1b6a5bdd784c0449e7a975bb563536151c86000c1d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VRQPFBNXVLKNECAPH67F3OLJDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Practical Parallel Fast Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA"],"primary_cat":"cs.DC","authors_text":"Austin R. Benson, Grey Ballard","submitted_at":"2014-09-09T22:28:36Z","abstract_excerpt":"Matrix multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and Strassen's fast algorithm on modest problem sizes and shapes. Furthermore, we show that the best choice of fast algorithm depends not only on the size of the matrices but also the shape. We develop a code generation tool to automatically implement multiple sequential and shared-memory parallel variants of each fast algorithm, including our novel parallelizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2908","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:26:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsWhxNsDuTcvC3RzhdtfWssn/wANR5fO2T1RoBnxCTYE72uz0THc4A5S6loJc2zleCOCfw97QfGpxud3xXVbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:05:07.542290Z"},"content_sha256":"2c0b05cd5251650ba1c65fe1059552cf127a6ccaf823fd23de5705a1ce618cd9","schema_version":"1.0","event_id":"sha256:2c0b05cd5251650ba1c65fe1059552cf127a6ccaf823fd23de5705a1ce618cd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRQPFBNXVLKNECAPH67F3OLJDR/bundle.json","state_url":"https://pith.science/pith/VRQPFBNXVLKNECAPH67F3OLJDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRQPFBNXVLKNECAPH67F3OLJDR/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-05-31T21:05:07Z","links":{"resolver":"https://pith.science/pith/VRQPFBNXVLKNECAPH67F3OLJDR","bundle":"https://pith.science/pith/VRQPFBNXVLKNECAPH67F3OLJDR/bundle.json","state":"https://pith.science/pith/VRQPFBNXVLKNECAPH67F3OLJDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRQPFBNXVLKNECAPH67F3OLJDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VRQPFBNXVLKNECAPH67F3OLJDR","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":"518ec1417ce6201ab38be5e097a8b48f14f710e5ccffc4e59e03ea8c67418326","cross_cats_sorted":["cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-09T22:28:36Z","title_canon_sha256":"8fc7af936e1939ceeb19657b2640a56f671ee12252fbbb4b86fe7dda31f67bc8"},"schema_version":"1.0","source":{"id":"1409.2908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2908","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2908v1","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2908","created_at":"2026-05-18T00:26:47Z"},{"alias_kind":"pith_short_12","alias_value":"VRQPFBNXVLKN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VRQPFBNXVLKNECAP","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VRQPFBNX","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:2c0b05cd5251650ba1c65fe1059552cf127a6ccaf823fd23de5705a1ce618cd9","target":"graph","created_at":"2026-05-18T00:26:47Z","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 multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and Strassen's fast algorithm on modest problem sizes and shapes. Furthermore, we show that the best choice of fast algorithm depends not only on the size of the matrices but also the shape. We develop a code generation tool to automatically implement multiple sequential and shared-memory parallel variants of each fast algorithm, including our novel parallelizatio","authors_text":"Austin R. Benson, Grey Ballard","cross_cats":["cs.MS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-09T22:28:36Z","title":"A Framework for Practical Parallel Fast Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2908","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:7b69530d48a8ccae47ec1b6a5bdd784c0449e7a975bb563536151c86000c1d0c","target":"record","created_at":"2026-05-18T00:26:47Z","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":"518ec1417ce6201ab38be5e097a8b48f14f710e5ccffc4e59e03ea8c67418326","cross_cats_sorted":["cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-09-09T22:28:36Z","title_canon_sha256":"8fc7af936e1939ceeb19657b2640a56f671ee12252fbbb4b86fe7dda31f67bc8"},"schema_version":"1.0","source":{"id":"1409.2908","kind":"arxiv","version":1}},"canonical_sha256":"ac60f285b7aad4d2080f3fbe5db9691c575c94fad119c611d479b8e0427bf4d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac60f285b7aad4d2080f3fbe5db9691c575c94fad119c611d479b8e0427bf4d1","first_computed_at":"2026-05-18T00:26:47.414694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:47.414694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pVG2Hz7+g31MNkt1vZIGa4lqqGKwaauAGP50svU2CRk/I2ANlSovlbJnvRVWI6uKyPmzHPaSja3JDUjxa1+wCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:47.415292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b69530d48a8ccae47ec1b6a5bdd784c0449e7a975bb563536151c86000c1d0c","sha256:2c0b05cd5251650ba1c65fe1059552cf127a6ccaf823fd23de5705a1ce618cd9"],"state_sha256":"78a3520e4eaf46c0caee55b5e50055a42d07a364498bf361608388b30215da89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xu/m1l1aC2nqI4ngy6FJe4lA8Zs+VQSEEB/Jo/S14r/dkmOIYwf8G5czfCzMgzvWZ1oG5BgvIXvtcDJrpA91Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:05:07.546059Z","bundle_sha256":"a71551dd15aa07d24c7a83426ca8ff8ef6819a75aea765869848a6a4c1ce524f"}}