{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NNODDW44ZPKV7V2AYD4MXWWFCC","short_pith_number":"pith:NNODDW44","schema_version":"1.0","canonical_sha256":"6b5c31db9ccbd55fd740c0f8cbdac510990d9203e707efd7cc46f5fc758cdaa0","source":{"kind":"arxiv","id":"2007.00380","version":1},"attestation_state":"computed","paper":{"title":"Unsupervised Semantic Hashing with Pairwise Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Casper Hansen, Christian Hansen, Christina Lioma, Jakob Grue Simonsen, Stephen Alstrup","submitted_at":"2020-07-01T10:54:27Z","abstract_excerpt":"Semantic Hashing is a popular family of methods for efficient similarity search in large-scale datasets. In Semantic Hashing, documents are encoded as short binary vectors (i.e., hash codes), such that semantic similarity can be efficiently computed using the Hamming distance. Recent state-of-the-art approaches have utilized weak supervision to train better performing hashing models. Inspired by this, we present Semantic Hashing with Pairwise Reconstruction (PairRec), which is a discrete variational autoencoder based hashing model. PairRec first encodes weakly supervised training pairs (a quer"},"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":"2007.00380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-07-01T10:54:27Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"1a0a794f93a6202664f4dfdfb7d890cb9f3ff400d7170d1fcaa8046610eee1da","abstract_canon_sha256":"e7f0f8de66fff5b1a2670608ba4ed6167fab3a0179c55617cbfa3a83cc9615bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:31.280747Z","signature_b64":"8Eo7WgHnd3RmxKSDF9TgBAyq63KtKU0TqeGZE/6onPpxeNIlvHMCfqweprUrZw5wyFaa74QanXytWz4d49J0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5c31db9ccbd55fd740c0f8cbdac510990d9203e707efd7cc46f5fc758cdaa0","last_reissued_at":"2026-07-05T01:15:31.280349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:31.280349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Semantic Hashing with Pairwise Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Casper Hansen, Christian Hansen, Christina Lioma, Jakob Grue Simonsen, Stephen Alstrup","submitted_at":"2020-07-01T10:54:27Z","abstract_excerpt":"Semantic Hashing is a popular family of methods for efficient similarity search in large-scale datasets. In Semantic Hashing, documents are encoded as short binary vectors (i.e., hash codes), such that semantic similarity can be efficiently computed using the Hamming distance. Recent state-of-the-art approaches have utilized weak supervision to train better performing hashing models. Inspired by this, we present Semantic Hashing with Pairwise Reconstruction (PairRec), which is a discrete variational autoencoder based hashing model. PairRec first encodes weakly supervised training pairs (a quer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00380","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.00380/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.00380","created_at":"2026-07-05T01:15:31.280408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00380v1","created_at":"2026-07-05T01:15:31.280408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00380","created_at":"2026-07-05T01:15:31.280408+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNODDW44ZPKV","created_at":"2026-07-05T01:15:31.280408+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNODDW44ZPKV7V2A","created_at":"2026-07-05T01:15:31.280408+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNODDW44","created_at":"2026-07-05T01:15:31.280408+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/NNODDW44ZPKV7V2AYD4MXWWFCC","json":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC.json","graph_json":"https://pith.science/api/pith-number/NNODDW44ZPKV7V2AYD4MXWWFCC/graph.json","events_json":"https://pith.science/api/pith-number/NNODDW44ZPKV7V2AYD4MXWWFCC/events.json","paper":"https://pith.science/paper/NNODDW44"},"agent_actions":{"view_html":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC","download_json":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC.json","view_paper":"https://pith.science/paper/NNODDW44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00380&json=true","fetch_graph":"https://pith.science/api/pith-number/NNODDW44ZPKV7V2AYD4MXWWFCC/graph.json","fetch_events":"https://pith.science/api/pith-number/NNODDW44ZPKV7V2AYD4MXWWFCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/action/storage_attestation","attest_author":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/action/author_attestation","sign_citation":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/action/citation_signature","submit_replication":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/action/replication_record"}},"created_at":"2026-07-05T01:15:31.280408+00:00","updated_at":"2026-07-05T01:15:31.280408+00:00"}