{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VEYFM4F6OLIIL5BV2HQU6I722J","short_pith_number":"pith:VEYFM4F6","schema_version":"1.0","canonical_sha256":"a9305670be72d085f435d1e14f23fad26dbb6dbfd4aada529b383fe944a3bcf5","source":{"kind":"arxiv","id":"1602.00435","version":2},"attestation_state":"computed","paper":{"title":"Efficiently Correcting Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Lingas, Christos Levcopoulos, Leszek Gasieniec, Rasmus Pagh, Takeshi Tokuyama","submitted_at":"2016-02-01T09:17:13Z","abstract_excerpt":"We study the problem of efficiently correcting an erroneous product of two $n\\times n$ matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most $k$ erroneous entries running in $\\tilde{O}(n^2+kn)$ time and a deterministic $\\tilde{O}(kn^2)$-time algorithm for this problem (where the notation $\\tilde{O}$ suppresses polylogarithmic terms in $n$ and $k$)."},"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":"1602.00435","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-01T09:17:13Z","cross_cats_sorted":[],"title_canon_sha256":"ecf9dbb4a057e241251d502ca0ce663512e45c53541c4112e43dadcb15c6d300","abstract_canon_sha256":"12970e383e00a65865ec362201fb5bf81e0e1a686eb682a0a5d899092e2f2e75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:32.383818Z","signature_b64":"y7aBjDg+GemvFO17vlvdcH2vP5SAuH29D70F7P9IjNeLzJdoZAhsLk7SQQu7lqZPcSh7VwVfZDOwyoIId2GVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9305670be72d085f435d1e14f23fad26dbb6dbfd4aada529b383fe944a3bcf5","last_reissued_at":"2026-05-18T01:08:32.383129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:32.383129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Correcting Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Lingas, Christos Levcopoulos, Leszek Gasieniec, Rasmus Pagh, Takeshi Tokuyama","submitted_at":"2016-02-01T09:17:13Z","abstract_excerpt":"We study the problem of efficiently correcting an erroneous product of two $n\\times n$ matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most $k$ erroneous entries running in $\\tilde{O}(n^2+kn)$ time and a deterministic $\\tilde{O}(kn^2)$-time algorithm for this problem (where the notation $\\tilde{O}$ suppresses polylogarithmic terms in $n$ and $k$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00435","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.00435","created_at":"2026-05-18T01:08:32.383225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00435v2","created_at":"2026-05-18T01:08:32.383225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00435","created_at":"2026-05-18T01:08:32.383225+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEYFM4F6OLII","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEYFM4F6OLIIL5BV","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEYFM4F6","created_at":"2026-05-18T12:30:48.956258+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/VEYFM4F6OLIIL5BV2HQU6I722J","json":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J.json","graph_json":"https://pith.science/api/pith-number/VEYFM4F6OLIIL5BV2HQU6I722J/graph.json","events_json":"https://pith.science/api/pith-number/VEYFM4F6OLIIL5BV2HQU6I722J/events.json","paper":"https://pith.science/paper/VEYFM4F6"},"agent_actions":{"view_html":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J","download_json":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J.json","view_paper":"https://pith.science/paper/VEYFM4F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00435&json=true","fetch_graph":"https://pith.science/api/pith-number/VEYFM4F6OLIIL5BV2HQU6I722J/graph.json","fetch_events":"https://pith.science/api/pith-number/VEYFM4F6OLIIL5BV2HQU6I722J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J/action/storage_attestation","attest_author":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J/action/author_attestation","sign_citation":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J/action/citation_signature","submit_replication":"https://pith.science/pith/VEYFM4F6OLIIL5BV2HQU6I722J/action/replication_record"}},"created_at":"2026-05-18T01:08:32.383225+00:00","updated_at":"2026-05-18T01:08:32.383225+00:00"}