{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RFBOU4UQDGZOQBXQZGLWXV55WS","short_pith_number":"pith:RFBOU4UQ","canonical_record":{"source":{"id":"1301.0722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-01-04T13:45:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fa4030ed283a1996ea14ddb05c76c9513c406325019ffeee57ad00ff7e644b02","abstract_canon_sha256":"53ff18a0fe0e614adf626887df729e26464b49f9d967f3efa20645253c59369b"},"schema_version":"1.0"},"canonical_sha256":"8942ea729019b2e806f0c9976bd7bdb4b35c0a887609837f8d699fe0ed12b805","source":{"kind":"arxiv","id":"1301.0722","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0722","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0722v2","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0722","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"RFBOU4UQDGZO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RFBOU4UQDGZOQBXQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RFBOU4UQ","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RFBOU4UQDGZOQBXQZGLWXV55WS","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-01-04T13:45:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fa4030ed283a1996ea14ddb05c76c9513c406325019ffeee57ad00ff7e644b02","abstract_canon_sha256":"53ff18a0fe0e614adf626887df729e26464b49f9d967f3efa20645253c59369b"},"schema_version":"1.0"},"canonical_sha256":"8942ea729019b2e806f0c9976bd7bdb4b35c0a887609837f8d699fe0ed12b805","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.894646Z","signature_b64":"CE7f70ME5yHv+sXdJIisJ1SzQW56fenM74TSvYpMq0BiHRu8T3uq33DEu8B4jxo9UUXsdwgbnKgvyQsdwO/iBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8942ea729019b2e806f0c9976bd7bdb4b35c0a887609837f8d699fe0ed12b805","last_reissued_at":"2026-05-18T01:25:24.894250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.894250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0722","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-18T01:25:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMp5LNLgsRdkTK/kQCKgWByFx4TZZpMGkijHFjcYg5jOuXMWXH7SuqbR+NwtdHQJrKD+xhxQ93KvE2vUEhuIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:06:34.549052Z"},"content_sha256":"8bf4f11548890141c95d229a567f1ea7be4fcc3a446646d9a505af965c239f95","schema_version":"1.0","event_id":"sha256:8bf4f11548890141c95d229a567f1ea7be4fcc3a446646d9a505af965c239f95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RFBOU4UQDGZOQBXQZGLWXV55WS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Good parts first - a new algorithm for approximate search in lexica and string databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CL","authors_text":"Klaus U. Schulz, Petar Mitankin, Stefan Gerdjikov, Stoyan Mihov","submitted_at":"2013-01-04T13:45:35Z","abstract_excerpt":"We present a new efficient method for approximate search in electronic lexica. Given an input string (the pattern) and a similarity threshold, the algorithm retrieves all entries of the lexicon that are sufficiently similar to the pattern. Search is organized in subsearches that always start with an exact partial match where a substring of the input pattern is aligned with a substring of a lexicon word. Afterwards this partial match is extended stepwise to larger substrings. For aligning further parts of the pattern with corresponding parts of lexicon entries, more errors are tolerated at each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0722","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-18T01:25:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4KldJFYPd9H1B/SYsjLffOd/emV3rz+CKteSO+Bwolgt45DlQ9nxq7nSMPzs/I8EyqvuTCjFFZO12ptsdenBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:06:34.549410Z"},"content_sha256":"96b7f3f6bd925c287594c36bc529822d1285e846ced6694007efe65dcaaaacde","schema_version":"1.0","event_id":"sha256:96b7f3f6bd925c287594c36bc529822d1285e846ced6694007efe65dcaaaacde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFBOU4UQDGZOQBXQZGLWXV55WS/bundle.json","state_url":"https://pith.science/pith/RFBOU4UQDGZOQBXQZGLWXV55WS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFBOU4UQDGZOQBXQZGLWXV55WS/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-05T19:06:34Z","links":{"resolver":"https://pith.science/pith/RFBOU4UQDGZOQBXQZGLWXV55WS","bundle":"https://pith.science/pith/RFBOU4UQDGZOQBXQZGLWXV55WS/bundle.json","state":"https://pith.science/pith/RFBOU4UQDGZOQBXQZGLWXV55WS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFBOU4UQDGZOQBXQZGLWXV55WS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RFBOU4UQDGZOQBXQZGLWXV55WS","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":"53ff18a0fe0e614adf626887df729e26464b49f9d967f3efa20645253c59369b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-01-04T13:45:35Z","title_canon_sha256":"fa4030ed283a1996ea14ddb05c76c9513c406325019ffeee57ad00ff7e644b02"},"schema_version":"1.0","source":{"id":"1301.0722","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0722","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0722v2","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0722","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"RFBOU4UQDGZO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RFBOU4UQDGZOQBXQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RFBOU4UQ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:96b7f3f6bd925c287594c36bc529822d1285e846ced6694007efe65dcaaaacde","target":"graph","created_at":"2026-05-18T01:25:24Z","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 present a new efficient method for approximate search in electronic lexica. Given an input string (the pattern) and a similarity threshold, the algorithm retrieves all entries of the lexicon that are sufficiently similar to the pattern. Search is organized in subsearches that always start with an exact partial match where a substring of the input pattern is aligned with a substring of a lexicon word. Afterwards this partial match is extended stepwise to larger substrings. For aligning further parts of the pattern with corresponding parts of lexicon entries, more errors are tolerated at each","authors_text":"Klaus U. Schulz, Petar Mitankin, Stefan Gerdjikov, Stoyan Mihov","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-01-04T13:45:35Z","title":"Good parts first - a new algorithm for approximate search in lexica and string databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0722","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:8bf4f11548890141c95d229a567f1ea7be4fcc3a446646d9a505af965c239f95","target":"record","created_at":"2026-05-18T01:25:24Z","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":"53ff18a0fe0e614adf626887df729e26464b49f9d967f3efa20645253c59369b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-01-04T13:45:35Z","title_canon_sha256":"fa4030ed283a1996ea14ddb05c76c9513c406325019ffeee57ad00ff7e644b02"},"schema_version":"1.0","source":{"id":"1301.0722","kind":"arxiv","version":2}},"canonical_sha256":"8942ea729019b2e806f0c9976bd7bdb4b35c0a887609837f8d699fe0ed12b805","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8942ea729019b2e806f0c9976bd7bdb4b35c0a887609837f8d699fe0ed12b805","first_computed_at":"2026-05-18T01:25:24.894250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:24.894250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CE7f70ME5yHv+sXdJIisJ1SzQW56fenM74TSvYpMq0BiHRu8T3uq33DEu8B4jxo9UUXsdwgbnKgvyQsdwO/iBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:24.894646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0722","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bf4f11548890141c95d229a567f1ea7be4fcc3a446646d9a505af965c239f95","sha256:96b7f3f6bd925c287594c36bc529822d1285e846ced6694007efe65dcaaaacde"],"state_sha256":"424304843c1d89f066ef1574fa1b8c510f7dc6556290cc5b20cb32cb03f73b5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgU/0L1wUFGdpmp8Jau1HS+dutF83yx43qaAWDMFycY6aTrV8jJ8uYPO3lsLNSSPVPImqfo8IB9ZBzR4jrdVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:06:34.551311Z","bundle_sha256":"b9b85d87cca689c8661b232f87c31703f1b5558512e9dbf9a914188c3307d5f5"}}