{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6O2YED2O5ZB5ST6EHJ3I564O4Y","short_pith_number":"pith:6O2YED2O","canonical_record":{"source":{"id":"1705.08562","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-23T23:42:46Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"9627d6b1c5969ea78b85d8efaba3c03e90bc14760063068e9858b7537421ec26","abstract_canon_sha256":"039d0b4b856460b03d58078ca76b38db2b5760c9849fa172bbcf0067a2481971"},"schema_version":"1.0"},"canonical_sha256":"f3b5820f4eee43d94fc43a768efb8ee6035481bbed1cbf33bff4c0ce8506a31f","source":{"kind":"arxiv","id":"1705.08562","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08562","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08562v4","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08562","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"6O2YED2O5ZB5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6O2YED2O5ZB5ST6E","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6O2YED2O","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6O2YED2O5ZB5ST6EHJ3I564O4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08562","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-23T23:42:46Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"9627d6b1c5969ea78b85d8efaba3c03e90bc14760063068e9858b7537421ec26","abstract_canon_sha256":"039d0b4b856460b03d58078ca76b38db2b5760c9849fa172bbcf0067a2481971"},"schema_version":"1.0"},"canonical_sha256":"f3b5820f4eee43d94fc43a768efb8ee6035481bbed1cbf33bff4c0ce8506a31f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.794036Z","signature_b64":"xzdBlV3P6XbkDnWZhWIWUjqvLMTjSdvvcScaOSaWe2Yc9dV2LbbQIPiYMlJk6IO8iY9qaywGlKb5yuxg9mKjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3b5820f4eee43d94fc43a768efb8ee6035481bbed1cbf33bff4c0ce8506a31f","last_reissued_at":"2026-05-18T00:03:41.793648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.793648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08562","source_version":4,"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:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8N1pybe+h2F86ZVRuBU2nFufLl2Ic5/9KZ+kzHLkuL9v8GoZZtT6ZkECmjNCtmduJejd6VRWPV4Gn83dQMLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:14:15.865749Z"},"content_sha256":"c3c96afa351c6e329d9d54875c3aca4b6859aad46617ab9970c1afd78bb4a78e","schema_version":"1.0","event_id":"sha256:c3c96afa351c6e329d9d54875c3aca4b6859aad46617ab9970c1afd78bb4a78e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6O2YED2O5ZB5ST6EHJ3I564O4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hashing as Tie-Aware Learning to Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Fatih Cakir, Kun He, Sarah Adel Bargal, Stan Sclaroff","submitted_at":"2017-05-23T23:42:46Z","abstract_excerpt":"Hashing, or learning binary embeddings of data, is frequently used in nearest neighbor retrieval. In this paper, we develop learning to rank formulations for hashing, aimed at directly optimizing ranking-based evaluation metrics such as Average Precision (AP) and Normalized Discounted Cumulative Gain (NDCG). We first observe that the integer-valued Hamming distance often leads to tied rankings, and propose to use tie-aware versions of AP and NDCG to evaluate hashing for retrieval. Then, to optimize tie-aware ranking metrics, we derive their continuous relaxations, and perform gradient-based op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08562","kind":"arxiv","version":4},"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:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOtVcZGAY1+4PZ/PXtvHljmHouX+g7OQVM4Ei6JkWiPKSLheB5Wd6ggZmsp4JfxY/K2XSZZCwbfS5k8QsCATBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:14:15.866431Z"},"content_sha256":"584ea7332430017749090813cfdb0949e0e6db254ed8b3e5053efa721ca57c26","schema_version":"1.0","event_id":"sha256:584ea7332430017749090813cfdb0949e0e6db254ed8b3e5053efa721ca57c26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O2YED2O5ZB5ST6EHJ3I564O4Y/bundle.json","state_url":"https://pith.science/pith/6O2YED2O5ZB5ST6EHJ3I564O4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O2YED2O5ZB5ST6EHJ3I564O4Y/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-06-05T01:14:15Z","links":{"resolver":"https://pith.science/pith/6O2YED2O5ZB5ST6EHJ3I564O4Y","bundle":"https://pith.science/pith/6O2YED2O5ZB5ST6EHJ3I564O4Y/bundle.json","state":"https://pith.science/pith/6O2YED2O5ZB5ST6EHJ3I564O4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O2YED2O5ZB5ST6EHJ3I564O4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6O2YED2O5ZB5ST6EHJ3I564O4Y","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":"039d0b4b856460b03d58078ca76b38db2b5760c9849fa172bbcf0067a2481971","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-23T23:42:46Z","title_canon_sha256":"9627d6b1c5969ea78b85d8efaba3c03e90bc14760063068e9858b7537421ec26"},"schema_version":"1.0","source":{"id":"1705.08562","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08562","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08562v4","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08562","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"6O2YED2O5ZB5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6O2YED2O5ZB5ST6E","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6O2YED2O","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:584ea7332430017749090813cfdb0949e0e6db254ed8b3e5053efa721ca57c26","target":"graph","created_at":"2026-05-18T00:03: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":"Hashing, or learning binary embeddings of data, is frequently used in nearest neighbor retrieval. In this paper, we develop learning to rank formulations for hashing, aimed at directly optimizing ranking-based evaluation metrics such as Average Precision (AP) and Normalized Discounted Cumulative Gain (NDCG). We first observe that the integer-valued Hamming distance often leads to tied rankings, and propose to use tie-aware versions of AP and NDCG to evaluate hashing for retrieval. Then, to optimize tie-aware ranking metrics, we derive their continuous relaxations, and perform gradient-based op","authors_text":"Fatih Cakir, Kun He, Sarah Adel Bargal, Stan Sclaroff","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-23T23:42:46Z","title":"Hashing as Tie-Aware Learning to Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08562","kind":"arxiv","version":4},"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:c3c96afa351c6e329d9d54875c3aca4b6859aad46617ab9970c1afd78bb4a78e","target":"record","created_at":"2026-05-18T00:03: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":"039d0b4b856460b03d58078ca76b38db2b5760c9849fa172bbcf0067a2481971","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-23T23:42:46Z","title_canon_sha256":"9627d6b1c5969ea78b85d8efaba3c03e90bc14760063068e9858b7537421ec26"},"schema_version":"1.0","source":{"id":"1705.08562","kind":"arxiv","version":4}},"canonical_sha256":"f3b5820f4eee43d94fc43a768efb8ee6035481bbed1cbf33bff4c0ce8506a31f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3b5820f4eee43d94fc43a768efb8ee6035481bbed1cbf33bff4c0ce8506a31f","first_computed_at":"2026-05-18T00:03:41.793648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:41.793648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xzdBlV3P6XbkDnWZhWIWUjqvLMTjSdvvcScaOSaWe2Yc9dV2LbbQIPiYMlJk6IO8iY9qaywGlKb5yuxg9mKjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:41.794036Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08562","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3c96afa351c6e329d9d54875c3aca4b6859aad46617ab9970c1afd78bb4a78e","sha256:584ea7332430017749090813cfdb0949e0e6db254ed8b3e5053efa721ca57c26"],"state_sha256":"1f0c93af451528beb2af005a09e80199101ea8a641f71ee8b22fb90f66fe1206"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/C6C6o1NnSKPdSaIz62kiYk1OkeNr1oB0bJR95Qujk/JZztCB6/+uHWrwWGqdDmehC0266hZce1sM3e+rvgjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:14:15.869762Z","bundle_sha256":"077dba1e80dd6437bddd281d76686cbb9eb34fb1bda9d9df70b8eb157c756578"}}