{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:554HVPSGFAQEBJ6Z6BSBBUT2OZ","short_pith_number":"pith:554HVPSG","canonical_record":{"source":{"id":"1407.1151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-04T08:18:45Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7689913c88e701563b509d1d605b2f05f96ec76689f889e41b005029c0035e31","abstract_canon_sha256":"d582e5cf2d1428a5fbe48d8dd9514340e23a28f6931b2c32554e625763bbd7aa"},"schema_version":"1.0"},"canonical_sha256":"ef787abe46282040a7d9f06410d27a7679c90f8540a824aea32c7121854e191d","source":{"kind":"arxiv","id":"1407.1151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1151","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1151v1","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1151","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"554HVPSGFAQE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"554HVPSGFAQEBJ6Z","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"554HVPSG","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:554HVPSGFAQEBJ6Z6BSBBUT2OZ","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-04T08:18:45Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7689913c88e701563b509d1d605b2f05f96ec76689f889e41b005029c0035e31","abstract_canon_sha256":"d582e5cf2d1428a5fbe48d8dd9514340e23a28f6931b2c32554e625763bbd7aa"},"schema_version":"1.0"},"canonical_sha256":"ef787abe46282040a7d9f06410d27a7679c90f8540a824aea32c7121854e191d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:18.635999Z","signature_b64":"vjjIivItCyXyj32guQ573wtO5ZGk3njbdNju+cgfzO2MDluzpOjX2dI2QKoSO9D0dwPwZ4ubx46Nm/e3RFzJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef787abe46282040a7d9f06410d27a7679c90f8540a824aea32c7121854e191d","last_reissued_at":"2026-05-18T02:48:18.635293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:18.635293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1151","source_version":1,"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-18T02:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dz8xeBhLGsc9fC/9izUWqnrgNTARNru4w1JUH/d+dP5580y929g0TDTzVLONtbsCvlt6yruM+DpiUfTiSyLSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:18:29.187505Z"},"content_sha256":"c7a5547497004a6ecfbbabbf470ed6cb2c59fa7beb0e9646ff272996a5568d79","schema_version":"1.0","event_id":"sha256:c7a5547497004a6ecfbbabbf470ed6cb2c59fa7beb0e9646ff272996a5568d79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:554HVPSGFAQEBJ6Z6BSBBUT2OZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Ranking Measures for Compact Binary Code Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Chunhua Shen, Guosheng Lin, Jianxin Wu","submitted_at":"2014-07-04T08:18:45Z","abstract_excerpt":"Hashing has proven a valuable tool for large-scale information retrieval. Despite much success, existing hashing methods optimize over simple objectives such as the reconstruction error or graph Laplacian related loss functions, instead of the performance evaluation criteria of interest---multivariate performance measures such as the AUC and NDCG. Here we present a general framework (termed StructHash) that allows one to directly optimize multivariate performance measures. The resulting optimization problem can involve exponentially or infinitely many variables and constraints, which is more c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1151","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"},"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-18T02:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Q+QkfVqbfVKLCzyOgr+aw5Ei3e6J2SxDte99Wue0LdEDoOZ9u92zzvnCDJOxfRpzo/GumANHPFZzrZBVpmWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:18:29.187911Z"},"content_sha256":"5c4b34c46677041ac7bfcfeb2aacce7db72521e9aca878f6fe20e24d95c432bb","schema_version":"1.0","event_id":"sha256:5c4b34c46677041ac7bfcfeb2aacce7db72521e9aca878f6fe20e24d95c432bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/554HVPSGFAQEBJ6Z6BSBBUT2OZ/bundle.json","state_url":"https://pith.science/pith/554HVPSGFAQEBJ6Z6BSBBUT2OZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/554HVPSGFAQEBJ6Z6BSBBUT2OZ/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-26T08:18:29Z","links":{"resolver":"https://pith.science/pith/554HVPSGFAQEBJ6Z6BSBBUT2OZ","bundle":"https://pith.science/pith/554HVPSGFAQEBJ6Z6BSBBUT2OZ/bundle.json","state":"https://pith.science/pith/554HVPSGFAQEBJ6Z6BSBBUT2OZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/554HVPSGFAQEBJ6Z6BSBBUT2OZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:554HVPSGFAQEBJ6Z6BSBBUT2OZ","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":"d582e5cf2d1428a5fbe48d8dd9514340e23a28f6931b2c32554e625763bbd7aa","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-04T08:18:45Z","title_canon_sha256":"7689913c88e701563b509d1d605b2f05f96ec76689f889e41b005029c0035e31"},"schema_version":"1.0","source":{"id":"1407.1151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1151","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1151v1","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1151","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"554HVPSGFAQE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"554HVPSGFAQEBJ6Z","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"554HVPSG","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:5c4b34c46677041ac7bfcfeb2aacce7db72521e9aca878f6fe20e24d95c432bb","target":"graph","created_at":"2026-05-18T02:48:18Z","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":"Hashing has proven a valuable tool for large-scale information retrieval. Despite much success, existing hashing methods optimize over simple objectives such as the reconstruction error or graph Laplacian related loss functions, instead of the performance evaluation criteria of interest---multivariate performance measures such as the AUC and NDCG. Here we present a general framework (termed StructHash) that allows one to directly optimize multivariate performance measures. The resulting optimization problem can involve exponentially or infinitely many variables and constraints, which is more c","authors_text":"Chunhua Shen, Guosheng Lin, Jianxin Wu","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-04T08:18:45Z","title":"Optimizing Ranking Measures for Compact Binary Code Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1151","kind":"arxiv","version":1},"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:c7a5547497004a6ecfbbabbf470ed6cb2c59fa7beb0e9646ff272996a5568d79","target":"record","created_at":"2026-05-18T02:48:18Z","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":"d582e5cf2d1428a5fbe48d8dd9514340e23a28f6931b2c32554e625763bbd7aa","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-04T08:18:45Z","title_canon_sha256":"7689913c88e701563b509d1d605b2f05f96ec76689f889e41b005029c0035e31"},"schema_version":"1.0","source":{"id":"1407.1151","kind":"arxiv","version":1}},"canonical_sha256":"ef787abe46282040a7d9f06410d27a7679c90f8540a824aea32c7121854e191d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef787abe46282040a7d9f06410d27a7679c90f8540a824aea32c7121854e191d","first_computed_at":"2026-05-18T02:48:18.635293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:18.635293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vjjIivItCyXyj32guQ573wtO5ZGk3njbdNju+cgfzO2MDluzpOjX2dI2QKoSO9D0dwPwZ4ubx46Nm/e3RFzJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:18.635999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7a5547497004a6ecfbbabbf470ed6cb2c59fa7beb0e9646ff272996a5568d79","sha256:5c4b34c46677041ac7bfcfeb2aacce7db72521e9aca878f6fe20e24d95c432bb"],"state_sha256":"abbc65e67c5c8ad173884c7c1ef4aacd314fbb38a9a0081de96f5f8f015b7227"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnaV3Pqh/OoBm+jo9i/4CcQRUH9yZuS5STuuJO710oBdol+Ai8sz12tQL6FKXHLwLHKaLlJ2myCL70j/r0kdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:18:29.190707Z","bundle_sha256":"aac23912d6e25509914fdc77507896b450ac79621b5d27bb521735bd9df0c175"}}