{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VSA7BFIVSWQ2BGAK3I4DFKHI2W","short_pith_number":"pith:VSA7BFIV","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"},"canonical_sha256":"ac81f0951595a1a0980ada3832a8e8d5b0ba19e43cbf7e3ec66c1942ea1f73ca","source":{"kind":"arxiv","id":"2603.18699","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.18699","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"2603.18699v2","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18699","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"VSA7BFIVSWQ2","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"pith_short_16","alias_value":"VSA7BFIVSWQ2BGAK","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"pith_short_8","alias_value":"VSA7BFIV","created_at":"2026-07-28T02:23:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VSA7BFIVSWQ2BGAK3I4DFKHI2W","target":"record","payload":{"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"},"canonical_sha256":"ac81f0951595a1a0980ada3832a8e8d5b0ba19e43cbf7e3ec66c1942ea1f73ca","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"},"source_kind":"arxiv","source_id":"2603.18699","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-07-28T02:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCr6rnfgjGREFczWiIWojrfw4ZGdYHYp6xeNavait2YpbDhXzIc1Mje52dbUamxl81Krgh+yWsg//F+ko2f4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:43:46.089447Z"},"content_sha256":"629a5f015afe89384fb86d781075cabca952bd505241bd3327058a2285831413","schema_version":"1.0","event_id":"sha256:629a5f015afe89384fb86d781075cabca952bd505241bd3327058a2285831413"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VSA7BFIVSWQ2BGAK3I4DFKHI2W","target":"graph","payload":{"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"},"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-07-28T02:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRMfY7RngCzthHUF+TXmpBtmIeP9XUgjMh8QnSJdhy2oqLU6UmkB+SiXiC7+Q0hGY9KymeMhkjItndY+u/FpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:43:46.089987Z"},"content_sha256":"4da516efae4a6f0302b41d0085a17a9f55c9902fc4e1e1de607a6ebc75069a5a","schema_version":"1.0","event_id":"sha256:4da516efae4a6f0302b41d0085a17a9f55c9902fc4e1e1de607a6ebc75069a5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/bundle.json","state_url":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/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-08-14T08:43:46Z","links":{"resolver":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W","bundle":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/bundle.json","state":"https://pith.science/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSA7BFIVSWQ2BGAK3I4DFKHI2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VSA7BFIVSWQ2BGAK3I4DFKHI2W","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":"93723024e25755520827640609d1c098627a6ba56f2ea4b8a7ff5fe766d31ed7","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-03-19T09:58:19Z","title_canon_sha256":"e447f2e98fc07557e3e30d31d428a9de4e8f4e30738ab78445480f01eb9c1e91"},"schema_version":"1.0","source":{"id":"2603.18699","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.18699","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"2603.18699v2","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.18699","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"VSA7BFIVSWQ2","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"pith_short_16","alias_value":"VSA7BFIVSWQ2BGAK","created_at":"2026-07-28T02:23:28Z"},{"alias_kind":"pith_short_8","alias_value":"VSA7BFIV","created_at":"2026-07-28T02:23:28Z"}],"graph_snapshots":[{"event_id":"sha256:4da516efae4a6f0302b41d0085a17a9f55c9902fc4e1e1de607a6ebc75069a5a","target":"graph","created_at":"2026-07-28T02:23:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.18699/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Alexandre Sedoglavic (CRIStAL), CASC), Cl\\'ement Pernet (UGA, Jean-Guillaume Dumas (UGA, LJK, LJK)","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-03-19T09:58:19Z","title":"A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.18699","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:629a5f015afe89384fb86d781075cabca952bd505241bd3327058a2285831413","target":"record","created_at":"2026-07-28T02:23:28Z","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":"93723024e25755520827640609d1c098627a6ba56f2ea4b8a7ff5fe766d31ed7","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-03-19T09:58:19Z","title_canon_sha256":"e447f2e98fc07557e3e30d31d428a9de4e8f4e30738ab78445480f01eb9c1e91"},"schema_version":"1.0","source":{"id":"2603.18699","kind":"arxiv","version":2}},"canonical_sha256":"ac81f0951595a1a0980ada3832a8e8d5b0ba19e43cbf7e3ec66c1942ea1f73ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac81f0951595a1a0980ada3832a8e8d5b0ba19e43cbf7e3ec66c1942ea1f73ca","first_computed_at":"2026-07-28T02:23:28.380458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T02:23:28.380458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2VF1cqsxpcvqEIkazO/83tyVSBsfyBxpjeOjxlbIJjV2AbY+HizG8x33/e1D58ElTR70uNxM6YfT2S27RXfVCA==","signature_status":"signed_v1","signed_at":"2026-07-28T02:23:28.381466Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.18699","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:629a5f015afe89384fb86d781075cabca952bd505241bd3327058a2285831413","sha256:4da516efae4a6f0302b41d0085a17a9f55c9902fc4e1e1de607a6ebc75069a5a"],"state_sha256":"7c1943d38cd4e1b61a66df4db196f7540d52a65d89f6e97d94b118f525a16907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBKdzoYiN56xdMuWj5aGPx9iUOkbQVEaTw/Gy4PMjQRtUijIwfYhnK30JYwBIjMKg2fY0d2JV96/mMrvEi/IBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:43:46.094365Z","bundle_sha256":"d32d6c852689d155a2157c8e1847ed63ccb316306a81504bdef6950579ce9b8c"}}