{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RWXBIG5KATFK2UH66XELFGTCXA","short_pith_number":"pith:RWXBIG5K","canonical_record":{"source":{"id":"1602.01557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-04T04:59:54Z","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"title_canon_sha256":"5ea565bff293104ffc5abdba08717957109bc2106132dc46553813ef854c2a23","abstract_canon_sha256":"ffff2c8fc48fabd67a82ee6863b8667814a7c23671b23b6219026fffb6c5b547"},"schema_version":"1.0"},"canonical_sha256":"8dae141baa04caad50fef5c8b29a62b832455e418870cc1dea03700ba7521775","source":{"kind":"arxiv","id":"1602.01557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01557","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01557v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01557","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"RWXBIG5KATFK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWXBIG5KATFK2UH6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWXBIG5K","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RWXBIG5KATFK2UH66XELFGTCXA","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-04T04:59:54Z","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"title_canon_sha256":"5ea565bff293104ffc5abdba08717957109bc2106132dc46553813ef854c2a23","abstract_canon_sha256":"ffff2c8fc48fabd67a82ee6863b8667814a7c23671b23b6219026fffb6c5b547"},"schema_version":"1.0"},"canonical_sha256":"8dae141baa04caad50fef5c8b29a62b832455e418870cc1dea03700ba7521775","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.655441Z","signature_b64":"/sc1/52HPjMC2HmZTDQhT3hLLjyjG8dB/3uFLepi7SWGILCNkovuLJuDSuBLxPIKTfso02sXsp+0GANiCgHHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dae141baa04caad50fef5c8b29a62b832455e418870cc1dea03700ba7521775","last_reissued_at":"2026-05-18T01:21:18.654816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.654816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01557","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3KvCK0gOrh6NBOOL5YtKZz/qSb1qXZneYiohR/VQMBIyXAJQ3A4Qt5QoEfdsEdZR56zSpCfdxi0mbArutMZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:57.148163Z"},"content_sha256":"855de247217a6fe4cf55d00ac42a8c655f24baf03b504fd459d819ce60c1a111","schema_version":"1.0","event_id":"sha256:855de247217a6fe4cf55d00ac42a8c655f24baf03b504fd459d819ce60c1a111"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RWXBIG5KATFK2UH66XELFGTCXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An ensemble diversity approach to supervised binary hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Ramin Raziperchikolaei","submitted_at":"2016-02-04T04:59:54Z","abstract_excerpt":"Binary hashing is a well-known approach for fast approximate nearest-neighbor search in information retrieval. Much work has focused on affinity-based objective functions involving the hash functions or binary codes. These objective functions encode neighborhood information between data points and are often inspired by manifold learning algorithms. They ensure that the hash functions differ from each other through constraints or penalty terms that encourage codes to be orthogonal or dissimilar across bits, but this couples the binary variables and complicates the already difficult optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01557","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYh6l6MjGkyy4WhokRzRlD1kvSKJmUH9QEnGNHFCiIdzKW0W/P5g0CK+G6eYvRdWoRXEBOeg7r0PDe+Oxz46Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:57.148538Z"},"content_sha256":"e03fa5570f4c8bb42857a89a52653e445a9d41a9eae45d3cfe90858fe750b912","schema_version":"1.0","event_id":"sha256:e03fa5570f4c8bb42857a89a52653e445a9d41a9eae45d3cfe90858fe750b912"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWXBIG5KATFK2UH66XELFGTCXA/bundle.json","state_url":"https://pith.science/pith/RWXBIG5KATFK2UH66XELFGTCXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWXBIG5KATFK2UH66XELFGTCXA/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-03T06:34:57Z","links":{"resolver":"https://pith.science/pith/RWXBIG5KATFK2UH66XELFGTCXA","bundle":"https://pith.science/pith/RWXBIG5KATFK2UH66XELFGTCXA/bundle.json","state":"https://pith.science/pith/RWXBIG5KATFK2UH66XELFGTCXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWXBIG5KATFK2UH66XELFGTCXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RWXBIG5KATFK2UH66XELFGTCXA","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":"ffff2c8fc48fabd67a82ee6863b8667814a7c23671b23b6219026fffb6c5b547","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-04T04:59:54Z","title_canon_sha256":"5ea565bff293104ffc5abdba08717957109bc2106132dc46553813ef854c2a23"},"schema_version":"1.0","source":{"id":"1602.01557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01557","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01557v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01557","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"RWXBIG5KATFK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWXBIG5KATFK2UH6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWXBIG5K","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:e03fa5570f4c8bb42857a89a52653e445a9d41a9eae45d3cfe90858fe750b912","target":"graph","created_at":"2026-05-18T01:21: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":"Binary hashing is a well-known approach for fast approximate nearest-neighbor search in information retrieval. Much work has focused on affinity-based objective functions involving the hash functions or binary codes. These objective functions encode neighborhood information between data points and are often inspired by manifold learning algorithms. They ensure that the hash functions differ from each other through constraints or penalty terms that encourage codes to be orthogonal or dissimilar across bits, but this couples the binary variables and complicates the already difficult optimization","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Ramin Raziperchikolaei","cross_cats":["cs.CV","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-04T04:59:54Z","title":"An ensemble diversity approach to supervised binary hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01557","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:855de247217a6fe4cf55d00ac42a8c655f24baf03b504fd459d819ce60c1a111","target":"record","created_at":"2026-05-18T01:21: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":"ffff2c8fc48fabd67a82ee6863b8667814a7c23671b23b6219026fffb6c5b547","cross_cats_sorted":["cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-04T04:59:54Z","title_canon_sha256":"5ea565bff293104ffc5abdba08717957109bc2106132dc46553813ef854c2a23"},"schema_version":"1.0","source":{"id":"1602.01557","kind":"arxiv","version":1}},"canonical_sha256":"8dae141baa04caad50fef5c8b29a62b832455e418870cc1dea03700ba7521775","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dae141baa04caad50fef5c8b29a62b832455e418870cc1dea03700ba7521775","first_computed_at":"2026-05-18T01:21:18.654816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.654816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/sc1/52HPjMC2HmZTDQhT3hLLjyjG8dB/3uFLepi7SWGILCNkovuLJuDSuBLxPIKTfso02sXsp+0GANiCgHHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.655441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:855de247217a6fe4cf55d00ac42a8c655f24baf03b504fd459d819ce60c1a111","sha256:e03fa5570f4c8bb42857a89a52653e445a9d41a9eae45d3cfe90858fe750b912"],"state_sha256":"780850c48d67248ec26043cfff1c2f9085c80b6fbc7a0dc97a64883e1c049084"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQ5rTx0ZIxnPTWrpoGGQM8GYRllD1f2Ikq73vQtOqFmcxV5xS1jeR84DUPBDpxMm8Tw61fipjZwEEfX3o/NnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:34:57.150555Z","bundle_sha256":"5d8a02b23c8e8d50fef2f4c55a2d211052b5f9c175fe23285dab3c4454522baa"}}