{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZPSHENS2CKRLG2I225G7CO7XZY","short_pith_number":"pith:ZPSHENS2","schema_version":"1.0","canonical_sha256":"cbe472365a12a2b3691ad74df13bf7ce2452bee36aef39b9607ae96d0280b2f2","source":{"kind":"arxiv","id":"1012.1338","version":1},"attestation_state":"computed","paper":{"title":"On Tuning the Bad-Character Rule: the Worst-Character Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Domenico Cantone, Simone Faro","submitted_at":"2010-12-06T21:16:37Z","abstract_excerpt":"In this note we present the worst-character rule, an efficient variation of the bad-character heuristic for the exact string matching problem, firstly introduced in the well-known Boyer-Moore algorithm. Our proposed rule selects a position relative to the current shift which yields the largest average advancement, according to the characters distribution in the text. Experimental results show that the worst-character rule achieves very good results especially in the case of long patterns or small alphabets in random texts and in the case of texts in natural languages."},"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":"1012.1338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-06T21:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"70c3028cd3e2240ea1909de54590cad86c210a440364f2a4b144ffede1035dbc","abstract_canon_sha256":"0006734d9abd5d1728f745d73b9a920fd753146e3da16f607b9897d33f3420ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:01.166498Z","signature_b64":"bkTtAjZnEPfw2zNcV5mz7NDcoXz463pP8g9fO5zGsjte8J36RBdIUj89RMi6j1bykOD3+GXvfIkTD7UueknHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbe472365a12a2b3691ad74df13bf7ce2452bee36aef39b9607ae96d0280b2f2","last_reissued_at":"2026-05-18T04:34:01.166018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:01.166018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Tuning the Bad-Character Rule: the Worst-Character Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Domenico Cantone, Simone Faro","submitted_at":"2010-12-06T21:16:37Z","abstract_excerpt":"In this note we present the worst-character rule, an efficient variation of the bad-character heuristic for the exact string matching problem, firstly introduced in the well-known Boyer-Moore algorithm. Our proposed rule selects a position relative to the current shift which yields the largest average advancement, according to the characters distribution in the text. Experimental results show that the worst-character rule achieves very good results especially in the case of long patterns or small alphabets in random texts and in the case of texts in natural languages."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1338","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":"1012.1338","created_at":"2026-05-18T04:34:01.166093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1338v1","created_at":"2026-05-18T04:34:01.166093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1338","created_at":"2026-05-18T04:34:01.166093+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPSHENS2CKRL","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPSHENS2CKRLG2I2","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPSHENS2","created_at":"2026-05-18T12:26:18.847500+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/ZPSHENS2CKRLG2I225G7CO7XZY","json":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY.json","graph_json":"https://pith.science/api/pith-number/ZPSHENS2CKRLG2I225G7CO7XZY/graph.json","events_json":"https://pith.science/api/pith-number/ZPSHENS2CKRLG2I225G7CO7XZY/events.json","paper":"https://pith.science/paper/ZPSHENS2"},"agent_actions":{"view_html":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY","download_json":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY.json","view_paper":"https://pith.science/paper/ZPSHENS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1338&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPSHENS2CKRLG2I225G7CO7XZY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPSHENS2CKRLG2I225G7CO7XZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY/action/storage_attestation","attest_author":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY/action/author_attestation","sign_citation":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY/action/citation_signature","submit_replication":"https://pith.science/pith/ZPSHENS2CKRLG2I225G7CO7XZY/action/replication_record"}},"created_at":"2026-05-18T04:34:01.166093+00:00","updated_at":"2026-05-18T04:34:01.166093+00:00"}