{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X373BUSBU7AM7FHJVHNWUQ3XF2","short_pith_number":"pith:X373BUSB","canonical_record":{"source":{"id":"1904.08685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-18T11:02:52Z","cross_cats_sorted":[],"title_canon_sha256":"82d25aa49e57376bf7c95976b4e5d33c0cf7d6e301f08c080f65d1ea8b492f38","abstract_canon_sha256":"c3f4cd43982ff29d917d4380eb1f4ed1d094aa46899931dc31bf643d2acbb418"},"schema_version":"1.0"},"canonical_sha256":"beffb0d241a7c0cf94e9a9db6a43772eb700509f794877f50d56957013ba1733","source":{"kind":"arxiv","id":"1904.08685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08685","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08685v1","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08685","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"X373BUSBU7AM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X373BUSBU7AM7FHJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X373BUSB","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X373BUSBU7AM7FHJVHNWUQ3XF2","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-18T11:02:52Z","cross_cats_sorted":[],"title_canon_sha256":"82d25aa49e57376bf7c95976b4e5d33c0cf7d6e301f08c080f65d1ea8b492f38","abstract_canon_sha256":"c3f4cd43982ff29d917d4380eb1f4ed1d094aa46899931dc31bf643d2acbb418"},"schema_version":"1.0"},"canonical_sha256":"beffb0d241a7c0cf94e9a9db6a43772eb700509f794877f50d56957013ba1733","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:13.390556Z","signature_b64":"jdJVgkLmDntEXTi2/XsEOHgdeQ8lB4v6eUBkLRC9Cpg32Vhho38fCOwl479Kc4QPf+Yz+DmDbbOJze/0W/kTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beffb0d241a7c0cf94e9a9db6a43772eb700509f794877f50d56957013ba1733","last_reissued_at":"2026-05-17T23:48:13.389883Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:13.389883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08685","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-17T23:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efbFgK723g+M7m/aJrBRwlDZRx1r/cTlxmIO8WdIt9nN6fnvV43dk+tse1or8FS/2j1xHmO4LcnFW65pR/hwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:42:11.462821Z"},"content_sha256":"68f0568672da62b6ca7e4024711e8d1e512dfb2162714d668519235ef4c39ded","schema_version":"1.0","event_id":"sha256:68f0568672da62b6ca7e4024711e8d1e512dfb2162714d668519235ef4c39ded"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X373BUSBU7AM7FHJVHNWUQ3XF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global Hashing System for Fast Image Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dacheng Tao, Dayong Tian","submitted_at":"2019-04-18T11:02:52Z","abstract_excerpt":"Hashing methods have been widely investigated for fast approximate nearest neighbor searching in large data sets. Most existing methods use binary vectors in lower dimensional spaces to represent data points that are usually real vectors of higher dimensionality. We divide the hashing process into two steps. Data points are first embedded in a low-dimensional space, and the global positioning system method is subsequently introduced but modified for binary embedding. We devise dataindependent and data-dependent methods to distribute the satellites at appropriate locations. Our methods are base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08685","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-17T23:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZV+/lTQn9izGGMte5A5uOmwNMv3pKO95SqUWtzb0TxwGkrOhHMRB0+UDVv21zUyoVWai9ONQk1Rsv+4w8jGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:42:11.463172Z"},"content_sha256":"db7b8ff2903dcb1422147a765fd8a0491a289d2a0bdcf3883bab5f6f480c34a6","schema_version":"1.0","event_id":"sha256:db7b8ff2903dcb1422147a765fd8a0491a289d2a0bdcf3883bab5f6f480c34a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X373BUSBU7AM7FHJVHNWUQ3XF2/bundle.json","state_url":"https://pith.science/pith/X373BUSBU7AM7FHJVHNWUQ3XF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X373BUSBU7AM7FHJVHNWUQ3XF2/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-25T17:42:11Z","links":{"resolver":"https://pith.science/pith/X373BUSBU7AM7FHJVHNWUQ3XF2","bundle":"https://pith.science/pith/X373BUSBU7AM7FHJVHNWUQ3XF2/bundle.json","state":"https://pith.science/pith/X373BUSBU7AM7FHJVHNWUQ3XF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X373BUSBU7AM7FHJVHNWUQ3XF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X373BUSBU7AM7FHJVHNWUQ3XF2","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":"c3f4cd43982ff29d917d4380eb1f4ed1d094aa46899931dc31bf643d2acbb418","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-18T11:02:52Z","title_canon_sha256":"82d25aa49e57376bf7c95976b4e5d33c0cf7d6e301f08c080f65d1ea8b492f38"},"schema_version":"1.0","source":{"id":"1904.08685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08685","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08685v1","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08685","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"X373BUSBU7AM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X373BUSBU7AM7FHJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X373BUSB","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:db7b8ff2903dcb1422147a765fd8a0491a289d2a0bdcf3883bab5f6f480c34a6","target":"graph","created_at":"2026-05-17T23:48:13Z","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 methods have been widely investigated for fast approximate nearest neighbor searching in large data sets. Most existing methods use binary vectors in lower dimensional spaces to represent data points that are usually real vectors of higher dimensionality. We divide the hashing process into two steps. Data points are first embedded in a low-dimensional space, and the global positioning system method is subsequently introduced but modified for binary embedding. We devise dataindependent and data-dependent methods to distribute the satellites at appropriate locations. Our methods are base","authors_text":"Dacheng Tao, Dayong Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-18T11:02:52Z","title":"Global Hashing System for Fast Image Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08685","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:68f0568672da62b6ca7e4024711e8d1e512dfb2162714d668519235ef4c39ded","target":"record","created_at":"2026-05-17T23:48:13Z","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":"c3f4cd43982ff29d917d4380eb1f4ed1d094aa46899931dc31bf643d2acbb418","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-18T11:02:52Z","title_canon_sha256":"82d25aa49e57376bf7c95976b4e5d33c0cf7d6e301f08c080f65d1ea8b492f38"},"schema_version":"1.0","source":{"id":"1904.08685","kind":"arxiv","version":1}},"canonical_sha256":"beffb0d241a7c0cf94e9a9db6a43772eb700509f794877f50d56957013ba1733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beffb0d241a7c0cf94e9a9db6a43772eb700509f794877f50d56957013ba1733","first_computed_at":"2026-05-17T23:48:13.389883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:13.389883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jdJVgkLmDntEXTi2/XsEOHgdeQ8lB4v6eUBkLRC9Cpg32Vhho38fCOwl479Kc4QPf+Yz+DmDbbOJze/0W/kTCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:13.390556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68f0568672da62b6ca7e4024711e8d1e512dfb2162714d668519235ef4c39ded","sha256:db7b8ff2903dcb1422147a765fd8a0491a289d2a0bdcf3883bab5f6f480c34a6"],"state_sha256":"7c41f92fc5a69474942ae5b194bb78f5613f381caf9b27e639179226b9416b4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZjduoeKMT3EYzezpS4q8hlnlIeS4rB5xp494Kh92AJT5nTVd/Zf824pO9jzuF49xYmN4L1MkSRZFjRLdnOtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:42:11.466156Z","bundle_sha256":"26683d1740a773c2d196f35cb94c67491cb7111645c51b63172d7eed323fedf2"}}