{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C6FFGPCLKYOGL5LOYAHB4RZCKX","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":"ffce340d71b481a51fdd62a8260bec147e30e6064bcf8a1dd0a1be3347bbdb26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-20T21:08:18Z","title_canon_sha256":"fb6fafced42c6fffeedacd20333555d52182cf749ce98a0f9542f006f2b8d627"},"schema_version":"1.0","source":{"id":"1511.06773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06773","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06773v1","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06773","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"pith_short_12","alias_value":"C6FFGPCLKYOG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C6FFGPCLKYOGL5LO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C6FFGPCL","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:27866256291bdd3354f150919f4d99b36d003747eb65bb1d4622952536ae90d7","target":"graph","created_at":"2026-05-18T01:26:19Z","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":"Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given an $n\\times n$ matrix $M$ and will receive $n$ column-vectors of size $n$, denoted by $v_1,\\ldots,v_n$, one by one. After seeing each vector $v_i$, we have to output the product $Mv_i$ before we can see the next vector. A naive algorithm can solve this problem using $O(n^3)$ time in total, and its running time can be slightly improved to $O(n^3/\\log^2 n)$ [Williams SODA'07]. We show that a conjecture that there is no truly subcubic ($O(n^{3-\\epsilon})$) time algorithm for this problem can be used to exhibi","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-20T21:08:18Z","title":"Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06773","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:d1fa2ea90c369363e10e835a002894a97a54c6e0a687fe3da2dff6fb77942e68","target":"record","created_at":"2026-05-18T01:26:19Z","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":"ffce340d71b481a51fdd62a8260bec147e30e6064bcf8a1dd0a1be3347bbdb26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-20T21:08:18Z","title_canon_sha256":"fb6fafced42c6fffeedacd20333555d52182cf749ce98a0f9542f006f2b8d627"},"schema_version":"1.0","source":{"id":"1511.06773","kind":"arxiv","version":1}},"canonical_sha256":"178a533c4b561c65f56ec00e1e472255f32e94fd6b919cd4ec8b1ce17afacf13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"178a533c4b561c65f56ec00e1e472255f32e94fd6b919cd4ec8b1ce17afacf13","first_computed_at":"2026-05-18T01:26:19.502527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:19.502527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gR8CDsiFyq7zulNC0oVFOfoGvNX6wSqMnbEekASIKg4Ku+ZXs8d/47IjH9Z992A3PzRBiFv/PZ7ipkaVyhN8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:19.503158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1fa2ea90c369363e10e835a002894a97a54c6e0a687fe3da2dff6fb77942e68","sha256:27866256291bdd3354f150919f4d99b36d003747eb65bb1d4622952536ae90d7"],"state_sha256":"2494f8079d274985925230d36423f1f3842b5897e929647c70247713ea14b3d9"}