{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C6FFGPCLKYOGL5LOYAHB4RZCKX","short_pith_number":"pith:C6FFGPCL","canonical_record":{"source":{"id":"1511.06773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-20T21:08:18Z","cross_cats_sorted":[],"title_canon_sha256":"fb6fafced42c6fffeedacd20333555d52182cf749ce98a0f9542f006f2b8d627","abstract_canon_sha256":"ffce340d71b481a51fdd62a8260bec147e30e6064bcf8a1dd0a1be3347bbdb26"},"schema_version":"1.0"},"canonical_sha256":"178a533c4b561c65f56ec00e1e472255f32e94fd6b919cd4ec8b1ce17afacf13","source":{"kind":"arxiv","id":"1511.06773","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C6FFGPCLKYOGL5LOYAHB4RZCKX","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-20T21:08:18Z","cross_cats_sorted":[],"title_canon_sha256":"fb6fafced42c6fffeedacd20333555d52182cf749ce98a0f9542f006f2b8d627","abstract_canon_sha256":"ffce340d71b481a51fdd62a8260bec147e30e6064bcf8a1dd0a1be3347bbdb26"},"schema_version":"1.0"},"canonical_sha256":"178a533c4b561c65f56ec00e1e472255f32e94fd6b919cd4ec8b1ce17afacf13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:19.503158Z","signature_b64":"gR8CDsiFyq7zulNC0oVFOfoGvNX6wSqMnbEekASIKg4Ku+ZXs8d/47IjH9Z992A3PzRBiFv/PZ7ipkaVyhN8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"178a533c4b561c65f56ec00e1e472255f32e94fd6b919cd4ec8b1ce17afacf13","last_reissued_at":"2026-05-18T01:26:19.502527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:19.502527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06773","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-18T01:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVNOwH+1jtkUU1gstVFbBMo8v6UtlaamWM+Sz/bLQeH8jaUqn+XcGQ2Zv1VoMbsoW4mPWQm01RQh1QIDxW+mAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:48:49.237401Z"},"content_sha256":"d1fa2ea90c369363e10e835a002894a97a54c6e0a687fe3da2dff6fb77942e68","schema_version":"1.0","event_id":"sha256:d1fa2ea90c369363e10e835a002894a97a54c6e0a687fe3da2dff6fb77942e68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C6FFGPCLKYOGL5LOYAHB4RZCKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger, Thatchaphol Saranurak","submitted_at":"2015-11-20T21:08:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06773","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-18T01:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5mnIMwzXOxcyoYAW5n8buZYorMZWDN0/BZoograPg9vnGIJiuBK9nPdEGXdrHpan8VGtFVzvVk0WhB/q+06DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:48:49.237770Z"},"content_sha256":"27866256291bdd3354f150919f4d99b36d003747eb65bb1d4622952536ae90d7","schema_version":"1.0","event_id":"sha256:27866256291bdd3354f150919f4d99b36d003747eb65bb1d4622952536ae90d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/bundle.json","state_url":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/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-27T06:48:49Z","links":{"resolver":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX","bundle":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/bundle.json","state":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tx1fvJ5gYhVXR23Pwx3XG125l68uu99u4jEpDfucHYcRs0pxRqeZ9VYtYS4KXiSJOe3OJ+PrivfuVXSc0SXUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:48:49.240696Z","bundle_sha256":"542816b34de526c2afc39d3f16862647067bb70c2c545ddf55d3f6e300745f31"}}