{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AM7M45MCPEHYLKLDB675AREZWE","short_pith_number":"pith:AM7M45MC","canonical_record":{"source":{"id":"1408.5574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-24T07:40:19Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"92330bffc8154cde3eee2bde5f71d1ec86fb04841a1b02b8a44671771c80145c","abstract_canon_sha256":"c97d74a3e8ffac4b58c3185512d0bbaa3df159d15c2b6d5225deeb27e9660421"},"schema_version":"1.0"},"canonical_sha256":"033ece7582790f85a9630fbfd04499b136ad56dcacd4db0829ce3e2acaad73bc","source":{"kind":"arxiv","id":"1408.5574","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5574","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5574v2","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5574","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"AM7M45MCPEHY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AM7M45MCPEHYLKLD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AM7M45MC","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AM7M45MCPEHYLKLDB675AREZWE","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-24T07:40:19Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"92330bffc8154cde3eee2bde5f71d1ec86fb04841a1b02b8a44671771c80145c","abstract_canon_sha256":"c97d74a3e8ffac4b58c3185512d0bbaa3df159d15c2b6d5225deeb27e9660421"},"schema_version":"1.0"},"canonical_sha256":"033ece7582790f85a9630fbfd04499b136ad56dcacd4db0829ce3e2acaad73bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.071107Z","signature_b64":"EURvosWMKwcM9kY5x5axAclCFbe/yEe433GfNgRiZ/X90EDgnEC3QJd0jOLyWESORVyqSgdT2fkHtNgzrVxfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"033ece7582790f85a9630fbfd04499b136ad56dcacd4db0829ce3e2acaad73bc","last_reissued_at":"2026-05-18T00:58:41.070388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.070388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5574","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/bEBp82NfqJmORiZLPNF87xUh2E56jC9kis/GzMAyFPhiAsA2ZaDHKS61x6CC1ojD7YTK75Zdslq1bQv2HPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:58:20.020232Z"},"content_sha256":"632afef709768adbcb953969461c56d49e69d41ef167fb64c19f96985eff1a27","schema_version":"1.0","event_id":"sha256:632afef709768adbcb953969461c56d49e69d41ef167fb64c19f96985eff1a27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AM7M45MCPEHYLKLDB675AREZWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supervised Hashing Using Graph Cuts and Boosted Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Chunhua Shen, Guosheng Lin","submitted_at":"2014-08-24T07:40:19Z","abstract_excerpt":"Embedding image features into a binary Hamming space can improve both the speed and accuracy of large-scale query-by-example image retrieval systems. Supervised hashing aims to map the original features to compact binary codes in a manner which preserves the label-based similarities of the original data. Most existing approaches apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of those methods, and can result in complex optimization problems that are difficult to solve. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5574","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJFXN0DhHI2f/3xiHAG1pTA7rY+u6lxw4q27Pa9jbsFQLaJ4VijCPhp0myKr+FsVh30FTwqecq9IqVeu+CygDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:58:20.020940Z"},"content_sha256":"3376add506e4200039a510fb29423e4a4f34b7a7ffed5c786cddefdbbae46d84","schema_version":"1.0","event_id":"sha256:3376add506e4200039a510fb29423e4a4f34b7a7ffed5c786cddefdbbae46d84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AM7M45MCPEHYLKLDB675AREZWE/bundle.json","state_url":"https://pith.science/pith/AM7M45MCPEHYLKLDB675AREZWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AM7M45MCPEHYLKLDB675AREZWE/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-26T04:58:20Z","links":{"resolver":"https://pith.science/pith/AM7M45MCPEHYLKLDB675AREZWE","bundle":"https://pith.science/pith/AM7M45MCPEHYLKLDB675AREZWE/bundle.json","state":"https://pith.science/pith/AM7M45MCPEHYLKLDB675AREZWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AM7M45MCPEHYLKLDB675AREZWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AM7M45MCPEHYLKLDB675AREZWE","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":"c97d74a3e8ffac4b58c3185512d0bbaa3df159d15c2b6d5225deeb27e9660421","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-24T07:40:19Z","title_canon_sha256":"92330bffc8154cde3eee2bde5f71d1ec86fb04841a1b02b8a44671771c80145c"},"schema_version":"1.0","source":{"id":"1408.5574","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5574","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5574v2","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5574","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"AM7M45MCPEHY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AM7M45MCPEHYLKLD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AM7M45MC","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:3376add506e4200039a510fb29423e4a4f34b7a7ffed5c786cddefdbbae46d84","target":"graph","created_at":"2026-05-18T00:58:41Z","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":"Embedding image features into a binary Hamming space can improve both the speed and accuracy of large-scale query-by-example image retrieval systems. Supervised hashing aims to map the original features to compact binary codes in a manner which preserves the label-based similarities of the original data. Most existing approaches apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of those methods, and can result in complex optimization problems that are difficult to solve. In th","authors_text":"Anton van den Hengel, Chunhua Shen, Guosheng Lin","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-24T07:40:19Z","title":"Supervised Hashing Using Graph Cuts and Boosted Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5574","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:632afef709768adbcb953969461c56d49e69d41ef167fb64c19f96985eff1a27","target":"record","created_at":"2026-05-18T00:58:41Z","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":"c97d74a3e8ffac4b58c3185512d0bbaa3df159d15c2b6d5225deeb27e9660421","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-24T07:40:19Z","title_canon_sha256":"92330bffc8154cde3eee2bde5f71d1ec86fb04841a1b02b8a44671771c80145c"},"schema_version":"1.0","source":{"id":"1408.5574","kind":"arxiv","version":2}},"canonical_sha256":"033ece7582790f85a9630fbfd04499b136ad56dcacd4db0829ce3e2acaad73bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"033ece7582790f85a9630fbfd04499b136ad56dcacd4db0829ce3e2acaad73bc","first_computed_at":"2026-05-18T00:58:41.070388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.070388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EURvosWMKwcM9kY5x5axAclCFbe/yEe433GfNgRiZ/X90EDgnEC3QJd0jOLyWESORVyqSgdT2fkHtNgzrVxfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.071107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5574","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:632afef709768adbcb953969461c56d49e69d41ef167fb64c19f96985eff1a27","sha256:3376add506e4200039a510fb29423e4a4f34b7a7ffed5c786cddefdbbae46d84"],"state_sha256":"2ba8f1b0ef08d22e83c2fb8d9ec1defaa909a568bca7cc14942e648d06aae57c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0l4NfOxnm00tKmOYJlaoDE/3OT+UeFxn0oDS2GZD4qev+BBUR1knmKVgab28OTbxSzrGWV1zYCTx3/uQMxHZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:58:20.024798Z","bundle_sha256":"bb7c6f6b6a39abbe5ad39cd669ae58c34de3a6e197bb9d4a32febe52c922b819"}}