{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:36NW3KZ2SPICFMXYE3W6QGHZWW","short_pith_number":"pith:36NW3KZ2","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"},"canonical_sha256":"df9b6dab3a93d022b2f826ede818f9b5a437600750fe97790907b50eb9a3853c","source":{"kind":"arxiv","id":"1903.01545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01545","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01545v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01545","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"36NW3KZ2SPIC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"36NW3KZ2SPICFMXY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"36NW3KZ2","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:36NW3KZ2SPICFMXYE3W6QGHZWW","target":"record","payload":{"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"},"canonical_sha256":"df9b6dab3a93d022b2f826ede818f9b5a437600750fe97790907b50eb9a3853c","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"},"source_kind":"arxiv","source_id":"1903.01545","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-17T23:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqeWjwRxKNASrp6/gLPQBntpKIxUQuDAKtuF3DfmUPThQFwEH2KgxtcBWbnwoGaHhsQKfbFFYGcuujCygVM6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:14:42.256027Z"},"content_sha256":"3ab75c4d02e00f018c3b5e5165e78879992277a1c4faa7b8d67227ec8b2d61a3","schema_version":"1.0","event_id":"sha256:3ab75c4d02e00f018c3b5e5165e78879992277a1c4faa7b8d67227ec8b2d61a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:36NW3KZ2SPICFMXYE3W6QGHZWW","target":"graph","payload":{"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"},"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-17T23:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42mwYtqTAEwHjSUK+sqnbr6xe6lkA7L62rNnOA76xWDLz5F6BvkGDI0jEthkYKaLpdiMB6UVF9E32iWyY9FbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:14:42.256707Z"},"content_sha256":"fd0279cf3fc676101587eebeb41b0c10625ad8f79dfc515be3e842c52433777b","schema_version":"1.0","event_id":"sha256:fd0279cf3fc676101587eebeb41b0c10625ad8f79dfc515be3e842c52433777b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/bundle.json","state_url":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/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-05-24T00:14:42Z","links":{"resolver":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW","bundle":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/bundle.json","state":"https://pith.science/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36NW3KZ2SPICFMXYE3W6QGHZWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:36NW3KZ2SPICFMXYE3W6QGHZWW","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":"ec5502c3a67c656aac29e6c09c497d5e86f756a5167699178ae496d18a7130e6","cross_cats_sorted":["cs.IR","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-04T21:24:26Z","title_canon_sha256":"763892e0bb84a911a54088f3475d4ca919a338fb8814f65dd8780558043ee5d5"},"schema_version":"1.0","source":{"id":"1903.01545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01545","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01545v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01545","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"36NW3KZ2SPIC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"36NW3KZ2SPICFMXY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"36NW3KZ2","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:fd0279cf3fc676101587eebeb41b0c10625ad8f79dfc515be3e842c52433777b","target":"graph","created_at":"2026-05-17T23:52:00Z","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":"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","authors_text":"Shih-Fu Chang, Svebor Karaman, Xudong Lin, Xuefeng Hu","cross_cats":["cs.IR","cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-04T21:24:26Z","title":"Unsupervised Rank-Preserving Hashing for Large-Scale Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01545","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:3ab75c4d02e00f018c3b5e5165e78879992277a1c4faa7b8d67227ec8b2d61a3","target":"record","created_at":"2026-05-17T23:52:00Z","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":"ec5502c3a67c656aac29e6c09c497d5e86f756a5167699178ae496d18a7130e6","cross_cats_sorted":["cs.IR","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-04T21:24:26Z","title_canon_sha256":"763892e0bb84a911a54088f3475d4ca919a338fb8814f65dd8780558043ee5d5"},"schema_version":"1.0","source":{"id":"1903.01545","kind":"arxiv","version":1}},"canonical_sha256":"df9b6dab3a93d022b2f826ede818f9b5a437600750fe97790907b50eb9a3853c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df9b6dab3a93d022b2f826ede818f9b5a437600750fe97790907b50eb9a3853c","first_computed_at":"2026-05-17T23:52:00.348801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:00.348801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WrZVtiRR4PteyNAiNvuykqWIlQB+sH1uu6B/bCIwsFrBCCj2bUE25NOFUKn4ru5EMIBIo4HnBVfPzNlpd6YXBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:00.349209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ab75c4d02e00f018c3b5e5165e78879992277a1c4faa7b8d67227ec8b2d61a3","sha256:fd0279cf3fc676101587eebeb41b0c10625ad8f79dfc515be3e842c52433777b"],"state_sha256":"d3e39ced2470ad76ae9517ed7515edf05fc3ae64f8465c20e71938eb8cbe38a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FaaiqhS6bmYYCYfZs94otdwiIZzB+b06rEXHOYW6Amngso5cpKvFuSK/5vlXSREW17EPglblBbBhm+ZSLY0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:14:42.260241Z","bundle_sha256":"e1ce27ce14085effaa1577604943fa9b021dafaa6a4daa62ccc0d52b8a5bdf79"}}