{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RVGOJGCWLNJ3XORLNRUNHVLSZY","short_pith_number":"pith:RVGOJGCW","schema_version":"1.0","canonical_sha256":"8d4ce498565b53bbba2b6c68d3d572ce3a2fbfd92b8ff716e2bbc1ba3609ece4","source":{"kind":"arxiv","id":"1806.09189","version":1},"attestation_state":"computed","paper":{"title":"On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Marvin K\\\"unnemann","submitted_at":"2018-06-24T18:19:09Z","abstract_excerpt":"Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained reductions, we investigate the question whether the multiplication of two $n\\times n$ matrices can be performed in near-optimal nondeterministic time $\\tilde{O}(n^2)$. Since a classic algorithm due to Freivalds verifies correctness of matrix products probabilistically in time $O(n^2)$, our question is a relaxation of the open problem of derandomizing Freivalds' algorithm.\n  We discuss consequences of a positive or negative resolution of this problem and provide potential avenues towards resolving"},"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":"1806.09189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-24T18:19:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"916b9ba40ec548dc061657f5e10d338df0e45df8fedc6079bf9a38aa47077b1b","abstract_canon_sha256":"14fa64f65068352f2647cda710d5fb0986fde5a02d2aca995bd49cb171ccb889"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:30.039429Z","signature_b64":"iEKnEQU/dwH7BsO1xt2QY3+prhfdwD9rGTu0hPtrP93hv9O7Lx2F85bZ5/w3PirBXDjBhEecSnYd2qmVWb6WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d4ce498565b53bbba2b6c68d3d572ce3a2fbfd92b8ff716e2bbc1ba3609ece4","last_reissued_at":"2026-05-18T00:12:30.038927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:30.038927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Marvin K\\\"unnemann","submitted_at":"2018-06-24T18:19:09Z","abstract_excerpt":"Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained reductions, we investigate the question whether the multiplication of two $n\\times n$ matrices can be performed in near-optimal nondeterministic time $\\tilde{O}(n^2)$. Since a classic algorithm due to Freivalds verifies correctness of matrix products probabilistically in time $O(n^2)$, our question is a relaxation of the open problem of derandomizing Freivalds' algorithm.\n  We discuss consequences of a positive or negative resolution of this problem and provide potential avenues towards resolving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09189","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":"1806.09189","created_at":"2026-05-18T00:12:30.039007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09189v1","created_at":"2026-05-18T00:12:30.039007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09189","created_at":"2026-05-18T00:12:30.039007+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVGOJGCWLNJ3","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVGOJGCWLNJ3XORL","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVGOJGCW","created_at":"2026-05-18T12:32:50.500415+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/RVGOJGCWLNJ3XORLNRUNHVLSZY","json":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY.json","graph_json":"https://pith.science/api/pith-number/RVGOJGCWLNJ3XORLNRUNHVLSZY/graph.json","events_json":"https://pith.science/api/pith-number/RVGOJGCWLNJ3XORLNRUNHVLSZY/events.json","paper":"https://pith.science/paper/RVGOJGCW"},"agent_actions":{"view_html":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY","download_json":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY.json","view_paper":"https://pith.science/paper/RVGOJGCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09189&json=true","fetch_graph":"https://pith.science/api/pith-number/RVGOJGCWLNJ3XORLNRUNHVLSZY/graph.json","fetch_events":"https://pith.science/api/pith-number/RVGOJGCWLNJ3XORLNRUNHVLSZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/action/storage_attestation","attest_author":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/action/author_attestation","sign_citation":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/action/citation_signature","submit_replication":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/action/replication_record"}},"created_at":"2026-05-18T00:12:30.039007+00:00","updated_at":"2026-05-18T00:12:30.039007+00:00"}