{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:37YM4OHVFFRYSIFTYS4MPV2DUV","short_pith_number":"pith:37YM4OHV","schema_version":"1.0","canonical_sha256":"dff0ce38f529638920b3c4b8c7d743a559c1c7c6b2931b60d70d43b35a55aa6e","source":{"kind":"arxiv","id":"1612.05766","version":1},"attestation_state":"computed","paper":{"title":"Fast Matrix Multiplication and Symbolic Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Jean-Guillaume Dumas (CASYS), Victor Pan","submitted_at":"2016-12-17T13:51:17Z","abstract_excerpt":"The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when Strassen surprisingly decreased the exponent 3 in the cubic cost of the straightforward classical MM to log 2 (7) $\\approx$ 2.8074. Applications to some fundamental problems of Linear Algebra and Computer Science have been immediately recognized, but the researchers in Computer Algebra keep discovering more and more applications even today, with no sign of slowdown. We survey the unfinished history of decreasing the exponent towards its information lower bound 2, recall some important technique"},"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":"1612.05766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-17T13:51:17Z","cross_cats_sorted":[],"title_canon_sha256":"0b65ee27ee77975631c916369827de278533d4249463b33987eb662e957732b1","abstract_canon_sha256":"c7bcb326cc08cb84ebebd5c794f3d425b3cdd959acade3a9c14e937035dd64cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:46.767024Z","signature_b64":"xzpLwEj/5BPX0ZFYkK7fxyTgkrcBI3XR9Oava+nISbtzmLaLn1NsQOFQF3mDDDVob6evATefHJxeNVimg52VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff0ce38f529638920b3c4b8c7d743a559c1c7c6b2931b60d70d43b35a55aa6e","last_reissued_at":"2026-05-18T00:54:46.766605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:46.766605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Matrix Multiplication and Symbolic Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Jean-Guillaume Dumas (CASYS), Victor Pan","submitted_at":"2016-12-17T13:51:17Z","abstract_excerpt":"The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when Strassen surprisingly decreased the exponent 3 in the cubic cost of the straightforward classical MM to log 2 (7) $\\approx$ 2.8074. Applications to some fundamental problems of Linear Algebra and Computer Science have been immediately recognized, but the researchers in Computer Algebra keep discovering more and more applications even today, with no sign of slowdown. We survey the unfinished history of decreasing the exponent towards its information lower bound 2, recall some important technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05766","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.05766","created_at":"2026-05-18T00:54:46.766677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05766v1","created_at":"2026-05-18T00:54:46.766677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05766","created_at":"2026-05-18T00:54:46.766677+00:00"},{"alias_kind":"pith_short_12","alias_value":"37YM4OHVFFRY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"37YM4OHVFFRYSIFT","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"37YM4OHV","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV","json":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV.json","graph_json":"https://pith.science/api/pith-number/37YM4OHVFFRYSIFTYS4MPV2DUV/graph.json","events_json":"https://pith.science/api/pith-number/37YM4OHVFFRYSIFTYS4MPV2DUV/events.json","paper":"https://pith.science/paper/37YM4OHV"},"agent_actions":{"view_html":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV","download_json":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV.json","view_paper":"https://pith.science/paper/37YM4OHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05766&json=true","fetch_graph":"https://pith.science/api/pith-number/37YM4OHVFFRYSIFTYS4MPV2DUV/graph.json","fetch_events":"https://pith.science/api/pith-number/37YM4OHVFFRYSIFTYS4MPV2DUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV/action/storage_attestation","attest_author":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV/action/author_attestation","sign_citation":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV/action/citation_signature","submit_replication":"https://pith.science/pith/37YM4OHVFFRYSIFTYS4MPV2DUV/action/replication_record"}},"created_at":"2026-05-18T00:54:46.766677+00:00","updated_at":"2026-05-18T00:54:46.766677+00:00"}