{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JR7ZXG4RW25QJFPNJJHMCTPP2W","short_pith_number":"pith:JR7ZXG4R","canonical_record":{"source":{"id":"1611.10017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-30T06:35:39Z","cross_cats_sorted":["cs.LG","cs.MM"],"title_canon_sha256":"0508c0337a39c21e77c8be47d8c0617066f66606e083cd40d18c55c282f76225","abstract_canon_sha256":"283799fefab4e10c7fde165f0d5f8d27e5932c5b6b4da2e96cc96d32ec654452"},"schema_version":"1.0"},"canonical_sha256":"4c7f9b9b91b6bb0495ed4a4ec14defd593bab9dbf1cd253874420feea6c8369b","source":{"kind":"arxiv","id":"1611.10017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10017","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10017v1","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10017","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"JR7ZXG4RW25Q","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JR7ZXG4RW25QJFPN","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JR7ZXG4R","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JR7ZXG4RW25QJFPNJJHMCTPP2W","target":"record","payload":{"canonical_record":{"source":{"id":"1611.10017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-30T06:35:39Z","cross_cats_sorted":["cs.LG","cs.MM"],"title_canon_sha256":"0508c0337a39c21e77c8be47d8c0617066f66606e083cd40d18c55c282f76225","abstract_canon_sha256":"283799fefab4e10c7fde165f0d5f8d27e5932c5b6b4da2e96cc96d32ec654452"},"schema_version":"1.0"},"canonical_sha256":"4c7f9b9b91b6bb0495ed4a4ec14defd593bab9dbf1cd253874420feea6c8369b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:11.388290Z","signature_b64":"YKVGJ0xIj+KhcnZt0m3fQalWawnQaUO6fUgW7/hvtyTw2uSm4bN0uuRUIJBMycVIPgUYTiqCRcnpdv8IuGRYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c7f9b9b91b6bb0495ed4a4ec14defd593bab9dbf1cd253874420feea6c8369b","last_reissued_at":"2026-05-18T00:56:11.387782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:11.387782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.10017","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7+GT6IUvOjzd5NVTOOcNMQUcL8x4jy6PEmPCleny5CekhsWmmAK1K0zfYHJBuB4wL7JmV/qEWQcO5+4vy6LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:16:52.334138Z"},"content_sha256":"2221a0881b12a719184030e2d6abc904f42e17f0a9a1f527c307f1328f3dbe82","schema_version":"1.0","event_id":"sha256:2221a0881b12a719184030e2d6abc904f42e17f0a9a1f527c307f1328f3dbe82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JR7ZXG4RW25QJFPNJJHMCTPP2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Supervised Discrete Hashing and its Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MM"],"primary_cat":"cs.CV","authors_text":"Gou Koutaki, Keiichiro Shirai, Mitsuru Ambai","submitted_at":"2016-11-30T06:35:39Z","abstract_excerpt":"In this paper, we propose a learning-based supervised discrete hashing method. Binary hashing is widely used for large-scale image retrieval as well as video and document searches because the compact representation of binary code is essential for data storage and reasonable for query searches using bit-operations. The recently proposed Supervised Discrete Hashing (SDH) efficiently solves mixed-integer programming problems by alternating optimization and the Discrete Cyclic Coordinate descent (DCC) method. We show that the SDH model can be simplified without performance degradation based on som"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10017","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AU4Dcxsa/Nq+qw2DzbZa0r/A5f5LiUhciRUDJL/Y9VD7o/Clc0Eor35Y1VIpu5XPX++/B57ouh6XJb1db99BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:16:52.334937Z"},"content_sha256":"dfc342967e50aac3badc30e006cdf831b2cb85af04fc9a2d64ea87ba5d29fb5e","schema_version":"1.0","event_id":"sha256:dfc342967e50aac3badc30e006cdf831b2cb85af04fc9a2d64ea87ba5d29fb5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JR7ZXG4RW25QJFPNJJHMCTPP2W/bundle.json","state_url":"https://pith.science/pith/JR7ZXG4RW25QJFPNJJHMCTPP2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JR7ZXG4RW25QJFPNJJHMCTPP2W/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-11T17:16:52Z","links":{"resolver":"https://pith.science/pith/JR7ZXG4RW25QJFPNJJHMCTPP2W","bundle":"https://pith.science/pith/JR7ZXG4RW25QJFPNJJHMCTPP2W/bundle.json","state":"https://pith.science/pith/JR7ZXG4RW25QJFPNJJHMCTPP2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JR7ZXG4RW25QJFPNJJHMCTPP2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JR7ZXG4RW25QJFPNJJHMCTPP2W","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":"283799fefab4e10c7fde165f0d5f8d27e5932c5b6b4da2e96cc96d32ec654452","cross_cats_sorted":["cs.LG","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-30T06:35:39Z","title_canon_sha256":"0508c0337a39c21e77c8be47d8c0617066f66606e083cd40d18c55c282f76225"},"schema_version":"1.0","source":{"id":"1611.10017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10017","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10017v1","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10017","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"JR7ZXG4RW25Q","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JR7ZXG4RW25QJFPN","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JR7ZXG4R","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:dfc342967e50aac3badc30e006cdf831b2cb85af04fc9a2d64ea87ba5d29fb5e","target":"graph","created_at":"2026-05-18T00:56:11Z","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":"In this paper, we propose a learning-based supervised discrete hashing method. Binary hashing is widely used for large-scale image retrieval as well as video and document searches because the compact representation of binary code is essential for data storage and reasonable for query searches using bit-operations. The recently proposed Supervised Discrete Hashing (SDH) efficiently solves mixed-integer programming problems by alternating optimization and the Discrete Cyclic Coordinate descent (DCC) method. We show that the SDH model can be simplified without performance degradation based on som","authors_text":"Gou Koutaki, Keiichiro Shirai, Mitsuru Ambai","cross_cats":["cs.LG","cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-30T06:35:39Z","title":"Fast Supervised Discrete Hashing and its Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10017","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:2221a0881b12a719184030e2d6abc904f42e17f0a9a1f527c307f1328f3dbe82","target":"record","created_at":"2026-05-18T00:56:11Z","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":"283799fefab4e10c7fde165f0d5f8d27e5932c5b6b4da2e96cc96d32ec654452","cross_cats_sorted":["cs.LG","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-30T06:35:39Z","title_canon_sha256":"0508c0337a39c21e77c8be47d8c0617066f66606e083cd40d18c55c282f76225"},"schema_version":"1.0","source":{"id":"1611.10017","kind":"arxiv","version":1}},"canonical_sha256":"4c7f9b9b91b6bb0495ed4a4ec14defd593bab9dbf1cd253874420feea6c8369b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c7f9b9b91b6bb0495ed4a4ec14defd593bab9dbf1cd253874420feea6c8369b","first_computed_at":"2026-05-18T00:56:11.387782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:11.387782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YKVGJ0xIj+KhcnZt0m3fQalWawnQaUO6fUgW7/hvtyTw2uSm4bN0uuRUIJBMycVIPgUYTiqCRcnpdv8IuGRYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:11.388290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2221a0881b12a719184030e2d6abc904f42e17f0a9a1f527c307f1328f3dbe82","sha256:dfc342967e50aac3badc30e006cdf831b2cb85af04fc9a2d64ea87ba5d29fb5e"],"state_sha256":"39126312a77326f4c72e3c5903afa5df15d4723cbcf3d6f4a72cdcd342ec6ad2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiqjz9oq2XSKDu+032oQE+o1jQx4/GsKLPp2I+/YXnVdm7DGRWO/fTBiriiQ10V1AKtZv3tBEHx03aNN3Jq+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:16:52.339180Z","bundle_sha256":"f0e87b7b3a82024f004f8716453793593af83c5dfb7634d93983f5c9a1c4c154"}}