{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LZRAWYNHJDFKJ35NSNCJ2G3VLO","short_pith_number":"pith:LZRAWYNH","schema_version":"1.0","canonical_sha256":"5e620b61a748caa4efad93449d1b755bb2ad5a3fe11bdf0d5b3c73aaacd3ddc7","source":{"kind":"arxiv","id":"1712.00573","version":1},"attestation_state":"computed","paper":{"title":"Supervised Hashing based on Energy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongtao Lu, Xiyi Luo, Yong Yu, Zihao Hu","submitted_at":"2017-12-02T08:43:23Z","abstract_excerpt":"Recently, supervised hashing methods have attracted much attention since they can optimize retrieval speed and storage cost while preserving semantic information. Because hashing codes learning is NP-hard, many methods resort to some form of relaxation technique. But the performance of these methods can easily deteriorate due to the relaxation. Luckily, many supervised hashing formulations can be viewed as energy functions, hence solving hashing codes is equivalent to learning marginals in the corresponding conditional random field (CRF). By minimizing the KL divergence between a fully factori"},"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":"1712.00573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-02T08:43:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"35829f88e78b385adb8de2825d32147de15f3a9d032432d15e141e5042250ede","abstract_canon_sha256":"ebdff9f64b505c95d38ec1300bc16cbd5000abd8467521bdc0c52fb94aed8e2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:04.840068Z","signature_b64":"cleGEC1dpZbmbuRmFTJgt0Ic9MNdLa5hqo900WbuuzvbYu1t6e/RxcdxmIQY1FdhZLh5/pa7NxEMqEqCMkVjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e620b61a748caa4efad93449d1b755bb2ad5a3fe11bdf0d5b3c73aaacd3ddc7","last_reissued_at":"2026-05-18T00:29:04.839396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:04.839396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised Hashing based on Energy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongtao Lu, Xiyi Luo, Yong Yu, Zihao Hu","submitted_at":"2017-12-02T08:43:23Z","abstract_excerpt":"Recently, supervised hashing methods have attracted much attention since they can optimize retrieval speed and storage cost while preserving semantic information. Because hashing codes learning is NP-hard, many methods resort to some form of relaxation technique. But the performance of these methods can easily deteriorate due to the relaxation. Luckily, many supervised hashing formulations can be viewed as energy functions, hence solving hashing codes is equivalent to learning marginals in the corresponding conditional random field (CRF). By minimizing the KL divergence between a fully factori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00573","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.00573","created_at":"2026-05-18T00:29:04.839514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00573v1","created_at":"2026-05-18T00:29:04.839514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00573","created_at":"2026-05-18T00:29:04.839514+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZRAWYNHJDFK","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZRAWYNHJDFKJ35N","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZRAWYNH","created_at":"2026-05-18T12:31:28.150371+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/LZRAWYNHJDFKJ35NSNCJ2G3VLO","json":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO.json","graph_json":"https://pith.science/api/pith-number/LZRAWYNHJDFKJ35NSNCJ2G3VLO/graph.json","events_json":"https://pith.science/api/pith-number/LZRAWYNHJDFKJ35NSNCJ2G3VLO/events.json","paper":"https://pith.science/paper/LZRAWYNH"},"agent_actions":{"view_html":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO","download_json":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO.json","view_paper":"https://pith.science/paper/LZRAWYNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00573&json=true","fetch_graph":"https://pith.science/api/pith-number/LZRAWYNHJDFKJ35NSNCJ2G3VLO/graph.json","fetch_events":"https://pith.science/api/pith-number/LZRAWYNHJDFKJ35NSNCJ2G3VLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO/action/storage_attestation","attest_author":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO/action/author_attestation","sign_citation":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO/action/citation_signature","submit_replication":"https://pith.science/pith/LZRAWYNHJDFKJ35NSNCJ2G3VLO/action/replication_record"}},"created_at":"2026-05-18T00:29:04.839514+00:00","updated_at":"2026-05-18T00:29:04.839514+00:00"}