{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XPYDEJO5I7S2YHSJ6J6AEM7M5A","short_pith_number":"pith:XPYDEJO5","canonical_record":{"source":{"id":"1507.00687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-02T18:42:28Z","cross_cats_sorted":[],"title_canon_sha256":"caf1ef15ee13734a629b1c9b2a8e41aaff9dfdd92c869b8bd9489e41746c2306","abstract_canon_sha256":"ade18f3867534a338ed5dc30ca27f0c2d31e5a89d669345805e49c8beff3f211"},"schema_version":"1.0"},"canonical_sha256":"bbf03225dd47e5ac1e49f27c0233ece83ca4178d3a415141f6b274b60e5ec3cf","source":{"kind":"arxiv","id":"1507.00687","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00687","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00687v2","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00687","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"XPYDEJO5I7S2","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XPYDEJO5I7S2YHSJ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XPYDEJO5","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XPYDEJO5I7S2YHSJ6J6AEM7M5A","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-02T18:42:28Z","cross_cats_sorted":[],"title_canon_sha256":"caf1ef15ee13734a629b1c9b2a8e41aaff9dfdd92c869b8bd9489e41746c2306","abstract_canon_sha256":"ade18f3867534a338ed5dc30ca27f0c2d31e5a89d669345805e49c8beff3f211"},"schema_version":"1.0"},"canonical_sha256":"bbf03225dd47e5ac1e49f27c0233ece83ca4178d3a415141f6b274b60e5ec3cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:38.517663Z","signature_b64":"DhxmlSQ0y3F9yc8iEe2B0+GnAzp+b1RMnWfDyMT2eynZrZEOxClKNxzrPNxOX2zw9qFcxKAdsPlKW4712/scAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbf03225dd47e5ac1e49f27c0233ece83ca4178d3a415141f6b274b60e5ec3cf","last_reissued_at":"2026-05-18T01:10:38.517201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:38.517201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00687","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-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRNhQ6XuI4lMKzHp/N8zj9A654OLLbA5EarehDORO6Luiclqn0wUlhTe2eYeb5TK3PargOcf5GELjRnXAE5/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:36:12.742817Z"},"content_sha256":"5ed77518f5dd1a552d0ab15d1dc8fef1ef1a03b3f0196c3b8a4a486868c37194","schema_version":"1.0","event_id":"sha256:5ed77518f5dd1a552d0ab15d1dc8fef1ef1a03b3f0196c3b8a4a486868c37194"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XPYDEJO5I7S2YHSJ6J6AEM7M5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the numerical stability of fast matrix multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Alex Druinsky, Austin R. Benson, Benjamin Lipshitz, Grey Ballard, Oded Schwartz","submitted_at":"2015-07-02T18:42:28Z","abstract_excerpt":"Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00687","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-18T01:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"su3qMBTs7fyISaBul3pNV8VM10I+l7GGVw2AIVfr2brJdgeAn1/dGO6gpkXrfI3lCVs4NeXkUegzxMprVQ2IAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:36:12.743239Z"},"content_sha256":"19fdd313f0f0aba12a2c21e8e5783acb69f8aebff86087e19203918ac464e8e4","schema_version":"1.0","event_id":"sha256:19fdd313f0f0aba12a2c21e8e5783acb69f8aebff86087e19203918ac464e8e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPYDEJO5I7S2YHSJ6J6AEM7M5A/bundle.json","state_url":"https://pith.science/pith/XPYDEJO5I7S2YHSJ6J6AEM7M5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPYDEJO5I7S2YHSJ6J6AEM7M5A/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-31T13:36:12Z","links":{"resolver":"https://pith.science/pith/XPYDEJO5I7S2YHSJ6J6AEM7M5A","bundle":"https://pith.science/pith/XPYDEJO5I7S2YHSJ6J6AEM7M5A/bundle.json","state":"https://pith.science/pith/XPYDEJO5I7S2YHSJ6J6AEM7M5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPYDEJO5I7S2YHSJ6J6AEM7M5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XPYDEJO5I7S2YHSJ6J6AEM7M5A","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":"ade18f3867534a338ed5dc30ca27f0c2d31e5a89d669345805e49c8beff3f211","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-02T18:42:28Z","title_canon_sha256":"caf1ef15ee13734a629b1c9b2a8e41aaff9dfdd92c869b8bd9489e41746c2306"},"schema_version":"1.0","source":{"id":"1507.00687","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00687","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00687v2","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00687","created_at":"2026-05-18T01:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"XPYDEJO5I7S2","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XPYDEJO5I7S2YHSJ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XPYDEJO5","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:19fdd313f0f0aba12a2c21e8e5783acb69f8aebff86087e19203918ac464e8e4","target":"graph","created_at":"2026-05-18T01:10:38Z","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":"Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used ","authors_text":"Alex Druinsky, Austin R. Benson, Benjamin Lipshitz, Grey Ballard, Oded Schwartz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-02T18:42:28Z","title":"Improving the numerical stability of fast matrix multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00687","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:5ed77518f5dd1a552d0ab15d1dc8fef1ef1a03b3f0196c3b8a4a486868c37194","target":"record","created_at":"2026-05-18T01:10:38Z","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":"ade18f3867534a338ed5dc30ca27f0c2d31e5a89d669345805e49c8beff3f211","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-02T18:42:28Z","title_canon_sha256":"caf1ef15ee13734a629b1c9b2a8e41aaff9dfdd92c869b8bd9489e41746c2306"},"schema_version":"1.0","source":{"id":"1507.00687","kind":"arxiv","version":2}},"canonical_sha256":"bbf03225dd47e5ac1e49f27c0233ece83ca4178d3a415141f6b274b60e5ec3cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbf03225dd47e5ac1e49f27c0233ece83ca4178d3a415141f6b274b60e5ec3cf","first_computed_at":"2026-05-18T01:10:38.517201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:38.517201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DhxmlSQ0y3F9yc8iEe2B0+GnAzp+b1RMnWfDyMT2eynZrZEOxClKNxzrPNxOX2zw9qFcxKAdsPlKW4712/scAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:38.517663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00687","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ed77518f5dd1a552d0ab15d1dc8fef1ef1a03b3f0196c3b8a4a486868c37194","sha256:19fdd313f0f0aba12a2c21e8e5783acb69f8aebff86087e19203918ac464e8e4"],"state_sha256":"50c57f0fad49c1a1bf0b05dd1989120eb0d81f769722447736689aab86610606"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AK8gDcIyvHUQgwrdPj9inWC3v1EMm58QJscyCM39frhLMREgJiKtXB7PCtmsalMtgr+JUBSblBcroM0xpCP4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:36:12.746385Z","bundle_sha256":"a4a3c04d680a13fec5ac94fec8e417950d8f77977b7396e31c25e99c392b27c7"}}