{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:57YMTCMPPIBFV4NEKT3RDAOCD5","short_pith_number":"pith:57YMTCMP","schema_version":"1.0","canonical_sha256":"eff0c9898f7a025af1a454f71181c21f420ac54e9fe243f7993b08b965c4a847","source":{"kind":"arxiv","id":"1408.6273","version":1},"attestation_state":"computed","paper":{"title":"On symmetries of the Strassen algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.RA","math.RT"],"primary_cat":"cs.CC","authors_text":"Vladimir P. Burichenko","submitted_at":"2014-08-26T22:08:57Z","abstract_excerpt":"We consider the famous Strassen algorithm for fast multiplication of matrices. We show that this algorithm has a nontrivial finite group of automorphisms of order 36 (namely the direct product of two copies of the symmetric group on 3 symbols), or even 72, if we consider \"extended\" Strassen algorithm. This is an indirect evidence that the (unknown at present) optimal algorithm for multiplication of two size 3 by 3 matrices also may have a large automorphism group, and this may be a fruitful idea for a search of such an algorithm. In the beginning we give a brief introduction to the subject, to"},"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":"1408.6273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-08-26T22:08:57Z","cross_cats_sorted":["math.GR","math.RA","math.RT"],"title_canon_sha256":"cf7b1994c55a3785d98996bd625d1b93719d5f4ccfb2da63faa4001c47c6a946","abstract_canon_sha256":"e8cab09a07aa8b3bfcc53727bc6a5291d5117f04082145f10a47ea8f41669f62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.896537Z","signature_b64":"Q8osUTa9ybVd0WjgTBgjkZcZxdM3N/KacDJqARpfnhqKjY0lLS0CRVdJYrlKENqDUdFEnTQgymQrQqYHKZ+qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eff0c9898f7a025af1a454f71181c21f420ac54e9fe243f7993b08b965c4a847","last_reissued_at":"2026-05-18T02:44:07.895996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.895996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On symmetries of the Strassen algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.RA","math.RT"],"primary_cat":"cs.CC","authors_text":"Vladimir P. Burichenko","submitted_at":"2014-08-26T22:08:57Z","abstract_excerpt":"We consider the famous Strassen algorithm for fast multiplication of matrices. We show that this algorithm has a nontrivial finite group of automorphisms of order 36 (namely the direct product of two copies of the symmetric group on 3 symbols), or even 72, if we consider \"extended\" Strassen algorithm. This is an indirect evidence that the (unknown at present) optimal algorithm for multiplication of two size 3 by 3 matrices also may have a large automorphism group, and this may be a fruitful idea for a search of such an algorithm. In the beginning we give a brief introduction to the subject, to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6273","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.6273","created_at":"2026-05-18T02:44:07.896089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6273v1","created_at":"2026-05-18T02:44:07.896089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6273","created_at":"2026-05-18T02:44:07.896089+00:00"},{"alias_kind":"pith_short_12","alias_value":"57YMTCMPPIBF","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"57YMTCMPPIBFV4NE","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"57YMTCMP","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.13408","citing_title":"A catalog of fast matrix multiplication algorithms with frontier-closure search","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5","json":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5.json","graph_json":"https://pith.science/api/pith-number/57YMTCMPPIBFV4NEKT3RDAOCD5/graph.json","events_json":"https://pith.science/api/pith-number/57YMTCMPPIBFV4NEKT3RDAOCD5/events.json","paper":"https://pith.science/paper/57YMTCMP"},"agent_actions":{"view_html":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5","download_json":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5.json","view_paper":"https://pith.science/paper/57YMTCMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6273&json=true","fetch_graph":"https://pith.science/api/pith-number/57YMTCMPPIBFV4NEKT3RDAOCD5/graph.json","fetch_events":"https://pith.science/api/pith-number/57YMTCMPPIBFV4NEKT3RDAOCD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5/action/storage_attestation","attest_author":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5/action/author_attestation","sign_citation":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5/action/citation_signature","submit_replication":"https://pith.science/pith/57YMTCMPPIBFV4NEKT3RDAOCD5/action/replication_record"}},"created_at":"2026-05-18T02:44:07.896089+00:00","updated_at":"2026-05-18T02:44:07.896089+00:00"}