{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UKDCOOSHLQIE2VVCLN2N5XNNLO","short_pith_number":"pith:UKDCOOSH","schema_version":"1.0","canonical_sha256":"a286273a475c104d56a25b74deddad5b99fe1413b28a99ebe80e5fcc97ce9354","source":{"kind":"arxiv","id":"1604.06480","version":2},"attestation_state":"computed","paper":{"title":"LOH and behold: Web-scale visual search, recommendation and clustering using Locally Optimized Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.MM"],"primary_cat":"cs.CV","authors_text":"Clayton Mellina, David A. Shamma, Huy Nguyen, Lyndon Kennedy, Yannis Kalantidis","submitted_at":"2016-04-21T20:23:55Z","abstract_excerpt":"We propose a novel hashing-based matching scheme, called Locally Optimized Hashing (LOH), based on a state-of-the-art quantization algorithm that can be used for efficient, large-scale search, recommendation, clustering, and deduplication. We show that matching with LOH only requires set intersections and summations to compute and so is easily implemented in generic distributed computing systems. We further show application of LOH to: a) large-scale search tasks where performance is on par with other state-of-the-art hashing approaches; b) large-scale recommendation where queries consisting of"},"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":"1604.06480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-04-21T20:23:55Z","cross_cats_sorted":["cs.IR","cs.MM"],"title_canon_sha256":"b9651fcc6eb856806007597d5492435419fe57b86b0578f6e3db50104d7fda66","abstract_canon_sha256":"40eb171a7595bb6cf8238b6ca4412bb4c37f3461c5c05656e445842830a8b9d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:14.454305Z","signature_b64":"BoSDvfqJ4SA2UgtTrzU7yLUx0JKkXozf61Hh+g9N7cmjXC4xGsF19KM7PbnJhep5nIqVtYPF41hmn5hFO0k8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a286273a475c104d56a25b74deddad5b99fe1413b28a99ebe80e5fcc97ce9354","last_reissued_at":"2026-05-18T01:10:14.453708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:14.453708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LOH and behold: Web-scale visual search, recommendation and clustering using Locally Optimized Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.MM"],"primary_cat":"cs.CV","authors_text":"Clayton Mellina, David A. Shamma, Huy Nguyen, Lyndon Kennedy, Yannis Kalantidis","submitted_at":"2016-04-21T20:23:55Z","abstract_excerpt":"We propose a novel hashing-based matching scheme, called Locally Optimized Hashing (LOH), based on a state-of-the-art quantization algorithm that can be used for efficient, large-scale search, recommendation, clustering, and deduplication. We show that matching with LOH only requires set intersections and summations to compute and so is easily implemented in generic distributed computing systems. We further show application of LOH to: a) large-scale search tasks where performance is on par with other state-of-the-art hashing approaches; b) large-scale recommendation where queries consisting of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06480","kind":"arxiv","version":2},"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":"1604.06480","created_at":"2026-05-18T01:10:14.453791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06480v2","created_at":"2026-05-18T01:10:14.453791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06480","created_at":"2026-05-18T01:10:14.453791+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKDCOOSHLQIE","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKDCOOSHLQIE2VVC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKDCOOSH","created_at":"2026-05-18T12:30:46.583412+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/UKDCOOSHLQIE2VVCLN2N5XNNLO","json":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO.json","graph_json":"https://pith.science/api/pith-number/UKDCOOSHLQIE2VVCLN2N5XNNLO/graph.json","events_json":"https://pith.science/api/pith-number/UKDCOOSHLQIE2VVCLN2N5XNNLO/events.json","paper":"https://pith.science/paper/UKDCOOSH"},"agent_actions":{"view_html":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO","download_json":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO.json","view_paper":"https://pith.science/paper/UKDCOOSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06480&json=true","fetch_graph":"https://pith.science/api/pith-number/UKDCOOSHLQIE2VVCLN2N5XNNLO/graph.json","fetch_events":"https://pith.science/api/pith-number/UKDCOOSHLQIE2VVCLN2N5XNNLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO/action/storage_attestation","attest_author":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO/action/author_attestation","sign_citation":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO/action/citation_signature","submit_replication":"https://pith.science/pith/UKDCOOSHLQIE2VVCLN2N5XNNLO/action/replication_record"}},"created_at":"2026-05-18T01:10:14.453791+00:00","updated_at":"2026-05-18T01:10:14.453791+00:00"}