{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:J2WI7LY26X6RX23H67TKVQDGEL","short_pith_number":"pith:J2WI7LY2","canonical_record":{"source":{"id":"1903.12493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-29T13:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"4d6208c2fa0d020003e5bd7115c597186505c5049db6f17b794b08927e0568f8","abstract_canon_sha256":"3d9901c00bb3e7fd1d4b71c8d59feacfa42392d68741279212e32a7ef93e1a7c"},"schema_version":"1.0"},"canonical_sha256":"4eac8faf1af5fd1beb67f7e6aac06622c0c3dd01a44616db7d07c7ca13eafa47","source":{"kind":"arxiv","id":"1903.12493","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12493","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12493v2","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12493","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"J2WI7LY26X6R","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J2WI7LY26X6RX23H","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J2WI7LY2","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:J2WI7LY26X6RX23H67TKVQDGEL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-29T13:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"4d6208c2fa0d020003e5bd7115c597186505c5049db6f17b794b08927e0568f8","abstract_canon_sha256":"3d9901c00bb3e7fd1d4b71c8d59feacfa42392d68741279212e32a7ef93e1a7c"},"schema_version":"1.0"},"canonical_sha256":"4eac8faf1af5fd1beb67f7e6aac06622c0c3dd01a44616db7d07c7ca13eafa47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:28.867879Z","signature_b64":"Oy0T30kuSPkYzlHbXmzeWFers414SbUBHZqXulzhHOvW6HZ1MWd/dWNi4We6gFvhBnPN9r7garqadotcHHfXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eac8faf1af5fd1beb67f7e6aac06622c0c3dd01a44616db7d07c7ca13eafa47","last_reissued_at":"2026-05-17T23:44:28.867417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:28.867417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12493","source_version":2,"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:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04WmJZAhGpWHidNgYBDZPPNp9tmJHEq22jNnPMKMJa5o1H1O/rRhv7qh+BuUr8SNkUrxOIeuL+EVd86EO7pJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:44:00.915846Z"},"content_sha256":"b3581e6ba71eb630e9cbd25a26ba668889dccffb11bc12b3208d4a3a6ff511c8","schema_version":"1.0","event_id":"sha256:b3581e6ba71eb630e9cbd25a26ba668889dccffb11bc12b3208d4a3a6ff511c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:J2WI7LY26X6RX23H67TKVQDGEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetric Deep Semantic Quantization for Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jun Long, Osolo Ian Raymond, Wuqing Sun, Zhan Yang","submitted_at":"2019-03-29T13:00:03Z","abstract_excerpt":"Due to its fast retrieval and storage efficiency capabilities, hashing has been widely used in nearest neighbor retrieval tasks. By using deep learning based techniques, hashing can outperform non-learning based hashing technique in many applications. However, we argue that the current deep learning based hashing methods ignore some critical problems (e.g., the learned hash codes are not discriminative due to the hashing methods being unable to discover rich semantic information and the training strategy having difficulty optimizing the discrete binary codes). In this paper, we propose a novel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12493","kind":"arxiv","version":2},"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:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDQwSHtPH+poNVpd2vv3NI3Ul8EGueR8XT0rtLHHtu4nbALtXe8yVbTOwj0Mi6pMA9BAnu5H8cBjMqE5b5DcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:44:00.916273Z"},"content_sha256":"d5babbd5d538864e465634e1f13677ba34c5caa42439abd035ba0f6803ed4e2f","schema_version":"1.0","event_id":"sha256:d5babbd5d538864e465634e1f13677ba34c5caa42439abd035ba0f6803ed4e2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2WI7LY26X6RX23H67TKVQDGEL/bundle.json","state_url":"https://pith.science/pith/J2WI7LY26X6RX23H67TKVQDGEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2WI7LY26X6RX23H67TKVQDGEL/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-01T01:44:00Z","links":{"resolver":"https://pith.science/pith/J2WI7LY26X6RX23H67TKVQDGEL","bundle":"https://pith.science/pith/J2WI7LY26X6RX23H67TKVQDGEL/bundle.json","state":"https://pith.science/pith/J2WI7LY26X6RX23H67TKVQDGEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2WI7LY26X6RX23H67TKVQDGEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J2WI7LY26X6RX23H67TKVQDGEL","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":"3d9901c00bb3e7fd1d4b71c8d59feacfa42392d68741279212e32a7ef93e1a7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-29T13:00:03Z","title_canon_sha256":"4d6208c2fa0d020003e5bd7115c597186505c5049db6f17b794b08927e0568f8"},"schema_version":"1.0","source":{"id":"1903.12493","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12493","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12493v2","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12493","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"J2WI7LY26X6R","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J2WI7LY26X6RX23H","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J2WI7LY2","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:d5babbd5d538864e465634e1f13677ba34c5caa42439abd035ba0f6803ed4e2f","target":"graph","created_at":"2026-05-17T23:44:28Z","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":"Due to its fast retrieval and storage efficiency capabilities, hashing has been widely used in nearest neighbor retrieval tasks. By using deep learning based techniques, hashing can outperform non-learning based hashing technique in many applications. However, we argue that the current deep learning based hashing methods ignore some critical problems (e.g., the learned hash codes are not discriminative due to the hashing methods being unable to discover rich semantic information and the training strategy having difficulty optimizing the discrete binary codes). In this paper, we propose a novel","authors_text":"Jun Long, Osolo Ian Raymond, Wuqing Sun, Zhan Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-29T13:00:03Z","title":"Asymmetric Deep Semantic Quantization for Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12493","kind":"arxiv","version":2},"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:b3581e6ba71eb630e9cbd25a26ba668889dccffb11bc12b3208d4a3a6ff511c8","target":"record","created_at":"2026-05-17T23:44:28Z","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":"3d9901c00bb3e7fd1d4b71c8d59feacfa42392d68741279212e32a7ef93e1a7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-29T13:00:03Z","title_canon_sha256":"4d6208c2fa0d020003e5bd7115c597186505c5049db6f17b794b08927e0568f8"},"schema_version":"1.0","source":{"id":"1903.12493","kind":"arxiv","version":2}},"canonical_sha256":"4eac8faf1af5fd1beb67f7e6aac06622c0c3dd01a44616db7d07c7ca13eafa47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eac8faf1af5fd1beb67f7e6aac06622c0c3dd01a44616db7d07c7ca13eafa47","first_computed_at":"2026-05-17T23:44:28.867417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:28.867417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oy0T30kuSPkYzlHbXmzeWFers414SbUBHZqXulzhHOvW6HZ1MWd/dWNi4We6gFvhBnPN9r7garqadotcHHfXAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:28.867879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12493","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3581e6ba71eb630e9cbd25a26ba668889dccffb11bc12b3208d4a3a6ff511c8","sha256:d5babbd5d538864e465634e1f13677ba34c5caa42439abd035ba0f6803ed4e2f"],"state_sha256":"f19edd90a5115db1eeacc80832488d0f6d236e16743b89403af2fe53dfd1596c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jk4VZ9/+jj3qxxzQnG1zBu8A45wVwrQy8LY3CAit2HAa0M/Of5EteL//ZMNFzdsTeadi+Zbo4ipSHorHy4EvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:44:00.919703Z","bundle_sha256":"dd2762fc51fa3c4fe5c1c3d40c99d733690721b106aed4e5bbba9d8b40ec2972"}}