{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BFTYAV4NPXNUTFVFWF7LEQHXTX","short_pith_number":"pith:BFTYAV4N","schema_version":"1.0","canonical_sha256":"096780578d7ddb4996a5b17eb240f79deff26570e0f2a1f794719f3dafc723fe","source":{"kind":"arxiv","id":"1501.04948","version":4},"attestation_state":"computed","paper":{"title":"A practical index for approximate dictionary matching with few mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Cis{\\l}ak, Szymon Grabowski","submitted_at":"2015-01-20T20:32:45Z","abstract_excerpt":"Approximate dictionary matching is a classic string matching problem (checking if a query string occurs in a collection of strings) with applications in, e.g., spellchecking, online catalogs, geolocation, and web searchers. We present a surprisingly simple solution called a split index, which is based on the Dirichlet principle, for matching a keyword with few mismatches, and experimentally show that it offers competitive space-time tradeoffs. Our implementation in the C++ language is focused mostly on data compaction, which is beneficial for the search speed (e.g., by being cache friendly). W"},"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":"1501.04948","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-20T20:32:45Z","cross_cats_sorted":[],"title_canon_sha256":"1afa49080acf4aedc394e7aa765f6796dce3607b232bb7ca70bfd4e9dde07a53","abstract_canon_sha256":"24f630896ac3fd711a56ead9a1a341cb6410433ee3692d7c1afb9a071cacc527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:56.113137Z","signature_b64":"a1pr2mpHBdpSbG2MDBvgc6gVdtNA51WlJUv1XOM5mj3bdUosHrAmYEWedlw/ywO7M6CUXZ9wJ/m9j12twpcMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"096780578d7ddb4996a5b17eb240f79deff26570e0f2a1f794719f3dafc723fe","last_reissued_at":"2026-05-18T01:20:56.112575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:56.112575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A practical index for approximate dictionary matching with few mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Cis{\\l}ak, Szymon Grabowski","submitted_at":"2015-01-20T20:32:45Z","abstract_excerpt":"Approximate dictionary matching is a classic string matching problem (checking if a query string occurs in a collection of strings) with applications in, e.g., spellchecking, online catalogs, geolocation, and web searchers. We present a surprisingly simple solution called a split index, which is based on the Dirichlet principle, for matching a keyword with few mismatches, and experimentally show that it offers competitive space-time tradeoffs. Our implementation in the C++ language is focused mostly on data compaction, which is beneficial for the search speed (e.g., by being cache friendly). W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04948","kind":"arxiv","version":4},"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":"1501.04948","created_at":"2026-05-18T01:20:56.112667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04948v4","created_at":"2026-05-18T01:20:56.112667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04948","created_at":"2026-05-18T01:20:56.112667+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFTYAV4NPXNU","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFTYAV4NPXNUTFVF","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFTYAV4N","created_at":"2026-05-18T12:29:14.074870+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/BFTYAV4NPXNUTFVFWF7LEQHXTX","json":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX.json","graph_json":"https://pith.science/api/pith-number/BFTYAV4NPXNUTFVFWF7LEQHXTX/graph.json","events_json":"https://pith.science/api/pith-number/BFTYAV4NPXNUTFVFWF7LEQHXTX/events.json","paper":"https://pith.science/paper/BFTYAV4N"},"agent_actions":{"view_html":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX","download_json":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX.json","view_paper":"https://pith.science/paper/BFTYAV4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04948&json=true","fetch_graph":"https://pith.science/api/pith-number/BFTYAV4NPXNUTFVFWF7LEQHXTX/graph.json","fetch_events":"https://pith.science/api/pith-number/BFTYAV4NPXNUTFVFWF7LEQHXTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/action/storage_attestation","attest_author":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/action/author_attestation","sign_citation":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/action/citation_signature","submit_replication":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/action/replication_record"}},"created_at":"2026-05-18T01:20:56.112667+00:00","updated_at":"2026-05-18T01:20:56.112667+00:00"}