{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RVGOJGCWLNJ3XORLNRUNHVLSZY","short_pith_number":"pith:RVGOJGCW","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"},"canonical_sha256":"8d4ce498565b53bbba2b6c68d3d572ce3a2fbfd92b8ff716e2bbc1ba3609ece4","source":{"kind":"arxiv","id":"1806.09189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09189","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09189v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09189","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"RVGOJGCWLNJ3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RVGOJGCWLNJ3XORL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RVGOJGCW","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RVGOJGCWLNJ3XORLNRUNHVLSZY","target":"record","payload":{"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"},"canonical_sha256":"8d4ce498565b53bbba2b6c68d3d572ce3a2fbfd92b8ff716e2bbc1ba3609ece4","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"},"source_kind":"arxiv","source_id":"1806.09189","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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7710VpsW7N8DbZM0h54HC3AtYec8blX6/cmfJLpe3efqMqZ2VKVX7k7q7x5WErlPUO5ZS6J/macM2f9Oo9OVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:25:43.531714Z"},"content_sha256":"2f50cc85048a561fba8a6315df5a093d04a7e3c433730f3b45ac9258de8cbf28","schema_version":"1.0","event_id":"sha256:2f50cc85048a561fba8a6315df5a093d04a7e3c433730f3b45ac9258de8cbf28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RVGOJGCWLNJ3XORLNRUNHVLSZY","target":"graph","payload":{"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"},"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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2tKI0uaeI0uX8AoYKlYWZtn5mD1yvGfoEu7vaXnnMGa/N9zFOh0gi8yCMGSIiRsOjgr6lP0KIVgSQCTS39btCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:25:43.532095Z"},"content_sha256":"7742d3745f2b6197af07dd93715deef4d59908a20d139c6d0bc1ce451989e9f8","schema_version":"1.0","event_id":"sha256:7742d3745f2b6197af07dd93715deef4d59908a20d139c6d0bc1ce451989e9f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/bundle.json","state_url":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/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-05-25T07:25:43Z","links":{"resolver":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY","bundle":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/bundle.json","state":"https://pith.science/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVGOJGCWLNJ3XORLNRUNHVLSZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RVGOJGCWLNJ3XORLNRUNHVLSZY","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":"14fa64f65068352f2647cda710d5fb0986fde5a02d2aca995bd49cb171ccb889","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-24T18:19:09Z","title_canon_sha256":"916b9ba40ec548dc061657f5e10d338df0e45df8fedc6079bf9a38aa47077b1b"},"schema_version":"1.0","source":{"id":"1806.09189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09189","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09189v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09189","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"RVGOJGCWLNJ3","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RVGOJGCWLNJ3XORL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RVGOJGCW","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:7742d3745f2b6197af07dd93715deef4d59908a20d139c6d0bc1ce451989e9f8","target":"graph","created_at":"2026-05-18T00:12:30Z","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":"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","authors_text":"Marvin K\\\"unnemann","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-24T18:19:09Z","title":"On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09189","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:2f50cc85048a561fba8a6315df5a093d04a7e3c433730f3b45ac9258de8cbf28","target":"record","created_at":"2026-05-18T00:12:30Z","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":"14fa64f65068352f2647cda710d5fb0986fde5a02d2aca995bd49cb171ccb889","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-24T18:19:09Z","title_canon_sha256":"916b9ba40ec548dc061657f5e10d338df0e45df8fedc6079bf9a38aa47077b1b"},"schema_version":"1.0","source":{"id":"1806.09189","kind":"arxiv","version":1}},"canonical_sha256":"8d4ce498565b53bbba2b6c68d3d572ce3a2fbfd92b8ff716e2bbc1ba3609ece4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d4ce498565b53bbba2b6c68d3d572ce3a2fbfd92b8ff716e2bbc1ba3609ece4","first_computed_at":"2026-05-18T00:12:30.038927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:30.038927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iEKnEQU/dwH7BsO1xt2QY3+prhfdwD9rGTu0hPtrP93hv9O7Lx2F85bZ5/w3PirBXDjBhEecSnYd2qmVWb6WCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:30.039429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f50cc85048a561fba8a6315df5a093d04a7e3c433730f3b45ac9258de8cbf28","sha256:7742d3745f2b6197af07dd93715deef4d59908a20d139c6d0bc1ce451989e9f8"],"state_sha256":"02b764cda25cc6ac78c057debf338867f2350dfed860b1865ff024e9bb3e53ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tMs4cwlE9sgr3QIqKfxzPg+k8fPFu2PwoZQ8h8rIBtc2bp+6zdP2EUi8bvFXISj3Rg2NkO42Qftxt9EfzC/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:25:43.535329Z","bundle_sha256":"e54e500909dd5fc16f01d36584a2eeab9c014653ae802fae0f9ff14b90f42977"}}