{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TVNGUDVBTDM2UDPDCD2XHWUC4B","short_pith_number":"pith:TVNGUDVB","canonical_record":{"source":{"id":"1903.11391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-03-27T12:53:51Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"f98b9d209833be755e25ce93040880b181eeb5c64f19cc6986aa8c322ce48c34","abstract_canon_sha256":"a2df58ebef1a4ada82b09e0cc40c88722e27650b69b67066542dd067eb55e184"},"schema_version":"1.0"},"canonical_sha256":"9d5a6a0ea198d9aa0de310f573da82e04899d0dcfe1718773436cb35b5a1aeb0","source":{"kind":"arxiv","id":"1903.11391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11391","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11391v2","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11391","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"pith_short_12","alias_value":"TVNGUDVBTDM2","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"pith_short_16","alias_value":"TVNGUDVBTDM2UDPD","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"pith_short_8","alias_value":"TVNGUDVB","created_at":"2026-07-04T23:58:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TVNGUDVBTDM2UDPDCD2XHWUC4B","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-03-27T12:53:51Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"f98b9d209833be755e25ce93040880b181eeb5c64f19cc6986aa8c322ce48c34","abstract_canon_sha256":"a2df58ebef1a4ada82b09e0cc40c88722e27650b69b67066542dd067eb55e184"},"schema_version":"1.0"},"canonical_sha256":"9d5a6a0ea198d9aa0de310f573da82e04899d0dcfe1718773436cb35b5a1aeb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:07.511472Z","signature_b64":"3SmH9F0zu9uddXPmVCrJWKi6yOtmLrOfxWt0niZb8tyiMc/s1V0X7iZaaVT+3rUDVOtS2qqvtLf2SFsJj9oGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d5a6a0ea198d9aa0de310f573da82e04899d0dcfe1718773436cb35b5a1aeb0","last_reissued_at":"2026-07-04T23:58:07.511030Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:07.511030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11391","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-04T23:58:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1dzdOqgZyVs/pRLHrr1YCIKfEBEXFp/fTE+Baz7enFXaxoJ4IR5d/wpNkAChpQpiLJ5IeRGHPTV2R7A8lU9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:33:12.948974Z"},"content_sha256":"a506908fc44f7e3ccf2b95d5bf241be10863ab2c90f56acaeb8b318685e5a301","schema_version":"1.0","event_id":"sha256:a506908fc44f7e3ccf2b95d5bf241be10863ab2c90f56acaeb8b318685e5a301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TVNGUDVBTDM2UDPDCD2XHWUC4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Search for Fast Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.LO","authors_text":"Manuel Kauers, Marijn J.H. Heule, Martina Seidl","submitted_at":"2019-03-27T12:53:51Z","abstract_excerpt":"Laderman discovered a scheme for computing the product of two 3x3 matrices using only 23 multiplications in 1976. Since then, some more such schemes were proposed, but it remains open how many there are and whether there exist schemes with fewer than 23 multiplications. In this paper we present two independent SAT-based methods for finding new schemes. Both methods allow computing a few hundred new schemes individually, and many thousands when combined. Local search SAT solvers outperform CDCL solvers consistently in this application."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11391","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/1903.11391/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-04T23:58:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQ4J0t985ABj/OrGHZWuJn6uxEJ8DtIU0u+7BJxVXOAhUTkxsfuZpEKGIP+NSvz3fyNwSFKKIsLt+FknxGJNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:33:12.950019Z"},"content_sha256":"61142ec8e73eccc12749dd03e49fc91412223021cf388f5daed69c341bbf601f","schema_version":"1.0","event_id":"sha256:61142ec8e73eccc12749dd03e49fc91412223021cf388f5daed69c341bbf601f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVNGUDVBTDM2UDPDCD2XHWUC4B/bundle.json","state_url":"https://pith.science/pith/TVNGUDVBTDM2UDPDCD2XHWUC4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVNGUDVBTDM2UDPDCD2XHWUC4B/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-13T10:33:13Z","links":{"resolver":"https://pith.science/pith/TVNGUDVBTDM2UDPDCD2XHWUC4B","bundle":"https://pith.science/pith/TVNGUDVBTDM2UDPDCD2XHWUC4B/bundle.json","state":"https://pith.science/pith/TVNGUDVBTDM2UDPDCD2XHWUC4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVNGUDVBTDM2UDPDCD2XHWUC4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TVNGUDVBTDM2UDPDCD2XHWUC4B","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":"a2df58ebef1a4ada82b09e0cc40c88722e27650b69b67066542dd067eb55e184","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-03-27T12:53:51Z","title_canon_sha256":"f98b9d209833be755e25ce93040880b181eeb5c64f19cc6986aa8c322ce48c34"},"schema_version":"1.0","source":{"id":"1903.11391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11391","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11391v2","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11391","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"pith_short_12","alias_value":"TVNGUDVBTDM2","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"pith_short_16","alias_value":"TVNGUDVBTDM2UDPD","created_at":"2026-07-04T23:58:07Z"},{"alias_kind":"pith_short_8","alias_value":"TVNGUDVB","created_at":"2026-07-04T23:58:07Z"}],"graph_snapshots":[{"event_id":"sha256:61142ec8e73eccc12749dd03e49fc91412223021cf388f5daed69c341bbf601f","target":"graph","created_at":"2026-07-04T23:58:07Z","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/1903.11391/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Laderman discovered a scheme for computing the product of two 3x3 matrices using only 23 multiplications in 1976. Since then, some more such schemes were proposed, but it remains open how many there are and whether there exist schemes with fewer than 23 multiplications. In this paper we present two independent SAT-based methods for finding new schemes. Both methods allow computing a few hundred new schemes individually, and many thousands when combined. Local search SAT solvers outperform CDCL solvers consistently in this application.","authors_text":"Manuel Kauers, Marijn J.H. Heule, Martina Seidl","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-03-27T12:53:51Z","title":"Local Search for Fast Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11391","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:a506908fc44f7e3ccf2b95d5bf241be10863ab2c90f56acaeb8b318685e5a301","target":"record","created_at":"2026-07-04T23:58:07Z","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":"a2df58ebef1a4ada82b09e0cc40c88722e27650b69b67066542dd067eb55e184","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-03-27T12:53:51Z","title_canon_sha256":"f98b9d209833be755e25ce93040880b181eeb5c64f19cc6986aa8c322ce48c34"},"schema_version":"1.0","source":{"id":"1903.11391","kind":"arxiv","version":2}},"canonical_sha256":"9d5a6a0ea198d9aa0de310f573da82e04899d0dcfe1718773436cb35b5a1aeb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d5a6a0ea198d9aa0de310f573da82e04899d0dcfe1718773436cb35b5a1aeb0","first_computed_at":"2026-07-04T23:58:07.511030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:07.511030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3SmH9F0zu9uddXPmVCrJWKi6yOtmLrOfxWt0niZb8tyiMc/s1V0X7iZaaVT+3rUDVOtS2qqvtLf2SFsJj9oGDA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:07.511472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a506908fc44f7e3ccf2b95d5bf241be10863ab2c90f56acaeb8b318685e5a301","sha256:61142ec8e73eccc12749dd03e49fc91412223021cf388f5daed69c341bbf601f"],"state_sha256":"9ae9b1f7ee4122a97511219f8411ee3a3ef7e2327fcfb158df51c66d141cbd3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqmqj7gSdZy5Ue4oU1Bf/eFYjJZp6UtjNbz4nj2L8D8FuN/zKDc0j9bZ5tiy4lHjSXDH89fRyNX+TPJGjyMRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:33:13.119744Z","bundle_sha256":"ffbf6a7e7ae6849680846d7e8c84c88b4fa5093b9d738831acf53221a13a986e"}}