{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6PEZSFJMV6V3REYLJUXAZDH5I5","short_pith_number":"pith:6PEZSFJM","canonical_record":{"source":{"id":"1708.09398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T18:00:06Z","cross_cats_sorted":["cs.CC","cs.SC","math.RT"],"title_canon_sha256":"7e9652661e44176b58d301506e14820d03c6ecfceaea68ab42c2ac4948dd4754","abstract_canon_sha256":"420633961df9bc60a287c605d3877f1a3e5e086d0680d18c151f1c04f982a7f2"},"schema_version":"1.0"},"canonical_sha256":"f3c999152cafabb8930b4d2e0c8cfd477c3b87ca0d5a067bbf2a4d7123302d45","source":{"kind":"arxiv","id":"1708.09398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09398","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09398v1","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09398","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"6PEZSFJMV6V3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6PEZSFJMV6V3REYL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6PEZSFJM","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6PEZSFJMV6V3REYLJUXAZDH5I5","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T18:00:06Z","cross_cats_sorted":["cs.CC","cs.SC","math.RT"],"title_canon_sha256":"7e9652661e44176b58d301506e14820d03c6ecfceaea68ab42c2ac4948dd4754","abstract_canon_sha256":"420633961df9bc60a287c605d3877f1a3e5e086d0680d18c151f1c04f982a7f2"},"schema_version":"1.0"},"canonical_sha256":"f3c999152cafabb8930b4d2e0c8cfd477c3b87ca0d5a067bbf2a4d7123302d45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:18.934231Z","signature_b64":"zXumhp1ctz00Yg1UeiDtUntWlYxHy0c9D87cLnNItxRhLplnZt6jP1gbOWR2mlg3mMNE+La0CAN/XAqwWje0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3c999152cafabb8930b4d2e0c8cfd477c3b87ca0d5a067bbf2a4d7123302d45","last_reissued_at":"2026-05-18T00:36:18.933726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:18.933726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09398","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-18T00:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcwTDzjucGhNynkuTSVuCTG+JCQ5BzQZNROhq8d4z22WEmPm4yUES0194XrLCeS9/wpuEL9O+Jl+ma+t/RuMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:06:50.847473Z"},"content_sha256":"2ab83b3370b436b80985432766ec3de2ba47d0e451e3cb3a8f7a30a64817fe5e","schema_version":"1.0","event_id":"sha256:2ab83b3370b436b80985432766ec3de2ba47d0e451e3cb3a8f7a30a64817fe5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6PEZSFJMV6V3REYLJUXAZDH5I5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Designing Strassen's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC","math.RT"],"primary_cat":"cs.DS","authors_text":"Cristopher Moore, Joshua A. Grochow","submitted_at":"2017-08-30T18:00:06Z","abstract_excerpt":"In 1969, Strassen shocked the world by showing that two n x n matrices could be multiplied in time asymptotically less than $O(n^3)$. While the recursive construction in his algorithm is very clear, the key gain was made by showing that 2 x 2 matrix multiplication could be performed with only 7 multiplications instead of 8. The latter construction was arrived at by a process of elimination and appears to come out of thin air. Here, we give the simplest and most transparent proof of Strassen's algorithm that we are aware of, using only a simple unitary 2-design and a few easy lines of calculati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09398","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-18T00:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3X7qWufKfH4tJCtOJHN9SmBmr1fbVzMz9NtsYvhd6OmwjVA5MVxw2GYuHs0PC2wewNTU3MH9HFEflQGdzhJCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:06:50.847821Z"},"content_sha256":"402818f9cbcf0cdbf8ae3602ed8a632c2b88f1cabece7fbeae585687e856ae13","schema_version":"1.0","event_id":"sha256:402818f9cbcf0cdbf8ae3602ed8a632c2b88f1cabece7fbeae585687e856ae13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PEZSFJMV6V3REYLJUXAZDH5I5/bundle.json","state_url":"https://pith.science/pith/6PEZSFJMV6V3REYLJUXAZDH5I5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PEZSFJMV6V3REYLJUXAZDH5I5/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-28T11:06:50Z","links":{"resolver":"https://pith.science/pith/6PEZSFJMV6V3REYLJUXAZDH5I5","bundle":"https://pith.science/pith/6PEZSFJMV6V3REYLJUXAZDH5I5/bundle.json","state":"https://pith.science/pith/6PEZSFJMV6V3REYLJUXAZDH5I5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PEZSFJMV6V3REYLJUXAZDH5I5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6PEZSFJMV6V3REYLJUXAZDH5I5","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":"420633961df9bc60a287c605d3877f1a3e5e086d0680d18c151f1c04f982a7f2","cross_cats_sorted":["cs.CC","cs.SC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T18:00:06Z","title_canon_sha256":"7e9652661e44176b58d301506e14820d03c6ecfceaea68ab42c2ac4948dd4754"},"schema_version":"1.0","source":{"id":"1708.09398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09398","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09398v1","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09398","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"6PEZSFJMV6V3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6PEZSFJMV6V3REYL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6PEZSFJM","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:402818f9cbcf0cdbf8ae3602ed8a632c2b88f1cabece7fbeae585687e856ae13","target":"graph","created_at":"2026-05-18T00:36:18Z","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":"In 1969, Strassen shocked the world by showing that two n x n matrices could be multiplied in time asymptotically less than $O(n^3)$. While the recursive construction in his algorithm is very clear, the key gain was made by showing that 2 x 2 matrix multiplication could be performed with only 7 multiplications instead of 8. The latter construction was arrived at by a process of elimination and appears to come out of thin air. Here, we give the simplest and most transparent proof of Strassen's algorithm that we are aware of, using only a simple unitary 2-design and a few easy lines of calculati","authors_text":"Cristopher Moore, Joshua A. Grochow","cross_cats":["cs.CC","cs.SC","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T18:00:06Z","title":"Designing Strassen's algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09398","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:2ab83b3370b436b80985432766ec3de2ba47d0e451e3cb3a8f7a30a64817fe5e","target":"record","created_at":"2026-05-18T00:36:18Z","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":"420633961df9bc60a287c605d3877f1a3e5e086d0680d18c151f1c04f982a7f2","cross_cats_sorted":["cs.CC","cs.SC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T18:00:06Z","title_canon_sha256":"7e9652661e44176b58d301506e14820d03c6ecfceaea68ab42c2ac4948dd4754"},"schema_version":"1.0","source":{"id":"1708.09398","kind":"arxiv","version":1}},"canonical_sha256":"f3c999152cafabb8930b4d2e0c8cfd477c3b87ca0d5a067bbf2a4d7123302d45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3c999152cafabb8930b4d2e0c8cfd477c3b87ca0d5a067bbf2a4d7123302d45","first_computed_at":"2026-05-18T00:36:18.933726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:18.933726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zXumhp1ctz00Yg1UeiDtUntWlYxHy0c9D87cLnNItxRhLplnZt6jP1gbOWR2mlg3mMNE+La0CAN/XAqwWje0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:18.934231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ab83b3370b436b80985432766ec3de2ba47d0e451e3cb3a8f7a30a64817fe5e","sha256:402818f9cbcf0cdbf8ae3602ed8a632c2b88f1cabece7fbeae585687e856ae13"],"state_sha256":"316577ae24889a908a6cd2ff31232db1fffc44159a2e3a97fd38d1fb736a1d27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/z+9NRZ6Nu/rdJE1fjgbmu/IIzxL58BKj6aTbNqMga7GS/ssx2DWkWAIpOsQv5mROFFtFP0/jOZTHzatU7D8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:06:50.849755Z","bundle_sha256":"bfe9095a1bcfe8ea48877f680a5dd959920437069ae307eab630c62b4334df65"}}