{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YDDBMGBAWNCI2UZAVSKWJKFZB5","short_pith_number":"pith:YDDBMGBA","schema_version":"1.0","canonical_sha256":"c0c6161820b3448d5320ac9564a8b90f5308f7991028251e59b679c52d36e5b3","source":{"kind":"arxiv","id":"1102.3537","version":1},"attestation_state":"computed","paper":{"title":"Even Better Framework for min-wise Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Shiftan, Ely Porat, Guy Feigenblat","submitted_at":"2011-02-17T09:43:17Z","abstract_excerpt":"In a recent paper from SODA11 \\cite{kminwise} the authors introduced a general framework for exponential time improvement of \\minwise based algorithms by defining and constructing almost \\kmin independent family of hash functions. Here we take it a step forward and reduce the space and the independent needed for representing the functions, by defining and constructing a \\dkmin independent family of hash functions. Surprisingly, for most cases only 8-wise independent is needed for exponential time and space improvement. Moreover, we bypass the $O(\\log{\\frac{1}{\\epsilon}})$ independent lower bou"},"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":"1102.3537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T09:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"9272f1c60c86a7d0c491c29c1eb53226f25468b5d0b71461f5ff0ae2be8e6709","abstract_canon_sha256":"890b36224a1e25eb3a509f30ff49cb8859aa8bdd347b81ffe01c75a51c225b3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:28.879567Z","signature_b64":"6cTCGEWCc9PgnzyFAQZ/RPCp+iLt2LcnZjCEH6h4K3QwggTFyVrutu6KcGbZ5e9VFLgUSuDwe/KR6k3CmpNfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0c6161820b3448d5320ac9564a8b90f5308f7991028251e59b679c52d36e5b3","last_reissued_at":"2026-05-18T04:28:28.879221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:28.879221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even Better Framework for min-wise Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ariel Shiftan, Ely Porat, Guy Feigenblat","submitted_at":"2011-02-17T09:43:17Z","abstract_excerpt":"In a recent paper from SODA11 \\cite{kminwise} the authors introduced a general framework for exponential time improvement of \\minwise based algorithms by defining and constructing almost \\kmin independent family of hash functions. Here we take it a step forward and reduce the space and the independent needed for representing the functions, by defining and constructing a \\dkmin independent family of hash functions. Surprisingly, for most cases only 8-wise independent is needed for exponential time and space improvement. Moreover, we bypass the $O(\\log{\\frac{1}{\\epsilon}})$ independent lower bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3537","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":"1102.3537","created_at":"2026-05-18T04:28:28.879269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3537v1","created_at":"2026-05-18T04:28:28.879269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3537","created_at":"2026-05-18T04:28:28.879269+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDDBMGBAWNCI","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDDBMGBAWNCI2UZA","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDDBMGBA","created_at":"2026-05-18T12:26:47.523578+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/YDDBMGBAWNCI2UZAVSKWJKFZB5","json":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5.json","graph_json":"https://pith.science/api/pith-number/YDDBMGBAWNCI2UZAVSKWJKFZB5/graph.json","events_json":"https://pith.science/api/pith-number/YDDBMGBAWNCI2UZAVSKWJKFZB5/events.json","paper":"https://pith.science/paper/YDDBMGBA"},"agent_actions":{"view_html":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5","download_json":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5.json","view_paper":"https://pith.science/paper/YDDBMGBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3537&json=true","fetch_graph":"https://pith.science/api/pith-number/YDDBMGBAWNCI2UZAVSKWJKFZB5/graph.json","fetch_events":"https://pith.science/api/pith-number/YDDBMGBAWNCI2UZAVSKWJKFZB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/action/storage_attestation","attest_author":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/action/author_attestation","sign_citation":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/action/citation_signature","submit_replication":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/action/replication_record"}},"created_at":"2026-05-18T04:28:28.879269+00:00","updated_at":"2026-05-18T04:28:28.879269+00:00"}