{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4LXPF6UJ6GJD7ENX2MY4RKQL5R","short_pith_number":"pith:4LXPF6UJ","canonical_record":{"source":{"id":"1108.2830","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-14T00:23:37Z","cross_cats_sorted":["cs.CC","math.NA","math.RT"],"title_canon_sha256":"83d7ca282beae45b6c1e95a3978368b42a8dc4282e42237d8b6b363bcf2b7507","abstract_canon_sha256":"865d8ca960226669aed92ca2bd026aada5d542e67346a4007bb088a6775ef616"},"schema_version":"1.0"},"canonical_sha256":"e2eef2fa89f1923f91b7d331c8aa0bec66ea80ebf0d9d926a69404868bedaf9a","source":{"kind":"arxiv","id":"1108.2830","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2830","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2830v3","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2830","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"4LXPF6UJ6GJD","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4LXPF6UJ6GJD7ENX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4LXPF6UJ","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4LXPF6UJ6GJD7ENX2MY4RKQL5R","target":"record","payload":{"canonical_record":{"source":{"id":"1108.2830","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-14T00:23:37Z","cross_cats_sorted":["cs.CC","math.NA","math.RT"],"title_canon_sha256":"83d7ca282beae45b6c1e95a3978368b42a8dc4282e42237d8b6b363bcf2b7507","abstract_canon_sha256":"865d8ca960226669aed92ca2bd026aada5d542e67346a4007bb088a6775ef616"},"schema_version":"1.0"},"canonical_sha256":"e2eef2fa89f1923f91b7d331c8aa0bec66ea80ebf0d9d926a69404868bedaf9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:06.335891Z","signature_b64":"5eIChnRrZ1y9mMzbilMUBA+HuzxRrOZ3rzJNxBXapla6tDzBNXEvXJ2PaAU2KTjorCuWpokvunI77ArK/t8NAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2eef2fa89f1923f91b7d331c8aa0bec66ea80ebf0d9d926a69404868bedaf9a","last_reissued_at":"2026-05-18T04:15:06.335103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:06.335103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.2830","source_version":3,"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-18T04:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2nO5G9hROF2452TmLOu7Ojp7CVWHSr8C+Gfq94FFAGAF6IWVsB9DVmH4WJLslK/CaJqMyqu2twp/H6ziuhKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:09.922725Z"},"content_sha256":"6238fb3a48edafa4fb48973ac45e5553676a6cf2e50bab2a460075fe3de3c3c5","schema_version":"1.0","event_id":"sha256:6238fb3a48edafa4fb48973ac45e5553676a6cf2e50bab2a460075fe3de3c3c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4LXPF6UJ6GJD7ENX2MY4RKQL5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NA","math.RT"],"primary_cat":"cs.SC","authors_text":"Daniel Hulme, Gregory V. Bard, Nicolas T. Courtois","submitted_at":"2011-08-14T00:23:37Z","abstract_excerpt":"One of the most famous conjectures in computer algebra is that matrix multiplication might be feasible in not much more than quadratic time. The best known exponent is 2.376, due to Coppersmith and Winograd. Many attempts to solve this problems in the literature work by solving, fixed-size problems and then apply the solution recursively. This leads to pure combinatorial optimisation problems with fixed size. These problems are unlikely to be solvable in polynomial time.\n  In 1976 Laderman published a method to multiply two 3x3 matrices using only 23 multiplications. This result is non-commuta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2830","kind":"arxiv","version":3},"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-18T04:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1Coj0rsWB/yrnPAaQR7+NU4Gr5osNrEs5ycZgLncK/cWsk1c3zYSRsWLptWcyjd8qMIPX89cv/i8JPQzY+xBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:34:09.923298Z"},"content_sha256":"745e09a8da46a1de54e66b160327dca34ce855151dd4774ba6c1f2e25f632e5f","schema_version":"1.0","event_id":"sha256:745e09a8da46a1de54e66b160327dca34ce855151dd4774ba6c1f2e25f632e5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LXPF6UJ6GJD7ENX2MY4RKQL5R/bundle.json","state_url":"https://pith.science/pith/4LXPF6UJ6GJD7ENX2MY4RKQL5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LXPF6UJ6GJD7ENX2MY4RKQL5R/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-05-30T07:34:09Z","links":{"resolver":"https://pith.science/pith/4LXPF6UJ6GJD7ENX2MY4RKQL5R","bundle":"https://pith.science/pith/4LXPF6UJ6GJD7ENX2MY4RKQL5R/bundle.json","state":"https://pith.science/pith/4LXPF6UJ6GJD7ENX2MY4RKQL5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LXPF6UJ6GJD7ENX2MY4RKQL5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4LXPF6UJ6GJD7ENX2MY4RKQL5R","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":"865d8ca960226669aed92ca2bd026aada5d542e67346a4007bb088a6775ef616","cross_cats_sorted":["cs.CC","math.NA","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-14T00:23:37Z","title_canon_sha256":"83d7ca282beae45b6c1e95a3978368b42a8dc4282e42237d8b6b363bcf2b7507"},"schema_version":"1.0","source":{"id":"1108.2830","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.2830","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1108.2830v3","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2830","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"4LXPF6UJ6GJD","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4LXPF6UJ6GJD7ENX","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4LXPF6UJ","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:745e09a8da46a1de54e66b160327dca34ce855151dd4774ba6c1f2e25f632e5f","target":"graph","created_at":"2026-05-18T04:15:06Z","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":"One of the most famous conjectures in computer algebra is that matrix multiplication might be feasible in not much more than quadratic time. The best known exponent is 2.376, due to Coppersmith and Winograd. Many attempts to solve this problems in the literature work by solving, fixed-size problems and then apply the solution recursively. This leads to pure combinatorial optimisation problems with fixed size. These problems are unlikely to be solvable in polynomial time.\n  In 1976 Laderman published a method to multiply two 3x3 matrices using only 23 multiplications. This result is non-commuta","authors_text":"Daniel Hulme, Gregory V. Bard, Nicolas T. Courtois","cross_cats":["cs.CC","math.NA","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-14T00:23:37Z","title":"A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2830","kind":"arxiv","version":3},"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:6238fb3a48edafa4fb48973ac45e5553676a6cf2e50bab2a460075fe3de3c3c5","target":"record","created_at":"2026-05-18T04:15:06Z","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":"865d8ca960226669aed92ca2bd026aada5d542e67346a4007bb088a6775ef616","cross_cats_sorted":["cs.CC","math.NA","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-08-14T00:23:37Z","title_canon_sha256":"83d7ca282beae45b6c1e95a3978368b42a8dc4282e42237d8b6b363bcf2b7507"},"schema_version":"1.0","source":{"id":"1108.2830","kind":"arxiv","version":3}},"canonical_sha256":"e2eef2fa89f1923f91b7d331c8aa0bec66ea80ebf0d9d926a69404868bedaf9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2eef2fa89f1923f91b7d331c8aa0bec66ea80ebf0d9d926a69404868bedaf9a","first_computed_at":"2026-05-18T04:15:06.335103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:06.335103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5eIChnRrZ1y9mMzbilMUBA+HuzxRrOZ3rzJNxBXapla6tDzBNXEvXJ2PaAU2KTjorCuWpokvunI77ArK/t8NAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:06.335891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.2830","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6238fb3a48edafa4fb48973ac45e5553676a6cf2e50bab2a460075fe3de3c3c5","sha256:745e09a8da46a1de54e66b160327dca34ce855151dd4774ba6c1f2e25f632e5f"],"state_sha256":"00da6b1292e1bca99f5a36a9e0f06c9bf2a33adbf910fd8546b7e549a21704c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2VKho8pATm91WuxVc2AI0HundaHhJ4syasWC3nBUdHc1NZFH9GbsY4wechUAsRxbmhOgvowGZnFRCy/0OwPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:34:09.927499Z","bundle_sha256":"9765150523edd2018f534bb2ad60bb1e10dc7eb4a9191c1bc2d0537bede42d29"}}