{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:47DA2EGSYHYJSYT3OFBY2PGV7H","short_pith_number":"pith:47DA2EGS","canonical_record":{"source":{"id":"1612.01527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-05T21:00:02Z","cross_cats_sorted":["cs.DS","math.AG","math.RT"],"title_canon_sha256":"5fd5ceebebd6f138e442cdfe8960fb75de2e0b844558fcd4c98ef644b2c94bfe","abstract_canon_sha256":"f8d51cf9438d9df97f342bd9cba73228b68287c457e97134c86864695b4a34f6"},"schema_version":"1.0"},"canonical_sha256":"e7c60d10d2c1f099627b71438d3cd5f9d6cc207a7a3765509bc2a978df8edd24","source":{"kind":"arxiv","id":"1612.01527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01527","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01527v2","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01527","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"47DA2EGSYHYJ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"47DA2EGSYHYJSYT3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"47DA2EGS","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:47DA2EGSYHYJSYT3OFBY2PGV7H","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-05T21:00:02Z","cross_cats_sorted":["cs.DS","math.AG","math.RT"],"title_canon_sha256":"5fd5ceebebd6f138e442cdfe8960fb75de2e0b844558fcd4c98ef644b2c94bfe","abstract_canon_sha256":"f8d51cf9438d9df97f342bd9cba73228b68287c457e97134c86864695b4a34f6"},"schema_version":"1.0"},"canonical_sha256":"e7c60d10d2c1f099627b71438d3cd5f9d6cc207a7a3765509bc2a978df8edd24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:20.147837Z","signature_b64":"4JGjep2d3hv/2XD9Qrzo0nb/9/yWwNu415f9nPvdif9hlYoJwjGLaFMCEIuYcAFYO6lqkQ5OkG94W61uRp+qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7c60d10d2c1f099627b71438d3cd5f9d6cc207a7a3765509bc2a978df8edd24","last_reissued_at":"2026-05-18T00:55:20.147247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:20.147247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01527","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-05-18T00:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdeK5ZaFk6iVTx/bMKrjo8Cj7yKF2I6vv9XO2cdQOIXd29DVRPx01uo5soLbb87e5swT8Xm1G3CF063oTsW/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:56.259487Z"},"content_sha256":"e378c3e6f6afd01f8de0154ca6688fe285a43abed8de090c6b5964c497ce8971","schema_version":"1.0","event_id":"sha256:e378c3e6f6afd01f8de0154ca6688fe285a43abed8de090c6b5964c497ce8971"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:47DA2EGSYHYJSYT3OFBY2PGV7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix multiplication algorithms from group orbits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.AG","math.RT"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, Joshua A. Grochow","submitted_at":"2016-12-05T21:00:02Z","abstract_excerpt":"We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of orbits under some finite group action. We show how to use the representation theory of the corresponding group to derive simple constraints on the decomposition, which we solve by hand for n=2,3,4,5, recovering Strassen's algorithm (in a particularly symmetric form) and new algorithms for larger n. While these new algorithms do not improve the known upper bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01527","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":""},"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:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKlpDoXpO4B/gnqR7SaLFckkMQseyNd7964tX03OruKSRBgJnC2HRVtlVyfopwbvVNwPfs/AOjDOVttdbCSPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:46:56.259837Z"},"content_sha256":"65c7c1d282df5102907e6f087bd4c6da2741300f4752ae3b0bff01607d61f186","schema_version":"1.0","event_id":"sha256:65c7c1d282df5102907e6f087bd4c6da2741300f4752ae3b0bff01607d61f186"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47DA2EGSYHYJSYT3OFBY2PGV7H/bundle.json","state_url":"https://pith.science/pith/47DA2EGSYHYJSYT3OFBY2PGV7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47DA2EGSYHYJSYT3OFBY2PGV7H/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-28T12:46:56Z","links":{"resolver":"https://pith.science/pith/47DA2EGSYHYJSYT3OFBY2PGV7H","bundle":"https://pith.science/pith/47DA2EGSYHYJSYT3OFBY2PGV7H/bundle.json","state":"https://pith.science/pith/47DA2EGSYHYJSYT3OFBY2PGV7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47DA2EGSYHYJSYT3OFBY2PGV7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:47DA2EGSYHYJSYT3OFBY2PGV7H","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":"f8d51cf9438d9df97f342bd9cba73228b68287c457e97134c86864695b4a34f6","cross_cats_sorted":["cs.DS","math.AG","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-05T21:00:02Z","title_canon_sha256":"5fd5ceebebd6f138e442cdfe8960fb75de2e0b844558fcd4c98ef644b2c94bfe"},"schema_version":"1.0","source":{"id":"1612.01527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01527","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01527v2","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01527","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"47DA2EGSYHYJ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"47DA2EGSYHYJSYT3","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"47DA2EGS","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:65c7c1d282df5102907e6f087bd4c6da2741300f4752ae3b0bff01607d61f186","target":"graph","created_at":"2026-05-18T00:55:20Z","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":"We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of orbits under some finite group action. We show how to use the representation theory of the corresponding group to derive simple constraints on the decomposition, which we solve by hand for n=2,3,4,5, recovering Strassen's algorithm (in a particularly symmetric form) and new algorithms for larger n. While these new algorithms do not improve the known upper bo","authors_text":"Cristopher Moore, Joshua A. Grochow","cross_cats":["cs.DS","math.AG","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-05T21:00:02Z","title":"Matrix multiplication algorithms from group orbits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01527","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:e378c3e6f6afd01f8de0154ca6688fe285a43abed8de090c6b5964c497ce8971","target":"record","created_at":"2026-05-18T00:55:20Z","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":"f8d51cf9438d9df97f342bd9cba73228b68287c457e97134c86864695b4a34f6","cross_cats_sorted":["cs.DS","math.AG","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-05T21:00:02Z","title_canon_sha256":"5fd5ceebebd6f138e442cdfe8960fb75de2e0b844558fcd4c98ef644b2c94bfe"},"schema_version":"1.0","source":{"id":"1612.01527","kind":"arxiv","version":2}},"canonical_sha256":"e7c60d10d2c1f099627b71438d3cd5f9d6cc207a7a3765509bc2a978df8edd24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7c60d10d2c1f099627b71438d3cd5f9d6cc207a7a3765509bc2a978df8edd24","first_computed_at":"2026-05-18T00:55:20.147247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:20.147247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JGjep2d3hv/2XD9Qrzo0nb/9/yWwNu415f9nPvdif9hlYoJwjGLaFMCEIuYcAFYO6lqkQ5OkG94W61uRp+qBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:20.147837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e378c3e6f6afd01f8de0154ca6688fe285a43abed8de090c6b5964c497ce8971","sha256:65c7c1d282df5102907e6f087bd4c6da2741300f4752ae3b0bff01607d61f186"],"state_sha256":"a8ddeff4aa370c83c323aad82e646d25e18ae1a9d6d1f4d690803d89ec2b761f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Yof+Gl79W27BGQgGceH/1KyuVF0owGIXKK1fxvjHJ14toxZ7cM2PaT9ofR2JlEfSmp3ZJpnpoEDJPG3ntWACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:46:56.261745Z","bundle_sha256":"2df5d716d354bae938b89798e27bb8173ace3e0ad45edbf3c8c45e86615ef258"}}