{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VNG5UXUAINCMQSDNO7XW5UIOPF","short_pith_number":"pith:VNG5UXUA","canonical_record":{"source":{"id":"1008.1191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-08-06T13:30:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a945121448682836e4a9acf0f9de7541d11723374fd53b50496509b04c456494","abstract_canon_sha256":"9390f99187b830737e14764dcc748960f109f237a9128e6fb5a57321047028c1"},"schema_version":"1.0"},"canonical_sha256":"ab4dda5e804344c8486d77ef6ed10e795e80367352525e86cb41d67b65a41a30","source":{"kind":"arxiv","id":"1008.1191","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1191","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1191v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1191","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"VNG5UXUAINCM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VNG5UXUAINCMQSDN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VNG5UXUA","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VNG5UXUAINCMQSDNO7XW5UIOPF","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-08-06T13:30:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a945121448682836e4a9acf0f9de7541d11723374fd53b50496509b04c456494","abstract_canon_sha256":"9390f99187b830737e14764dcc748960f109f237a9128e6fb5a57321047028c1"},"schema_version":"1.0"},"canonical_sha256":"ab4dda5e804344c8486d77ef6ed10e795e80367352525e86cb41d67b65a41a30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.823786Z","signature_b64":"VemsIrVC4tNUHOSAfpUJJSlfMRBWNBAuwjbPJt1zufOydxMYxByNGtTd1UKWtkzEwjz5KVjY4eHYZAQrIOyvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab4dda5e804344c8486d77ef6ed10e795e80367352525e86cb41d67b65a41a30","last_reissued_at":"2026-05-18T04:42:03.823358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.823358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1191","source_version":2,"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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AATwyw8w0JzdsXgEqiIODU0HgNiPqkkD+vimqHCTXskZo8WHT+BaEa3fAyf17VaUkKJCMPYr0jgEn1QlqzVJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:46:35.223946Z"},"content_sha256":"74a31ffa8a00813119e14b176cfa0201bf304d04758c79135996adecdc4e9093","schema_version":"1.0","event_id":"sha256:74a31ffa8a00813119e14b176cfa0201bf304d04758c79135996adecdc4e9093"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VNG5UXUAINCMQSDNO7XW5UIOPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Fast Similarity Search in Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.IR","authors_text":"Daniel Karch, Dennis Luxen, Peter Sanders","submitted_at":"2010-08-06T13:30:31Z","abstract_excerpt":"We engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words $\\mathcal{W}$, maximum distance $d$ fixed at preprocessing time and a query word $q$, we would like to retrieve all words from $\\mathcal{W}$ that can be transformed into $q$ with $d$ or less edit operations. We present data structures that support fault tolerant queries by generating an index. On top of that, we present a generalization of the method that eases memory consumption and preprocessing time significantly. At the same time, running times of queries are virtually unaffected. We are ab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1191","kind":"arxiv","version":2},"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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpE/8IBzGoqbukc8slAxpYIcjhahqqCgGPLM7l707tDnPELM5JP5THnXbJvWbFj9YWIVfb73Uch4EyBqyeJMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:46:35.224294Z"},"content_sha256":"6c88af514d52c5bfdb1f0a0f3de036240bbc757fdc3ba2553f1d31a0627463f9","schema_version":"1.0","event_id":"sha256:6c88af514d52c5bfdb1f0a0f3de036240bbc757fdc3ba2553f1d31a0627463f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNG5UXUAINCMQSDNO7XW5UIOPF/bundle.json","state_url":"https://pith.science/pith/VNG5UXUAINCMQSDNO7XW5UIOPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNG5UXUAINCMQSDNO7XW5UIOPF/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-22T06:46:35Z","links":{"resolver":"https://pith.science/pith/VNG5UXUAINCMQSDNO7XW5UIOPF","bundle":"https://pith.science/pith/VNG5UXUAINCMQSDNO7XW5UIOPF/bundle.json","state":"https://pith.science/pith/VNG5UXUAINCMQSDNO7XW5UIOPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNG5UXUAINCMQSDNO7XW5UIOPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VNG5UXUAINCMQSDNO7XW5UIOPF","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":"9390f99187b830737e14764dcc748960f109f237a9128e6fb5a57321047028c1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-08-06T13:30:31Z","title_canon_sha256":"a945121448682836e4a9acf0f9de7541d11723374fd53b50496509b04c456494"},"schema_version":"1.0","source":{"id":"1008.1191","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1191","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1191v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1191","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"VNG5UXUAINCM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VNG5UXUAINCMQSDN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VNG5UXUA","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:6c88af514d52c5bfdb1f0a0f3de036240bbc757fdc3ba2553f1d31a0627463f9","target":"graph","created_at":"2026-05-18T04:42:03Z","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 engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words $\\mathcal{W}$, maximum distance $d$ fixed at preprocessing time and a query word $q$, we would like to retrieve all words from $\\mathcal{W}$ that can be transformed into $q$ with $d$ or less edit operations. We present data structures that support fault tolerant queries by generating an index. On top of that, we present a generalization of the method that eases memory consumption and preprocessing time significantly. At the same time, running times of queries are virtually unaffected. We are ab","authors_text":"Daniel Karch, Dennis Luxen, Peter Sanders","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-08-06T13:30:31Z","title":"Improved Fast Similarity Search in Dictionaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1191","kind":"arxiv","version":2},"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:74a31ffa8a00813119e14b176cfa0201bf304d04758c79135996adecdc4e9093","target":"record","created_at":"2026-05-18T04:42:03Z","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":"9390f99187b830737e14764dcc748960f109f237a9128e6fb5a57321047028c1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-08-06T13:30:31Z","title_canon_sha256":"a945121448682836e4a9acf0f9de7541d11723374fd53b50496509b04c456494"},"schema_version":"1.0","source":{"id":"1008.1191","kind":"arxiv","version":2}},"canonical_sha256":"ab4dda5e804344c8486d77ef6ed10e795e80367352525e86cb41d67b65a41a30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab4dda5e804344c8486d77ef6ed10e795e80367352525e86cb41d67b65a41a30","first_computed_at":"2026-05-18T04:42:03.823358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.823358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VemsIrVC4tNUHOSAfpUJJSlfMRBWNBAuwjbPJt1zufOydxMYxByNGtTd1UKWtkzEwjz5KVjY4eHYZAQrIOyvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.823786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1191","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74a31ffa8a00813119e14b176cfa0201bf304d04758c79135996adecdc4e9093","sha256:6c88af514d52c5bfdb1f0a0f3de036240bbc757fdc3ba2553f1d31a0627463f9"],"state_sha256":"f0742f3a2340bf9693c3bccdddba24beaf69c6fef551d948cf3344217a9d8aad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cd0L++mwAx8SvM3Ej52rWkV8dYftd5B7jmqmEhKw9zbrHRmaGzapfDnOhItN+TBdoaQuyzjhq76KDVNsXMigDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T06:46:35.226227Z","bundle_sha256":"c31b1cb100cb265dc3bd86463493de2e759730eb022d41a733641bd6bd18daef"}}