{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IBJKJ4R4RMXRLMEHIJFVB4LPS5","short_pith_number":"pith:IBJKJ4R4","canonical_record":{"source":{"id":"1905.10192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-24T12:36:00Z","cross_cats_sorted":[],"title_canon_sha256":"c643e395628e94aae44ea9b6150f93c9b26173e399f829bdcc7a3bcba37b985c","abstract_canon_sha256":"47d354efa5cec772884716a440eb6f73af32054ddbb1228333b48a9b2a51b6d5"},"schema_version":"1.0"},"canonical_sha256":"4052a4f23c8b2f15b087424b50f16f9776cc6961dabe3fc93fed8731d5d0814c","source":{"kind":"arxiv","id":"1905.10192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10192","created_at":"2026-05-17T23:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10192v1","created_at":"2026-05-17T23:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10192","created_at":"2026-05-17T23:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"IBJKJ4R4RMXR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBJKJ4R4RMXRLMEH","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBJKJ4R4","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IBJKJ4R4RMXRLMEHIJFVB4LPS5","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-24T12:36:00Z","cross_cats_sorted":[],"title_canon_sha256":"c643e395628e94aae44ea9b6150f93c9b26173e399f829bdcc7a3bcba37b985c","abstract_canon_sha256":"47d354efa5cec772884716a440eb6f73af32054ddbb1228333b48a9b2a51b6d5"},"schema_version":"1.0"},"canonical_sha256":"4052a4f23c8b2f15b087424b50f16f9776cc6961dabe3fc93fed8731d5d0814c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:11.002169Z","signature_b64":"2+EGZpUrr+eGcBzo2HtcX8xBd5RXkTbFfGh2aqGFYhodKB5hILV5n28ek2K8JlG5WhDlC5T9YYZkZVt/EQ8kCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4052a4f23c8b2f15b087424b50f16f9776cc6961dabe3fc93fed8731d5d0814c","last_reissued_at":"2026-05-17T23:45:11.001603Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:11.001603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10192","source_version":1,"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-05-17T23:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Ke1X1e5GgY1gvl3voSMyPysXO7z4tJGbC9j2l/FLDmHI5XDVSXIx5rK1hI0utOnwGMrFe2O7yvuYmI4lV5EBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:06.118154Z"},"content_sha256":"dc754a8c5291c4c4575f244f841f84d800da6926913ace624b3e40dc7bfe30dd","schema_version":"1.0","event_id":"sha256:dc754a8c5291c4c4575f244f841f84d800da6926913ace624b3e40dc7bfe30dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IBJKJ4R4RMXRLMEHIJFVB4LPS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New ways to multiply 3 x 3-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Manuel Kauers, Marijn J.H. Heule, Martina Seidl","submitted_at":"2019-05-24T12:36:00Z","abstract_excerpt":"It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 x 3-matrices. It is not known whether this can also be done with fewer multiplications. However, there are several mutually inequivalent ways of doing the job with 23 multiplications. In this article, we extend this list considerably by providing more than 13 000 new and mutually inequivalent schemes for multiplying 3 x 3-matrices using 23 multiplications. Moreover, we show that the set of all these schemes is a manifold of dimension at least 17."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10192","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"},"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-05-17T23:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NymL5o48TKf5OSow79c47DT0R+NLWO94JjCpm7UTy/+1tFK8RLknByaAwzhDLRF2g9tr0yAgKWy3U79lxl2VAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:06.118573Z"},"content_sha256":"6b6354950e4a8e2368a7788d375f0310945829ec0a9662e786e85fc3309486f6","schema_version":"1.0","event_id":"sha256:6b6354950e4a8e2368a7788d375f0310945829ec0a9662e786e85fc3309486f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBJKJ4R4RMXRLMEHIJFVB4LPS5/bundle.json","state_url":"https://pith.science/pith/IBJKJ4R4RMXRLMEHIJFVB4LPS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBJKJ4R4RMXRLMEHIJFVB4LPS5/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-06-05T19:58:06Z","links":{"resolver":"https://pith.science/pith/IBJKJ4R4RMXRLMEHIJFVB4LPS5","bundle":"https://pith.science/pith/IBJKJ4R4RMXRLMEHIJFVB4LPS5/bundle.json","state":"https://pith.science/pith/IBJKJ4R4RMXRLMEHIJFVB4LPS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBJKJ4R4RMXRLMEHIJFVB4LPS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IBJKJ4R4RMXRLMEHIJFVB4LPS5","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":"47d354efa5cec772884716a440eb6f73af32054ddbb1228333b48a9b2a51b6d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-24T12:36:00Z","title_canon_sha256":"c643e395628e94aae44ea9b6150f93c9b26173e399f829bdcc7a3bcba37b985c"},"schema_version":"1.0","source":{"id":"1905.10192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10192","created_at":"2026-05-17T23:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10192v1","created_at":"2026-05-17T23:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10192","created_at":"2026-05-17T23:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"IBJKJ4R4RMXR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBJKJ4R4RMXRLMEH","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBJKJ4R4","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:6b6354950e4a8e2368a7788d375f0310945829ec0a9662e786e85fc3309486f6","target":"graph","created_at":"2026-05-17T23:45:11Z","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"},"paper":{"abstract_excerpt":"It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 x 3-matrices. It is not known whether this can also be done with fewer multiplications. However, there are several mutually inequivalent ways of doing the job with 23 multiplications. In this article, we extend this list considerably by providing more than 13 000 new and mutually inequivalent schemes for multiplying 3 x 3-matrices using 23 multiplications. Moreover, we show that the set of all these schemes is a manifold of dimension at least 17.","authors_text":"Manuel Kauers, Marijn J.H. Heule, Martina Seidl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-24T12:36:00Z","title":"New ways to multiply 3 x 3-matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10192","kind":"arxiv","version":1},"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:dc754a8c5291c4c4575f244f841f84d800da6926913ace624b3e40dc7bfe30dd","target":"record","created_at":"2026-05-17T23:45:11Z","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":"47d354efa5cec772884716a440eb6f73af32054ddbb1228333b48a9b2a51b6d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-24T12:36:00Z","title_canon_sha256":"c643e395628e94aae44ea9b6150f93c9b26173e399f829bdcc7a3bcba37b985c"},"schema_version":"1.0","source":{"id":"1905.10192","kind":"arxiv","version":1}},"canonical_sha256":"4052a4f23c8b2f15b087424b50f16f9776cc6961dabe3fc93fed8731d5d0814c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4052a4f23c8b2f15b087424b50f16f9776cc6961dabe3fc93fed8731d5d0814c","first_computed_at":"2026-05-17T23:45:11.001603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:11.001603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2+EGZpUrr+eGcBzo2HtcX8xBd5RXkTbFfGh2aqGFYhodKB5hILV5n28ek2K8JlG5WhDlC5T9YYZkZVt/EQ8kCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:11.002169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc754a8c5291c4c4575f244f841f84d800da6926913ace624b3e40dc7bfe30dd","sha256:6b6354950e4a8e2368a7788d375f0310945829ec0a9662e786e85fc3309486f6"],"state_sha256":"7c753711c7fce4a8bf661eda72cf4134f00da874d482f6a6004e64b80b34c926"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZmgIiE2GHy/A5jyqV5Q/McuBo3+gR+VXlJxiz/E5AhAf9jyO5ZQdtMR5G/H9J0V2iGgKeSac5s23TmjIzXHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:58:06.121700Z","bundle_sha256":"7af5792fea0b3d7dfe1a3b51dae95c5650e84bdae681caba8d6b35a8bfb98897"}}