{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NHAAWPLR7HSYMMAXLKRDQQJD4P","short_pith_number":"pith:NHAAWPLR","schema_version":"1.0","canonical_sha256":"69c00b3d71f9e58630175aa2384123e3d5bb6a52cc06fab480525eebb27d2458","source":{"kind":"arxiv","id":"1705.10449","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.10449","created_at":"2026-05-18T00:43:24.551276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10449v1","created_at":"2026-05-18T00:43:24.551276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10449","created_at":"2026-05-18T00:43:24.551276+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHAAWPLR7HSY","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHAAWPLR7HSYMMAX","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHAAWPLR","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P","json":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P.json","graph_json":"https://pith.science/api/pith-number/NHAAWPLR7HSYMMAXLKRDQQJD4P/graph.json","events_json":"https://pith.science/api/pith-number/NHAAWPLR7HSYMMAXLKRDQQJD4P/events.json","paper":"https://pith.science/paper/NHAAWPLR"},"agent_actions":{"view_html":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P","download_json":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P.json","view_paper":"https://pith.science/paper/NHAAWPLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10449&json=true","fetch_graph":"https://pith.science/api/pith-number/NHAAWPLR7HSYMMAXLKRDQQJD4P/graph.json","fetch_events":"https://pith.science/api/pith-number/NHAAWPLR7HSYMMAXLKRDQQJD4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/action/storage_attestation","attest_author":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/action/author_attestation","sign_citation":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/action/citation_signature","submit_replication":"https://pith.science/pith/NHAAWPLR7HSYMMAXLKRDQQJD4P/action/replication_record"}},"created_at":"2026-05-18T00:43:24.551276+00:00","updated_at":"2026-05-18T00:43:24.551276+00:00"}