{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FUJWMBNGW2GRLP3AVSB7HVLTTE","short_pith_number":"pith:FUJWMBNG","canonical_record":{"source":{"id":"1907.00382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-30T13:59:01Z","cross_cats_sorted":["cs.LG","eess.IV"],"title_canon_sha256":"0bb9e014e3a4fb2c5d9b34216d00ab89cc1783404831e3711d1d249b18dd641b","abstract_canon_sha256":"ef88866ba3350a2aab885188893fc318829f25bac9406cbb0053ccc19496a81d"},"schema_version":"1.0"},"canonical_sha256":"2d136605a6b68d15bf60ac83f3d573991f68fc1c3ed036d6ee3b68b382b9542a","source":{"kind":"arxiv","id":"1907.00382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00382","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00382v1","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00382","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"FUJWMBNGW2GR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUJWMBNGW2GRLP3A","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUJWMBNG","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FUJWMBNGW2GRLP3AVSB7HVLTTE","target":"record","payload":{"canonical_record":{"source":{"id":"1907.00382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-30T13:59:01Z","cross_cats_sorted":["cs.LG","eess.IV"],"title_canon_sha256":"0bb9e014e3a4fb2c5d9b34216d00ab89cc1783404831e3711d1d249b18dd641b","abstract_canon_sha256":"ef88866ba3350a2aab885188893fc318829f25bac9406cbb0053ccc19496a81d"},"schema_version":"1.0"},"canonical_sha256":"2d136605a6b68d15bf60ac83f3d573991f68fc1c3ed036d6ee3b68b382b9542a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:51.932554Z","signature_b64":"1c79KinudYIwbNmVZB04KO/6v+APvvPwNz6yrgzy0cMvWO7BLRnCfxAYaKIatpV0i8EJRMRPAortMAdZh7LwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d136605a6b68d15bf60ac83f3d573991f68fc1c3ed036d6ee3b68b382b9542a","last_reissued_at":"2026-05-17T23:41:51.931951Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:51.931951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.00382","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:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gU0MwzTEwISf6fdUEi72a1Tn40GrWkvTdmokKYVu5zTPkfomXi0TIR9cpU5M/JFW+I4lyGz8THBIwp1IjbZqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:43:23.025365Z"},"content_sha256":"1e336271e61ee857bb5e31aee93812c43fba3b3877f7afb0dcd5d4daf176990e","schema_version":"1.0","event_id":"sha256:1e336271e61ee857bb5e31aee93812c43fba3b3877f7afb0dcd5d4daf176990e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FUJWMBNGW2GRLP3AVSB7HVLTTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarially Trained Deep Neural Semantic Hashing Scheme for Subjective Search in Fashion Inventory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.IV"],"primary_cat":"cs.CV","authors_text":"Debdoot Sheet, Mithun Dasgupta, Saket Singh","submitted_at":"2019-06-30T13:59:01Z","abstract_excerpt":"The simple approach of retrieving a closest match of a query image from one in the gallery, compares an image pair using sum of absolute difference in pixel or feature space. The process is computationally expensive, ill-posed to illumination, background composition, pose variation, as well as inefficient to be deployed on gallery sets with more than 1000 elements. Hashing is a faster alternative which involves representing images in reduced dimensional simple feature spaces. Encoding images into binary hash codes enables similarity comparison in an image-pair using the Hamming distance measur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00382","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:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20XHP27n8iO5ivlFK6awAW1qUjKCUNyj5GVtP7iz1tvuh7/1+IADYAxLiM2pCT/mloD0VdJAEjYjn+lOkofFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:43:23.025984Z"},"content_sha256":"4a308de99bc86312b7935466396aacfdcff798d87f49981b7f844222bd81b866","schema_version":"1.0","event_id":"sha256:4a308de99bc86312b7935466396aacfdcff798d87f49981b7f844222bd81b866"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUJWMBNGW2GRLP3AVSB7HVLTTE/bundle.json","state_url":"https://pith.science/pith/FUJWMBNGW2GRLP3AVSB7HVLTTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUJWMBNGW2GRLP3AVSB7HVLTTE/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-26T09:43:23Z","links":{"resolver":"https://pith.science/pith/FUJWMBNGW2GRLP3AVSB7HVLTTE","bundle":"https://pith.science/pith/FUJWMBNGW2GRLP3AVSB7HVLTTE/bundle.json","state":"https://pith.science/pith/FUJWMBNGW2GRLP3AVSB7HVLTTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUJWMBNGW2GRLP3AVSB7HVLTTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FUJWMBNGW2GRLP3AVSB7HVLTTE","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":"ef88866ba3350a2aab885188893fc318829f25bac9406cbb0053ccc19496a81d","cross_cats_sorted":["cs.LG","eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-30T13:59:01Z","title_canon_sha256":"0bb9e014e3a4fb2c5d9b34216d00ab89cc1783404831e3711d1d249b18dd641b"},"schema_version":"1.0","source":{"id":"1907.00382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00382","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00382v1","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00382","created_at":"2026-05-17T23:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"FUJWMBNGW2GR","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUJWMBNGW2GRLP3A","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUJWMBNG","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4a308de99bc86312b7935466396aacfdcff798d87f49981b7f844222bd81b866","target":"graph","created_at":"2026-05-17T23:41:51Z","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":"The simple approach of retrieving a closest match of a query image from one in the gallery, compares an image pair using sum of absolute difference in pixel or feature space. The process is computationally expensive, ill-posed to illumination, background composition, pose variation, as well as inefficient to be deployed on gallery sets with more than 1000 elements. Hashing is a faster alternative which involves representing images in reduced dimensional simple feature spaces. Encoding images into binary hash codes enables similarity comparison in an image-pair using the Hamming distance measur","authors_text":"Debdoot Sheet, Mithun Dasgupta, Saket Singh","cross_cats":["cs.LG","eess.IV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-30T13:59:01Z","title":"Adversarially Trained Deep Neural Semantic Hashing Scheme for Subjective Search in Fashion Inventory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00382","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:1e336271e61ee857bb5e31aee93812c43fba3b3877f7afb0dcd5d4daf176990e","target":"record","created_at":"2026-05-17T23:41:51Z","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":"ef88866ba3350a2aab885188893fc318829f25bac9406cbb0053ccc19496a81d","cross_cats_sorted":["cs.LG","eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-30T13:59:01Z","title_canon_sha256":"0bb9e014e3a4fb2c5d9b34216d00ab89cc1783404831e3711d1d249b18dd641b"},"schema_version":"1.0","source":{"id":"1907.00382","kind":"arxiv","version":1}},"canonical_sha256":"2d136605a6b68d15bf60ac83f3d573991f68fc1c3ed036d6ee3b68b382b9542a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d136605a6b68d15bf60ac83f3d573991f68fc1c3ed036d6ee3b68b382b9542a","first_computed_at":"2026-05-17T23:41:51.931951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:51.931951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1c79KinudYIwbNmVZB04KO/6v+APvvPwNz6yrgzy0cMvWO7BLRnCfxAYaKIatpV0i8EJRMRPAortMAdZh7LwAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:51.932554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e336271e61ee857bb5e31aee93812c43fba3b3877f7afb0dcd5d4daf176990e","sha256:4a308de99bc86312b7935466396aacfdcff798d87f49981b7f844222bd81b866"],"state_sha256":"7a7f7e0c0f0af50dc728522bc366ed1c3b4e5d69a5298aadec0b543fcf1d740f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yy8PQihB4pApE/AbdJtatWuKeWk3FrQnPOVxKxwiS7xV61ty8VHoZPPmYjlcCMj/60C48Zr+UhauRQtvmtk7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:43:23.029280Z","bundle_sha256":"dc88ccfa26a99f029d6f106841ab8292868991b9669110806b39884259beae87"}}