{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VSA7BFIVSWQ2BGAK3I4DFKHI2W","short_pith_number":"pith:VSA7BFIV","schema_version":"1.0","canonical_sha256":"ac81f0951595a1a0980ada3832a8e8d5b0ba19e43cbf7e3ec66c1942ea1f73ca","source":{"kind":"arxiv","id":"2603.18699","version":2},"attestation_state":"computed","paper":{"title":"A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.DS","authors_text":"Alexandre Sedoglavic (CRIStAL), CASC), Cl\\'ement Pernet (UGA, Jean-Guillaume Dumas (UGA, LJK, LJK)","submitted_at":"2026-03-19T09:58:19Z","abstract_excerpt":"We propose a more accurate variant of an algorithm for multiplying 4x4 matrices using 48 multiplications over any ring containing an inverse of 2. This algorithm achieves an error bound exponent of only $\\log_{4}gamma_{\\infty,2}\\approx{2.335}$. In practice, it also reaches a better accuracy w.r.t. max-norm, when compared to previously known such fast algorithms. Furthermore, we propose a straight line program of this algorithm, giving a leading constant in its complexity bound of $\\frac{316}{32}n^{2+\\log_{4}{3}}+o(n^{2+\\log_{4}{3}})$ operations over any ring containing an inverse of 2."},"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":"2603.18699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-03-19T09:58:19Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"e447f2e98fc07557e3e30d31d428a9de4e8f4e30738ab78445480f01eb9c1e91","abstract_canon_sha256":"93723024e25755520827640609d1c098627a6ba56f2ea4b8a7ff5fe766d31ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:23:28.381466Z","signature_b64":"2VF1cqsxpcvqEIkazO/83tyVSBsfyBxpjeOjxlbIJjV2AbY+HizG8x33/e1D58ElTR70uNxM6YfT2S27RXfVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac81f0951595a1a0980ada3832a8e8d5b0ba19e43cbf7e3ec66c1942ea1f73ca","last_reissued_at":"2026-07-28T02:23:28.380458Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:23:28.380458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.DS","authors_text":"Alexandre Sedoglavic (CRIStAL), CASC), Cl\\'ement Pernet (UGA, Jean-Guillaume Dumas (UGA, LJK, LJK)","submitted_at":"2026-03-19T09:58:19Z","abstract_excerpt":"We propose a more accurate variant of an algorithm for multiplying 4x4 matrices using 48 multiplications over any ring containing an inverse of 2. This algorithm achieves an error bound exponent of only $\\log_{4}gamma_{\\infty,2}\\approx{2.335}$. In practice, it also reaches a better accuracy w.r.t. max-norm, when compared to previously known such fast algorithms. Furthermore, we propose a straight line program of this algorithm, giving a leading constant in its complexity bound of $\\frac{316}{32}n^{2+\\log_{4}{3}}+o(n^{2+\\log_{4}{3}})$ operations over any ring containing an inverse of 2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.18699","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.18699/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":"2603.18699","created_at":"2026-07-28T02:23:28.380914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.18699v2","created_at":"2026-07-28T02:23:28.380914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18699","created_at":"2026-07-28T02:23:28.380914+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSA7BFIVSWQ2","created_at":"2026-07-28T02:23:28.380914+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSA7BFIVSWQ2BGAK","created_at":"2026-07-28T02:23:28.380914+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSA7BFIV","created_at":"2026-07-28T02:23:28.380914+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/VSA7BFIVSWQ2BGAK3I4DFKHI2W","json":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W.json","graph_json":"https://pith.science/api/pith-number/VSA7BFIVSWQ2BGAK3I4DFKHI2W/graph.json","events_json":"https://pith.science/api/pith-number/VSA7BFIVSWQ2BGAK3I4DFKHI2W/events.json","paper":"https://pith.science/paper/VSA7BFIV"},"agent_actions":{"view_html":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W","download_json":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W.json","view_paper":"https://pith.science/paper/VSA7BFIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.18699&json=true","fetch_graph":"https://pith.science/api/pith-number/VSA7BFIVSWQ2BGAK3I4DFKHI2W/graph.json","fetch_events":"https://pith.science/api/pith-number/VSA7BFIVSWQ2BGAK3I4DFKHI2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/action/storage_attestation","attest_author":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/action/author_attestation","sign_citation":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/action/citation_signature","submit_replication":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/action/replication_record"}},"created_at":"2026-07-28T02:23:28.380914+00:00","updated_at":"2026-07-28T02:23:28.380914+00:00"}