{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:THDFZB3DVTG6FGJVFXD3AT5G2W","short_pith_number":"pith:THDFZB3D","schema_version":"1.0","canonical_sha256":"99c65c8763accde299352dc7b04fa6d59d872efa11c1150b060c6e534b24977c","source":{"kind":"arxiv","id":"1007.2117","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.2117","created_at":"2026-05-18T04:21:22.761823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.2117v2","created_at":"2026-05-18T04:21:22.761823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2117","created_at":"2026-05-18T04:21:22.761823+00:00"},{"alias_kind":"pith_short_12","alias_value":"THDFZB3DVTG6","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"THDFZB3DVTG6FGJV","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"THDFZB3D","created_at":"2026-05-18T12:26:13.927090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W","json":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W.json","graph_json":"https://pith.science/api/pith-number/THDFZB3DVTG6FGJVFXD3AT5G2W/graph.json","events_json":"https://pith.science/api/pith-number/THDFZB3DVTG6FGJVFXD3AT5G2W/events.json","paper":"https://pith.science/paper/THDFZB3D"},"agent_actions":{"view_html":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W","download_json":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W.json","view_paper":"https://pith.science/paper/THDFZB3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.2117&json=true","fetch_graph":"https://pith.science/api/pith-number/THDFZB3DVTG6FGJVFXD3AT5G2W/graph.json","fetch_events":"https://pith.science/api/pith-number/THDFZB3DVTG6FGJVFXD3AT5G2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/action/storage_attestation","attest_author":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/action/author_attestation","sign_citation":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/action/citation_signature","submit_replication":"https://pith.science/pith/THDFZB3DVTG6FGJVFXD3AT5G2W/action/replication_record"}},"created_at":"2026-05-18T04:21:22.761823+00:00","updated_at":"2026-05-18T04:21:22.761823+00:00"}