{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WSSBWSJPJNFXAZ53RLEN2ERWRN","short_pith_number":"pith:WSSBWSJP","schema_version":"1.0","canonical_sha256":"b4a41b492f4b4b7067bb8ac8dd12368b6448607ac0ef2298f39e4fc370e08f6e","source":{"kind":"arxiv","id":"2505.05896","version":1},"attestation_state":"computed","paper":{"title":"Consequences of the Moosbauer-Poole Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Isaac Wood, Manuel Kauers","submitted_at":"2025-05-09T09:02:34Z","abstract_excerpt":"Moosbauer and Poole have recently shown that the multiplication of two $5\\times 5$ matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two $6\\times 6$ matrices requires no more than 153 multiplications. Taking these multiplication schemes as starting points, we found improved matrix multiplication schemes for various rectangular matrix formats using a flip graph search."},"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":"2505.05896","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2025-05-09T09:02:34Z","cross_cats_sorted":[],"title_canon_sha256":"567130cf7fa3d31f54499a0d020769e53adcc08a9b20d0dd7c320397ca16333e","abstract_canon_sha256":"7341e06d8f32694f00dad2520a60107ef584591bd13c86ca1e009d31a1c6ec07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:49.473155Z","signature_b64":"lN0mXI+Pa6gQJtYQE/SSBSRaBtTfd9b02ijiDy49fdtqjHT1FzDxJWPd4K7XkuwItSpwr9J4rTo5enarSAFfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4a41b492f4b4b7067bb8ac8dd12368b6448607ac0ef2298f39e4fc370e08f6e","last_reissued_at":"2026-07-05T11:00:49.472660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:49.472660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consequences of the Moosbauer-Poole Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Isaac Wood, Manuel Kauers","submitted_at":"2025-05-09T09:02:34Z","abstract_excerpt":"Moosbauer and Poole have recently shown that the multiplication of two $5\\times 5$ matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two $6\\times 6$ matrices requires no more than 153 multiplications. Taking these multiplication schemes as starting points, we found improved matrix multiplication schemes for various rectangular matrix formats using a flip graph search."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05896","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.05896/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":"2505.05896","created_at":"2026-07-05T11:00:49.472719+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05896v1","created_at":"2026-07-05T11:00:49.472719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05896","created_at":"2026-07-05T11:00:49.472719+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSSBWSJPJNFX","created_at":"2026-07-05T11:00:49.472719+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSSBWSJPJNFXAZ53","created_at":"2026-07-05T11:00:49.472719+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSSBWSJP","created_at":"2026-07-05T11:00:49.472719+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.11041","citing_title":"Exploiting the Structure in Tensor Decompositions for Matrix Multiplication","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2506.13131","citing_title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN","json":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN.json","graph_json":"https://pith.science/api/pith-number/WSSBWSJPJNFXAZ53RLEN2ERWRN/graph.json","events_json":"https://pith.science/api/pith-number/WSSBWSJPJNFXAZ53RLEN2ERWRN/events.json","paper":"https://pith.science/paper/WSSBWSJP"},"agent_actions":{"view_html":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN","download_json":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN.json","view_paper":"https://pith.science/paper/WSSBWSJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05896&json=true","fetch_graph":"https://pith.science/api/pith-number/WSSBWSJPJNFXAZ53RLEN2ERWRN/graph.json","fetch_events":"https://pith.science/api/pith-number/WSSBWSJPJNFXAZ53RLEN2ERWRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN/action/storage_attestation","attest_author":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN/action/author_attestation","sign_citation":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN/action/citation_signature","submit_replication":"https://pith.science/pith/WSSBWSJPJNFXAZ53RLEN2ERWRN/action/replication_record"}},"created_at":"2026-07-05T11:00:49.472719+00:00","updated_at":"2026-07-05T11:00:49.472719+00:00"}