{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NZIR57TWBY2G6W672F65LSWW2H","short_pith_number":"pith:NZIR57TW","canonical_record":{"source":{"id":"1310.4136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-15T18:21:39Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"dc3f224b47b04f71f34a17beb9840d9c81b47bb65caeb38108d18d74152a4e42","abstract_canon_sha256":"d8cc9417cbbb24cf360ec9449384cb3202ff0ceb64b37d771f5dd673b6a672cc"},"schema_version":"1.0"},"canonical_sha256":"6e511efe760e346f5bdfd17dd5cad6d1e816b979235322d42329d235655ed6ee","source":{"kind":"arxiv","id":"1310.4136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4136","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4136v1","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4136","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"NZIR57TWBY2G","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZIR57TWBY2G6W67","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZIR57TW","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NZIR57TWBY2G6W672F65LSWW2H","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-15T18:21:39Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"dc3f224b47b04f71f34a17beb9840d9c81b47bb65caeb38108d18d74152a4e42","abstract_canon_sha256":"d8cc9417cbbb24cf360ec9449384cb3202ff0ceb64b37d771f5dd673b6a672cc"},"schema_version":"1.0"},"canonical_sha256":"6e511efe760e346f5bdfd17dd5cad6d1e816b979235322d42329d235655ed6ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:24.956574Z","signature_b64":"zMUeZ7BhwtIRCQy+dBFnpE1jypfsUT1baIvCYDpgQeNw0Y61ftN7eTAA64Ir26Y2zqWwJIayM1yYmuoxjv7iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e511efe760e346f5bdfd17dd5cad6d1e816b979235322d42329d235655ed6ee","last_reissued_at":"2026-05-18T03:10:24.955770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:24.955770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4136","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-18T03:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13Po6dTTtUXI4qq66ZcdHi95wrEv91E5HEoG8vty9AhkWgwxUNVipad2uzScuNgMIZTlkraiUSiz4d9PY95JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:48:37.092241Z"},"content_sha256":"f8b81ac6f721535e1991e626c8c86a61bed245ab9e5b79f23143719d7b4261ec","schema_version":"1.0","event_id":"sha256:f8b81ac6f721535e1991e626c8c86a61bed245ab9e5b79f23143719d7b4261ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NZIR57TWBY2G6W672F65LSWW2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Locality-Sensitive Hashing for Similarity Search in High-Dimensional, Large-Scale Multimedia Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR"],"primary_cat":"cs.DC","authors_text":"Eduardo Valle, George Teodoro, Joel H. Saltz, Thiago S. F. X. Teixeira","submitted_at":"2013-10-15T18:21:39Z","abstract_excerpt":"Similarity search is critical for many database applications, including the increasingly popular online services for Content-Based Multimedia Retrieval (CBMR). These services, which include image search engines, must handle an overwhelming volume of data, while keeping low response times. Thus, scalability is imperative for similarity search in Web-scale applications, but most existing methods are sequential and target shared-memory machines. Here we address these issues with a distributed, efficient, and scalable index based on Locality-Sensitive Hashing (LSH). LSH is one of the most efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4136","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-18T03:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrfCNNegwohn5Xk4u++ERJz8jPhXj0ZmIXOH7PUyjb2wYcalXxZ/BDP2UP3SUq8+cdeyQJVjfrEhVHiy0T1JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:48:37.092605Z"},"content_sha256":"efaaf3dd71dfe7179248046e95a5ff159308e31fed54e8aff3965c1f6c83b410","schema_version":"1.0","event_id":"sha256:efaaf3dd71dfe7179248046e95a5ff159308e31fed54e8aff3965c1f6c83b410"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZIR57TWBY2G6W672F65LSWW2H/bundle.json","state_url":"https://pith.science/pith/NZIR57TWBY2G6W672F65LSWW2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZIR57TWBY2G6W672F65LSWW2H/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-03T14:48:37Z","links":{"resolver":"https://pith.science/pith/NZIR57TWBY2G6W672F65LSWW2H","bundle":"https://pith.science/pith/NZIR57TWBY2G6W672F65LSWW2H/bundle.json","state":"https://pith.science/pith/NZIR57TWBY2G6W672F65LSWW2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZIR57TWBY2G6W672F65LSWW2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NZIR57TWBY2G6W672F65LSWW2H","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":"d8cc9417cbbb24cf360ec9449384cb3202ff0ceb64b37d771f5dd673b6a672cc","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-15T18:21:39Z","title_canon_sha256":"dc3f224b47b04f71f34a17beb9840d9c81b47bb65caeb38108d18d74152a4e42"},"schema_version":"1.0","source":{"id":"1310.4136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4136","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4136v1","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4136","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"NZIR57TWBY2G","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZIR57TWBY2G6W67","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZIR57TW","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:efaaf3dd71dfe7179248046e95a5ff159308e31fed54e8aff3965c1f6c83b410","target":"graph","created_at":"2026-05-18T03:10:24Z","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":"Similarity search is critical for many database applications, including the increasingly popular online services for Content-Based Multimedia Retrieval (CBMR). These services, which include image search engines, must handle an overwhelming volume of data, while keeping low response times. Thus, scalability is imperative for similarity search in Web-scale applications, but most existing methods are sequential and target shared-memory machines. Here we address these issues with a distributed, efficient, and scalable index based on Locality-Sensitive Hashing (LSH). LSH is one of the most efficien","authors_text":"Eduardo Valle, George Teodoro, Joel H. Saltz, Thiago S. F. X. Teixeira","cross_cats":["cs.DB","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-15T18:21:39Z","title":"Scalable Locality-Sensitive Hashing for Similarity Search in High-Dimensional, Large-Scale Multimedia Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4136","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:f8b81ac6f721535e1991e626c8c86a61bed245ab9e5b79f23143719d7b4261ec","target":"record","created_at":"2026-05-18T03:10:24Z","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":"d8cc9417cbbb24cf360ec9449384cb3202ff0ceb64b37d771f5dd673b6a672cc","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-15T18:21:39Z","title_canon_sha256":"dc3f224b47b04f71f34a17beb9840d9c81b47bb65caeb38108d18d74152a4e42"},"schema_version":"1.0","source":{"id":"1310.4136","kind":"arxiv","version":1}},"canonical_sha256":"6e511efe760e346f5bdfd17dd5cad6d1e816b979235322d42329d235655ed6ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e511efe760e346f5bdfd17dd5cad6d1e816b979235322d42329d235655ed6ee","first_computed_at":"2026-05-18T03:10:24.955770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:24.955770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zMUeZ7BhwtIRCQy+dBFnpE1jypfsUT1baIvCYDpgQeNw0Y61ftN7eTAA64Ir26Y2zqWwJIayM1yYmuoxjv7iCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:24.956574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8b81ac6f721535e1991e626c8c86a61bed245ab9e5b79f23143719d7b4261ec","sha256:efaaf3dd71dfe7179248046e95a5ff159308e31fed54e8aff3965c1f6c83b410"],"state_sha256":"355b3c2f2f45dff987590e680ce3a7f82a0746451ac8990fa459974cc93b54ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMg7nWzTG5H0iT1msSg8upSIiAi+BVIPBfpY3a7Wpf99OHCe0v5yDsfR2LKAOUunXgDYerjsZyfqnvzSb//CAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:48:37.094758Z","bundle_sha256":"e47588dafeb22e3534fbf3b83e25e1b434e423569c2ef3b20d2d766c95f708aa"}}