{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UZGCH7JC5SHZXEDL4OWO4TCMVQ","short_pith_number":"pith:UZGCH7JC","canonical_record":{"source":{"id":"1611.06362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-19T13:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"36e34893fa2a57fcf8c0b82973f0806c2bfdad026c979aa86e586263494a8ef9","abstract_canon_sha256":"a1c751f4ac07d1ea79bdd5a8a756ca1027f1cbd2e9d2642e21ef377af26ee018"},"schema_version":"1.0"},"canonical_sha256":"a64c23fd22ec8f9b906be3acee4c4cac08774e5ec23f2620020a054e267b173a","source":{"kind":"arxiv","id":"1611.06362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06362","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06362v1","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06362","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"UZGCH7JC5SHZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UZGCH7JC5SHZXEDL","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UZGCH7JC","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UZGCH7JC5SHZXEDL4OWO4TCMVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-19T13:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"36e34893fa2a57fcf8c0b82973f0806c2bfdad026c979aa86e586263494a8ef9","abstract_canon_sha256":"a1c751f4ac07d1ea79bdd5a8a756ca1027f1cbd2e9d2642e21ef377af26ee018"},"schema_version":"1.0"},"canonical_sha256":"a64c23fd22ec8f9b906be3acee4c4cac08774e5ec23f2620020a054e267b173a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:38.907799Z","signature_b64":"CSVffMs5gL1SzVw8K/7FN2RVxH1djfeOjXyOpADW1vJBdwKHfV40AWqbastkqDwjm97vxA8q3LyH7joRw0BKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a64c23fd22ec8f9b906be3acee4c4cac08774e5ec23f2620020a054e267b173a","last_reissued_at":"2026-05-18T00:57:38.907261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:38.907261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06362","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-18T00:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oea2vqoYkzzsKLBHine1UwKBkCpPbPGfbPQpVEfRCvFpMrUwq3bsGOVG8iTkbsZsssxixdUTGIZ7QLtCRsiCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:52:05.256477Z"},"content_sha256":"c15213ae91e27df2112b14003d7a954f2c05fa9e23cd99bbaf606889a4231b4d","schema_version":"1.0","event_id":"sha256:c15213ae91e27df2112b14003d7a954f2c05fa9e23cd99bbaf606889a4231b4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UZGCH7JC5SHZXEDL4OWO4TCMVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ordinal Constrained Binary Code Learning for Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Feiyue Huang, Hong Liu, Rongrong Ji, Yongjian Wu","submitted_at":"2016-11-19T13:24:10Z","abstract_excerpt":"Recent years have witnessed extensive attention in binary code learning, a.k.a. hashing, for nearest neighbor search problems. It has been seen that high-dimensional data points can be quantized into binary codes to give an efficient similarity approximation via Hamming distance. Among existing schemes, ranking-based hashing is recent promising that targets at preserving ordinal relations of ranking in the Hamming space to minimize retrieval loss. However, the size of the ranking tuples, which shows the ordinal relations, is quadratic or cubic to the size of training samples. By given a large-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06362","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-18T00:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hB/Vh+Aokw3RzNcTf1ud5yjr3LN8blMXxhyaBBEdMtW+K6gXpV/cVYuQqigQNSiKZRFiej5xFai9ZgjK7M5pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T11:52:05.257037Z"},"content_sha256":"ab804d398cf3a2de3523bb3c5ba35d47fc5301e9e127a9bc5f8adba07d0136e6","schema_version":"1.0","event_id":"sha256:ab804d398cf3a2de3523bb3c5ba35d47fc5301e9e127a9bc5f8adba07d0136e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZGCH7JC5SHZXEDL4OWO4TCMVQ/bundle.json","state_url":"https://pith.science/pith/UZGCH7JC5SHZXEDL4OWO4TCMVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZGCH7JC5SHZXEDL4OWO4TCMVQ/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-19T11:52:05Z","links":{"resolver":"https://pith.science/pith/UZGCH7JC5SHZXEDL4OWO4TCMVQ","bundle":"https://pith.science/pith/UZGCH7JC5SHZXEDL4OWO4TCMVQ/bundle.json","state":"https://pith.science/pith/UZGCH7JC5SHZXEDL4OWO4TCMVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZGCH7JC5SHZXEDL4OWO4TCMVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UZGCH7JC5SHZXEDL4OWO4TCMVQ","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":"a1c751f4ac07d1ea79bdd5a8a756ca1027f1cbd2e9d2642e21ef377af26ee018","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-19T13:24:10Z","title_canon_sha256":"36e34893fa2a57fcf8c0b82973f0806c2bfdad026c979aa86e586263494a8ef9"},"schema_version":"1.0","source":{"id":"1611.06362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06362","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06362v1","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06362","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"UZGCH7JC5SHZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UZGCH7JC5SHZXEDL","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UZGCH7JC","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:ab804d398cf3a2de3523bb3c5ba35d47fc5301e9e127a9bc5f8adba07d0136e6","target":"graph","created_at":"2026-05-18T00:57:38Z","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":"Recent years have witnessed extensive attention in binary code learning, a.k.a. hashing, for nearest neighbor search problems. It has been seen that high-dimensional data points can be quantized into binary codes to give an efficient similarity approximation via Hamming distance. Among existing schemes, ranking-based hashing is recent promising that targets at preserving ordinal relations of ranking in the Hamming space to minimize retrieval loss. However, the size of the ranking tuples, which shows the ordinal relations, is quadratic or cubic to the size of training samples. By given a large-","authors_text":"Feiyue Huang, Hong Liu, Rongrong Ji, Yongjian Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-19T13:24:10Z","title":"Ordinal Constrained Binary Code Learning for Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06362","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:c15213ae91e27df2112b14003d7a954f2c05fa9e23cd99bbaf606889a4231b4d","target":"record","created_at":"2026-05-18T00:57:38Z","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":"a1c751f4ac07d1ea79bdd5a8a756ca1027f1cbd2e9d2642e21ef377af26ee018","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-19T13:24:10Z","title_canon_sha256":"36e34893fa2a57fcf8c0b82973f0806c2bfdad026c979aa86e586263494a8ef9"},"schema_version":"1.0","source":{"id":"1611.06362","kind":"arxiv","version":1}},"canonical_sha256":"a64c23fd22ec8f9b906be3acee4c4cac08774e5ec23f2620020a054e267b173a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a64c23fd22ec8f9b906be3acee4c4cac08774e5ec23f2620020a054e267b173a","first_computed_at":"2026-05-18T00:57:38.907261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:38.907261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSVffMs5gL1SzVw8K/7FN2RVxH1djfeOjXyOpADW1vJBdwKHfV40AWqbastkqDwjm97vxA8q3LyH7joRw0BKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:38.907799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c15213ae91e27df2112b14003d7a954f2c05fa9e23cd99bbaf606889a4231b4d","sha256:ab804d398cf3a2de3523bb3c5ba35d47fc5301e9e127a9bc5f8adba07d0136e6"],"state_sha256":"403fb85afae91163654a7e564939732092461fc36fdb17115e65b0821d3bb071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8q4hhm4OT+Yb7AQUbpUCxgB5duFEgrF7UEA/FBRxHDFrAFeAlHjWgxLh6WIU7MeTVsiLoUbTc2jvqBa/HngLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T11:52:05.259543Z","bundle_sha256":"6b94167472dbcb67c1ea061337e06527e6051b6b5c50b5edfc0adca2c7e16778"}}