{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VYJAMUNXH53ZSKKJIEBHKIZ3HN","short_pith_number":"pith:VYJAMUNX","canonical_record":{"source":{"id":"2106.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-21T05:08:54Z","cross_cats_sorted":["cs.AR","cs.PF","stat.ML"],"title_canon_sha256":"718679bc5f8b20789f8a5a01a7f324bcfc6f0f7c0e3ebd072aa167009bd4ebd6","abstract_canon_sha256":"0938ba59f7a9161675e96a65258bea7f8d0faeb4e31d052588927b94173c75cc"},"schema_version":"1.0"},"canonical_sha256":"ae120651b73f77992949410275233b3b78b41e46e08a1a04eb4d07de8e9d6158","source":{"kind":"arxiv","id":"2106.10860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.10860","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"2106.10860v1","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.10860","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"VYJAMUNXH53Z","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_16","alias_value":"VYJAMUNXH53ZSKKJ","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_8","alias_value":"VYJAMUNX","created_at":"2026-07-05T03:05:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VYJAMUNXH53ZSKKJIEBHKIZ3HN","target":"record","payload":{"canonical_record":{"source":{"id":"2106.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-21T05:08:54Z","cross_cats_sorted":["cs.AR","cs.PF","stat.ML"],"title_canon_sha256":"718679bc5f8b20789f8a5a01a7f324bcfc6f0f7c0e3ebd072aa167009bd4ebd6","abstract_canon_sha256":"0938ba59f7a9161675e96a65258bea7f8d0faeb4e31d052588927b94173c75cc"},"schema_version":"1.0"},"canonical_sha256":"ae120651b73f77992949410275233b3b78b41e46e08a1a04eb4d07de8e9d6158","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:51.398439Z","signature_b64":"7x4GrqspRLZRZ8LFoV2qW6axUIwN0V7LU9iJSgTAp4++MkiJ0M20sBRmsJl3rnNkmR0bww2nObmqW4D/PYxUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae120651b73f77992949410275233b3b78b41e46e08a1a04eb4d07de8e9d6158","last_reissued_at":"2026-07-05T03:05:51.397948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:51.397948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.10860","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-07-05T03:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLdZhGN6Dg4Qni2aFD+A63liah8AbcUw3Vp8pYTi9UzfAlwscFlTa0e+VNTp7rTnNOR293kGPM+NHN26Hfi4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:08:40.983789Z"},"content_sha256":"2e634f0110052da8b5283cadd2fd58fa29eb6a0f78e39ab2c1484f26d3cc16fc","schema_version":"1.0","event_id":"sha256:2e634f0110052da8b5283cadd2fd58fa29eb6a0f78e39ab2c1484f26d3cc16fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VYJAMUNXH53ZSKKJIEBHKIZ3HN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplying Matrices Without Multiplying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.PF","stat.ML"],"primary_cat":"cs.LG","authors_text":"Davis Blalock, John Guttag","submitted_at":"2021-06-21T05:08:54Z","abstract_excerpt":"Multiplying matrices is among the most fundamental and compute-intensive operations in machine learning. Consequently, there has been significant work on efficiently approximating matrix multiplies. We introduce a learning-based algorithm for this task that greatly outperforms existing methods. Experiments using hundreds of matrices from diverse domains show that it often runs $100\\times$ faster than exact matrix products and $10\\times$ faster than current approximate methods. In the common case that one matrix is known ahead of time, our method also has the interesting property that it requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.10860","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.10860/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJin6bCcrxqPvLmSxuLPae5tKXUI3+ep3TYyMLTQtwSgKoZfNYWh5sxgipl6Jxtn1RHTAfeqvaexRmzxsvVKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:08:40.984169Z"},"content_sha256":"7afa8da6cf11f40e1a46cbcdbba2ad921066f8f4d2d716c979663328c67b080d","schema_version":"1.0","event_id":"sha256:7afa8da6cf11f40e1a46cbcdbba2ad921066f8f4d2d716c979663328c67b080d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYJAMUNXH53ZSKKJIEBHKIZ3HN/bundle.json","state_url":"https://pith.science/pith/VYJAMUNXH53ZSKKJIEBHKIZ3HN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYJAMUNXH53ZSKKJIEBHKIZ3HN/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-20T07:08:40Z","links":{"resolver":"https://pith.science/pith/VYJAMUNXH53ZSKKJIEBHKIZ3HN","bundle":"https://pith.science/pith/VYJAMUNXH53ZSKKJIEBHKIZ3HN/bundle.json","state":"https://pith.science/pith/VYJAMUNXH53ZSKKJIEBHKIZ3HN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYJAMUNXH53ZSKKJIEBHKIZ3HN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VYJAMUNXH53ZSKKJIEBHKIZ3HN","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":"0938ba59f7a9161675e96a65258bea7f8d0faeb4e31d052588927b94173c75cc","cross_cats_sorted":["cs.AR","cs.PF","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-21T05:08:54Z","title_canon_sha256":"718679bc5f8b20789f8a5a01a7f324bcfc6f0f7c0e3ebd072aa167009bd4ebd6"},"schema_version":"1.0","source":{"id":"2106.10860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.10860","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"2106.10860v1","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.10860","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"VYJAMUNXH53Z","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_16","alias_value":"VYJAMUNXH53ZSKKJ","created_at":"2026-07-05T03:05:51Z"},{"alias_kind":"pith_short_8","alias_value":"VYJAMUNX","created_at":"2026-07-05T03:05:51Z"}],"graph_snapshots":[{"event_id":"sha256:7afa8da6cf11f40e1a46cbcdbba2ad921066f8f4d2d716c979663328c67b080d","target":"graph","created_at":"2026-07-05T03:05:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.10860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multiplying matrices is among the most fundamental and compute-intensive operations in machine learning. Consequently, there has been significant work on efficiently approximating matrix multiplies. We introduce a learning-based algorithm for this task that greatly outperforms existing methods. Experiments using hundreds of matrices from diverse domains show that it often runs $100\\times$ faster than exact matrix products and $10\\times$ faster than current approximate methods. In the common case that one matrix is known ahead of time, our method also has the interesting property that it requir","authors_text":"Davis Blalock, John Guttag","cross_cats":["cs.AR","cs.PF","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-21T05:08:54Z","title":"Multiplying Matrices Without Multiplying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.10860","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:2e634f0110052da8b5283cadd2fd58fa29eb6a0f78e39ab2c1484f26d3cc16fc","target":"record","created_at":"2026-07-05T03:05:51Z","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":"0938ba59f7a9161675e96a65258bea7f8d0faeb4e31d052588927b94173c75cc","cross_cats_sorted":["cs.AR","cs.PF","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-21T05:08:54Z","title_canon_sha256":"718679bc5f8b20789f8a5a01a7f324bcfc6f0f7c0e3ebd072aa167009bd4ebd6"},"schema_version":"1.0","source":{"id":"2106.10860","kind":"arxiv","version":1}},"canonical_sha256":"ae120651b73f77992949410275233b3b78b41e46e08a1a04eb4d07de8e9d6158","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae120651b73f77992949410275233b3b78b41e46e08a1a04eb4d07de8e9d6158","first_computed_at":"2026-07-05T03:05:51.397948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:05:51.397948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7x4GrqspRLZRZ8LFoV2qW6axUIwN0V7LU9iJSgTAp4++MkiJ0M20sBRmsJl3rnNkmR0bww2nObmqW4D/PYxUCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:05:51.398439Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.10860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e634f0110052da8b5283cadd2fd58fa29eb6a0f78e39ab2c1484f26d3cc16fc","sha256:7afa8da6cf11f40e1a46cbcdbba2ad921066f8f4d2d716c979663328c67b080d"],"state_sha256":"e6ff55b2bfd1d5b4b6e0222499d84168906d2e1db4cfe23a5eae143b80c0c850"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jl4v6+PVaLheoSdVezBZOkcyxZBZovMBe78wphpFyDHlEmb2iD6qus8T4Mvvvkwxxvav/cTbL1zbD0zT7PRDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:08:40.986919Z","bundle_sha256":"aea8d39bbe709d062209f059646e8f38b535dc6e7387cb0b7ee6c32f8ab6ee9c"}}