{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FJBZAMEK34CYCWLEFOUJCM2ZRV","short_pith_number":"pith:FJBZAMEK","canonical_record":{"source":{"id":"1701.02815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-11T00:23:34Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"5843052988ff9fb0068d5610b658befb3e968774f37eaf892897e4b93500f54f","abstract_canon_sha256":"7390e57d50556a915d3a18d4a66e93fe919b39fe1a6f41d640795efc1fe17199"},"schema_version":"1.0"},"canonical_sha256":"2a4390308adf058159642ba89133598d5f7b69661bc21dd4bd1ada1263e40133","source":{"kind":"arxiv","id":"1701.02815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02815","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02815v2","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02815","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"FJBZAMEK34CY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJBZAMEK34CYCWLE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJBZAMEK","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FJBZAMEK34CYCWLEFOUJCM2ZRV","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-11T00:23:34Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"5843052988ff9fb0068d5610b658befb3e968774f37eaf892897e4b93500f54f","abstract_canon_sha256":"7390e57d50556a915d3a18d4a66e93fe919b39fe1a6f41d640795efc1fe17199"},"schema_version":"1.0"},"canonical_sha256":"2a4390308adf058159642ba89133598d5f7b69661bc21dd4bd1ada1263e40133","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:09.039682Z","signature_b64":"ZpiX86WyekYAryCvFCVD0c6kroHnIEf7SpuQ1RMcmG+cP/KhsXPiilFTsx0saKyaYB3BVfTpfFMGrn7ScUADAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a4390308adf058159642ba89133598d5f7b69661bc21dd4bd1ada1263e40133","last_reissued_at":"2026-05-18T00:38:09.039200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:09.039200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02815","source_version":2,"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-18T00:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zf6zKmja7m+gYuLsvvyzSOssJhXWczdDBkpc8t0ofTn2zye3XfmBUGSs2YaGZa4S9/KqruRvQNORn+3b9IuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:08:48.248566Z"},"content_sha256":"4051e79a332ded946a2a42bd7664c4b50bf78abd7c8ae3350aa009925d20c7fa","schema_version":"1.0","event_id":"sha256:4051e79a332ded946a2a42bd7664c4b50bf78abd7c8ae3350aa009925d20c7fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FJBZAMEK34CYCWLEFOUJCM2ZRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Generative Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Dai, Le Song, Niao He, Ruiqi Guo, Sanjiv Kumar","submitted_at":"2017-01-11T00:23:34Z","abstract_excerpt":"Learning-based binary hashing has become a powerful paradigm for fast search and retrieval in massive databases. However, due to the requirement of discrete outputs for the hash functions, learning such functions is known to be very challenging. In addition, the objective functions adopted by existing hashing techniques are mostly chosen heuristically. In this paper, we propose a novel generative approach to learn hash functions through Minimum Description Length principle such that the learned hash codes maximally compress the dataset and can also be used to regenerate the inputs. We also dev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02815","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"},"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-18T00:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8C7G00rmMs+qlVyoN9qXwy2qRVSgd1fUWeV+UBRI0Y99qPKrkpps+KdZyuxM/cEdGPDwkKsKtWfIun3hxNblCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:08:48.249204Z"},"content_sha256":"f64733c9a8725b405754751d80f363c058c13f9a91328ee5ac9fa62fb4eb2ed3","schema_version":"1.0","event_id":"sha256:f64733c9a8725b405754751d80f363c058c13f9a91328ee5ac9fa62fb4eb2ed3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJBZAMEK34CYCWLEFOUJCM2ZRV/bundle.json","state_url":"https://pith.science/pith/FJBZAMEK34CYCWLEFOUJCM2ZRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJBZAMEK34CYCWLEFOUJCM2ZRV/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-23T08:08:48Z","links":{"resolver":"https://pith.science/pith/FJBZAMEK34CYCWLEFOUJCM2ZRV","bundle":"https://pith.science/pith/FJBZAMEK34CYCWLEFOUJCM2ZRV/bundle.json","state":"https://pith.science/pith/FJBZAMEK34CYCWLEFOUJCM2ZRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJBZAMEK34CYCWLEFOUJCM2ZRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FJBZAMEK34CYCWLEFOUJCM2ZRV","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":"7390e57d50556a915d3a18d4a66e93fe919b39fe1a6f41d640795efc1fe17199","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-11T00:23:34Z","title_canon_sha256":"5843052988ff9fb0068d5610b658befb3e968774f37eaf892897e4b93500f54f"},"schema_version":"1.0","source":{"id":"1701.02815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02815","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02815v2","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02815","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"FJBZAMEK34CY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJBZAMEK34CYCWLE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJBZAMEK","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:f64733c9a8725b405754751d80f363c058c13f9a91328ee5ac9fa62fb4eb2ed3","target":"graph","created_at":"2026-05-18T00:38:09Z","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":"Learning-based binary hashing has become a powerful paradigm for fast search and retrieval in massive databases. However, due to the requirement of discrete outputs for the hash functions, learning such functions is known to be very challenging. In addition, the objective functions adopted by existing hashing techniques are mostly chosen heuristically. In this paper, we propose a novel generative approach to learn hash functions through Minimum Description Length principle such that the learned hash codes maximally compress the dataset and can also be used to regenerate the inputs. We also dev","authors_text":"Bo Dai, Le Song, Niao He, Ruiqi Guo, Sanjiv Kumar","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-11T00:23:34Z","title":"Stochastic Generative Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02815","kind":"arxiv","version":2},"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:4051e79a332ded946a2a42bd7664c4b50bf78abd7c8ae3350aa009925d20c7fa","target":"record","created_at":"2026-05-18T00:38:09Z","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":"7390e57d50556a915d3a18d4a66e93fe919b39fe1a6f41d640795efc1fe17199","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-11T00:23:34Z","title_canon_sha256":"5843052988ff9fb0068d5610b658befb3e968774f37eaf892897e4b93500f54f"},"schema_version":"1.0","source":{"id":"1701.02815","kind":"arxiv","version":2}},"canonical_sha256":"2a4390308adf058159642ba89133598d5f7b69661bc21dd4bd1ada1263e40133","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a4390308adf058159642ba89133598d5f7b69661bc21dd4bd1ada1263e40133","first_computed_at":"2026-05-18T00:38:09.039200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:09.039200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZpiX86WyekYAryCvFCVD0c6kroHnIEf7SpuQ1RMcmG+cP/KhsXPiilFTsx0saKyaYB3BVfTpfFMGrn7ScUADAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:09.039682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4051e79a332ded946a2a42bd7664c4b50bf78abd7c8ae3350aa009925d20c7fa","sha256:f64733c9a8725b405754751d80f363c058c13f9a91328ee5ac9fa62fb4eb2ed3"],"state_sha256":"1e0da497a10cbbace4fdab36536c0a151517abae2c174f90777cf19cd25db4e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8ClnPv1VA/bs27SgOuS19R4RB3nxnSavKeOJHWyDCNL2w7CKRpk6dqxU7TYSaYzaooh2QGNFtJmqFUUvoY+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:08:48.252504Z","bundle_sha256":"e1cb72dc3018cf6f5226d4a9513cb78eba4384853b742c2f6c87c34884bc042c"}}