{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YPJ5B7YCDJ6MK7GSJFX5EWFYBG","short_pith_number":"pith:YPJ5B7YC","canonical_record":{"source":{"id":"1710.07750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-21T04:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"1a42335480e779cd27627acb9ea0a7cbe4a42077a6e78411e84a6845bdfc5ae9","abstract_canon_sha256":"de848c7cfe55f1154519bde6845243187115e825d5dd435d388f540a4370cd4a"},"schema_version":"1.0"},"canonical_sha256":"c3d3d0ff021a7cc57cd2496fd258b809805c591bcfc0798d7e891e2ece9c20c3","source":{"kind":"arxiv","id":"1710.07750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07750","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07750v1","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07750","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"YPJ5B7YCDJ6M","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YPJ5B7YCDJ6MK7GS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YPJ5B7YC","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YPJ5B7YCDJ6MK7GSJFX5EWFYBG","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-21T04:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"1a42335480e779cd27627acb9ea0a7cbe4a42077a6e78411e84a6845bdfc5ae9","abstract_canon_sha256":"de848c7cfe55f1154519bde6845243187115e825d5dd435d388f540a4370cd4a"},"schema_version":"1.0"},"canonical_sha256":"c3d3d0ff021a7cc57cd2496fd258b809805c591bcfc0798d7e891e2ece9c20c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:19.762917Z","signature_b64":"iEX1FrQJ8+UGhjM/qadwESSovDM5MtVQX1hAGB7Tn81ZEBH/QHSECDiMWuO3jnsjcOiaEHIqNgN4CHMcpX91Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3d3d0ff021a7cc57cd2496fd258b809805c591bcfc0798d7e891e2ece9c20c3","last_reissued_at":"2026-05-18T00:32:19.762555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:19.762555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07750","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:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfSnpzFnqN3IvKn3t1kogPImjiRxP7nS/e8FPQZoHDckCHBJahdw9Gvuk90QtgRDatEzvPuYxT9nJ0UgHxlFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:29.689386Z"},"content_sha256":"4d5f3a486e34948fd1399b990f9e634489f50709572e2c9bccdd7c1c7c338c68","schema_version":"1.0","event_id":"sha256:4d5f3a486e34948fd1399b990f9e634489f50709572e2c9bccdd7c1c7c338c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YPJ5B7YCDJ6MK7GSJFX5EWFYBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient deep learning hashing neural network for mobile visual search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Heng Qi, Liang Liu, Wu Liu","submitted_at":"2017-10-21T04:37:23Z","abstract_excerpt":"Mobile visual search applications are emerging that enable users to sense their surroundings with smart phones. However, because of the particular challenges of mobile visual search, achieving a high recognition bitrate has becomes a consistent target of previous related works. In this paper, we propose a few-parameter, low-latency, and high-accuracy deep hashing approach for constructing binary hash codes for mobile visual search. First, we exploit the architecture of the MobileNet model, which significantly decreases the latency of deep feature extraction by reducing the number of model para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07750","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:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H11kTaRGOQUNqJJ0S0QD/EJ9iu8zPdHUEe4PO1yKc7HPJ8kmP3icSAps0u9sGKKcxJlLBBpJ/SgTMuRUtK0GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:23:29.689736Z"},"content_sha256":"7eb806e12e7802814ac6bacf3ef0ccfc2742e085f48b80fca6390cd1cfce834f","schema_version":"1.0","event_id":"sha256:7eb806e12e7802814ac6bacf3ef0ccfc2742e085f48b80fca6390cd1cfce834f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPJ5B7YCDJ6MK7GSJFX5EWFYBG/bundle.json","state_url":"https://pith.science/pith/YPJ5B7YCDJ6MK7GSJFX5EWFYBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPJ5B7YCDJ6MK7GSJFX5EWFYBG/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-02T22:23:29Z","links":{"resolver":"https://pith.science/pith/YPJ5B7YCDJ6MK7GSJFX5EWFYBG","bundle":"https://pith.science/pith/YPJ5B7YCDJ6MK7GSJFX5EWFYBG/bundle.json","state":"https://pith.science/pith/YPJ5B7YCDJ6MK7GSJFX5EWFYBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPJ5B7YCDJ6MK7GSJFX5EWFYBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YPJ5B7YCDJ6MK7GSJFX5EWFYBG","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":"de848c7cfe55f1154519bde6845243187115e825d5dd435d388f540a4370cd4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-21T04:37:23Z","title_canon_sha256":"1a42335480e779cd27627acb9ea0a7cbe4a42077a6e78411e84a6845bdfc5ae9"},"schema_version":"1.0","source":{"id":"1710.07750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07750","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07750v1","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07750","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"YPJ5B7YCDJ6M","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YPJ5B7YCDJ6MK7GS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YPJ5B7YC","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:7eb806e12e7802814ac6bacf3ef0ccfc2742e085f48b80fca6390cd1cfce834f","target":"graph","created_at":"2026-05-18T00:32:19Z","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":"Mobile visual search applications are emerging that enable users to sense their surroundings with smart phones. However, because of the particular challenges of mobile visual search, achieving a high recognition bitrate has becomes a consistent target of previous related works. In this paper, we propose a few-parameter, low-latency, and high-accuracy deep hashing approach for constructing binary hash codes for mobile visual search. First, we exploit the architecture of the MobileNet model, which significantly decreases the latency of deep feature extraction by reducing the number of model para","authors_text":"Heng Qi, Liang Liu, Wu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-21T04:37:23Z","title":"An efficient deep learning hashing neural network for mobile visual search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07750","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:4d5f3a486e34948fd1399b990f9e634489f50709572e2c9bccdd7c1c7c338c68","target":"record","created_at":"2026-05-18T00:32:19Z","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":"de848c7cfe55f1154519bde6845243187115e825d5dd435d388f540a4370cd4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-21T04:37:23Z","title_canon_sha256":"1a42335480e779cd27627acb9ea0a7cbe4a42077a6e78411e84a6845bdfc5ae9"},"schema_version":"1.0","source":{"id":"1710.07750","kind":"arxiv","version":1}},"canonical_sha256":"c3d3d0ff021a7cc57cd2496fd258b809805c591bcfc0798d7e891e2ece9c20c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3d3d0ff021a7cc57cd2496fd258b809805c591bcfc0798d7e891e2ece9c20c3","first_computed_at":"2026-05-18T00:32:19.762555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:19.762555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iEX1FrQJ8+UGhjM/qadwESSovDM5MtVQX1hAGB7Tn81ZEBH/QHSECDiMWuO3jnsjcOiaEHIqNgN4CHMcpX91Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:19.762917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d5f3a486e34948fd1399b990f9e634489f50709572e2c9bccdd7c1c7c338c68","sha256:7eb806e12e7802814ac6bacf3ef0ccfc2742e085f48b80fca6390cd1cfce834f"],"state_sha256":"2cded0d829a5c715bfc99bacecd800f0be9b06f37b63e57aba5abd0e76bbcb89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkw4aUG8oIGXF6bAJJ4Y0sWmFuRcUBzklccCl8fiRZ41tS2lryJHKLmJfajftaR63VJAKZHeuRlY809qug8eBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:23:29.691688Z","bundle_sha256":"a900f4d166ad8a4ecfac8671588ffce1ba56ca30985bec71292ab104e77ccc4e"}}