{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QLNYK6AZ4RET2EQBJJE3FGPLE6","short_pith_number":"pith:QLNYK6AZ","schema_version":"1.0","canonical_sha256":"82db857819e4493d12014a49b299eb278d96193fe650982756b77e96c153c1ab","source":{"kind":"arxiv","id":"1502.05729","version":1},"attestation_state":"computed","paper":{"title":"Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Morten St\\\"ockel","submitted_at":"2015-02-19T21:20:56Z","abstract_excerpt":"Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how \"random\" a hash function or a random number generator is, is its independence: a sequence of random variables is said to be $k$-independent if every variable is uniform and every size $k$ subset is independent. In this paper we consider three classic algorithms under limited independence. We provide new bounds for randomized quicksort, min-wise hashing and largest bucket size under limited independence. Our results can be"},"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":"1502.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T21:20:56Z","cross_cats_sorted":[],"title_canon_sha256":"72613196bb6ef1eea1fb12593b2df5c3d7619e5694bb37a970fdb5caef69a06d","abstract_canon_sha256":"3b88551a2e1722d06c8966312e759547ed0a8d83ae824d62b536803d8478e212"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.945256Z","signature_b64":"+hnq+UXDBWlth7HnES9lqlvGMWEsjmpyeYOkhaiHiS38RIHNZgB+xL25svlOgAaED0SRPMkDeOBAYjZ2UhBeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82db857819e4493d12014a49b299eb278d96193fe650982756b77e96c153c1ab","last_reissued_at":"2026-05-18T02:26:44.944761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.944761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Morten St\\\"ockel","submitted_at":"2015-02-19T21:20:56Z","abstract_excerpt":"Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how \"random\" a hash function or a random number generator is, is its independence: a sequence of random variables is said to be $k$-independent if every variable is uniform and every size $k$ subset is independent. In this paper we consider three classic algorithms under limited independence. We provide new bounds for randomized quicksort, min-wise hashing and largest bucket size under limited independence. Our results can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05729","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":"1502.05729","created_at":"2026-05-18T02:26:44.944829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05729v1","created_at":"2026-05-18T02:26:44.944829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05729","created_at":"2026-05-18T02:26:44.944829+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLNYK6AZ4RET","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLNYK6AZ4RET2EQB","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLNYK6AZ","created_at":"2026-05-18T12:29:37.295048+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/QLNYK6AZ4RET2EQBJJE3FGPLE6","json":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6.json","graph_json":"https://pith.science/api/pith-number/QLNYK6AZ4RET2EQBJJE3FGPLE6/graph.json","events_json":"https://pith.science/api/pith-number/QLNYK6AZ4RET2EQBJJE3FGPLE6/events.json","paper":"https://pith.science/paper/QLNYK6AZ"},"agent_actions":{"view_html":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6","download_json":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6.json","view_paper":"https://pith.science/paper/QLNYK6AZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05729&json=true","fetch_graph":"https://pith.science/api/pith-number/QLNYK6AZ4RET2EQBJJE3FGPLE6/graph.json","fetch_events":"https://pith.science/api/pith-number/QLNYK6AZ4RET2EQBJJE3FGPLE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6/action/storage_attestation","attest_author":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6/action/author_attestation","sign_citation":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6/action/citation_signature","submit_replication":"https://pith.science/pith/QLNYK6AZ4RET2EQBJJE3FGPLE6/action/replication_record"}},"created_at":"2026-05-18T02:26:44.944829+00:00","updated_at":"2026-05-18T02:26:44.944829+00:00"}