{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YDDBMGBAWNCI2UZAVSKWJKFZB5","short_pith_number":"pith:YDDBMGBA","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"},"canonical_sha256":"c0c6161820b3448d5320ac9564a8b90f5308f7991028251e59b679c52d36e5b3","source":{"kind":"arxiv","id":"1102.3537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3537","created_at":"2026-05-18T04:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3537v1","created_at":"2026-05-18T04:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3537","created_at":"2026-05-18T04:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"YDDBMGBAWNCI","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YDDBMGBAWNCI2UZA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YDDBMGBA","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YDDBMGBAWNCI2UZAVSKWJKFZB5","target":"record","payload":{"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"},"canonical_sha256":"c0c6161820b3448d5320ac9564a8b90f5308f7991028251e59b679c52d36e5b3","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"},"source_kind":"arxiv","source_id":"1102.3537","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-18T04:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYgt28LxVsWQdb8XRKux3GYB8YnVGWnLe3HDFUXw04Mf8Ye5+o6ijDbnTG6ubtQj1h9Mff0947VObfOkFrTLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:22:32.479969Z"},"content_sha256":"af5e6ea0013bf2eb6bd1a88f5f692251cdd20f4a744a9782d6dd1b5923289c1a","schema_version":"1.0","event_id":"sha256:af5e6ea0013bf2eb6bd1a88f5f692251cdd20f4a744a9782d6dd1b5923289c1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YDDBMGBAWNCI2UZAVSKWJKFZB5","target":"graph","payload":{"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"},"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-18T04:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NToS152pQMIOAXvAWRj/r1UpY1JO1x5/GfLHe1sSxr6XGckl8PHhwH8AzFM62+a1orjk02ETG3pH06fTssXKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:22:32.480332Z"},"content_sha256":"8a0152232915e65611f38deb54195433fcb70a759a58d0d57ccc9173a22e2713","schema_version":"1.0","event_id":"sha256:8a0152232915e65611f38deb54195433fcb70a759a58d0d57ccc9173a22e2713"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/bundle.json","state_url":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/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-22T12:22:32Z","links":{"resolver":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5","bundle":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/bundle.json","state":"https://pith.science/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDDBMGBAWNCI2UZAVSKWJKFZB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YDDBMGBAWNCI2UZAVSKWJKFZB5","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":"890b36224a1e25eb3a509f30ff49cb8859aa8bdd347b81ffe01c75a51c225b3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T09:43:17Z","title_canon_sha256":"9272f1c60c86a7d0c491c29c1eb53226f25468b5d0b71461f5ff0ae2be8e6709"},"schema_version":"1.0","source":{"id":"1102.3537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3537","created_at":"2026-05-18T04:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3537v1","created_at":"2026-05-18T04:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3537","created_at":"2026-05-18T04:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"YDDBMGBAWNCI","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YDDBMGBAWNCI2UZA","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YDDBMGBA","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:8a0152232915e65611f38deb54195433fcb70a759a58d0d57ccc9173a22e2713","target":"graph","created_at":"2026-05-18T04:28:28Z","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":"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","authors_text":"Ariel Shiftan, Ely Porat, Guy Feigenblat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T09:43:17Z","title":"Even Better Framework for min-wise Based Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3537","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:af5e6ea0013bf2eb6bd1a88f5f692251cdd20f4a744a9782d6dd1b5923289c1a","target":"record","created_at":"2026-05-18T04:28:28Z","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":"890b36224a1e25eb3a509f30ff49cb8859aa8bdd347b81ffe01c75a51c225b3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-17T09:43:17Z","title_canon_sha256":"9272f1c60c86a7d0c491c29c1eb53226f25468b5d0b71461f5ff0ae2be8e6709"},"schema_version":"1.0","source":{"id":"1102.3537","kind":"arxiv","version":1}},"canonical_sha256":"c0c6161820b3448d5320ac9564a8b90f5308f7991028251e59b679c52d36e5b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0c6161820b3448d5320ac9564a8b90f5308f7991028251e59b679c52d36e5b3","first_computed_at":"2026-05-18T04:28:28.879221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:28.879221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6cTCGEWCc9PgnzyFAQZ/RPCp+iLt2LcnZjCEH6h4K3QwggTFyVrutu6KcGbZ5e9VFLgUSuDwe/KR6k3CmpNfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:28.879567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af5e6ea0013bf2eb6bd1a88f5f692251cdd20f4a744a9782d6dd1b5923289c1a","sha256:8a0152232915e65611f38deb54195433fcb70a759a58d0d57ccc9173a22e2713"],"state_sha256":"543fe1974af3dad7af03e6576b81c47e580e28691997f765d9f8b4eb941887c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORQxkoeCXdNH3iWG6eMb5NIq7I8JwnQFgKMu8LSxEccdhqg+BurJa2XqrwfYqqrGxwRftJ8Ji+R2SAm0O1gaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:22:32.482354Z","bundle_sha256":"6a601ed6d3f0e44eca49f91c93fa0f264e7d6d65fa99c7155e7995f010a3988f"}}