{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LYCJ76XAFNEEO4CHLHAYMPSCNQ","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":"a7a6aee06a1c3110b7ae46718b12451de0c246bfa9adec6f7ea703656fede71d","cross_cats_sorted":["cs.IR","cs.IT","math.IT","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-08-06T12:28:06Z","title_canon_sha256":"23467896f77f98e6a47a755521e47ac6782396d722206583642f925836a59fe6"},"schema_version":"1.0","source":{"id":"1208.1259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1259","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1259v1","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1259","created_at":"2026-05-18T03:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"LYCJ76XAFNEE","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LYCJ76XAFNEEO4CH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LYCJ76XA","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:1bfb1b70e079b773366ca88d11181bf94bb82fa2c1f184273e084a40cbc23544","target":"graph","created_at":"2026-05-18T03:49:19Z","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":"Recently, the method of b-bit minwise hashing has been applied to large-scale linear learning and sublinear time near-neighbor search. The major drawback of minwise hashing is the expensive preprocessing cost, as the method requires applying (e.g.,) k=200 to 500 permutations on the data. The testing time can also be expensive if a new data point (e.g., a new document or image) has not been processed, which might be a significant issue in user-facing applications.\n  We develop a very simple solution based on one permutation hashing. Conceptually, given a massive binary data matrix, we permute t","authors_text":"Art Owen, Cun-Hui Zhang, Ping Li","cross_cats":["cs.IR","cs.IT","math.IT","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-08-06T12:28:06Z","title":"One Permutation Hashing for Efficient Search and Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1259","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:ed770c01b09c10882841e802bc1dfee2ac5247a4bbf1e38875542bf6edcdbfe0","target":"record","created_at":"2026-05-18T03:49:19Z","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":"a7a6aee06a1c3110b7ae46718b12451de0c246bfa9adec6f7ea703656fede71d","cross_cats_sorted":["cs.IR","cs.IT","math.IT","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-08-06T12:28:06Z","title_canon_sha256":"23467896f77f98e6a47a755521e47ac6782396d722206583642f925836a59fe6"},"schema_version":"1.0","source":{"id":"1208.1259","kind":"arxiv","version":1}},"canonical_sha256":"5e049ffae02b4847704759c1863e426c21ea89144976136abc7eab5e1f4ef15a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e049ffae02b4847704759c1863e426c21ea89144976136abc7eab5e1f4ef15a","first_computed_at":"2026-05-18T03:49:19.448810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:19.448810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+S7X/GQaHr9BKF0yWD5jqYL5H1jT7rw08jLi5W2c+bo9s7pIsC4Y24094oOTD1yDDjEM5tTnZJBufTzEit9yBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:19.449502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed770c01b09c10882841e802bc1dfee2ac5247a4bbf1e38875542bf6edcdbfe0","sha256:1bfb1b70e079b773366ca88d11181bf94bb82fa2c1f184273e084a40cbc23544"],"state_sha256":"391a1aaedc92ad47b56be1c285c2a418c28fbbdd633363ef3ed926dabae37f9b"}