{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:72L45U2FA72U5C6ZT3ECA7XKS6","short_pith_number":"pith:72L45U2F","schema_version":"1.0","canonical_sha256":"fe97ced34507f54e8bd99ec8207eea978b2a2cacc91341661b4ef4aac43fa608","source":{"kind":"arxiv","id":"1806.09646","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.09646","created_at":"2026-05-18T00:12:23.871883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09646v1","created_at":"2026-05-18T00:12:23.871883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09646","created_at":"2026-05-18T00:12:23.871883+00:00"},{"alias_kind":"pith_short_12","alias_value":"72L45U2FA72U","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"72L45U2FA72U5C6Z","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"72L45U2F","created_at":"2026-05-18T12:32:11.075285+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/72L45U2FA72U5C6ZT3ECA7XKS6","json":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6.json","graph_json":"https://pith.science/api/pith-number/72L45U2FA72U5C6ZT3ECA7XKS6/graph.json","events_json":"https://pith.science/api/pith-number/72L45U2FA72U5C6ZT3ECA7XKS6/events.json","paper":"https://pith.science/paper/72L45U2F"},"agent_actions":{"view_html":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6","download_json":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6.json","view_paper":"https://pith.science/paper/72L45U2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09646&json=true","fetch_graph":"https://pith.science/api/pith-number/72L45U2FA72U5C6ZT3ECA7XKS6/graph.json","fetch_events":"https://pith.science/api/pith-number/72L45U2FA72U5C6ZT3ECA7XKS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/action/storage_attestation","attest_author":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/action/author_attestation","sign_citation":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/action/citation_signature","submit_replication":"https://pith.science/pith/72L45U2FA72U5C6ZT3ECA7XKS6/action/replication_record"}},"created_at":"2026-05-18T00:12:23.871883+00:00","updated_at":"2026-05-18T00:12:23.871883+00:00"}