{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RXIPGRKJHZ5CDKESNXRF7V55EC","short_pith_number":"pith:RXIPGRKJ","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"},"canonical_sha256":"8dd0f345493e7a21a8926de25fd7bd209d4e35a25593bf5e2e66f85bac57b2e0","source":{"kind":"arxiv","id":"1711.08475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08475","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08475v1","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08475","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"RXIPGRKJHZ5C","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RXIPGRKJHZ5CDKES","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RXIPGRKJ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RXIPGRKJHZ5CDKESNXRF7V55EC","target":"record","payload":{"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"},"canonical_sha256":"8dd0f345493e7a21a8926de25fd7bd209d4e35a25593bf5e2e66f85bac57b2e0","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"},"source_kind":"arxiv","source_id":"1711.08475","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-18T00:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DR1QozjHdQ7ECiZxFElgvm7qbDeGA0IWtBEfVgn+H+FCUmEqtmwg5OLe+HZB+A+qPDronbnGAb5YrAsV7DhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:59:27.144913Z"},"content_sha256":"f8e4851a8820e95b85ce80dd89e343ce92bebabb3c0a42d830d5171bb2bf9854","schema_version":"1.0","event_id":"sha256:f8e4851a8820e95b85ce80dd89e343ce92bebabb3c0a42d830d5171bb2bf9854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RXIPGRKJHZ5CDKESNXRF7V55EC","target":"graph","payload":{"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"},"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-18T00:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QjXpG7CIkb1bRQ3Qmt5yU1pHD2g/MNUvakNoP9z9LWVR+nUFpiUhMBuE/sT5H4rhQjmx1r4vlPJWid0uQnmwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:59:27.145255Z"},"content_sha256":"e860f97e44673031874b2c83449d19d2e032db84f44ad0353858366298bce410","schema_version":"1.0","event_id":"sha256:e860f97e44673031874b2c83449d19d2e032db84f44ad0353858366298bce410"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/bundle.json","state_url":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/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-21T21:59:27Z","links":{"resolver":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC","bundle":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/bundle.json","state":"https://pith.science/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXIPGRKJHZ5CDKESNXRF7V55EC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RXIPGRKJHZ5CDKESNXRF7V55EC","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":"98b6bfcff5a5dc44c00aabafcc7fadc013656f7b94e3bb09a395abb9b21a874c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T19:13:08Z","title_canon_sha256":"21382d552e653ef8830487e0adc571ae5cabbfd28ff45818695d59acc3ea8ca2"},"schema_version":"1.0","source":{"id":"1711.08475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08475","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08475v1","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08475","created_at":"2026-05-18T00:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"RXIPGRKJHZ5C","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RXIPGRKJHZ5CDKES","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RXIPGRKJ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:e860f97e44673031874b2c83449d19d2e032db84f44ad0353858366298bce410","target":"graph","created_at":"2026-05-18T00:29:44Z","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 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","authors_text":"Aleksander Cis{\\l}ak, Szymon Grabowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T19:13:08Z","title":"Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08475","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:f8e4851a8820e95b85ce80dd89e343ce92bebabb3c0a42d830d5171bb2bf9854","target":"record","created_at":"2026-05-18T00:29:44Z","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":"98b6bfcff5a5dc44c00aabafcc7fadc013656f7b94e3bb09a395abb9b21a874c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T19:13:08Z","title_canon_sha256":"21382d552e653ef8830487e0adc571ae5cabbfd28ff45818695d59acc3ea8ca2"},"schema_version":"1.0","source":{"id":"1711.08475","kind":"arxiv","version":1}},"canonical_sha256":"8dd0f345493e7a21a8926de25fd7bd209d4e35a25593bf5e2e66f85bac57b2e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dd0f345493e7a21a8926de25fd7bd209d4e35a25593bf5e2e66f85bac57b2e0","first_computed_at":"2026-05-18T00:29:44.991178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:44.991178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2xXDPqcBpjWiMurqwd1ju2IWtS9ZP971+IvwYZpDtGB8lcRxnKPGMwaZ13TWuG5KVa5AD8ZgJZlZqVh5kSsyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:44.991783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8e4851a8820e95b85ce80dd89e343ce92bebabb3c0a42d830d5171bb2bf9854","sha256:e860f97e44673031874b2c83449d19d2e032db84f44ad0353858366298bce410"],"state_sha256":"eee24bf27a105b9d985e30107351fef9d97b692031232e3324ed4ebb86883515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DT7MHNDGpvGuIm37GtXyhEDWCsp75C1kjzIlHWJvYopq4Ltkvb60Cg70yezQTnXuOgppk5WAFNYiKBAr0ORSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:59:27.147186Z","bundle_sha256":"0766b5f060b8d0f7b88d1fe0011db9d38299a5e2e16529903b2d7bf6c63e14c8"}}