{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NNODDW44ZPKV7V2AYD4MXWWFCC","short_pith_number":"pith:NNODDW44","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"},"canonical_sha256":"6b5c31db9ccbd55fd740c0f8cbdac510990d9203e707efd7cc46f5fc758cdaa0","source":{"kind":"arxiv","id":"2007.00380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00380","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00380v1","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00380","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"NNODDW44ZPKV","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"pith_short_16","alias_value":"NNODDW44ZPKV7V2A","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"pith_short_8","alias_value":"NNODDW44","created_at":"2026-07-05T01:15:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NNODDW44ZPKV7V2AYD4MXWWFCC","target":"record","payload":{"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"},"canonical_sha256":"6b5c31db9ccbd55fd740c0f8cbdac510990d9203e707efd7cc46f5fc758cdaa0","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"},"source_kind":"arxiv","source_id":"2007.00380","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-07-05T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ozUy0dNr9laLyo+4H6XCiLGE4iyYuGisgyarxMxVvaKzpxf2Vz4WjD2cfsKsHb4GIHIMMMIfYof9P2L/4vmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:52:21.742074Z"},"content_sha256":"9c92d969849c96dd573493b5e413e7f1107908808e528ea51c2908c7d6e29350","schema_version":"1.0","event_id":"sha256:9c92d969849c96dd573493b5e413e7f1107908808e528ea51c2908c7d6e29350"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NNODDW44ZPKV7V2AYD4MXWWFCC","target":"graph","payload":{"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"},"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-07-05T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTibJlhbsBcJf8zWrS9iN/KIgAwg41XS/PmydWG5SwAa3t2sJQVF1cUft/Lwaik+c2XQXSH6buEkRhJpj4UIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:52:21.742730Z"},"content_sha256":"9cfb615db6d46ea04115eb1b111a845de22e628c4a1503699a6e7908dce575ad","schema_version":"1.0","event_id":"sha256:9cfb615db6d46ea04115eb1b111a845de22e628c4a1503699a6e7908dce575ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/bundle.json","state_url":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/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-07-07T04:52:21Z","links":{"resolver":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC","bundle":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/bundle.json","state":"https://pith.science/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNODDW44ZPKV7V2AYD4MXWWFCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NNODDW44ZPKV7V2AYD4MXWWFCC","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":"e7f0f8de66fff5b1a2670608ba4ed6167fab3a0179c55617cbfa3a83cc9615bf","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-07-01T10:54:27Z","title_canon_sha256":"1a0a794f93a6202664f4dfdfb7d890cb9f3ff400d7170d1fcaa8046610eee1da"},"schema_version":"1.0","source":{"id":"2007.00380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.00380","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"2007.00380v1","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00380","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"NNODDW44ZPKV","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"pith_short_16","alias_value":"NNODDW44ZPKV7V2A","created_at":"2026-07-05T01:15:31Z"},{"alias_kind":"pith_short_8","alias_value":"NNODDW44","created_at":"2026-07-05T01:15:31Z"}],"graph_snapshots":[{"event_id":"sha256:9cfb615db6d46ea04115eb1b111a845de22e628c4a1503699a6e7908dce575ad","target":"graph","created_at":"2026-07-05T01:15:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.00380/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Casper Hansen, Christian Hansen, Christina Lioma, Jakob Grue Simonsen, Stephen Alstrup","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-07-01T10:54:27Z","title":"Unsupervised Semantic Hashing with Pairwise Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00380","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:9c92d969849c96dd573493b5e413e7f1107908808e528ea51c2908c7d6e29350","target":"record","created_at":"2026-07-05T01:15:31Z","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":"e7f0f8de66fff5b1a2670608ba4ed6167fab3a0179c55617cbfa3a83cc9615bf","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-07-01T10:54:27Z","title_canon_sha256":"1a0a794f93a6202664f4dfdfb7d890cb9f3ff400d7170d1fcaa8046610eee1da"},"schema_version":"1.0","source":{"id":"2007.00380","kind":"arxiv","version":1}},"canonical_sha256":"6b5c31db9ccbd55fd740c0f8cbdac510990d9203e707efd7cc46f5fc758cdaa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b5c31db9ccbd55fd740c0f8cbdac510990d9203e707efd7cc46f5fc758cdaa0","first_computed_at":"2026-07-05T01:15:31.280349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:15:31.280349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Eo7WgHnd3RmxKSDF9TgBAyq63KtKU0TqeGZE/6onPpxeNIlvHMCfqweprUrZw5wyFaa74QanXytWz4d49J0Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:15:31.280747Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.00380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c92d969849c96dd573493b5e413e7f1107908808e528ea51c2908c7d6e29350","sha256:9cfb615db6d46ea04115eb1b111a845de22e628c4a1503699a6e7908dce575ad"],"state_sha256":"a5fda1dd520f5acc386cc64a9e851413182af46788abab08ee8a33dd72833027"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bm+keebq3ekFDRnAtnUIsjbxzUiXpkNAXQbFSeWpP8x0Hy94PleasfgfXrXrDYe4TuYcvvepiAvy7hgJb6SMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:52:21.745597Z","bundle_sha256":"9091164c02bd708b0cf7eb17484d1e72a74a90ceeba931792916c3dc2ef660f3"}}