{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:O6DKOB5WC4EEEGF65HDV35ZU2Y","short_pith_number":"pith:O6DKOB5W","schema_version":"1.0","canonical_sha256":"7786a707b617084218bee9c75df734d61749431d63511c27a614d8182df790ca","source":{"kind":"arxiv","id":"2506.13242","version":7},"attestation_state":"computed","paper":{"title":"A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alexandre Sedoglavic (CRIStAL), Cl\\'ement Pernet (CASC), Jean-Guillaume Dumas (CASC)","submitted_at":"2025-06-16T08:42:15Z","abstract_excerpt":"The quest for non-commutative matrix multiplication algorithms over non-commutative rings in small dimensions has recently seen significant progress. Specifically, the number of scalar multiplications required to multiply two 4x4 matrices was reduced in \\cite{Fawzi:2022aa} from 49 (using two recursion levels of Strassen's algorithm) to 47 in characteristic 2, and more recently to 48 in \\cite{alphaevolve} over the complex numbers. We propose an algorithm requiring 48 multiplications that uses only rational coefficients, thereby removing the requirement for complex-number arithmetic, and making "},"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":"2506.13242","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2025-06-16T08:42:15Z","cross_cats_sorted":[],"title_canon_sha256":"ea3d11c54c2b0996cdf54a3faccfbb01dde40a892dc6168a8c494239578b72dd","abstract_canon_sha256":"bb53c3a5b548be9b73ec124de2fac2ed57a19830402986fc1cc71df6019a5898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:23:15.235406Z","signature_b64":"OYM/r+iSHchT3v7l0jhhC/dSg4cYK82irU6a/ePNU9nv5+IJU2Z60xUZ/MMF7Gr+mczOtyU4oQJBaNJLJ4EOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7786a707b617084218bee9c75df734d61749431d63511c27a614d8182df790ca","last_reissued_at":"2026-07-28T02:23:15.234443Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:23:15.234443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alexandre Sedoglavic (CRIStAL), Cl\\'ement Pernet (CASC), Jean-Guillaume Dumas (CASC)","submitted_at":"2025-06-16T08:42:15Z","abstract_excerpt":"The quest for non-commutative matrix multiplication algorithms over non-commutative rings in small dimensions has recently seen significant progress. Specifically, the number of scalar multiplications required to multiply two 4x4 matrices was reduced in \\cite{Fawzi:2022aa} from 49 (using two recursion levels of Strassen's algorithm) to 47 in characteristic 2, and more recently to 48 in \\cite{alphaevolve} over the complex numbers. We propose an algorithm requiring 48 multiplications that uses only rational coefficients, thereby removing the requirement for complex-number arithmetic, and making "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13242","kind":"arxiv","version":7},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.13242/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.13242","created_at":"2026-07-28T02:23:15.234891+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13242v7","created_at":"2026-07-28T02:23:15.234891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13242","created_at":"2026-07-28T02:23:15.234891+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6DKOB5WC4EE","created_at":"2026-07-28T02:23:15.234891+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6DKOB5WC4EEEGF6","created_at":"2026-07-28T02:23:15.234891+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6DKOB5W","created_at":"2026-07-28T02:23:15.234891+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.13408","citing_title":"A catalog of fast matrix multiplication algorithms with frontier-closure search","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2602.11041","citing_title":"Exploiting the Structure in Tensor Decompositions for Matrix Multiplication","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y","json":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y.json","graph_json":"https://pith.science/api/pith-number/O6DKOB5WC4EEEGF65HDV35ZU2Y/graph.json","events_json":"https://pith.science/api/pith-number/O6DKOB5WC4EEEGF65HDV35ZU2Y/events.json","paper":"https://pith.science/paper/O6DKOB5W"},"agent_actions":{"view_html":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y","download_json":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y.json","view_paper":"https://pith.science/paper/O6DKOB5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13242&json=true","fetch_graph":"https://pith.science/api/pith-number/O6DKOB5WC4EEEGF65HDV35ZU2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/O6DKOB5WC4EEEGF65HDV35ZU2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y/action/storage_attestation","attest_author":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y/action/author_attestation","sign_citation":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y/action/citation_signature","submit_replication":"https://pith.science/pith/O6DKOB5WC4EEEGF65HDV35ZU2Y/action/replication_record"}},"created_at":"2026-07-28T02:23:15.234891+00:00","updated_at":"2026-07-28T02:23:15.234891+00:00"}