{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7BCSIAPK45VPVFHLXCWGY2JV2Y","short_pith_number":"pith:7BCSIAPK","canonical_record":{"source":{"id":"1805.05361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-14T18:04:28Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"5ae4c8ca1f404a08c645f5962b6927235c79f781187ffe6d3f4d79d23d89412d","abstract_canon_sha256":"5060993fdfbfa1e961aef5f773bd82d0f044e24003507fade2f92576e61bb065"},"schema_version":"1.0"},"canonical_sha256":"f8452401eae76afa94ebb8ac6c6935d61acb720576e16c6599520e9c187c21a7","source":{"kind":"arxiv","id":"1805.05361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05361","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05361v1","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05361","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"7BCSIAPK45VP","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7BCSIAPK45VPVFHL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7BCSIAPK","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7BCSIAPK45VPVFHLXCWGY2JV2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-14T18:04:28Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"5ae4c8ca1f404a08c645f5962b6927235c79f781187ffe6d3f4d79d23d89412d","abstract_canon_sha256":"5060993fdfbfa1e961aef5f773bd82d0f044e24003507fade2f92576e61bb065"},"schema_version":"1.0"},"canonical_sha256":"f8452401eae76afa94ebb8ac6c6935d61acb720576e16c6599520e9c187c21a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:02.533589Z","signature_b64":"OKRU9hOCvBgrNny/vhC9wZ29CDYk5k9IurSj6M7r5EfW9DMJV6OcIi4KYkJDMdiEnHCwPFTIrJkcZ1ACnNW3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8452401eae76afa94ebb8ac6c6935d61acb720576e16c6599520e9c187c21a7","last_reissued_at":"2026-05-18T00:16:02.533102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:02.533102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05361","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-18T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLh1QBznWkbQvk9C7QDdqEZNUJTXYLlHT8377AsgQqO9moBNGoUymnnbmRhZd/tHXRVtKkBYcBFfkzOAxJbBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:24:46.201502Z"},"content_sha256":"1a140fd83582206ad509928bb400af49af2a2274717d3d608ba4cf7d4993f613","schema_version":"1.0","event_id":"sha256:1a140fd83582206ad509928bb400af49af2a2274717d3d608ba4cf7d4993f613"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7BCSIAPK45VPVFHLXCWGY2JV2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NASH: Toward End-to-End Neural Architecture for Generative Semantic Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CL","authors_text":"Dinghan Shen, Guoyin Wang, Lawrence Carin, Paidamoyo Chapfuwa, Qinliang su, Ricardo Henao, Wenlin Wang","submitted_at":"2018-05-14T18:04:28Z","abstract_excerpt":"Semantic hashing has become a powerful paradigm for fast similarity search in many information retrieval systems. While fairly successful, previous techniques generally require two-stage training, and the binary constraints are handled ad-hoc. In this paper, we present an end-to-end Neural Architecture for Semantic Hashing (NASH), where the binary hashing codes are treated as Bernoulli latent variables. A neural variational inference framework is proposed for training, where gradients are directly back-propagated through the discrete latent variable to optimize the hash function. We also draw "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05361","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-18T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WK4lUZzcg5nDhH5BEmyOeZkZSdjU5z2k51byUCpqzBqNzucmbyUMmY9igESHOaJoxEQyvkGWfQMJt11O9UilCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:24:46.202237Z"},"content_sha256":"9ce562f74428a4caf6d6d20a8b2835ffc15b728eef0c84007f57f5d32a210b0a","schema_version":"1.0","event_id":"sha256:9ce562f74428a4caf6d6d20a8b2835ffc15b728eef0c84007f57f5d32a210b0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BCSIAPK45VPVFHLXCWGY2JV2Y/bundle.json","state_url":"https://pith.science/pith/7BCSIAPK45VPVFHLXCWGY2JV2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BCSIAPK45VPVFHLXCWGY2JV2Y/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-19T08:24:46Z","links":{"resolver":"https://pith.science/pith/7BCSIAPK45VPVFHLXCWGY2JV2Y","bundle":"https://pith.science/pith/7BCSIAPK45VPVFHLXCWGY2JV2Y/bundle.json","state":"https://pith.science/pith/7BCSIAPK45VPVFHLXCWGY2JV2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BCSIAPK45VPVFHLXCWGY2JV2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7BCSIAPK45VPVFHLXCWGY2JV2Y","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":"5060993fdfbfa1e961aef5f773bd82d0f044e24003507fade2f92576e61bb065","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-14T18:04:28Z","title_canon_sha256":"5ae4c8ca1f404a08c645f5962b6927235c79f781187ffe6d3f4d79d23d89412d"},"schema_version":"1.0","source":{"id":"1805.05361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05361","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05361v1","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05361","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"7BCSIAPK45VP","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7BCSIAPK45VPVFHL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7BCSIAPK","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:9ce562f74428a4caf6d6d20a8b2835ffc15b728eef0c84007f57f5d32a210b0a","target":"graph","created_at":"2026-05-18T00:16:02Z","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":"Semantic hashing has become a powerful paradigm for fast similarity search in many information retrieval systems. While fairly successful, previous techniques generally require two-stage training, and the binary constraints are handled ad-hoc. In this paper, we present an end-to-end Neural Architecture for Semantic Hashing (NASH), where the binary hashing codes are treated as Bernoulli latent variables. A neural variational inference framework is proposed for training, where gradients are directly back-propagated through the discrete latent variable to optimize the hash function. We also draw ","authors_text":"Dinghan Shen, Guoyin Wang, Lawrence Carin, Paidamoyo Chapfuwa, Qinliang su, Ricardo Henao, Wenlin Wang","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-14T18:04:28Z","title":"NASH: Toward End-to-End Neural Architecture for Generative Semantic Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05361","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:1a140fd83582206ad509928bb400af49af2a2274717d3d608ba4cf7d4993f613","target":"record","created_at":"2026-05-18T00:16:02Z","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":"5060993fdfbfa1e961aef5f773bd82d0f044e24003507fade2f92576e61bb065","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-14T18:04:28Z","title_canon_sha256":"5ae4c8ca1f404a08c645f5962b6927235c79f781187ffe6d3f4d79d23d89412d"},"schema_version":"1.0","source":{"id":"1805.05361","kind":"arxiv","version":1}},"canonical_sha256":"f8452401eae76afa94ebb8ac6c6935d61acb720576e16c6599520e9c187c21a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8452401eae76afa94ebb8ac6c6935d61acb720576e16c6599520e9c187c21a7","first_computed_at":"2026-05-18T00:16:02.533102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:02.533102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OKRU9hOCvBgrNny/vhC9wZ29CDYk5k9IurSj6M7r5EfW9DMJV6OcIi4KYkJDMdiEnHCwPFTIrJkcZ1ACnNW3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:02.533589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a140fd83582206ad509928bb400af49af2a2274717d3d608ba4cf7d4993f613","sha256:9ce562f74428a4caf6d6d20a8b2835ffc15b728eef0c84007f57f5d32a210b0a"],"state_sha256":"afce0e1020fb0388315beb07a21367f507f4bb7466475e6e5204180fed0e7194"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtIqn+IhP5VBQz/CrHW8Ckhaz9uWDuwU/ADTPxgH+L/dAW/t/mVAnSiy01zNd/UaWsjwjIy8aopb+nN5AL4/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:24:46.205417Z","bundle_sha256":"6565ec5e84da1abe9c92fb8d0d6fcfc6bcfb542047eb980ed5f11fbb088467fe"}}