{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:36NW3KZ2SPICFMXYE3W6QGHZWW","short_pith_number":"pith:36NW3KZ2","schema_version":"1.0","canonical_sha256":"df9b6dab3a93d022b2f826ede818f9b5a437600750fe97790907b50eb9a3853c","source":{"kind":"arxiv","id":"1903.01545","version":1},"attestation_state":"computed","paper":{"title":"Unsupervised Rank-Preserving Hashing for Large-Scale Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.MM"],"primary_cat":"cs.CV","authors_text":"Shih-Fu Chang, Svebor Karaman, Xudong Lin, Xuefeng Hu","submitted_at":"2019-03-04T21:24:26Z","abstract_excerpt":"We propose an unsupervised hashing method which aims to produce binary codes that preserve the ranking induced by a real-valued representation. Such compact hash codes enable the complete elimination of real-valued feature storage and allow for significant reduction of the computation complexity and storage cost of large-scale image retrieval applications. Specifically, we learn a neural network-based model, which transforms the input representation into a binary representation. We formalize the training objective of the network in an intuitive and effective way, considering each training samp"},"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":"1903.01545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-04T21:24:26Z","cross_cats_sorted":["cs.IR","cs.MM"],"title_canon_sha256":"763892e0bb84a911a54088f3475d4ca919a338fb8814f65dd8780558043ee5d5","abstract_canon_sha256":"ec5502c3a67c656aac29e6c09c497d5e86f756a5167699178ae496d18a7130e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:00.349209Z","signature_b64":"WrZVtiRR4PteyNAiNvuykqWIlQB+sH1uu6B/bCIwsFrBCCj2bUE25NOFUKn4ru5EMIBIo4HnBVfPzNlpd6YXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df9b6dab3a93d022b2f826ede818f9b5a437600750fe97790907b50eb9a3853c","last_reissued_at":"2026-05-17T23:52:00.348801Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:00.348801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Rank-Preserving Hashing for Large-Scale Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.MM"],"primary_cat":"cs.CV","authors_text":"Shih-Fu Chang, Svebor Karaman, Xudong Lin, Xuefeng Hu","submitted_at":"2019-03-04T21:24:26Z","abstract_excerpt":"We propose an unsupervised hashing method which aims to produce binary codes that preserve the ranking induced by a real-valued representation. Such compact hash codes enable the complete elimination of real-valued feature storage and allow for significant reduction of the computation complexity and storage cost of large-scale image retrieval applications. Specifically, we learn a neural network-based model, which transforms the input representation into a binary representation. We formalize the training objective of the network in an intuitive and effective way, considering each training samp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01545","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.01545","created_at":"2026-05-17T23:52:00.348867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01545v1","created_at":"2026-05-17T23:52:00.348867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01545","created_at":"2026-05-17T23:52:00.348867+00:00"},{"alias_kind":"pith_short_12","alias_value":"36NW3KZ2SPIC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"36NW3KZ2SPICFMXY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"36NW3KZ2","created_at":"2026-05-18T12:33:07.085635+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/36NW3KZ2SPICFMXYE3W6QGHZWW","json":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW.json","graph_json":"https://pith.science/api/pith-number/36NW3KZ2SPICFMXYE3W6QGHZWW/graph.json","events_json":"https://pith.science/api/pith-number/36NW3KZ2SPICFMXYE3W6QGHZWW/events.json","paper":"https://pith.science/paper/36NW3KZ2"},"agent_actions":{"view_html":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW","download_json":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW.json","view_paper":"https://pith.science/paper/36NW3KZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01545&json=true","fetch_graph":"https://pith.science/api/pith-number/36NW3KZ2SPICFMXYE3W6QGHZWW/graph.json","fetch_events":"https://pith.science/api/pith-number/36NW3KZ2SPICFMXYE3W6QGHZWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/action/storage_attestation","attest_author":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/action/author_attestation","sign_citation":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/action/citation_signature","submit_replication":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/action/replication_record"}},"created_at":"2026-05-17T23:52:00.348867+00:00","updated_at":"2026-05-17T23:52:00.348867+00:00"}