{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:72L45U2FA72U5C6ZT3ECA7XKS6","short_pith_number":"pith:72L45U2F","canonical_record":{"source":{"id":"1806.09646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T18:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"38850527539866403e4387abd84d984fa909307b023232c43e7b5884063c5834","abstract_canon_sha256":"161125d1018b6be5d5736bb7bacdceb8074cdc2cbc6569036662ae95acd6c9ac"},"schema_version":"1.0"},"canonical_sha256":"fe97ced34507f54e8bd99ec8207eea978b2a2cacc91341661b4ef4aac43fa608","source":{"kind":"arxiv","id":"1806.09646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09646","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09646v1","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09646","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"72L45U2FA72U","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72L45U2FA72U5C6Z","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72L45U2F","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:72L45U2FA72U5C6ZT3ECA7XKS6","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T18:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"38850527539866403e4387abd84d984fa909307b023232c43e7b5884063c5834","abstract_canon_sha256":"161125d1018b6be5d5736bb7bacdceb8074cdc2cbc6569036662ae95acd6c9ac"},"schema_version":"1.0"},"canonical_sha256":"fe97ced34507f54e8bd99ec8207eea978b2a2cacc91341661b4ef4aac43fa608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:23.872487Z","signature_b64":"c6yJXo8OPTMHgVHH1YG5mti6Q7Ff4Xs0XyWwZ/nk4N/hUrsb/ofrYehpvR0PBKhwrJjdApcILJf4GHAa7S52DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe97ced34507f54e8bd99ec8207eea978b2a2cacc91341661b4ef4aac43fa608","last_reissued_at":"2026-05-18T00:12:23.871764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:23.871764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09646","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:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnpxTXpVIh1PR8a+sMj1qJq2XjSLfeQ+xeE1oofp5OPw536jqv5/JuLBVodkJoFWr91LL/g/Wph2M9saz9sMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:28:41.424844Z"},"content_sha256":"8abecdfbaeb0aee656da451dbc2cc57a4e85a40cbd8c1f75918171267a081c40","schema_version":"1.0","event_id":"sha256:8abecdfbaeb0aee656da451dbc2cc57a4e85a40cbd8c1f75918171267a081c40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:72L45U2FA72U5C6ZT3ECA7XKS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast entropy-bounded string dictionary look-up with mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gad M. Landau, Pawe{\\l} Gawrychowski, Tatiana Starikovskaya","submitted_at":"2018-06-25T18:02:05Z","abstract_excerpt":"We revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) of $d$ strings of length $m$ and an integer $k$, we must preprocess it into a data structure to answer the following queries: Given a query string $Q$ of length $m$, find all strings in the dictionary that are at Hamming distance at most $k$ from $Q$. Chan and Lewenstein (CPM 2015) showed a data structure for $k = 1$ with optimal query time $O(m/w + occ)$, where $w$ is the size of a machine word and $occ$ is the size of the output. The data structure occupies $O(w d \\log^{1+\\varepsilon} d)$ extra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09646","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:12:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"duMermadazj3pPuiue5vEucMHp7u+k2opc4pTNQFKJ9s07WJBi2ZPOlV+92GLQ2HWy8HyD/wuFy6gIeREm9/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:28:41.425589Z"},"content_sha256":"0acf8c70980bdfd1396a91c7717090636d4e96871085cdfcc44dfcd5a30a0920","schema_version":"1.0","event_id":"sha256:0acf8c70980bdfd1396a91c7717090636d4e96871085cdfcc44dfcd5a30a0920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/bundle.json","state_url":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72L45U2FA72U5C6ZT3ECA7XKS6/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-25T21:28:41Z","links":{"resolver":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6","bundle":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/bundle.json","state":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72L45U2FA72U5C6ZT3ECA7XKS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:72L45U2FA72U5C6ZT3ECA7XKS6","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":"161125d1018b6be5d5736bb7bacdceb8074cdc2cbc6569036662ae95acd6c9ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T18:02:05Z","title_canon_sha256":"38850527539866403e4387abd84d984fa909307b023232c43e7b5884063c5834"},"schema_version":"1.0","source":{"id":"1806.09646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09646","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09646v1","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09646","created_at":"2026-05-18T00:12:23Z"},{"alias_kind":"pith_short_12","alias_value":"72L45U2FA72U","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"72L45U2FA72U5C6Z","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"72L45U2F","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:0acf8c70980bdfd1396a91c7717090636d4e96871085cdfcc44dfcd5a30a0920","target":"graph","created_at":"2026-05-18T00:12:23Z","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 revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) of $d$ strings of length $m$ and an integer $k$, we must preprocess it into a data structure to answer the following queries: Given a query string $Q$ of length $m$, find all strings in the dictionary that are at Hamming distance at most $k$ from $Q$. Chan and Lewenstein (CPM 2015) showed a data structure for $k = 1$ with optimal query time $O(m/w + occ)$, where $w$ is the size of a machine word and $occ$ is the size of the output. The data structure occupies $O(w d \\log^{1+\\varepsilon} d)$ extra","authors_text":"Gad M. Landau, Pawe{\\l} Gawrychowski, Tatiana Starikovskaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T18:02:05Z","title":"Fast entropy-bounded string dictionary look-up with mismatches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09646","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:8abecdfbaeb0aee656da451dbc2cc57a4e85a40cbd8c1f75918171267a081c40","target":"record","created_at":"2026-05-18T00:12:23Z","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":"161125d1018b6be5d5736bb7bacdceb8074cdc2cbc6569036662ae95acd6c9ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-25T18:02:05Z","title_canon_sha256":"38850527539866403e4387abd84d984fa909307b023232c43e7b5884063c5834"},"schema_version":"1.0","source":{"id":"1806.09646","kind":"arxiv","version":1}},"canonical_sha256":"fe97ced34507f54e8bd99ec8207eea978b2a2cacc91341661b4ef4aac43fa608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe97ced34507f54e8bd99ec8207eea978b2a2cacc91341661b4ef4aac43fa608","first_computed_at":"2026-05-18T00:12:23.871764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:23.871764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c6yJXo8OPTMHgVHH1YG5mti6Q7Ff4Xs0XyWwZ/nk4N/hUrsb/ofrYehpvR0PBKhwrJjdApcILJf4GHAa7S52DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:23.872487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8abecdfbaeb0aee656da451dbc2cc57a4e85a40cbd8c1f75918171267a081c40","sha256:0acf8c70980bdfd1396a91c7717090636d4e96871085cdfcc44dfcd5a30a0920"],"state_sha256":"7591f575bf29b0d3899b5688287e21d4bc31b5495e281efde9bb2dcec89159bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUgbRqQbxlOvPC6E5oeUAq2uvix1bX6QGh6t6zo2dRxX15DCzJGf4BrTHBYqdDCuchL3Y1RYURJW+6+YgdSkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:28:41.429298Z","bundle_sha256":"9a973963c0897196d84dbf44e45f108506505d037c2b2038ada777be0b141182"}}