{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RXIPGRKJHZ5CDKESNXRF7V55EC","short_pith_number":"pith:RXIPGRKJ","schema_version":"1.0","canonical_sha256":"8dd0f345493e7a21a8926de25fd7bd209d4e35a25593bf5e2e66f85bac57b2e0","source":{"kind":"arxiv","id":"1711.08475","version":1},"attestation_state":"computed","paper":{"title":"Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Cis{\\l}ak, Szymon Grabowski","submitted_at":"2017-11-22T19:13:08Z","abstract_excerpt":"We aim to speed up approximate keyword matching by storing a lightweight, fixed-size block of data for each string, called a fingerprint. These work in a similar way to hash values; however, they can be also used for matching with errors. They store information regarding symbol occurrences using individual bits, and they can be compared against each other with a constant number of bitwise operations. In this way, certain strings can be deduced to be at least within the distance $k$ from each other (using Hamming or Levenshtein distance) without performing an explicit verification. We show expe"},"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":"1711.08475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T19:13:08Z","cross_cats_sorted":[],"title_canon_sha256":"21382d552e653ef8830487e0adc571ae5cabbfd28ff45818695d59acc3ea8ca2","abstract_canon_sha256":"98b6bfcff5a5dc44c00aabafcc7fadc013656f7b94e3bb09a395abb9b21a874c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:44.991783Z","signature_b64":"2xXDPqcBpjWiMurqwd1ju2IWtS9ZP971+IvwYZpDtGB8lcRxnKPGMwaZ13TWuG5KVa5AD8ZgJZlZqVh5kSsyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dd0f345493e7a21a8926de25fd7bd209d4e35a25593bf5e2e66f85bac57b2e0","last_reissued_at":"2026-05-18T00:29:44.991178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:44.991178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Cis{\\l}ak, Szymon Grabowski","submitted_at":"2017-11-22T19:13:08Z","abstract_excerpt":"We aim to speed up approximate keyword matching by storing a lightweight, fixed-size block of data for each string, called a fingerprint. These work in a similar way to hash values; however, they can be also used for matching with errors. They store information regarding symbol occurrences using individual bits, and they can be compared against each other with a constant number of bitwise operations. In this way, certain strings can be deduced to be at least within the distance $k$ from each other (using Hamming or Levenshtein distance) without performing an explicit verification. We show expe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08475","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":"1711.08475","created_at":"2026-05-18T00:29:44.991260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08475v1","created_at":"2026-05-18T00:29:44.991260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08475","created_at":"2026-05-18T00:29:44.991260+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXIPGRKJHZ5C","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXIPGRKJHZ5CDKES","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXIPGRKJ","created_at":"2026-05-18T12:31:43.269735+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/RXIPGRKJHZ5CDKESNXRF7V55EC","json":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC.json","graph_json":"https://pith.science/api/pith-number/RXIPGRKJHZ5CDKESNXRF7V55EC/graph.json","events_json":"https://pith.science/api/pith-number/RXIPGRKJHZ5CDKESNXRF7V55EC/events.json","paper":"https://pith.science/paper/RXIPGRKJ"},"agent_actions":{"view_html":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC","download_json":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC.json","view_paper":"https://pith.science/paper/RXIPGRKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08475&json=true","fetch_graph":"https://pith.science/api/pith-number/RXIPGRKJHZ5CDKESNXRF7V55EC/graph.json","fetch_events":"https://pith.science/api/pith-number/RXIPGRKJHZ5CDKESNXRF7V55EC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/action/storage_attestation","attest_author":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/action/author_attestation","sign_citation":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/action/citation_signature","submit_replication":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/action/replication_record"}},"created_at":"2026-05-18T00:29:44.991260+00:00","updated_at":"2026-05-18T00:29:44.991260+00:00"}