{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7FON6IITLMYDQMMZGLXLBJOHVJ","short_pith_number":"pith:7FON6IIT","canonical_record":{"source":{"id":"1711.04467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T08:29:45Z","cross_cats_sorted":[],"title_canon_sha256":"c68e261dacdef4041929d0ccbdedbf42de66e06e3011cd848d66d4045e79fa14","abstract_canon_sha256":"3d997441dfee96220c04b8eef9032efcdc65088681dc21be7d763f6b72804db0"},"schema_version":"1.0"},"canonical_sha256":"f95cdf21135b3038319932eeb0a5c7aa418260db5832db3908d847739eaef60f","source":{"kind":"arxiv","id":"1711.04467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04467","created_at":"2026-05-18T00:30:38Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04467v1","created_at":"2026-05-18T00:30:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04467","created_at":"2026-05-18T00:30:38Z"},{"alias_kind":"pith_short_12","alias_value":"7FON6IITLMYD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7FON6IITLMYDQMMZ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7FON6IIT","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7FON6IITLMYDQMMZGLXLBJOHVJ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T08:29:45Z","cross_cats_sorted":[],"title_canon_sha256":"c68e261dacdef4041929d0ccbdedbf42de66e06e3011cd848d66d4045e79fa14","abstract_canon_sha256":"3d997441dfee96220c04b8eef9032efcdc65088681dc21be7d763f6b72804db0"},"schema_version":"1.0"},"canonical_sha256":"f95cdf21135b3038319932eeb0a5c7aa418260db5832db3908d847739eaef60f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:38.888473Z","signature_b64":"gOwHXWXmRZ5GnD9qcluvpz5/CVBVtON+rMZ2hyIAwyy3PvWDRO3PHI0IdWrjyUkOwpkEaZC8RoTUUStoT5H1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95cdf21135b3038319932eeb0a5c7aa418260db5832db3908d847739eaef60f","last_reissued_at":"2026-05-18T00:30:38.887780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:38.887780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04467","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:30:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCIB5Sf+Fe/oFvqLULY9oVtbwTaXuAXs8TQSV02htSdll9Keph/ttrbdRHJFirgIUCfhdFeNv0JRzwYFvJA/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:49:08.260067Z"},"content_sha256":"4cb691906e39bec630c880465c72a2c0842792f4d55724020a7b05dbfa74beaa","schema_version":"1.0","event_id":"sha256:4cb691906e39bec630c880465c72a2c0842792f4d55724020a7b05dbfa74beaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7FON6IITLMYDQMMZGLXLBJOHVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diptarka Chakraborty, Kasper Green Larsen, Lior Kamma","submitted_at":"2017-11-13T08:29:45Z","abstract_excerpt":"The conjectured hardness of Boolean matrix-vector multiplication has been used with great success to prove conditional lower bounds for numerous important data structure problems, see Henzinger et al. [STOC'15]. In recent work, Larsen and Williams [SODA'17] attacked the problem from the upper bound side and gave a surprising cell probe data structure (that is, we only charge for memory accesses, while computation is free). Their cell probe data structure answers queries in $\\tilde{O}(n^{7/4})$ time and is succinct in the sense that it stores the input matrix in read-only memory, plus an additi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04467","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:30:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yeMDh4Wic/lWQndRfJSRqaDAdv5s+ZIzvFvpf6Jjx8Z6/CJjsSlNCHntq51DSpWLLwIP6NSfLB2a1hfcFZtcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:49:08.260798Z"},"content_sha256":"d889a597dcde969194d89da045a831c7c79170fa9b60599a87dd486d87611de8","schema_version":"1.0","event_id":"sha256:d889a597dcde969194d89da045a831c7c79170fa9b60599a87dd486d87611de8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FON6IITLMYDQMMZGLXLBJOHVJ/bundle.json","state_url":"https://pith.science/pith/7FON6IITLMYDQMMZGLXLBJOHVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FON6IITLMYDQMMZGLXLBJOHVJ/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-06-11T08:49:08Z","links":{"resolver":"https://pith.science/pith/7FON6IITLMYDQMMZGLXLBJOHVJ","bundle":"https://pith.science/pith/7FON6IITLMYDQMMZGLXLBJOHVJ/bundle.json","state":"https://pith.science/pith/7FON6IITLMYDQMMZGLXLBJOHVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FON6IITLMYDQMMZGLXLBJOHVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7FON6IITLMYDQMMZGLXLBJOHVJ","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":"3d997441dfee96220c04b8eef9032efcdc65088681dc21be7d763f6b72804db0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T08:29:45Z","title_canon_sha256":"c68e261dacdef4041929d0ccbdedbf42de66e06e3011cd848d66d4045e79fa14"},"schema_version":"1.0","source":{"id":"1711.04467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04467","created_at":"2026-05-18T00:30:38Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04467v1","created_at":"2026-05-18T00:30:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04467","created_at":"2026-05-18T00:30:38Z"},{"alias_kind":"pith_short_12","alias_value":"7FON6IITLMYD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7FON6IITLMYDQMMZ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7FON6IIT","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:d889a597dcde969194d89da045a831c7c79170fa9b60599a87dd486d87611de8","target":"graph","created_at":"2026-05-18T00:30:38Z","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":"The conjectured hardness of Boolean matrix-vector multiplication has been used with great success to prove conditional lower bounds for numerous important data structure problems, see Henzinger et al. [STOC'15]. In recent work, Larsen and Williams [SODA'17] attacked the problem from the upper bound side and gave a surprising cell probe data structure (that is, we only charge for memory accesses, while computation is free). Their cell probe data structure answers queries in $\\tilde{O}(n^{7/4})$ time and is succinct in the sense that it stores the input matrix in read-only memory, plus an additi","authors_text":"Diptarka Chakraborty, Kasper Green Larsen, Lior Kamma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T08:29:45Z","title":"Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04467","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:4cb691906e39bec630c880465c72a2c0842792f4d55724020a7b05dbfa74beaa","target":"record","created_at":"2026-05-18T00:30:38Z","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":"3d997441dfee96220c04b8eef9032efcdc65088681dc21be7d763f6b72804db0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-13T08:29:45Z","title_canon_sha256":"c68e261dacdef4041929d0ccbdedbf42de66e06e3011cd848d66d4045e79fa14"},"schema_version":"1.0","source":{"id":"1711.04467","kind":"arxiv","version":1}},"canonical_sha256":"f95cdf21135b3038319932eeb0a5c7aa418260db5832db3908d847739eaef60f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95cdf21135b3038319932eeb0a5c7aa418260db5832db3908d847739eaef60f","first_computed_at":"2026-05-18T00:30:38.887780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:38.887780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOwHXWXmRZ5GnD9qcluvpz5/CVBVtON+rMZ2hyIAwyy3PvWDRO3PHI0IdWrjyUkOwpkEaZC8RoTUUStoT5H1BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:38.888473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cb691906e39bec630c880465c72a2c0842792f4d55724020a7b05dbfa74beaa","sha256:d889a597dcde969194d89da045a831c7c79170fa9b60599a87dd486d87611de8"],"state_sha256":"0da57f5349e2853ee01a924a2820ea79c665bba0b98ce47aafc65df2fd25b8cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lX8GcBr0L3CA3s5sqOTuAVBCuN6X300TaOcSrbjTDDfoniA5cQSgP6UKIX+OMenzlsHsp898qNZYUxdYGN01Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:49:08.264741Z","bundle_sha256":"069150a1afbb6e3623cd1aa49ee6b06247b618860f5cad6eaaa7a3569fa0a15e"}}