{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SMXSVRIX26WKBUX7AJIH4PMJUF","short_pith_number":"pith:SMXSVRIX","canonical_record":{"source":{"id":"1611.01120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-11-03T18:27:00Z","cross_cats_sorted":[],"title_canon_sha256":"4245de8ebf3054c315e58b13c1fc0996c0b8e0e51213fff6f7bc6af8c5efda35","abstract_canon_sha256":"2855e9c743ed9bafc41949142b97486bcb4275720ca4f6c70a0f73ac1789df91"},"schema_version":"1.0"},"canonical_sha256":"932f2ac517d7aca0d2ff02507e3d89a15203b7ed337148df99abcf1fd018e8ac","source":{"kind":"arxiv","id":"1611.01120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01120","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01120v1","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01120","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"SMXSVRIX26WK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SMXSVRIX26WKBUX7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SMXSVRIX","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SMXSVRIX26WKBUX7AJIH4PMJUF","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-11-03T18:27:00Z","cross_cats_sorted":[],"title_canon_sha256":"4245de8ebf3054c315e58b13c1fc0996c0b8e0e51213fff6f7bc6af8c5efda35","abstract_canon_sha256":"2855e9c743ed9bafc41949142b97486bcb4275720ca4f6c70a0f73ac1789df91"},"schema_version":"1.0"},"canonical_sha256":"932f2ac517d7aca0d2ff02507e3d89a15203b7ed337148df99abcf1fd018e8ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:17.638726Z","signature_b64":"t4BcFZJ0jb1P7AYMWXbGsqMa62at3gWERWMWsauWE3kB12G5plBVGtMJBWeEJ2zQjWfOaW974xW2eIEHdvWpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932f2ac517d7aca0d2ff02507e3d89a15203b7ed337148df99abcf1fd018e8ac","last_reissued_at":"2026-05-18T01:00:17.638023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:17.638023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01120","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-18T01:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3zW0xdI0OkbX2XNLgzTHuzb4zAfpGfDa6wp2K3RGI8plgqUiRI2VS14P3x4pW8v752x2M/yr4xn1NiEqMQTXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:46:25.660508Z"},"content_sha256":"fba0e9e79f6066b9816223bf8a9b2517dbaef882c69d7423093a2d719320dd65","schema_version":"1.0","event_id":"sha256:fba0e9e79f6066b9816223bf8a9b2517dbaef882c69d7423093a2d719320dd65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SMXSVRIX26WKBUX7AJIH4PMJUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating Families of Practical Fast Matrix Multiplication Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Devin A. Matthews, Jianyu Huang, Leslie Rice, Robert A. van de Geijn","submitted_at":"2016-11-03T18:27:00Z","abstract_excerpt":"Matrix multiplication (GEMM) is a core operation to numerous scientific applications. Traditional implementations of Strassen-like fast matrix multiplication (FMM) algorithms often do not perform well except for very large matrix sizes, due to the increased cost of memory movement, which is particularly noticeable for non-square matrices. Such implementations also require considerable workspace and modifications to the standard BLAS interface. We propose a code generator framework to automatically implement a large family of FMM algorithms suitable for multiplications of arbitrary matrix sizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01120","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-18T01:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEBVb2s786U9pGqTjNNTESw6qj22SeqvBU32EXpnJdKie+z3r93iU7q3lj9k0Wf67YTFs6Vyjz9R//7JFRVQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:46:25.661251Z"},"content_sha256":"5cd1165ac4da04d19a4ff0dd946e90cc2f1eda5a74c85a4249be066b07d246d8","schema_version":"1.0","event_id":"sha256:5cd1165ac4da04d19a4ff0dd946e90cc2f1eda5a74c85a4249be066b07d246d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMXSVRIX26WKBUX7AJIH4PMJUF/bundle.json","state_url":"https://pith.science/pith/SMXSVRIX26WKBUX7AJIH4PMJUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMXSVRIX26WKBUX7AJIH4PMJUF/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-09T08:46:25Z","links":{"resolver":"https://pith.science/pith/SMXSVRIX26WKBUX7AJIH4PMJUF","bundle":"https://pith.science/pith/SMXSVRIX26WKBUX7AJIH4PMJUF/bundle.json","state":"https://pith.science/pith/SMXSVRIX26WKBUX7AJIH4PMJUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMXSVRIX26WKBUX7AJIH4PMJUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SMXSVRIX26WKBUX7AJIH4PMJUF","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":"2855e9c743ed9bafc41949142b97486bcb4275720ca4f6c70a0f73ac1789df91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-11-03T18:27:00Z","title_canon_sha256":"4245de8ebf3054c315e58b13c1fc0996c0b8e0e51213fff6f7bc6af8c5efda35"},"schema_version":"1.0","source":{"id":"1611.01120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01120","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01120v1","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01120","created_at":"2026-05-18T01:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"SMXSVRIX26WK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SMXSVRIX26WKBUX7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SMXSVRIX","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:5cd1165ac4da04d19a4ff0dd946e90cc2f1eda5a74c85a4249be066b07d246d8","target":"graph","created_at":"2026-05-18T01:00:17Z","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 (GEMM) is a core operation to numerous scientific applications. Traditional implementations of Strassen-like fast matrix multiplication (FMM) algorithms often do not perform well except for very large matrix sizes, due to the increased cost of memory movement, which is particularly noticeable for non-square matrices. Such implementations also require considerable workspace and modifications to the standard BLAS interface. We propose a code generator framework to automatically implement a large family of FMM algorithms suitable for multiplications of arbitrary matrix sizes","authors_text":"Devin A. Matthews, Jianyu Huang, Leslie Rice, Robert A. van de Geijn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-11-03T18:27:00Z","title":"Generating Families of Practical Fast Matrix Multiplication Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01120","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:fba0e9e79f6066b9816223bf8a9b2517dbaef882c69d7423093a2d719320dd65","target":"record","created_at":"2026-05-18T01:00:17Z","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":"2855e9c743ed9bafc41949142b97486bcb4275720ca4f6c70a0f73ac1789df91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-11-03T18:27:00Z","title_canon_sha256":"4245de8ebf3054c315e58b13c1fc0996c0b8e0e51213fff6f7bc6af8c5efda35"},"schema_version":"1.0","source":{"id":"1611.01120","kind":"arxiv","version":1}},"canonical_sha256":"932f2ac517d7aca0d2ff02507e3d89a15203b7ed337148df99abcf1fd018e8ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"932f2ac517d7aca0d2ff02507e3d89a15203b7ed337148df99abcf1fd018e8ac","first_computed_at":"2026-05-18T01:00:17.638023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:17.638023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t4BcFZJ0jb1P7AYMWXbGsqMa62at3gWERWMWsauWE3kB12G5plBVGtMJBWeEJ2zQjWfOaW974xW2eIEHdvWpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:17.638726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fba0e9e79f6066b9816223bf8a9b2517dbaef882c69d7423093a2d719320dd65","sha256:5cd1165ac4da04d19a4ff0dd946e90cc2f1eda5a74c85a4249be066b07d246d8"],"state_sha256":"ddb1aae0a8ee8d101531183496ea605bf8743ea496f40ee08bc1d36d2b4b2561"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/W3zFbyJohT1oxRXzDEqhLXQjeVvi1smfOPP5P6jAffjC3p0QxF4ncYrIoCOe1BPH5e9pLCudarFq5mEJXnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:46:25.665547Z","bundle_sha256":"bf97cf8052fbd368c6d7a2061cc06fd02f0cafe0bb0d77801189f9cdace02d45"}}