{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EWERHLKXVKBJUYMRJM2FTK5YBB","short_pith_number":"pith:EWERHLKX","canonical_record":{"source":{"id":"1811.02725","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T02:11:39Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"42ca8d00bf8c554dcf27307b51b0727b85d4fc14f383e0f089f1bdd160d4582e","abstract_canon_sha256":"83c22c805321ba91e17c97e3b0fbd4fd2ca367ae7e9b3b13b42cb05ed1e6ff11"},"schema_version":"1.0"},"canonical_sha256":"258913ad57aa829a61914b3459abb80867e1668bf89f08fb5afd7a3008ede140","source":{"kind":"arxiv","id":"1811.02725","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02725","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02725v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02725","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"EWERHLKXVKBJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EWERHLKXVKBJUYMR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EWERHLKX","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EWERHLKXVKBJUYMRJM2FTK5YBB","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02725","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T02:11:39Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"42ca8d00bf8c554dcf27307b51b0727b85d4fc14f383e0f089f1bdd160d4582e","abstract_canon_sha256":"83c22c805321ba91e17c97e3b0fbd4fd2ca367ae7e9b3b13b42cb05ed1e6ff11"},"schema_version":"1.0"},"canonical_sha256":"258913ad57aa829a61914b3459abb80867e1668bf89f08fb5afd7a3008ede140","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:02.390611Z","signature_b64":"QCjhxT454TI2TdQnKbdqyWRHqH2jRhL1zqKaxzdFAmKhhx5LcIkXO5/2i5cJO93fh8OhTQA5KjmvnH6cG8PFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"258913ad57aa829a61914b3459abb80867e1668bf89f08fb5afd7a3008ede140","last_reissued_at":"2026-05-17T23:54:02.389872Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:02.389872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02725","source_version":3,"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-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lua+zPaYADkwbk3vhBM6WA9PTnczA9K49Op9+pZ5Dz6slPjbgcg92bpsOzisILFgcpJkoDUvz2LRZQ61T+4lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:47:21.404173Z"},"content_sha256":"867ba10cc21e70c3ec54a02dc228c093614a7e0c10d9ff2c2aeaf311998ce9a4","schema_version":"1.0","event_id":"sha256:867ba10cc21e70c3ec54a02dc228c093614a7e0c10d9ff2c2aeaf311998ce9a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EWERHLKXVKBJUYMRJM2FTK5YBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Static Data Structure Lower Bounds Imply Rigidity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Alexander Golovnev, Omri Weinstein, Zeev Dvir","submitted_at":"2018-11-07T02:11:39Z","abstract_excerpt":"We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \\geq \\omega(\\log^2 n)$ on the cell-probe complexity of linear data structures in the group model, even against arbitrarily small linear space $(s= (1+\\varepsilon)n)$, would already imply a semi-explicit ($\\bf P^{NP}\\rm$) construction of rigid matrices with significantly better parameters than the current state of art (Alon, Panigrahy and Yekhanin, 2009). Our results further assert that polynomial ($t\\geq n^{\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02725","kind":"arxiv","version":3},"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-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rkrHTOOFVNLfn+CXeXlUXze+VEFCwofgMpJC9IHPHOD6uhhUENbxWRUSFf3Yig8cWsO34uo39vE/E1eYa1EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:47:21.404833Z"},"content_sha256":"52b3ca3e8eed2d14eae07d58b15f6a56363f69a5bbb8297e30f6163c35f2c8e1","schema_version":"1.0","event_id":"sha256:52b3ca3e8eed2d14eae07d58b15f6a56363f69a5bbb8297e30f6163c35f2c8e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWERHLKXVKBJUYMRJM2FTK5YBB/bundle.json","state_url":"https://pith.science/pith/EWERHLKXVKBJUYMRJM2FTK5YBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWERHLKXVKBJUYMRJM2FTK5YBB/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-20T03:47:21Z","links":{"resolver":"https://pith.science/pith/EWERHLKXVKBJUYMRJM2FTK5YBB","bundle":"https://pith.science/pith/EWERHLKXVKBJUYMRJM2FTK5YBB/bundle.json","state":"https://pith.science/pith/EWERHLKXVKBJUYMRJM2FTK5YBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWERHLKXVKBJUYMRJM2FTK5YBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EWERHLKXVKBJUYMRJM2FTK5YBB","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":"83c22c805321ba91e17c97e3b0fbd4fd2ca367ae7e9b3b13b42cb05ed1e6ff11","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T02:11:39Z","title_canon_sha256":"42ca8d00bf8c554dcf27307b51b0727b85d4fc14f383e0f089f1bdd160d4582e"},"schema_version":"1.0","source":{"id":"1811.02725","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02725","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02725v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02725","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"EWERHLKXVKBJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EWERHLKXVKBJUYMR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EWERHLKX","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:52b3ca3e8eed2d14eae07d58b15f6a56363f69a5bbb8297e30f6163c35f2c8e1","target":"graph","created_at":"2026-05-17T23:54:02Z","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":"We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \\geq \\omega(\\log^2 n)$ on the cell-probe complexity of linear data structures in the group model, even against arbitrarily small linear space $(s= (1+\\varepsilon)n)$, would already imply a semi-explicit ($\\bf P^{NP}\\rm$) construction of rigid matrices with significantly better parameters than the current state of art (Alon, Panigrahy and Yekhanin, 2009). Our results further assert that polynomial ($t\\geq n^{\\","authors_text":"Alexander Golovnev, Omri Weinstein, Zeev Dvir","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T02:11:39Z","title":"Static Data Structure Lower Bounds Imply Rigidity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02725","kind":"arxiv","version":3},"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:867ba10cc21e70c3ec54a02dc228c093614a7e0c10d9ff2c2aeaf311998ce9a4","target":"record","created_at":"2026-05-17T23:54:02Z","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":"83c22c805321ba91e17c97e3b0fbd4fd2ca367ae7e9b3b13b42cb05ed1e6ff11","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T02:11:39Z","title_canon_sha256":"42ca8d00bf8c554dcf27307b51b0727b85d4fc14f383e0f089f1bdd160d4582e"},"schema_version":"1.0","source":{"id":"1811.02725","kind":"arxiv","version":3}},"canonical_sha256":"258913ad57aa829a61914b3459abb80867e1668bf89f08fb5afd7a3008ede140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"258913ad57aa829a61914b3459abb80867e1668bf89f08fb5afd7a3008ede140","first_computed_at":"2026-05-17T23:54:02.389872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:02.389872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QCjhxT454TI2TdQnKbdqyWRHqH2jRhL1zqKaxzdFAmKhhx5LcIkXO5/2i5cJO93fh8OhTQA5KjmvnH6cG8PFAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:02.390611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02725","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:867ba10cc21e70c3ec54a02dc228c093614a7e0c10d9ff2c2aeaf311998ce9a4","sha256:52b3ca3e8eed2d14eae07d58b15f6a56363f69a5bbb8297e30f6163c35f2c8e1"],"state_sha256":"93d17821953c0acecf5dfd8a8f99b416527741af543d0cbc6db0cae40ed009cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDTK++kJgXqGsm1G3LT1ymv4VBDh/wSA+UvwagyoAztNanu7oDqwo5oxuBTuTpOlNJJpSwbCdxlL8reyJrRdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T03:47:21.408802Z","bundle_sha256":"df832f0a5c606755c0fd001d1e1649d3dad8aae57cb81c8ac54ea3ac8eeb8d7d"}}