{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:H5R4V57I3RLCDNJQ5XIYPPPRY6","short_pith_number":"pith:H5R4V57I","canonical_record":{"source":{"id":"2112.13565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-27T08:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"996fb45ecc593a60043236b86da1052f80b2efd6fdc072233db9c6ab34fdf3d4","abstract_canon_sha256":"969bfcece9b0d2e00b87f31ec754f4a97634d153f96245e5549baf605e17913a"},"schema_version":"1.0"},"canonical_sha256":"3f63caf7e8dc5621b530edd187bdf1c788b46d7944dd4ffeabd4419d1b3bed4d","source":{"kind":"arxiv","id":"2112.13565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.13565","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"2112.13565v1","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13565","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"H5R4V57I3RLC","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"pith_short_16","alias_value":"H5R4V57I3RLCDNJQ","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"pith_short_8","alias_value":"H5R4V57I","created_at":"2026-07-05T03:43:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:H5R4V57I3RLCDNJQ5XIYPPPRY6","target":"record","payload":{"canonical_record":{"source":{"id":"2112.13565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-27T08:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"996fb45ecc593a60043236b86da1052f80b2efd6fdc072233db9c6ab34fdf3d4","abstract_canon_sha256":"969bfcece9b0d2e00b87f31ec754f4a97634d153f96245e5549baf605e17913a"},"schema_version":"1.0"},"canonical_sha256":"3f63caf7e8dc5621b530edd187bdf1c788b46d7944dd4ffeabd4419d1b3bed4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:54.969197Z","signature_b64":"NiQVSfDP6LfqaM8Wm9liK2afJ6iGdkW6HnaYvsnl4cIZwZNaSfPnbG5VxHlPOE+WTbCwRwHif/GbCQVcoiECCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f63caf7e8dc5621b530edd187bdf1c788b46d7944dd4ffeabd4419d1b3bed4d","last_reissued_at":"2026-07-05T03:43:54.968593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:54.968593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.13565","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-07-05T03:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBAsu8mve5JFEl4rb1J8zRkom+e1BOmmj+QUDVA+AOHYEJyyn2RicuW1uzKeAXo2cpznInFWTvCLsiVCEzRsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:45:48.749252Z"},"content_sha256":"c87678fe5f5357de39fcd96f880bece486281fa2121ab84822d0acb61818ca39","schema_version":"1.0","event_id":"sha256:c87678fe5f5357de39fcd96f880bece486281fa2121ab84822d0acb61818ca39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:H5R4V57I3RLCDNJQ5XIYPPPRY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hard Example Guided Hashing for Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hai Su, Junle Liang, Jun Liang, Meiyin Han, Songsen Yu","submitted_at":"2021-12-27T08:24:10Z","abstract_excerpt":"Compared with the traditional hashing methods, deep hashing methods generate hash codes with rich semantic information and greatly improves the performances in the image retrieval field. However, it is unsatisfied for current deep hashing methods to predict the similarity of hard examples. It exists two main factors affecting the ability of learning hard examples, which are weak key features extraction and the shortage of hard examples. In this paper, we give a novel end-to-end model to extract the key feature from hard examples and obtain hash code with the accurate semantic information. In a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13565","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.13565/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouNzgwXbaeon8WfrDPkLGwCaSdoodIps13keK2ogvoaCmtimB5BtTj/kJGPmt1FimJ3TqChUc//HL9dGE4RLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:45:48.749828Z"},"content_sha256":"0e8ed2f44f81c7ca1a215e7cb4a87ca81c0f43f2c6cb3e66f135f9ad4e91b824","schema_version":"1.0","event_id":"sha256:0e8ed2f44f81c7ca1a215e7cb4a87ca81c0f43f2c6cb3e66f135f9ad4e91b824"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5R4V57I3RLCDNJQ5XIYPPPRY6/bundle.json","state_url":"https://pith.science/pith/H5R4V57I3RLCDNJQ5XIYPPPRY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5R4V57I3RLCDNJQ5XIYPPPRY6/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-08-07T01:45:48Z","links":{"resolver":"https://pith.science/pith/H5R4V57I3RLCDNJQ5XIYPPPRY6","bundle":"https://pith.science/pith/H5R4V57I3RLCDNJQ5XIYPPPRY6/bundle.json","state":"https://pith.science/pith/H5R4V57I3RLCDNJQ5XIYPPPRY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5R4V57I3RLCDNJQ5XIYPPPRY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:H5R4V57I3RLCDNJQ5XIYPPPRY6","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":"969bfcece9b0d2e00b87f31ec754f4a97634d153f96245e5549baf605e17913a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-27T08:24:10Z","title_canon_sha256":"996fb45ecc593a60043236b86da1052f80b2efd6fdc072233db9c6ab34fdf3d4"},"schema_version":"1.0","source":{"id":"2112.13565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.13565","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"2112.13565v1","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13565","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"H5R4V57I3RLC","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"pith_short_16","alias_value":"H5R4V57I3RLCDNJQ","created_at":"2026-07-05T03:43:54Z"},{"alias_kind":"pith_short_8","alias_value":"H5R4V57I","created_at":"2026-07-05T03:43:54Z"}],"graph_snapshots":[{"event_id":"sha256:0e8ed2f44f81c7ca1a215e7cb4a87ca81c0f43f2c6cb3e66f135f9ad4e91b824","target":"graph","created_at":"2026-07-05T03:43:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.13565/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Compared with the traditional hashing methods, deep hashing methods generate hash codes with rich semantic information and greatly improves the performances in the image retrieval field. However, it is unsatisfied for current deep hashing methods to predict the similarity of hard examples. It exists two main factors affecting the ability of learning hard examples, which are weak key features extraction and the shortage of hard examples. In this paper, we give a novel end-to-end model to extract the key feature from hard examples and obtain hash code with the accurate semantic information. In a","authors_text":"Hai Su, Junle Liang, Jun Liang, Meiyin Han, Songsen Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-27T08:24:10Z","title":"Hard Example Guided Hashing for Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13565","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:c87678fe5f5357de39fcd96f880bece486281fa2121ab84822d0acb61818ca39","target":"record","created_at":"2026-07-05T03:43:54Z","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":"969bfcece9b0d2e00b87f31ec754f4a97634d153f96245e5549baf605e17913a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-12-27T08:24:10Z","title_canon_sha256":"996fb45ecc593a60043236b86da1052f80b2efd6fdc072233db9c6ab34fdf3d4"},"schema_version":"1.0","source":{"id":"2112.13565","kind":"arxiv","version":1}},"canonical_sha256":"3f63caf7e8dc5621b530edd187bdf1c788b46d7944dd4ffeabd4419d1b3bed4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f63caf7e8dc5621b530edd187bdf1c788b46d7944dd4ffeabd4419d1b3bed4d","first_computed_at":"2026-07-05T03:43:54.968593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:43:54.968593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NiQVSfDP6LfqaM8Wm9liK2afJ6iGdkW6HnaYvsnl4cIZwZNaSfPnbG5VxHlPOE+WTbCwRwHif/GbCQVcoiECCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:43:54.969197Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.13565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c87678fe5f5357de39fcd96f880bece486281fa2121ab84822d0acb61818ca39","sha256:0e8ed2f44f81c7ca1a215e7cb4a87ca81c0f43f2c6cb3e66f135f9ad4e91b824"],"state_sha256":"e8a7280b565348cb2e0a54a94dbc883076b5322adba4f748466155348c83ed82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unr3EOjo2UV7OkQLQW577WhB/FN/JjLDDjgVTaoVImXbxGGJV0g1uH+uWMZdb8atRBVuL31v+3Qx9GuqxznKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:45:48.766634Z","bundle_sha256":"ec2160f356bcf2946b96905fec339c068c59c23801d9f6b86be8509ad1f51ac5"}}