{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CIJ3VZIYZPMOPV5LTUY4N4E2KR","short_pith_number":"pith:CIJ3VZIY","canonical_record":{"source":{"id":"1602.08393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T16:55:08Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"2a4d18a252205636a681e589c5a23ecd740d621d1347f2fef93646e7e8831b6d","abstract_canon_sha256":"d35bf16ba45b6d8a1005d270cc844cb6a58822b12d3d4a8e2de608b1040e2da8"},"schema_version":"1.0"},"canonical_sha256":"1213bae518cbd8e7d7ab9d31c6f09a5454cc5562476bc499dc892396775b3293","source":{"kind":"arxiv","id":"1602.08393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08393","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08393v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08393","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"CIJ3VZIYZPMO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIJ3VZIYZPMOPV5L","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIJ3VZIY","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CIJ3VZIYZPMOPV5LTUY4N4E2KR","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T16:55:08Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"2a4d18a252205636a681e589c5a23ecd740d621d1347f2fef93646e7e8831b6d","abstract_canon_sha256":"d35bf16ba45b6d8a1005d270cc844cb6a58822b12d3d4a8e2de608b1040e2da8"},"schema_version":"1.0"},"canonical_sha256":"1213bae518cbd8e7d7ab9d31c6f09a5454cc5562476bc499dc892396775b3293","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.167997Z","signature_b64":"V6nqtqSfdsNizNQ3vARSYeGKKJwyr8Su465RC4OD8WVrC9eaTsFkk69w4ZDsynypaiV6bYPRDFWfigXt882PDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1213bae518cbd8e7d7ab9d31c6f09a5454cc5562476bc499dc892396775b3293","last_reissued_at":"2026-05-18T01:19:56.167387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.167387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08393","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-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Lkr+8TeuSfVh0GJgh+uj+qrNJ0pGO412vgZ3EXBkwcIPzT/W57NDhCCBGcdmuvC3vNvwjRe5jYcl1WLW5t6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:25:40.810223Z"},"content_sha256":"47e3acd787a60933b8f6700e7b8b0b92761496cba53cf08b6ec911cad8fec6eb","schema_version":"1.0","event_id":"sha256:47e3acd787a60933b8f6700e7b8b0b92761496cba53cf08b6ec911cad8fec6eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CIJ3VZIYZPMOPV5LTUY4N4E2KR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Weighted Minwise Hashing in Constant Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Anshumali Shrivastava","submitted_at":"2016-02-26T16:55:08Z","abstract_excerpt":"Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many celebrated approximation algorithms, commonly adopted in industrial practice for large scale-search and learning. The resource bottleneck of the algorithms is the computation of multiple (typically a few hundreds to thousands) independent hashes of the data. The fastest hashing algorithm is by Ioffe \\cite{Proc:Ioffe_ICDM10}, which requires one pass over the entire data vector, $O(d)$ ($d$ is the number of non-zeros), for computing one hash. However, the requirement of multiple hashes demands hundreds or thous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08393","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-18T01:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vV1Pm94OgB95z2B1Y6hCa6nKtME6BeyneXDjZ7fx/vjM+JtjMKaf2lYPCc7zZqy2xnNcwTnXtVSWm8IRcfrhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:25:40.810671Z"},"content_sha256":"d6669d326e2b2814917446b87a095a89dbaddb8f4ff3dc887655e6dfd3188e73","schema_version":"1.0","event_id":"sha256:d6669d326e2b2814917446b87a095a89dbaddb8f4ff3dc887655e6dfd3188e73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIJ3VZIYZPMOPV5LTUY4N4E2KR/bundle.json","state_url":"https://pith.science/pith/CIJ3VZIYZPMOPV5LTUY4N4E2KR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIJ3VZIYZPMOPV5LTUY4N4E2KR/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-08-21T04:25:40Z","links":{"resolver":"https://pith.science/pith/CIJ3VZIYZPMOPV5LTUY4N4E2KR","bundle":"https://pith.science/pith/CIJ3VZIYZPMOPV5LTUY4N4E2KR/bundle.json","state":"https://pith.science/pith/CIJ3VZIYZPMOPV5LTUY4N4E2KR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIJ3VZIYZPMOPV5LTUY4N4E2KR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CIJ3VZIYZPMOPV5LTUY4N4E2KR","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":"d35bf16ba45b6d8a1005d270cc844cb6a58822b12d3d4a8e2de608b1040e2da8","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T16:55:08Z","title_canon_sha256":"2a4d18a252205636a681e589c5a23ecd740d621d1347f2fef93646e7e8831b6d"},"schema_version":"1.0","source":{"id":"1602.08393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08393","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08393v1","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08393","created_at":"2026-05-18T01:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"CIJ3VZIYZPMO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIJ3VZIYZPMOPV5L","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIJ3VZIY","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:d6669d326e2b2814917446b87a095a89dbaddb8f4ff3dc887655e6dfd3188e73","target":"graph","created_at":"2026-05-18T01:19:56Z","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":"Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many celebrated approximation algorithms, commonly adopted in industrial practice for large scale-search and learning. The resource bottleneck of the algorithms is the computation of multiple (typically a few hundreds to thousands) independent hashes of the data. The fastest hashing algorithm is by Ioffe \\cite{Proc:Ioffe_ICDM10}, which requires one pass over the entire data vector, $O(d)$ ($d$ is the number of non-zeros), for computing one hash. However, the requirement of multiple hashes demands hundreds or thous","authors_text":"Anshumali Shrivastava","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T16:55:08Z","title":"Exact Weighted Minwise Hashing in Constant Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08393","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:47e3acd787a60933b8f6700e7b8b0b92761496cba53cf08b6ec911cad8fec6eb","target":"record","created_at":"2026-05-18T01:19:56Z","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":"d35bf16ba45b6d8a1005d270cc844cb6a58822b12d3d4a8e2de608b1040e2da8","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-26T16:55:08Z","title_canon_sha256":"2a4d18a252205636a681e589c5a23ecd740d621d1347f2fef93646e7e8831b6d"},"schema_version":"1.0","source":{"id":"1602.08393","kind":"arxiv","version":1}},"canonical_sha256":"1213bae518cbd8e7d7ab9d31c6f09a5454cc5562476bc499dc892396775b3293","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1213bae518cbd8e7d7ab9d31c6f09a5454cc5562476bc499dc892396775b3293","first_computed_at":"2026-05-18T01:19:56.167387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:56.167387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V6nqtqSfdsNizNQ3vARSYeGKKJwyr8Su465RC4OD8WVrC9eaTsFkk69w4ZDsynypaiV6bYPRDFWfigXt882PDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:56.167997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47e3acd787a60933b8f6700e7b8b0b92761496cba53cf08b6ec911cad8fec6eb","sha256:d6669d326e2b2814917446b87a095a89dbaddb8f4ff3dc887655e6dfd3188e73"],"state_sha256":"81a21323300514f74e7e6a9f1ea17fd8d1d1254092df3dfebfc8ed1f46e2673f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ry64bIb7bk67sAaMCZx43d6u3DhVBSxrtdLSZyNnSBRwQMaj/MDvfAon4XhPF+CMhaLPbvYcFODyuBl/roGrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T04:25:40.814998Z","bundle_sha256":"af0f7c517feb78593897d0f55f03b9cf671f008ee1cb0aa1efe9caa9fd1bf22d"}}