{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BFTYAV4NPXNUTFVFWF7LEQHXTX","short_pith_number":"pith:BFTYAV4N","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"},"canonical_sha256":"096780578d7ddb4996a5b17eb240f79deff26570e0f2a1f794719f3dafc723fe","source":{"kind":"arxiv","id":"1501.04948","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04948","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04948v4","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04948","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"BFTYAV4NPXNU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BFTYAV4NPXNUTFVF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BFTYAV4N","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BFTYAV4NPXNUTFVFWF7LEQHXTX","target":"record","payload":{"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"},"canonical_sha256":"096780578d7ddb4996a5b17eb240f79deff26570e0f2a1f794719f3dafc723fe","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"},"source_kind":"arxiv","source_id":"1501.04948","source_version":4,"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-18T01:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZF900hVlmlkY88+cmevOJi7T5ZESPx0Dm4Lf/iUL17e7WA9MWxRkOE8tY1KWtyuALHaYG2OSB8RwYyYgI+9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:57:22.819027Z"},"content_sha256":"94b57f003cd6f19795859484e5648780651a3a469fc08116bdf5a91b71c55b43","schema_version":"1.0","event_id":"sha256:94b57f003cd6f19795859484e5648780651a3a469fc08116bdf5a91b71c55b43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BFTYAV4NPXNUTFVFWF7LEQHXTX","target":"graph","payload":{"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"},"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-18T01:20:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVxuGvWDchZbqtSRcZRNbtB9peKbolkoDhV6pg4AXkQK+FH3Kzw53B23EQW19ZDOCvTbuC26Ot8b51P+PITEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:57:22.819606Z"},"content_sha256":"be0eb193f5694a829af6b2c19010c4ffe68ceefee65c94c5bf533e8458e9c131","schema_version":"1.0","event_id":"sha256:be0eb193f5694a829af6b2c19010c4ffe68ceefee65c94c5bf533e8458e9c131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/bundle.json","state_url":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/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-06-21T21:57:22Z","links":{"resolver":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX","bundle":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/bundle.json","state":"https://pith.science/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFTYAV4NPXNUTFVFWF7LEQHXTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BFTYAV4NPXNUTFVFWF7LEQHXTX","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":"24f630896ac3fd711a56ead9a1a341cb6410433ee3692d7c1afb9a071cacc527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-20T20:32:45Z","title_canon_sha256":"1afa49080acf4aedc394e7aa765f6796dce3607b232bb7ca70bfd4e9dde07a53"},"schema_version":"1.0","source":{"id":"1501.04948","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04948","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04948v4","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04948","created_at":"2026-05-18T01:20:56Z"},{"alias_kind":"pith_short_12","alias_value":"BFTYAV4NPXNU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BFTYAV4NPXNUTFVF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BFTYAV4N","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:be0eb193f5694a829af6b2c19010c4ffe68ceefee65c94c5bf533e8458e9c131","target":"graph","created_at":"2026-05-18T01:20:56Z","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":"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","authors_text":"Aleksander Cis{\\l}ak, Szymon Grabowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-20T20:32:45Z","title":"A practical index for approximate dictionary matching with few mismatches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04948","kind":"arxiv","version":4},"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:94b57f003cd6f19795859484e5648780651a3a469fc08116bdf5a91b71c55b43","target":"record","created_at":"2026-05-18T01:20:56Z","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":"24f630896ac3fd711a56ead9a1a341cb6410433ee3692d7c1afb9a071cacc527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-20T20:32:45Z","title_canon_sha256":"1afa49080acf4aedc394e7aa765f6796dce3607b232bb7ca70bfd4e9dde07a53"},"schema_version":"1.0","source":{"id":"1501.04948","kind":"arxiv","version":4}},"canonical_sha256":"096780578d7ddb4996a5b17eb240f79deff26570e0f2a1f794719f3dafc723fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"096780578d7ddb4996a5b17eb240f79deff26570e0f2a1f794719f3dafc723fe","first_computed_at":"2026-05-18T01:20:56.112575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:56.112575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1pr2mpHBdpSbG2MDBvgc6gVdtNA51WlJUv1XOM5mj3bdUosHrAmYEWedlw/ywO7M6CUXZ9wJ/m9j12twpcMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:56.113137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04948","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94b57f003cd6f19795859484e5648780651a3a469fc08116bdf5a91b71c55b43","sha256:be0eb193f5694a829af6b2c19010c4ffe68ceefee65c94c5bf533e8458e9c131"],"state_sha256":"7682cda89596ee87c956940b5a260bb01ea6a0d885bb5dda25bd7ddcbf77cdd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uv4bSVGqLv6ajWcyx1e1hTqM1r5zpKFqLr+w4Rou9AtTkuHnngVLKnoWJ5Dz1tgRLRdoO4LS1P5Ninx4PJDZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:57:22.822156Z","bundle_sha256":"006652a652f8288a878ecf43be7f217bfa6f6076474e8ac90b9b39be1ee26b09"}}