{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RALQXFLEFCPSK2HJB676JTRFBR","short_pith_number":"pith:RALQXFLE","canonical_record":{"source":{"id":"1309.5657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-09-22T22:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"affa57cc339d46d82fcdc8944ecdc8b94c3697f17e47d9ccdc98ea6efcd9e5e1","abstract_canon_sha256":"a0200cdd7e1d0af471a45a513289656ad852a6c33e11540fe034f78c7947a4f4"},"schema_version":"1.0"},"canonical_sha256":"88170b9564289f2568e90fbfe4ce250c61d8419022eb9dd4e9a3bf1578f08879","source":{"kind":"arxiv","id":"1309.5657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5657","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5657v1","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5657","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"RALQXFLEFCPS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RALQXFLEFCPSK2HJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RALQXFLE","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RALQXFLEFCPSK2HJB676JTRFBR","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-09-22T22:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"affa57cc339d46d82fcdc8944ecdc8b94c3697f17e47d9ccdc98ea6efcd9e5e1","abstract_canon_sha256":"a0200cdd7e1d0af471a45a513289656ad852a6c33e11540fe034f78c7947a4f4"},"schema_version":"1.0"},"canonical_sha256":"88170b9564289f2568e90fbfe4ce250c61d8419022eb9dd4e9a3bf1578f08879","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:35.623962Z","signature_b64":"bmk13dH1Q4ezGJMyF8DLjcljJ61/VoXruA+NjHenh1REkQC7RhBdGfFssyzJQsaIQrrhv+xGRX6agol1zHfBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88170b9564289f2568e90fbfe4ce250c61d8419022eb9dd4e9a3bf1578f08879","last_reissued_at":"2026-05-18T03:12:35.623210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:35.623210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5657","source_version":1,"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-18T03:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTWZUDv8QpinamLu3jF94qjKYRLhZ9Nq+FHWXALiK4Rj2T5ZWAL5eMJeljcfGawYM7H4vO0LicHMcFGW2NR7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:07:06.828500Z"},"content_sha256":"72a20022ec115c9e12d4f45e65f7e180c0c75b6b984695b6cba38ff27517cb9a","schema_version":"1.0","event_id":"sha256:72a20022ec115c9e12d4f45e65f7e180c0c75b6b984695b6cba38ff27517cb9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RALQXFLEFCPSK2HJB676JTRFBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hybrid Algorithm for Matching Arabic Names","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"T.El-Shishtawy","submitted_at":"2013-09-22T22:06:26Z","abstract_excerpt":"In this paper, a new hybrid algorithm which combines both of token-based and character-based approaches is presented. The basic Levenshtein approach has been extended to token-based distance metric. The distance metric is enhanced to set the proper granularity level behavior of the algorithm. It smoothly maps a threshold of misspellings differences at the character level, and the importance of token level errors in terms of token's position and frequency. Using a large Arabic dataset, the experimental results show that the proposed algorithm overcomes successfully many types of errors such as:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5657","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"},"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-18T03:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1vb7K47kBcuPw6edHUoTNvBT+3fQ5I7eyLZ8vrZaPxh81IiaGG9iPvxncoeeiAgp/9Q9N+2dp1UFvOQpXjqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:07:06.828941Z"},"content_sha256":"67ddfcb067d88d6a4db67a57a35188239eab84a11e576611382f04511aee0926","schema_version":"1.0","event_id":"sha256:67ddfcb067d88d6a4db67a57a35188239eab84a11e576611382f04511aee0926"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RALQXFLEFCPSK2HJB676JTRFBR/bundle.json","state_url":"https://pith.science/pith/RALQXFLEFCPSK2HJB676JTRFBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RALQXFLEFCPSK2HJB676JTRFBR/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-08-08T09:07:06Z","links":{"resolver":"https://pith.science/pith/RALQXFLEFCPSK2HJB676JTRFBR","bundle":"https://pith.science/pith/RALQXFLEFCPSK2HJB676JTRFBR/bundle.json","state":"https://pith.science/pith/RALQXFLEFCPSK2HJB676JTRFBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RALQXFLEFCPSK2HJB676JTRFBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RALQXFLEFCPSK2HJB676JTRFBR","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":"a0200cdd7e1d0af471a45a513289656ad852a6c33e11540fe034f78c7947a4f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-09-22T22:06:26Z","title_canon_sha256":"affa57cc339d46d82fcdc8944ecdc8b94c3697f17e47d9ccdc98ea6efcd9e5e1"},"schema_version":"1.0","source":{"id":"1309.5657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5657","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5657v1","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5657","created_at":"2026-05-18T03:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"RALQXFLEFCPS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RALQXFLEFCPSK2HJ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RALQXFLE","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:67ddfcb067d88d6a4db67a57a35188239eab84a11e576611382f04511aee0926","target":"graph","created_at":"2026-05-18T03:12:35Z","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":"In this paper, a new hybrid algorithm which combines both of token-based and character-based approaches is presented. The basic Levenshtein approach has been extended to token-based distance metric. The distance metric is enhanced to set the proper granularity level behavior of the algorithm. It smoothly maps a threshold of misspellings differences at the character level, and the importance of token level errors in terms of token's position and frequency. Using a large Arabic dataset, the experimental results show that the proposed algorithm overcomes successfully many types of errors such as:","authors_text":"T.El-Shishtawy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-09-22T22:06:26Z","title":"A Hybrid Algorithm for Matching Arabic Names"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5657","kind":"arxiv","version":1},"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:72a20022ec115c9e12d4f45e65f7e180c0c75b6b984695b6cba38ff27517cb9a","target":"record","created_at":"2026-05-18T03:12:35Z","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":"a0200cdd7e1d0af471a45a513289656ad852a6c33e11540fe034f78c7947a4f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-09-22T22:06:26Z","title_canon_sha256":"affa57cc339d46d82fcdc8944ecdc8b94c3697f17e47d9ccdc98ea6efcd9e5e1"},"schema_version":"1.0","source":{"id":"1309.5657","kind":"arxiv","version":1}},"canonical_sha256":"88170b9564289f2568e90fbfe4ce250c61d8419022eb9dd4e9a3bf1578f08879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88170b9564289f2568e90fbfe4ce250c61d8419022eb9dd4e9a3bf1578f08879","first_computed_at":"2026-05-18T03:12:35.623210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:35.623210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmk13dH1Q4ezGJMyF8DLjcljJ61/VoXruA+NjHenh1REkQC7RhBdGfFssyzJQsaIQrrhv+xGRX6agol1zHfBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:35.623962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72a20022ec115c9e12d4f45e65f7e180c0c75b6b984695b6cba38ff27517cb9a","sha256:67ddfcb067d88d6a4db67a57a35188239eab84a11e576611382f04511aee0926"],"state_sha256":"5b71fe6463186b7320dcf7133bd6eb7143b95ce9aa1ac851973285c0e2768981"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZ5MHgM8mZBvwnzpDWdJfefwhMTzsYiJaS6MtGwKa9DC8qksW/l8Z4aCdl/USFE7V8n+nLkNkmrpjMGFr8JPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:07:06.833145Z","bundle_sha256":"c1857db64e8d0d522cfba369bc1431b8d911872ab356196d6c998a9b8260102b"}}