{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2DUTW62HNN3Q7X3ICGAPRD5PLJ","short_pith_number":"pith:2DUTW62H","canonical_record":{"source":{"id":"1004.5370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IR","submitted_at":"2010-04-29T19:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"12aab813bfa8cb8fd3321e900a3e0d07444271ef39bbf6cbaf67af2c3f4908b8","abstract_canon_sha256":"ebdf20e70c3981ff4b027e0e710ab32569e1e833118a3c23376160b9e9a67f67"},"schema_version":"1.0"},"canonical_sha256":"d0e93b7b476b770fdf681180f88faf5a4ddb111e4a36ebf1f26858e637e415b2","source":{"kind":"arxiv","id":"1004.5370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.5370","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1004.5370v1","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5370","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"2DUTW62HNN3Q","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"2DUTW62HNN3Q7X3I","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"2DUTW62H","created_at":"2026-07-04T17:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2DUTW62HNN3Q7X3ICGAPRD5PLJ","target":"record","payload":{"canonical_record":{"source":{"id":"1004.5370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IR","submitted_at":"2010-04-29T19:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"12aab813bfa8cb8fd3321e900a3e0d07444271ef39bbf6cbaf67af2c3f4908b8","abstract_canon_sha256":"ebdf20e70c3981ff4b027e0e710ab32569e1e833118a3c23376160b9e9a67f67"},"schema_version":"1.0"},"canonical_sha256":"d0e93b7b476b770fdf681180f88faf5a4ddb111e4a36ebf1f26858e637e415b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:27:40.555677Z","signature_b64":"VCD7QXUL/Hv0QFl3ZJvijKK20eoGInrbIvxiKUOeciQ4hpF6DFfZmVjdeRGPkGXSrYF0xF71k8L18Mieh0xQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0e93b7b476b770fdf681180f88faf5a4ddb111e4a36ebf1f26858e637e415b2","last_reissued_at":"2026-07-04T17:27:40.555250Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:27:40.555250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.5370","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-04T17:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeMxUAXIWouMv9JSvHORstag+GCCUjiHgOoWsINoYVJbsY4UBawWbl4RoTodGdV196DKSKmFTz54+gZMQE1HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:39:52.525525Z"},"content_sha256":"a046171b6aede6a21f89f1637bffd2075521be1db662e96bf4e22009a0c65169","schema_version":"1.0","event_id":"sha256:a046171b6aede6a21f89f1637bffd2075521be1db662e96bf4e22009a0c65169"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2DUTW62HNN3Q7X3ICGAPRD5PLJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Taught Hashing for Fast Similarity Search","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Dell Zhang, Deng Cai, Jinsong Lu, Jun Wang","submitted_at":"2010-04-29T19:25:17Z","abstract_excerpt":"The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are mapped to similar codes (within a short Hamming distance). Although some recently proposed techniques are able to generate high-quality codes for documents known in advance, obtaining the codes for previously unseen documents remains to be a very challenging problem. In this paper, we emphasise t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5370","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/1004.5370/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-04T17:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMvlk7zIScji6/5J6gp7f4a3i50xY2Lk6YvGZtRsMjUlZv4Y/UL4AgdNNJz6imI9WxVnJyP2j/j8TrcCatBICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:39:52.526029Z"},"content_sha256":"587ed3de185d4c44158ff538b8f744d3ace89ed35db06c696ee450dc7a32fd0d","schema_version":"1.0","event_id":"sha256:587ed3de185d4c44158ff538b8f744d3ace89ed35db06c696ee450dc7a32fd0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DUTW62HNN3Q7X3ICGAPRD5PLJ/bundle.json","state_url":"https://pith.science/pith/2DUTW62HNN3Q7X3ICGAPRD5PLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DUTW62HNN3Q7X3ICGAPRD5PLJ/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-08-03T17:39:52Z","links":{"resolver":"https://pith.science/pith/2DUTW62HNN3Q7X3ICGAPRD5PLJ","bundle":"https://pith.science/pith/2DUTW62HNN3Q7X3ICGAPRD5PLJ/bundle.json","state":"https://pith.science/pith/2DUTW62HNN3Q7X3ICGAPRD5PLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DUTW62HNN3Q7X3ICGAPRD5PLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2DUTW62HNN3Q7X3ICGAPRD5PLJ","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":"ebdf20e70c3981ff4b027e0e710ab32569e1e833118a3c23376160b9e9a67f67","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IR","submitted_at":"2010-04-29T19:25:17Z","title_canon_sha256":"12aab813bfa8cb8fd3321e900a3e0d07444271ef39bbf6cbaf67af2c3f4908b8"},"schema_version":"1.0","source":{"id":"1004.5370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.5370","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1004.5370v1","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5370","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"2DUTW62HNN3Q","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"2DUTW62HNN3Q7X3I","created_at":"2026-07-04T17:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"2DUTW62H","created_at":"2026-07-04T17:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:587ed3de185d4c44158ff538b8f744d3ace89ed35db06c696ee450dc7a32fd0d","target":"graph","created_at":"2026-07-04T17:27:40Z","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/1004.5370/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are mapped to similar codes (within a short Hamming distance). Although some recently proposed techniques are able to generate high-quality codes for documents known in advance, obtaining the codes for previously unseen documents remains to be a very challenging problem. In this paper, we emphasise t","authors_text":"Dell Zhang, Deng Cai, Jinsong Lu, Jun Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IR","submitted_at":"2010-04-29T19:25:17Z","title":"Self-Taught Hashing for Fast Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5370","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:a046171b6aede6a21f89f1637bffd2075521be1db662e96bf4e22009a0c65169","target":"record","created_at":"2026-07-04T17:27:40Z","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":"ebdf20e70c3981ff4b027e0e710ab32569e1e833118a3c23376160b9e9a67f67","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IR","submitted_at":"2010-04-29T19:25:17Z","title_canon_sha256":"12aab813bfa8cb8fd3321e900a3e0d07444271ef39bbf6cbaf67af2c3f4908b8"},"schema_version":"1.0","source":{"id":"1004.5370","kind":"arxiv","version":1}},"canonical_sha256":"d0e93b7b476b770fdf681180f88faf5a4ddb111e4a36ebf1f26858e637e415b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0e93b7b476b770fdf681180f88faf5a4ddb111e4a36ebf1f26858e637e415b2","first_computed_at":"2026-07-04T17:27:40.555250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:27:40.555250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCD7QXUL/Hv0QFl3ZJvijKK20eoGInrbIvxiKUOeciQ4hpF6DFfZmVjdeRGPkGXSrYF0xF71k8L18Mieh0xQBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:27:40.555677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.5370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a046171b6aede6a21f89f1637bffd2075521be1db662e96bf4e22009a0c65169","sha256:587ed3de185d4c44158ff538b8f744d3ace89ed35db06c696ee450dc7a32fd0d"],"state_sha256":"4d6f7c03652c1ad6f6f0b8a386b5dd9a24ff4f41717e94ce9da7f3c22c2ddd93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3OEd70a0eLnULr0vaoaZNHITk+mRVoyDZAfReIb5uTrp+e4W95S1oCtfNXDty0GBdNj4kTTeJULvsGRK8hPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:39:52.529990Z","bundle_sha256":"5a598bd6705545da1c3b15566d55ea4bb8c68ce763fc32d1d28b91a82bcf6636"}}