{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NFHEXLIX2O53XAUFYRLQDA7IXC","short_pith_number":"pith:NFHEXLIX","schema_version":"1.0","canonical_sha256":"694e4bad17d3bbbb8285c4570183e8b8b07aab95ac46bfd61c6fe1d8cee364aa","source":{"kind":"arxiv","id":"1404.1561","version":2},"attestation_state":"computed","paper":{"title":"Fast Supervised Hashing with Decision Trees for High-Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, David Suter, Guosheng Lin, Qinfeng Shi","submitted_at":"2014-04-06T10:42:36Z","abstract_excerpt":"Supervised hashing aims to map the original features to compact binary codes that are able to preserve label based similarity in the Hamming space. Non-linear hash functions have demonstrated the advantage over linear ones due to their powerful generalization capability. In the literature, kernel functions are typically used to achieve non-linearity in hashing, which achieve encouraging retrieval performance at the price of slow evaluation and training time. Here we propose to use boosted decision trees for achieving non-linearity in hashing, which are fast to train and evaluate, hence more su"},"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":"1404.1561","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-06T10:42:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"66dba402b79127a348362f645d3a2eff9b1cd19c41b511339caca6d4fb5257c8","abstract_canon_sha256":"950583768859b55db40966b18ccaaedf72f0e20fd3a003f4ed59b6011e149ee8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:11.901149Z","signature_b64":"CvMWauHoVgwS7vuUSInw7Q36Gr1bKjbauJ9v776UGoYPofEQIb++MPhD6gXvmOqwEnymosgoyk330vfYMvNzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"694e4bad17d3bbbb8285c4570183e8b8b07aab95ac46bfd61c6fe1d8cee364aa","last_reissued_at":"2026-05-18T00:58:11.900425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:11.900425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Supervised Hashing with Decision Trees for High-Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, David Suter, Guosheng Lin, Qinfeng Shi","submitted_at":"2014-04-06T10:42:36Z","abstract_excerpt":"Supervised hashing aims to map the original features to compact binary codes that are able to preserve label based similarity in the Hamming space. Non-linear hash functions have demonstrated the advantage over linear ones due to their powerful generalization capability. In the literature, kernel functions are typically used to achieve non-linearity in hashing, which achieve encouraging retrieval performance at the price of slow evaluation and training time. Here we propose to use boosted decision trees for achieving non-linearity in hashing, which are fast to train and evaluate, hence more su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1561","kind":"arxiv","version":2},"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":"1404.1561","created_at":"2026-05-18T00:58:11.900542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1561v2","created_at":"2026-05-18T00:58:11.900542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1561","created_at":"2026-05-18T00:58:11.900542+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFHEXLIX2O53","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFHEXLIX2O53XAUF","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFHEXLIX","created_at":"2026-05-18T12:28:41.024544+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/NFHEXLIX2O53XAUFYRLQDA7IXC","json":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC.json","graph_json":"https://pith.science/api/pith-number/NFHEXLIX2O53XAUFYRLQDA7IXC/graph.json","events_json":"https://pith.science/api/pith-number/NFHEXLIX2O53XAUFYRLQDA7IXC/events.json","paper":"https://pith.science/paper/NFHEXLIX"},"agent_actions":{"view_html":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC","download_json":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC.json","view_paper":"https://pith.science/paper/NFHEXLIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1561&json=true","fetch_graph":"https://pith.science/api/pith-number/NFHEXLIX2O53XAUFYRLQDA7IXC/graph.json","fetch_events":"https://pith.science/api/pith-number/NFHEXLIX2O53XAUFYRLQDA7IXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/action/storage_attestation","attest_author":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/action/author_attestation","sign_citation":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/action/citation_signature","submit_replication":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/action/replication_record"}},"created_at":"2026-05-18T00:58:11.900542+00:00","updated_at":"2026-05-18T00:58:11.900542+00:00"}