{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NHIXMSRHHYVRDPRXDDKJRN37V3","short_pith_number":"pith:NHIXMSRH","canonical_record":{"source":{"id":"1812.08731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-20T18:04:08Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"093e00805aa43a836920dbeeb33efb9385c730a8a170969c68ca9bd0edf4ec3a","abstract_canon_sha256":"130ad27f4391f326dda7d9aed3758242660eb426d41dab1cb398e52e2013382e"},"schema_version":"1.0"},"canonical_sha256":"69d1764a273e2b11be3718d498b77faef131d242d78340c6a03e80b797c9d324","source":{"kind":"arxiv","id":"1812.08731","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08731","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08731v2","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08731","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"NHIXMSRHHYVR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHIXMSRHHYVRDPRX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHIXMSRH","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NHIXMSRHHYVRDPRXDDKJRN37V3","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-20T18:04:08Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"093e00805aa43a836920dbeeb33efb9385c730a8a170969c68ca9bd0edf4ec3a","abstract_canon_sha256":"130ad27f4391f326dda7d9aed3758242660eb426d41dab1cb398e52e2013382e"},"schema_version":"1.0"},"canonical_sha256":"69d1764a273e2b11be3718d498b77faef131d242d78340c6a03e80b797c9d324","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.748775Z","signature_b64":"EgGg5u1riwY/zWFVBwKPhxFj6QXtKqTw+cP0+mazPCQRpaUZPjgvIpXlXTcfUcLxwF8l/JWqrpbPuQ30Xf1tDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69d1764a273e2b11be3718d498b77faef131d242d78340c6a03e80b797c9d324","last_reissued_at":"2026-05-17T23:47:15.748311Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.748311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08731","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eed3fZc/yFScmvHR9USivfECq/1pYV0qdvNmpwKSInGuMBYtrGfhsdz9KMspxu3BGcsv67pd9J3IHBKEaHSfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:33:55.425126Z"},"content_sha256":"da1396070a8da845289fe9c86f2d8abe3f7ae66eb45f5c10db10fd8ca0341dd3","schema_version":"1.0","event_id":"sha256:da1396070a8da845289fe9c86f2d8abe3f7ae66eb45f5c10db10fd8ca0341dd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NHIXMSRHHYVRDPRXDDKJRN37V3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limits on the Universal Method for Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Josh Alman","submitted_at":"2018-12-20T18:04:08Z","abstract_excerpt":"In this work, we prove limitations on the known methods for designing matrix multiplication algorithms. Alman and Vassilevska Williams recently defined the Universal Method, which substantially generalizes all the known approaches including Strassen's Laser Method and Cohn and Umans' Group Theoretic Method. We prove concrete lower bounds on the algorithms one can design by applying the Universal Method to many different tensors. Our proofs use new tools for upper bounding the asymptotic slice rank of a wide range of tensors. Our main result is that the Universal method applied to any Coppersmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08731","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-17T23:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIh/dD9wLN8VljXjKRYXMtcBI+KOl1TxLvQrsO5Sb9z9CEK2rzTj1jEMLaIFeANf/5L+N7WUWbFc7ovXoSrXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:33:55.425627Z"},"content_sha256":"6a8aea3b59e55ce53cdddfbfc1edbc06116767543fe2540d72c3c89297a3b9ff","schema_version":"1.0","event_id":"sha256:6a8aea3b59e55ce53cdddfbfc1edbc06116767543fe2540d72c3c89297a3b9ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHIXMSRHHYVRDPRXDDKJRN37V3/bundle.json","state_url":"https://pith.science/pith/NHIXMSRHHYVRDPRXDDKJRN37V3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHIXMSRHHYVRDPRXDDKJRN37V3/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-13T08:33:55Z","links":{"resolver":"https://pith.science/pith/NHIXMSRHHYVRDPRXDDKJRN37V3","bundle":"https://pith.science/pith/NHIXMSRHHYVRDPRXDDKJRN37V3/bundle.json","state":"https://pith.science/pith/NHIXMSRHHYVRDPRXDDKJRN37V3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHIXMSRHHYVRDPRXDDKJRN37V3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NHIXMSRHHYVRDPRXDDKJRN37V3","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":"130ad27f4391f326dda7d9aed3758242660eb426d41dab1cb398e52e2013382e","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-20T18:04:08Z","title_canon_sha256":"093e00805aa43a836920dbeeb33efb9385c730a8a170969c68ca9bd0edf4ec3a"},"schema_version":"1.0","source":{"id":"1812.08731","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08731","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08731v2","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08731","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"NHIXMSRHHYVR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHIXMSRHHYVRDPRX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHIXMSRH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:6a8aea3b59e55ce53cdddfbfc1edbc06116767543fe2540d72c3c89297a3b9ff","target":"graph","created_at":"2026-05-17T23:47:15Z","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 this work, we prove limitations on the known methods for designing matrix multiplication algorithms. Alman and Vassilevska Williams recently defined the Universal Method, which substantially generalizes all the known approaches including Strassen's Laser Method and Cohn and Umans' Group Theoretic Method. We prove concrete lower bounds on the algorithms one can design by applying the Universal Method to many different tensors. Our proofs use new tools for upper bounding the asymptotic slice rank of a wide range of tensors. Our main result is that the Universal method applied to any Coppersmi","authors_text":"Josh Alman","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-20T18:04:08Z","title":"Limits on the Universal Method for Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08731","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:da1396070a8da845289fe9c86f2d8abe3f7ae66eb45f5c10db10fd8ca0341dd3","target":"record","created_at":"2026-05-17T23:47:15Z","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":"130ad27f4391f326dda7d9aed3758242660eb426d41dab1cb398e52e2013382e","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-12-20T18:04:08Z","title_canon_sha256":"093e00805aa43a836920dbeeb33efb9385c730a8a170969c68ca9bd0edf4ec3a"},"schema_version":"1.0","source":{"id":"1812.08731","kind":"arxiv","version":2}},"canonical_sha256":"69d1764a273e2b11be3718d498b77faef131d242d78340c6a03e80b797c9d324","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69d1764a273e2b11be3718d498b77faef131d242d78340c6a03e80b797c9d324","first_computed_at":"2026-05-17T23:47:15.748311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:15.748311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EgGg5u1riwY/zWFVBwKPhxFj6QXtKqTw+cP0+mazPCQRpaUZPjgvIpXlXTcfUcLxwF8l/JWqrpbPuQ30Xf1tDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:15.748775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08731","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da1396070a8da845289fe9c86f2d8abe3f7ae66eb45f5c10db10fd8ca0341dd3","sha256:6a8aea3b59e55ce53cdddfbfc1edbc06116767543fe2540d72c3c89297a3b9ff"],"state_sha256":"0a884fc23e38f8a1e7e18c1d5359f80800458d32bfca1afcb81227b9d54b8686"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbhR+Ypntr2mhG8M0mVbkerkJQwmGPMJsk1WCUxpT+CycLBJ7U3b+pIb3tFPLo+izkPMnuP4iiZrJne59Wk1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:33:55.431325Z","bundle_sha256":"b307987d83f0a9fc8e3087b40226c283497f007c7f990b6d0ad16f5a2d56bc76"}}