{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5N7X5MAZSERLQDVUQCFGYYNHFA","short_pith_number":"pith:5N7X5MAZ","canonical_record":{"source":{"id":"1802.02270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-07T00:20:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5bef6d94a57187ce577d0456ab9ff3e6955376fb7b23810fda1f44774a7384bb","abstract_canon_sha256":"ffbe952c8606ad76f36eee5691eaf7defe3f9f541347ef61a3ca78e2bd60ba21"},"schema_version":"1.0"},"canonical_sha256":"eb7f7eb0199122b80eb4808a6c61a7283782a75cd90bb5160e70c9a6cd631992","source":{"kind":"arxiv","id":"1802.02270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02270","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02270v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02270","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"5N7X5MAZSERL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5N7X5MAZSERLQDVU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5N7X5MAZ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5N7X5MAZSERLQDVUQCFGYYNHFA","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-07T00:20:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5bef6d94a57187ce577d0456ab9ff3e6955376fb7b23810fda1f44774a7384bb","abstract_canon_sha256":"ffbe952c8606ad76f36eee5691eaf7defe3f9f541347ef61a3ca78e2bd60ba21"},"schema_version":"1.0"},"canonical_sha256":"eb7f7eb0199122b80eb4808a6c61a7283782a75cd90bb5160e70c9a6cd631992","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:08.731006Z","signature_b64":"7U35Ql9/3BdFfcF2h7lILDPtgcfcKMOHzJ805MqxZv69QTbFjjL+qsehUmJCBiyKs+Lj9517bSK1EOXPxhhrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb7f7eb0199122b80eb4808a6c61a7283782a75cd90bb5160e70c9a6cd631992","last_reissued_at":"2026-05-18T00:24:08.730355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:08.730355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02270","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:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIgyk85g4TpMBB0H/wfa7HhpwADqtoY0S2QRj9pYU/EPy0pYbxq16d//K64WFRq3rxs2W033FRe0CvFBosWfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:33:05.249214Z"},"content_sha256":"bb261a6010fceefa36c1f854823d155fd7403b2c304d9b2ca52b11beb38a9ebd","schema_version":"1.0","event_id":"sha256:bb261a6010fceefa36c1f854823d155fd7403b2c304d9b2ca52b11beb38a9ebd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5N7X5MAZSERLQDVUQCFGYYNHFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error correction in fast matrix multiplication and inverse","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SC","authors_text":"Daniel S. Roche","submitted_at":"2018-02-07T00:20:12Z","abstract_excerpt":"We present new algorithms to detect and correct errors in the product of two matrices, or the inverse of a matrix, over an arbitrary field. Our algorithms do not require any additional information or encoding other than the original inputs and the erroneous output. Their running time is softly linear in the number of nonzero entries in these matrices when the number of errors is sufficiently small, and they also incorporate fast matrix multiplication so that the cost scales well when the number of errors is large. These algorithms build on the recent result of Gasieniec et al (2017) on correct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02270","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:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4ORSUJ5ug7rWLu+I/7XScHM9s+1PRW0rjZpBFDojjLG056LO2r8ilYYtCvMABNy1zury1bjtI7bmE8MRdLrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:33:05.249571Z"},"content_sha256":"a1596c2c17de19b89e30d37f9f71904f0647b3de1f1922a51e9fbd99ed580e18","schema_version":"1.0","event_id":"sha256:a1596c2c17de19b89e30d37f9f71904f0647b3de1f1922a51e9fbd99ed580e18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5N7X5MAZSERLQDVUQCFGYYNHFA/bundle.json","state_url":"https://pith.science/pith/5N7X5MAZSERLQDVUQCFGYYNHFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5N7X5MAZSERLQDVUQCFGYYNHFA/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-27T16:33:05Z","links":{"resolver":"https://pith.science/pith/5N7X5MAZSERLQDVUQCFGYYNHFA","bundle":"https://pith.science/pith/5N7X5MAZSERLQDVUQCFGYYNHFA/bundle.json","state":"https://pith.science/pith/5N7X5MAZSERLQDVUQCFGYYNHFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5N7X5MAZSERLQDVUQCFGYYNHFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5N7X5MAZSERLQDVUQCFGYYNHFA","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":"ffbe952c8606ad76f36eee5691eaf7defe3f9f541347ef61a3ca78e2bd60ba21","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-07T00:20:12Z","title_canon_sha256":"5bef6d94a57187ce577d0456ab9ff3e6955376fb7b23810fda1f44774a7384bb"},"schema_version":"1.0","source":{"id":"1802.02270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02270","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02270v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02270","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"5N7X5MAZSERL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5N7X5MAZSERLQDVU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5N7X5MAZ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:a1596c2c17de19b89e30d37f9f71904f0647b3de1f1922a51e9fbd99ed580e18","target":"graph","created_at":"2026-05-18T00:24:08Z","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":"We present new algorithms to detect and correct errors in the product of two matrices, or the inverse of a matrix, over an arbitrary field. Our algorithms do not require any additional information or encoding other than the original inputs and the erroneous output. Their running time is softly linear in the number of nonzero entries in these matrices when the number of errors is sufficiently small, and they also incorporate fast matrix multiplication so that the cost scales well when the number of errors is large. These algorithms build on the recent result of Gasieniec et al (2017) on correct","authors_text":"Daniel S. Roche","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-07T00:20:12Z","title":"Error correction in fast matrix multiplication and inverse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02270","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:bb261a6010fceefa36c1f854823d155fd7403b2c304d9b2ca52b11beb38a9ebd","target":"record","created_at":"2026-05-18T00:24:08Z","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":"ffbe952c8606ad76f36eee5691eaf7defe3f9f541347ef61a3ca78e2bd60ba21","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-07T00:20:12Z","title_canon_sha256":"5bef6d94a57187ce577d0456ab9ff3e6955376fb7b23810fda1f44774a7384bb"},"schema_version":"1.0","source":{"id":"1802.02270","kind":"arxiv","version":1}},"canonical_sha256":"eb7f7eb0199122b80eb4808a6c61a7283782a75cd90bb5160e70c9a6cd631992","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb7f7eb0199122b80eb4808a6c61a7283782a75cd90bb5160e70c9a6cd631992","first_computed_at":"2026-05-18T00:24:08.730355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:08.730355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7U35Ql9/3BdFfcF2h7lILDPtgcfcKMOHzJ805MqxZv69QTbFjjL+qsehUmJCBiyKs+Lj9517bSK1EOXPxhhrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:08.731006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb261a6010fceefa36c1f854823d155fd7403b2c304d9b2ca52b11beb38a9ebd","sha256:a1596c2c17de19b89e30d37f9f71904f0647b3de1f1922a51e9fbd99ed580e18"],"state_sha256":"e70b94f63822de8624731ce5c56e746672d763d784a7a715d7970a7383688e21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9v3oR6hZ/q6678INXVZcaOfhnL1TguVk6lezN/D42Zwrz+lvVS+MpA/6l8rSY0ImXzAVv1eJwpIC/vGa9jk6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:33:05.251639Z","bundle_sha256":"aea7cc4bc71839047aa9736be0f0b4dd592616378df1d20ef55c33f7fc649463"}}