{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6Y7L3TMB5WUDOUW3ZIQMXZONE3","short_pith_number":"pith:6Y7L3TMB","schema_version":"1.0","canonical_sha256":"f63ebdcd81eda83752dbca20cbe5cd26d4b3102f686a49791f78e5ce51a94017","source":{"kind":"arxiv","id":"1008.1715","version":5},"attestation_state":"computed","paper":{"title":"The universality of iterated hashing over variable-length strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Daniel Lemire","submitted_at":"2010-08-10T14:05:28Z","abstract_excerpt":"Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3-wise independent. We show that it can be almost universal over strings much longer than the number of hash values; we bound the maximal string length given the collision probability."},"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":"1008.1715","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-10T14:05:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fd4ed9cc7728a78b9a3e7364da67bd87a318896eb17cd032a7bd6ec188024b0f","abstract_canon_sha256":"365b6b1e1a6c84c1373aa4b0e915572e0896568206700e6b3bc568c55e66435a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:54.695535Z","signature_b64":"5LlGJbX1FyvyN9sES2I3aJ1TdWBIabNWX0WGOvRFOxtwbrig5y2Hf6kNsfPp7Wv/qxEF2qyTbrMu0byzVf3vAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f63ebdcd81eda83752dbca20cbe5cd26d4b3102f686a49791f78e5ce51a94017","last_reissued_at":"2026-05-18T04:03:54.695046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:54.695046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The universality of iterated hashing over variable-length strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Daniel Lemire","submitted_at":"2010-08-10T14:05:28Z","abstract_excerpt":"Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3-wise independent. We show that it can be almost universal over strings much longer than the number of hash values; we bound the maximal string length given the collision probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1715","kind":"arxiv","version":5},"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":"1008.1715","created_at":"2026-05-18T04:03:54.695124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1715v5","created_at":"2026-05-18T04:03:54.695124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1715","created_at":"2026-05-18T04:03:54.695124+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Y7L3TMB5WUD","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Y7L3TMB5WUDOUW3","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Y7L3TMB","created_at":"2026-05-18T12:26:04.259169+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/6Y7L3TMB5WUDOUW3ZIQMXZONE3","json":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3.json","graph_json":"https://pith.science/api/pith-number/6Y7L3TMB5WUDOUW3ZIQMXZONE3/graph.json","events_json":"https://pith.science/api/pith-number/6Y7L3TMB5WUDOUW3ZIQMXZONE3/events.json","paper":"https://pith.science/paper/6Y7L3TMB"},"agent_actions":{"view_html":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3","download_json":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3.json","view_paper":"https://pith.science/paper/6Y7L3TMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1715&json=true","fetch_graph":"https://pith.science/api/pith-number/6Y7L3TMB5WUDOUW3ZIQMXZONE3/graph.json","fetch_events":"https://pith.science/api/pith-number/6Y7L3TMB5WUDOUW3ZIQMXZONE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3/action/storage_attestation","attest_author":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3/action/author_attestation","sign_citation":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3/action/citation_signature","submit_replication":"https://pith.science/pith/6Y7L3TMB5WUDOUW3ZIQMXZONE3/action/replication_record"}},"created_at":"2026-05-18T04:03:54.695124+00:00","updated_at":"2026-05-18T04:03:54.695124+00:00"}