{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TTLHQ2U3F3WHKCPYYMY43ITGPZ","short_pith_number":"pith:TTLHQ2U3","schema_version":"1.0","canonical_sha256":"9cd6786a9b2eec7509f8c331cda2667e7142857504a6c804c3dff64a77a58a3b","source":{"kind":"arxiv","id":"1401.7110","version":1},"attestation_state":"computed","paper":{"title":"A Fast String Matching Algorithm Based on Lowlight Characters in the Pattern","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lihua Liu, Zhengjun Cao","submitted_at":"2014-01-28T08:27:19Z","abstract_excerpt":"We put forth a new string matching algorithm which matches the pattern from neither the left nor the right end, instead a special position. Comparing with the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm, the new algorithm is more flexible to pick the position for starting comparisons. The option really brings it a saving in cost."},"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":"1401.7110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-28T08:27:19Z","cross_cats_sorted":[],"title_canon_sha256":"44e901ac89383fb0a9ca48651f0dbef13c089f749a0a0926163a38ab440416ae","abstract_canon_sha256":"81ee304ee2b849fd869369670dac3a000fed349a72c729654bed598643443f32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:50.841914Z","signature_b64":"zDR4q/Ie8jGFMGYDeDsfckOKEXHaVgDvnHN8z111sveznpmRMMePspx4fhUMbN7UoU4sB93tRAyXxzmjNiOzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cd6786a9b2eec7509f8c331cda2667e7142857504a6c804c3dff64a77a58a3b","last_reissued_at":"2026-05-18T03:00:50.841311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:50.841311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast String Matching Algorithm Based on Lowlight Characters in the Pattern","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lihua Liu, Zhengjun Cao","submitted_at":"2014-01-28T08:27:19Z","abstract_excerpt":"We put forth a new string matching algorithm which matches the pattern from neither the left nor the right end, instead a special position. Comparing with the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm, the new algorithm is more flexible to pick the position for starting comparisons. The option really brings it a saving in cost."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7110","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.7110","created_at":"2026-05-18T03:00:50.841418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7110v1","created_at":"2026-05-18T03:00:50.841418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7110","created_at":"2026-05-18T03:00:50.841418+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTLHQ2U3F3WH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTLHQ2U3F3WHKCPY","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTLHQ2U3","created_at":"2026-05-18T12:28:52.271510+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/TTLHQ2U3F3WHKCPYYMY43ITGPZ","json":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ.json","graph_json":"https://pith.science/api/pith-number/TTLHQ2U3F3WHKCPYYMY43ITGPZ/graph.json","events_json":"https://pith.science/api/pith-number/TTLHQ2U3F3WHKCPYYMY43ITGPZ/events.json","paper":"https://pith.science/paper/TTLHQ2U3"},"agent_actions":{"view_html":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ","download_json":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ.json","view_paper":"https://pith.science/paper/TTLHQ2U3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7110&json=true","fetch_graph":"https://pith.science/api/pith-number/TTLHQ2U3F3WHKCPYYMY43ITGPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TTLHQ2U3F3WHKCPYYMY43ITGPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ/action/storage_attestation","attest_author":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ/action/author_attestation","sign_citation":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ/action/citation_signature","submit_replication":"https://pith.science/pith/TTLHQ2U3F3WHKCPYYMY43ITGPZ/action/replication_record"}},"created_at":"2026-05-18T03:00:50.841418+00:00","updated_at":"2026-05-18T03:00:50.841418+00:00"}