{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NFHEXLIX2O53XAUFYRLQDA7IXC","short_pith_number":"pith:NFHEXLIX","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"},"canonical_sha256":"694e4bad17d3bbbb8285c4570183e8b8b07aab95ac46bfd61c6fe1d8cee364aa","source":{"kind":"arxiv","id":"1404.1561","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1561","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1561v2","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1561","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"NFHEXLIX2O53","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NFHEXLIX2O53XAUF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NFHEXLIX","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NFHEXLIX2O53XAUFYRLQDA7IXC","target":"record","payload":{"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"},"canonical_sha256":"694e4bad17d3bbbb8285c4570183e8b8b07aab95ac46bfd61c6fe1d8cee364aa","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"},"source_kind":"arxiv","source_id":"1404.1561","source_version":2,"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-05-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JB6mbzFM/XAczbPAB9DHq/WJm6+kDc6piZz2tz3PL18TBjy3S50Zo+oB5LLKYwnWERGGNsNJQjf9LMYO6AL9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:02:25.694652Z"},"content_sha256":"ec628c5d8c18e4f5f7dcc783a659294b4bae6872620502f6b43b727f6a6c92fc","schema_version":"1.0","event_id":"sha256:ec628c5d8c18e4f5f7dcc783a659294b4bae6872620502f6b43b727f6a6c92fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NFHEXLIX2O53XAUFYRLQDA7IXC","target":"graph","payload":{"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"},"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-05-18T00:58:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ie0BxYDuMpu4ezB3fyIvgrQz0bl6M7T0rC7DJAMOhZQud6pmBMiOJovAfO0iLz/27NOgAHnB/gElZHe+MN3mDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:02:25.695307Z"},"content_sha256":"e2d5044fe758afa46730ba721d92077b34e35d272bb2c89077d65b65ac1d7973","schema_version":"1.0","event_id":"sha256:e2d5044fe758afa46730ba721d92077b34e35d272bb2c89077d65b65ac1d7973"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/bundle.json","state_url":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/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-05-26T07:02:25Z","links":{"resolver":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC","bundle":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/bundle.json","state":"https://pith.science/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NFHEXLIX2O53XAUFYRLQDA7IXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NFHEXLIX2O53XAUFYRLQDA7IXC","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":"950583768859b55db40966b18ccaaedf72f0e20fd3a003f4ed59b6011e149ee8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-06T10:42:36Z","title_canon_sha256":"66dba402b79127a348362f645d3a2eff9b1cd19c41b511339caca6d4fb5257c8"},"schema_version":"1.0","source":{"id":"1404.1561","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1561","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1561v2","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1561","created_at":"2026-05-18T00:58:11Z"},{"alias_kind":"pith_short_12","alias_value":"NFHEXLIX2O53","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NFHEXLIX2O53XAUF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NFHEXLIX","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:e2d5044fe758afa46730ba721d92077b34e35d272bb2c89077d65b65ac1d7973","target":"graph","created_at":"2026-05-18T00:58:11Z","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"},"paper":{"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","authors_text":"Anton van den Hengel, Chunhua Shen, David Suter, Guosheng Lin, Qinfeng Shi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-06T10:42:36Z","title":"Fast Supervised Hashing with Decision Trees for High-Dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1561","kind":"arxiv","version":2},"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:ec628c5d8c18e4f5f7dcc783a659294b4bae6872620502f6b43b727f6a6c92fc","target":"record","created_at":"2026-05-18T00:58:11Z","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":"950583768859b55db40966b18ccaaedf72f0e20fd3a003f4ed59b6011e149ee8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-06T10:42:36Z","title_canon_sha256":"66dba402b79127a348362f645d3a2eff9b1cd19c41b511339caca6d4fb5257c8"},"schema_version":"1.0","source":{"id":"1404.1561","kind":"arxiv","version":2}},"canonical_sha256":"694e4bad17d3bbbb8285c4570183e8b8b07aab95ac46bfd61c6fe1d8cee364aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"694e4bad17d3bbbb8285c4570183e8b8b07aab95ac46bfd61c6fe1d8cee364aa","first_computed_at":"2026-05-18T00:58:11.900425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:11.900425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CvMWauHoVgwS7vuUSInw7Q36Gr1bKjbauJ9v776UGoYPofEQIb++MPhD6gXvmOqwEnymosgoyk330vfYMvNzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:11.901149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1561","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec628c5d8c18e4f5f7dcc783a659294b4bae6872620502f6b43b727f6a6c92fc","sha256:e2d5044fe758afa46730ba721d92077b34e35d272bb2c89077d65b65ac1d7973"],"state_sha256":"d2cfe39ec768cd7f93be236064cf42dce30cf874e7752a596e915148f8ae35bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/Q9ke4sElKJVvIH5Q8fgV+HGs9HC11zShZltvTHprmYGv/FpbI4AYUCKzBV/8B9FsLu5jp6HNMIACAbEuyQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:02:25.698925Z","bundle_sha256":"0e441bf2c151a579d23b57e296bd6c376f36b65d847f285c9a434100a86c4959"}}