{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P3IPBVNO7TE5IS5C7T6G63UY5M","short_pith_number":"pith:P3IPBVNO","canonical_record":{"source":{"id":"1802.06545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T08:29:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"80eadd5630e54fbd484cd31cfcee80ccef27d1c2c7370393b242dc287fa030fc","abstract_canon_sha256":"463da77eba466ceb48bf9c7beff358ebebd8eb1a0b101735fe01d78820509743"},"schema_version":"1.0"},"canonical_sha256":"7ed0f0d5aefcc9d44ba2fcfc6f6e98eb18d914374250454142f9ade36301df5b","source":{"kind":"arxiv","id":"1802.06545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06545","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06545v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06545","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"P3IPBVNO7TE5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3IPBVNO7TE5IS5C","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3IPBVNO","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P3IPBVNO7TE5IS5C7T6G63UY5M","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T08:29:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"80eadd5630e54fbd484cd31cfcee80ccef27d1c2c7370393b242dc287fa030fc","abstract_canon_sha256":"463da77eba466ceb48bf9c7beff358ebebd8eb1a0b101735fe01d78820509743"},"schema_version":"1.0"},"canonical_sha256":"7ed0f0d5aefcc9d44ba2fcfc6f6e98eb18d914374250454142f9ade36301df5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:02.986418Z","signature_b64":"aCpITd5EBJOYmT4hoOD/tywgBe63mPMOyv+6OcbWpoUscC7Qjx2VQZCyQpP2tH/AKV8ntArF512ReYciEDeWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed0f0d5aefcc9d44ba2fcfc6f6e98eb18d914374250454142f9ade36301df5b","last_reissued_at":"2026-05-18T00:23:02.985794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:02.985794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06545","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:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kk8Z7rioz7yAlBtDRre+EmYCRxv4Iwjzboe70StTS9LecL/bnAgbFmDifPzInFErd0+ZZzF1bNgHeFe8zUu5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:14:15.700087Z"},"content_sha256":"a74374da7540fe65ccba1a02391542ac3730cc48befec71d53603f08d09bc302","schema_version":"1.0","event_id":"sha256:a74374da7540fe65ccba1a02391542ac3730cc48befec71d53603f08d09bc302"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P3IPBVNO7TE5IS5C7T6G63UY5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper and lower bounds for dynamic data structures on strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Allan Gr{\\o}nlund, Kasper Green Larsen, Raphael Clifford, Tatiana Starikovskaya","submitted_at":"2018-02-19T08:29:40Z","abstract_excerpt":"We consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the pattern of length $m$ and a substring of a longer text. We give both conditional and unconditional lower bounds for variants of exact matching with wildcards, inner product, and Hamming distance computation via a sequence of reductions. As an example, we show that there does not exist an $O(m^{1/2-\\varepsilon})$ time algorithm for a large range of these problems unless the online Boolean matrix-vector multiplication conje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06545","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:23:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBdmPxTy1rS2uiJMCVny30FP2aslKlQgPCnkDxflFaMEXZ5dLAJV7YXYSoHfAp+/IrJCCfaKRiuDk0Fue39sAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:14:15.700746Z"},"content_sha256":"5eedf821f59fd937ed14319fd22a8c937812ed5462886bb744f35cbe77518dc1","schema_version":"1.0","event_id":"sha256:5eedf821f59fd937ed14319fd22a8c937812ed5462886bb744f35cbe77518dc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3IPBVNO7TE5IS5C7T6G63UY5M/bundle.json","state_url":"https://pith.science/pith/P3IPBVNO7TE5IS5C7T6G63UY5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3IPBVNO7TE5IS5C7T6G63UY5M/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-25T01:14:15Z","links":{"resolver":"https://pith.science/pith/P3IPBVNO7TE5IS5C7T6G63UY5M","bundle":"https://pith.science/pith/P3IPBVNO7TE5IS5C7T6G63UY5M/bundle.json","state":"https://pith.science/pith/P3IPBVNO7TE5IS5C7T6G63UY5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3IPBVNO7TE5IS5C7T6G63UY5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P3IPBVNO7TE5IS5C7T6G63UY5M","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":"463da77eba466ceb48bf9c7beff358ebebd8eb1a0b101735fe01d78820509743","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T08:29:40Z","title_canon_sha256":"80eadd5630e54fbd484cd31cfcee80ccef27d1c2c7370393b242dc287fa030fc"},"schema_version":"1.0","source":{"id":"1802.06545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06545","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06545v1","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06545","created_at":"2026-05-18T00:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"P3IPBVNO7TE5","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3IPBVNO7TE5IS5C","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3IPBVNO","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:5eedf821f59fd937ed14319fd22a8c937812ed5462886bb744f35cbe77518dc1","target":"graph","created_at":"2026-05-18T00:23: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 consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the pattern of length $m$ and a substring of a longer text. We give both conditional and unconditional lower bounds for variants of exact matching with wildcards, inner product, and Hamming distance computation via a sequence of reductions. As an example, we show that there does not exist an $O(m^{1/2-\\varepsilon})$ time algorithm for a large range of these problems unless the online Boolean matrix-vector multiplication conje","authors_text":"Allan Gr{\\o}nlund, Kasper Green Larsen, Raphael Clifford, Tatiana Starikovskaya","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T08:29:40Z","title":"Upper and lower bounds for dynamic data structures on strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06545","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:a74374da7540fe65ccba1a02391542ac3730cc48befec71d53603f08d09bc302","target":"record","created_at":"2026-05-18T00:23: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":"463da77eba466ceb48bf9c7beff358ebebd8eb1a0b101735fe01d78820509743","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T08:29:40Z","title_canon_sha256":"80eadd5630e54fbd484cd31cfcee80ccef27d1c2c7370393b242dc287fa030fc"},"schema_version":"1.0","source":{"id":"1802.06545","kind":"arxiv","version":1}},"canonical_sha256":"7ed0f0d5aefcc9d44ba2fcfc6f6e98eb18d914374250454142f9ade36301df5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ed0f0d5aefcc9d44ba2fcfc6f6e98eb18d914374250454142f9ade36301df5b","first_computed_at":"2026-05-18T00:23:02.985794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:02.985794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCpITd5EBJOYmT4hoOD/tywgBe63mPMOyv+6OcbWpoUscC7Qjx2VQZCyQpP2tH/AKV8ntArF512ReYciEDeWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:02.986418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a74374da7540fe65ccba1a02391542ac3730cc48befec71d53603f08d09bc302","sha256:5eedf821f59fd937ed14319fd22a8c937812ed5462886bb744f35cbe77518dc1"],"state_sha256":"0ea5e0eb71fbfad3884e3efae3c5c5998ff9cbc045e8a46c883ddcfa483af71c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ee5NUHzg+aJ7YN/k7/+8Q9hGpdqL/VPOrM/LiRiqoCfw3zBj+91AXNq8N+8i57NVzcoMHKkxw4BkF8TirHOcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:14:15.704481Z","bundle_sha256":"f3b19e67cba4ed7d4a38be3983a55b445348a7ac4c3db149f155e6b690232aaa"}}