{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:KN362T4W3FBTUYUI4G4FDIPK3C","short_pith_number":"pith:KN362T4W","canonical_record":{"source":{"id":"0705.4676","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2007-05-31T18:41:28Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"0eba3cba46f17a0dc82f1b7d635214a8d113eabc311e9c3ce6c1d246089bf6b8","abstract_canon_sha256":"e4933a2466a9b8d3c28d011b8a8258eabf1c9903dff1e1c49cd7bf5228949274"},"schema_version":"1.0"},"canonical_sha256":"5377ed4f96d9433a6288e1b851a1ead884bf9c2d8756759119288e66d0bdabcc","source":{"kind":"arxiv","id":"0705.4676","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.4676","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"0705.4676v8","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.4676","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"KN362T4W3FBT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"KN362T4W3FBTUYUI","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"KN362T4W","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:KN362T4W3FBTUYUI4G4FDIPK3C","target":"record","payload":{"canonical_record":{"source":{"id":"0705.4676","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2007-05-31T18:41:28Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"0eba3cba46f17a0dc82f1b7d635214a8d113eabc311e9c3ce6c1d246089bf6b8","abstract_canon_sha256":"e4933a2466a9b8d3c28d011b8a8258eabf1c9903dff1e1c49cd7bf5228949274"},"schema_version":"1.0"},"canonical_sha256":"5377ed4f96d9433a6288e1b851a1ead884bf9c2d8756759119288e66d0bdabcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:59.027738Z","signature_b64":"QW26PpYMA3L5GPMS9tC88sooKA2IARJ0KEgb0k2xw+Jfq6re1UHq5kD3uD4f5yrAn3l7hII5S7DNsr28062JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5377ed4f96d9433a6288e1b851a1ead884bf9c2d8756759119288e66d0bdabcc","last_reissued_at":"2026-05-18T01:12:59.027393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:59.027393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0705.4676","source_version":8,"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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ealyo3gFhHgPljzHxrfKDqRqN6bGRLAVIJh+jssTVy7vl/Yv0m4yi3oUSNSAeLjSdhT1FgU4fKv8r5+7yyM6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:31:59.542027Z"},"content_sha256":"5ef99fcce0ad77fe189d24106f1aacfba7b575b3513fde7503b8572494b6b4af","schema_version":"1.0","event_id":"sha256:5ef99fcce0ad77fe189d24106f1aacfba7b575b3513fde7503b8572494b6b4af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:KN362T4W3FBTUYUI4G4FDIPK3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive n-gram hashing is pairwise independent, at best","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.DB","authors_text":"Daniel Lemire, Owen Kaser","submitted_at":"2007-05-31T18:41:28Z","abstract_excerpt":"Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values. We prove that recursive hash families cannot be more than pairwise independent. While hashing by irreducible polynomials is pairwise independent, our implementations either run in time O(n) or use an exponential amount of memory. As a more scalable alternative, we make hashing by cyclic polynomials pairwise independent by ignoring n-1 bits. Experimentally, we show that hashing by cycli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.4676","kind":"arxiv","version":8},"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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xDFV8axKPzaf1rqqZbanb6KF911kOrTxWuG7iNPJvknNQLoxk2T6xtkC3O7jUhrjzYChB27GNUmgZrlGFMVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:31:59.542693Z"},"content_sha256":"435c018607a9dcd79a1b6234e1eab959de48a705ce3e98769fda1db3ef506002","schema_version":"1.0","event_id":"sha256:435c018607a9dcd79a1b6234e1eab959de48a705ce3e98769fda1db3ef506002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KN362T4W3FBTUYUI4G4FDIPK3C/bundle.json","state_url":"https://pith.science/pith/KN362T4W3FBTUYUI4G4FDIPK3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KN362T4W3FBTUYUI4G4FDIPK3C/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-05-26T22:31:59Z","links":{"resolver":"https://pith.science/pith/KN362T4W3FBTUYUI4G4FDIPK3C","bundle":"https://pith.science/pith/KN362T4W3FBTUYUI4G4FDIPK3C/bundle.json","state":"https://pith.science/pith/KN362T4W3FBTUYUI4G4FDIPK3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KN362T4W3FBTUYUI4G4FDIPK3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:KN362T4W3FBTUYUI4G4FDIPK3C","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":"e4933a2466a9b8d3c28d011b8a8258eabf1c9903dff1e1c49cd7bf5228949274","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2007-05-31T18:41:28Z","title_canon_sha256":"0eba3cba46f17a0dc82f1b7d635214a8d113eabc311e9c3ce6c1d246089bf6b8"},"schema_version":"1.0","source":{"id":"0705.4676","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.4676","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"0705.4676v8","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.4676","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"KN362T4W3FBT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"KN362T4W3FBTUYUI","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"KN362T4W","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:435c018607a9dcd79a1b6234e1eab959de48a705ce3e98769fda1db3ef506002","target":"graph","created_at":"2026-05-18T01:12:59Z","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":"Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values. We prove that recursive hash families cannot be more than pairwise independent. While hashing by irreducible polynomials is pairwise independent, our implementations either run in time O(n) or use an exponential amount of memory. As a more scalable alternative, we make hashing by cyclic polynomials pairwise independent by ignoring n-1 bits. Experimentally, we show that hashing by cycli","authors_text":"Daniel Lemire, Owen Kaser","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2007-05-31T18:41:28Z","title":"Recursive n-gram hashing is pairwise independent, at best"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.4676","kind":"arxiv","version":8},"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:5ef99fcce0ad77fe189d24106f1aacfba7b575b3513fde7503b8572494b6b4af","target":"record","created_at":"2026-05-18T01:12:59Z","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":"e4933a2466a9b8d3c28d011b8a8258eabf1c9903dff1e1c49cd7bf5228949274","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2007-05-31T18:41:28Z","title_canon_sha256":"0eba3cba46f17a0dc82f1b7d635214a8d113eabc311e9c3ce6c1d246089bf6b8"},"schema_version":"1.0","source":{"id":"0705.4676","kind":"arxiv","version":8}},"canonical_sha256":"5377ed4f96d9433a6288e1b851a1ead884bf9c2d8756759119288e66d0bdabcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5377ed4f96d9433a6288e1b851a1ead884bf9c2d8756759119288e66d0bdabcc","first_computed_at":"2026-05-18T01:12:59.027393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:59.027393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QW26PpYMA3L5GPMS9tC88sooKA2IARJ0KEgb0k2xw+Jfq6re1UHq5kD3uD4f5yrAn3l7hII5S7DNsr28062JAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:59.027738Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.4676","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ef99fcce0ad77fe189d24106f1aacfba7b575b3513fde7503b8572494b6b4af","sha256:435c018607a9dcd79a1b6234e1eab959de48a705ce3e98769fda1db3ef506002"],"state_sha256":"dea55203f3c29d18b9650139df5d4456b02149c7a244559d9e3b442985197b85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bywSt8VUC0vQ48wNzYXbsYF+fjfftTqBtMHz/WyQTZQSQL+6+L1MT7DZB9YybzBhsfHS2BxCMVAPT1Z2nvAnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:31:59.546097Z","bundle_sha256":"7b37053ef3db8f468260ec17abd8114ad5dc451c32b12692585fa96c42ca4a53"}}