{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C6FFGPCLKYOGL5LOYAHB4RZCKX","short_pith_number":"pith:C6FFGPCL","schema_version":"1.0","canonical_sha256":"178a533c4b561c65f56ec00e1e472255f32e94fd6b919cd4ec8b1ce17afacf13","source":{"kind":"arxiv","id":"1511.06773","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.06773","created_at":"2026-05-18T01:26:19.502624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06773v1","created_at":"2026-05-18T01:26:19.502624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06773","created_at":"2026-05-18T01:26:19.502624+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6FFGPCLKYOG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6FFGPCLKYOGL5LO","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6FFGPCL","created_at":"2026-05-18T12:29:14.074870+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/C6FFGPCLKYOGL5LOYAHB4RZCKX","json":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX.json","graph_json":"https://pith.science/api/pith-number/C6FFGPCLKYOGL5LOYAHB4RZCKX/graph.json","events_json":"https://pith.science/api/pith-number/C6FFGPCLKYOGL5LOYAHB4RZCKX/events.json","paper":"https://pith.science/paper/C6FFGPCL"},"agent_actions":{"view_html":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX","download_json":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX.json","view_paper":"https://pith.science/paper/C6FFGPCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06773&json=true","fetch_graph":"https://pith.science/api/pith-number/C6FFGPCLKYOGL5LOYAHB4RZCKX/graph.json","fetch_events":"https://pith.science/api/pith-number/C6FFGPCLKYOGL5LOYAHB4RZCKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/action/storage_attestation","attest_author":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/action/author_attestation","sign_citation":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/action/citation_signature","submit_replication":"https://pith.science/pith/C6FFGPCLKYOGL5LOYAHB4RZCKX/action/replication_record"}},"created_at":"2026-05-18T01:26:19.502624+00:00","updated_at":"2026-05-18T01:26:19.502624+00:00"}