{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:THDFZB3DVTG6FGJVFXD3AT5G2W","short_pith_number":"pith:THDFZB3D","canonical_record":{"source":{"id":"1007.2117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-07-13T14:44:15Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"46e9c820696f2acf862161274e43d2e15cd3d45c51672da990745ac4e579b0aa","abstract_canon_sha256":"5aec2611d3f3fbf4f1964b8816d634874a1120b76a5cf5adbfb4c22371ed2f22"},"schema_version":"1.0"},"canonical_sha256":"99c65c8763accde299352dc7b04fa6d59d872efa11c1150b060c6e534b24977c","source":{"kind":"arxiv","id":"1007.2117","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2117","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2117v2","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2117","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"THDFZB3DVTG6","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"THDFZB3DVTG6FGJV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"THDFZB3D","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:THDFZB3DVTG6FGJVFXD3AT5G2W","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-07-13T14:44:15Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"46e9c820696f2acf862161274e43d2e15cd3d45c51672da990745ac4e579b0aa","abstract_canon_sha256":"5aec2611d3f3fbf4f1964b8816d634874a1120b76a5cf5adbfb4c22371ed2f22"},"schema_version":"1.0"},"canonical_sha256":"99c65c8763accde299352dc7b04fa6d59d872efa11c1150b060c6e534b24977c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:22.762211Z","signature_b64":"5ZSGZSeeQMW5F1IbJdJRoUbiTDjP+8poxVoiDs2525NWGOwwn7W4H4X6ukwrWWfvHVUpFuxzC+Vn0WCzyoTFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99c65c8763accde299352dc7b04fa6d59d872efa11c1150b060c6e534b24977c","last_reissued_at":"2026-05-18T04:21:22.761752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:22.761752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2117","source_version":2,"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-18T04:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Arqut/5waYllB/+QcbkInYdekOxDGgZ6xiRD58dPAKcfN3wEwgpOFGnndHzq1uCnZ9ABNl9X+SHfmEZQnyHnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:34:59.745916Z"},"content_sha256":"f1a3afe171e1dbdfa59f107e96eef4a42d1f0cb8e219a4373307fa0ead7e99c0","schema_version":"1.0","event_id":"sha256:f1a3afe171e1dbdfa59f107e96eef4a42d1f0cb8e219a4373307fa0ead7e99c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:THDFZB3DVTG6FGJVFXD3AT5G2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.NA","authors_text":"Ivo Hedtke","submitted_at":"2010-07-13T14:44:15Z","abstract_excerpt":"The well known algorithm of Volker Strassen for matrix multiplication can only be used for $(m2^k \\times m2^k)$ matrices. For arbitrary $(n \\times n)$ matrices one has to add zero rows and columns to the given matrices to use Strassen's algorithm. Strassen gave a strategy of how to set $m$ and $k$ for arbitrary $n$ to ensure $n\\leq m2^k$. In this paper we study the number $d$ of additional zero rows and columns and the influence on the number of flops used by the algorithm in the worst case ($d=n/16$), best case ($d=1$) and in the average case ($d\\approx n/48$). The aim of this work is to give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2117","kind":"arxiv","version":2},"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-18T04:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Bs6Ecx7R/O6Ky+L9Hx3LCFtTLhnfHXKO968TSi7r20CIl7HPIxi6rgDQOxlehYz03VVxq5uSPea66CswotXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:34:59.746631Z"},"content_sha256":"219cc0098c7f0b21bda912eac54d0d64eeb24d8d72d11ec8ad853c9080d3bea9","schema_version":"1.0","event_id":"sha256:219cc0098c7f0b21bda912eac54d0d64eeb24d8d72d11ec8ad853c9080d3bea9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/bundle.json","state_url":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/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-01T02:34:59Z","links":{"resolver":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W","bundle":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/bundle.json","state":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:THDFZB3DVTG6FGJVFXD3AT5G2W","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":"5aec2611d3f3fbf4f1964b8816d634874a1120b76a5cf5adbfb4c22371ed2f22","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-07-13T14:44:15Z","title_canon_sha256":"46e9c820696f2acf862161274e43d2e15cd3d45c51672da990745ac4e579b0aa"},"schema_version":"1.0","source":{"id":"1007.2117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2117","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2117v2","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2117","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"THDFZB3DVTG6","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"THDFZB3DVTG6FGJV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"THDFZB3D","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:219cc0098c7f0b21bda912eac54d0d64eeb24d8d72d11ec8ad853c9080d3bea9","target":"graph","created_at":"2026-05-18T04:21:22Z","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 well known algorithm of Volker Strassen for matrix multiplication can only be used for $(m2^k \\times m2^k)$ matrices. For arbitrary $(n \\times n)$ matrices one has to add zero rows and columns to the given matrices to use Strassen's algorithm. Strassen gave a strategy of how to set $m$ and $k$ for arbitrary $n$ to ensure $n\\leq m2^k$. In this paper we study the number $d$ of additional zero rows and columns and the influence on the number of flops used by the algorithm in the worst case ($d=n/16$), best case ($d=1$) and in the average case ($d\\approx n/48$). The aim of this work is to give","authors_text":"Ivo Hedtke","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-07-13T14:44:15Z","title":"Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2117","kind":"arxiv","version":2},"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:f1a3afe171e1dbdfa59f107e96eef4a42d1f0cb8e219a4373307fa0ead7e99c0","target":"record","created_at":"2026-05-18T04:21:22Z","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":"5aec2611d3f3fbf4f1964b8816d634874a1120b76a5cf5adbfb4c22371ed2f22","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-07-13T14:44:15Z","title_canon_sha256":"46e9c820696f2acf862161274e43d2e15cd3d45c51672da990745ac4e579b0aa"},"schema_version":"1.0","source":{"id":"1007.2117","kind":"arxiv","version":2}},"canonical_sha256":"99c65c8763accde299352dc7b04fa6d59d872efa11c1150b060c6e534b24977c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99c65c8763accde299352dc7b04fa6d59d872efa11c1150b060c6e534b24977c","first_computed_at":"2026-05-18T04:21:22.761752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:22.761752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ZSGZSeeQMW5F1IbJdJRoUbiTDjP+8poxVoiDs2525NWGOwwn7W4H4X6ukwrWWfvHVUpFuxzC+Vn0WCzyoTFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:22.762211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1a3afe171e1dbdfa59f107e96eef4a42d1f0cb8e219a4373307fa0ead7e99c0","sha256:219cc0098c7f0b21bda912eac54d0d64eeb24d8d72d11ec8ad853c9080d3bea9"],"state_sha256":"f3f4f1ebce6ca9fca3272a2b17388e9adadbd23cd33d45361d4158d265f7a0d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkNL3qFZrEs6xx8SdpgXDQ5bK4qfllNRhlE8Hk0KlbvBtyRsuopKo9LUJbPpwtT5zdfj3WtVJv6g74Zmwut3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:34:59.751146Z","bundle_sha256":"a544d392c16483522a3c231a8abc79b42dd77dd8584ed96a8ff5dd39c27eb996"}}