{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CL2W3HBUQ5HUY34YUWHOYOJJ7V","short_pith_number":"pith:CL2W3HBU","schema_version":"1.0","canonical_sha256":"12f56d9c34874f4c6f98a58eec3929fd4fdc5cb463027efc3d94841b5b34d022","source":{"kind":"arxiv","id":"2010.07804","version":4},"attestation_state":"computed","paper":{"title":"CIMON: Towards High-quality Hash Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chong Chen, Daqing Wu, Jianqiang Huang, Jinwen Ma, Minghua Deng, Xian-Sheng Hua, Xiao Luo, Zeyu Ma, Zhongming Jin","submitted_at":"2020-10-15T14:47:14Z","abstract_excerpt":"Recently, hashing is widely used in approximate nearest neighbor search for its storage and computational efficiency. Most of the unsupervised hashing methods learn to map images into semantic similarity-preserving hash codes by constructing local semantic similarity structure from the pre-trained model as the guiding information, i.e., treating each point pair similar if their distance is small in feature space. However, due to the inefficient representation ability of the pre-trained model, many false positives and negatives in local semantic similarity will be introduced and lead to error p"},"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":"2010.07804","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-10-15T14:47:14Z","cross_cats_sorted":[],"title_canon_sha256":"a47d9d0c9a26434047e90071e909a76d1fdefde3729cbfbb38c8f1e6d929f7eb","abstract_canon_sha256":"dd9944054bc6992ca56beb157e15ba9ebd5161e44dce3d94fcdf72048fd10004"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:44.594165Z","signature_b64":"fcTcTUI5XQfWiqwqRzLdV4k5Y0Kn+xkRYPiMRE50b3mLcBqhjIMvbJiLwdHMLf7JAfz8YdQ42r811g+pbdEgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12f56d9c34874f4c6f98a58eec3929fd4fdc5cb463027efc3d94841b5b34d022","last_reissued_at":"2026-07-05T03:07:44.593792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:44.593792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CIMON: Towards High-quality Hash Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chong Chen, Daqing Wu, Jianqiang Huang, Jinwen Ma, Minghua Deng, Xian-Sheng Hua, Xiao Luo, Zeyu Ma, Zhongming Jin","submitted_at":"2020-10-15T14:47:14Z","abstract_excerpt":"Recently, hashing is widely used in approximate nearest neighbor search for its storage and computational efficiency. Most of the unsupervised hashing methods learn to map images into semantic similarity-preserving hash codes by constructing local semantic similarity structure from the pre-trained model as the guiding information, i.e., treating each point pair similar if their distance is small in feature space. However, due to the inefficient representation ability of the pre-trained model, many false positives and negatives in local semantic similarity will be introduced and lead to error p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.07804","kind":"arxiv","version":4},"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/2010.07804/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":"2010.07804","created_at":"2026-07-05T03:07:44.593868+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.07804v4","created_at":"2026-07-05T03:07:44.593868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.07804","created_at":"2026-07-05T03:07:44.593868+00:00"},{"alias_kind":"pith_short_12","alias_value":"CL2W3HBUQ5HU","created_at":"2026-07-05T03:07:44.593868+00:00"},{"alias_kind":"pith_short_16","alias_value":"CL2W3HBUQ5HUY34Y","created_at":"2026-07-05T03:07:44.593868+00:00"},{"alias_kind":"pith_short_8","alias_value":"CL2W3HBU","created_at":"2026-07-05T03:07:44.593868+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/CL2W3HBUQ5HUY34YUWHOYOJJ7V","json":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V.json","graph_json":"https://pith.science/api/pith-number/CL2W3HBUQ5HUY34YUWHOYOJJ7V/graph.json","events_json":"https://pith.science/api/pith-number/CL2W3HBUQ5HUY34YUWHOYOJJ7V/events.json","paper":"https://pith.science/paper/CL2W3HBU"},"agent_actions":{"view_html":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V","download_json":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V.json","view_paper":"https://pith.science/paper/CL2W3HBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.07804&json=true","fetch_graph":"https://pith.science/api/pith-number/CL2W3HBUQ5HUY34YUWHOYOJJ7V/graph.json","fetch_events":"https://pith.science/api/pith-number/CL2W3HBUQ5HUY34YUWHOYOJJ7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V/action/storage_attestation","attest_author":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V/action/author_attestation","sign_citation":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V/action/citation_signature","submit_replication":"https://pith.science/pith/CL2W3HBUQ5HUY34YUWHOYOJJ7V/action/replication_record"}},"created_at":"2026-07-05T03:07:44.593868+00:00","updated_at":"2026-07-05T03:07:44.593868+00:00"}