{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NHAAWPLR7HSYMMAXLKRDQQJD4P","short_pith_number":"pith:NHAAWPLR","canonical_record":{"source":{"id":"1705.10449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T03:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"dd4c2e314b74fdbe5380d939861f9eaf50925ddb8f625b64c0c54b9933b088ec","abstract_canon_sha256":"d891e4625ca235e47851ca13bea776b1b4f6ffc796c06bfeeeef439e4d9b1d8f"},"schema_version":"1.0"},"canonical_sha256":"69c00b3d71f9e58630175aa2384123e3d5bb6a52cc06fab480525eebb27d2458","source":{"kind":"arxiv","id":"1705.10449","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10449","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10449v1","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10449","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"NHAAWPLR7HSY","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NHAAWPLR7HSYMMAX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NHAAWPLR","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NHAAWPLR7HSYMMAXLKRDQQJD4P","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T03:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"dd4c2e314b74fdbe5380d939861f9eaf50925ddb8f625b64c0c54b9933b088ec","abstract_canon_sha256":"d891e4625ca235e47851ca13bea776b1b4f6ffc796c06bfeeeef439e4d9b1d8f"},"schema_version":"1.0"},"canonical_sha256":"69c00b3d71f9e58630175aa2384123e3d5bb6a52cc06fab480525eebb27d2458","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:24.551694Z","signature_b64":"OY8mLO7/pzvmvD+GL6FrR2vBwiCDEi2lUiecyN9OvYS0t7RTrbhKrw8WL2yggPD2/K04EQNl+OOyQx73NN4VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c00b3d71f9e58630175aa2384123e3d5bb6a52cc06fab480525eebb27d2458","last_reissued_at":"2026-05-18T00:43:24.551197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:24.551197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10449","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:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idskt3gVDWYFoDF9jp2+VS1NnW2if2MLXiFFuiq5ffzNJNw5sl6RGj3DnpaFlJZi8eQJNEts0Ym8wM9U3yJ/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:09:57.702775Z"},"content_sha256":"2e87466d4f0f6688eab9c573ce20ff064397f8c659a7105f3b1c35fbc8e58922","schema_version":"1.0","event_id":"sha256:2e87466d4f0f6688eab9c573ce20ff064397f8c659a7105f3b1c35fbc8e58922"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NHAAWPLR7HSYMMAXLKRDQQJD4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gaussian Variant of Freivalds' Algorithm for Efficient and Reliable Matrix Product Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hao Ji, Michael Mascagni, Yaohang Li","submitted_at":"2017-05-30T03:46:29Z","abstract_excerpt":"In this article, we consider the general problem of checking the correctness of matrix multiplication. Given three $n \\times n$ matrices $A$, $B$, and $C$, the goal is to verify that $A \\times B=C$ without carrying out the computationally costly operations of matrix multiplication and comparing the product $A \\times B$ with $C$, term by term. This is especially important when some or all of these matrices are very large, and when the computing environment is prone to soft errors. Here we extend Freivalds' algorithm to a Gaussian Variant of Freivalds' Algorithm (GVFA) by projecting the product "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10449","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:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KVrfuHZBFuw0FEzPRcjjdjvGoS3ddOalnG/rum859miub8bjgpkLdLkDCy9OLEH83rrqUCxalbOHMTcGva0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:09:57.703119Z"},"content_sha256":"8c46bdaa1ac91e8285941e32a1f2a68d6a5241817c37e0fcfbe864d4ed95c605","schema_version":"1.0","event_id":"sha256:8c46bdaa1ac91e8285941e32a1f2a68d6a5241817c37e0fcfbe864d4ed95c605"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/bundle.json","state_url":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/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-06-01T19:09:57Z","links":{"resolver":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P","bundle":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/bundle.json","state":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NHAAWPLR7HSYMMAXLKRDQQJD4P","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":"d891e4625ca235e47851ca13bea776b1b4f6ffc796c06bfeeeef439e4d9b1d8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T03:46:29Z","title_canon_sha256":"dd4c2e314b74fdbe5380d939861f9eaf50925ddb8f625b64c0c54b9933b088ec"},"schema_version":"1.0","source":{"id":"1705.10449","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10449","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10449v1","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10449","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"NHAAWPLR7HSY","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NHAAWPLR7HSYMMAX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NHAAWPLR","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:8c46bdaa1ac91e8285941e32a1f2a68d6a5241817c37e0fcfbe864d4ed95c605","target":"graph","created_at":"2026-05-18T00:43:24Z","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 article, we consider the general problem of checking the correctness of matrix multiplication. Given three $n \\times n$ matrices $A$, $B$, and $C$, the goal is to verify that $A \\times B=C$ without carrying out the computationally costly operations of matrix multiplication and comparing the product $A \\times B$ with $C$, term by term. This is especially important when some or all of these matrices are very large, and when the computing environment is prone to soft errors. Here we extend Freivalds' algorithm to a Gaussian Variant of Freivalds' Algorithm (GVFA) by projecting the product ","authors_text":"Hao Ji, Michael Mascagni, Yaohang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T03:46:29Z","title":"Gaussian Variant of Freivalds' Algorithm for Efficient and Reliable Matrix Product Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10449","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:2e87466d4f0f6688eab9c573ce20ff064397f8c659a7105f3b1c35fbc8e58922","target":"record","created_at":"2026-05-18T00:43:24Z","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":"d891e4625ca235e47851ca13bea776b1b4f6ffc796c06bfeeeef439e4d9b1d8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T03:46:29Z","title_canon_sha256":"dd4c2e314b74fdbe5380d939861f9eaf50925ddb8f625b64c0c54b9933b088ec"},"schema_version":"1.0","source":{"id":"1705.10449","kind":"arxiv","version":1}},"canonical_sha256":"69c00b3d71f9e58630175aa2384123e3d5bb6a52cc06fab480525eebb27d2458","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69c00b3d71f9e58630175aa2384123e3d5bb6a52cc06fab480525eebb27d2458","first_computed_at":"2026-05-18T00:43:24.551197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:24.551197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OY8mLO7/pzvmvD+GL6FrR2vBwiCDEi2lUiecyN9OvYS0t7RTrbhKrw8WL2yggPD2/K04EQNl+OOyQx73NN4VAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:24.551694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10449","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e87466d4f0f6688eab9c573ce20ff064397f8c659a7105f3b1c35fbc8e58922","sha256:8c46bdaa1ac91e8285941e32a1f2a68d6a5241817c37e0fcfbe864d4ed95c605"],"state_sha256":"5aaeb78d51410e225ffb2d23ca9c7d93518a4b891653d40e0bb0776a4510c47d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDNqVa8ZPtTO5MKmUYqVi1Ttr2KDrTHuHu48be+ZQ4NjEjQVRjzxtDfpOG2oWvfqEd+jYOe6jQBZPkYrh7GJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:09:57.705127Z","bundle_sha256":"0ecc0a8f04ec0146bc11b61597959db72ed5c191a83b522b2b17de00fec5a474"}}