{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:576HIILU7AEOZ46GDGWXVCIN6Z","short_pith_number":"pith:576HIILU","schema_version":"1.0","canonical_sha256":"effc742174f808ecf3c619ad7a890df64371727ff49040fba707f3a64291699b","source":{"kind":"arxiv","id":"2003.00134","version":3},"attestation_state":"computed","paper":{"title":"Image Hashing by Minimizing Discrete Component-wise Wasserstein Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.IR","authors_text":"Chandan K. Reddy, Khoa D. Doan, Sarkhan Badirli, Saurav Manchanda","submitted_at":"2020-02-29T00:22:53Z","abstract_excerpt":"Image hashing is one of the fundamental problems that demand both efficient and effective solutions for various practical scenarios. Adversarial autoencoders are shown to be able to implicitly learn a robust, locality-preserving hash function that generates balanced and high-quality hash codes. However, the existing adversarial hashing methods are inefficient to be employed for large-scale image retrieval applications. Specifically, they require an exponential number of samples to be able to generate optimal hash codes and a significantly high computational cost to train. In this paper, we sho"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.00134","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-02-29T00:22:53Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"d47ab36228496443530494ad2e1f65b8ffbd688355858f00ba671aaaaf223549","abstract_canon_sha256":"c2558a9321549b61dbb13e63d814ef7ac0fe6281aee50c5e1f1a999d74a87ea4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:44.293860Z","signature_b64":"y9NaV6NJoX/k36lh/qnkXFzWkVxXCTLidITgidvK17ZsTSk8+AAUA2CVKvHLxwDSxRPmXfUMHyzZJXTdzufiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effc742174f808ecf3c619ad7a890df64371727ff49040fba707f3a64291699b","last_reissued_at":"2026-07-05T01:05:44.293415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:44.293415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Image Hashing by Minimizing Discrete Component-wise Wasserstein Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.IR","authors_text":"Chandan K. Reddy, Khoa D. Doan, Sarkhan Badirli, Saurav Manchanda","submitted_at":"2020-02-29T00:22:53Z","abstract_excerpt":"Image hashing is one of the fundamental problems that demand both efficient and effective solutions for various practical scenarios. Adversarial autoencoders are shown to be able to implicitly learn a robust, locality-preserving hash function that generates balanced and high-quality hash codes. However, the existing adversarial hashing methods are inefficient to be employed for large-scale image retrieval applications. Specifically, they require an exponential number of samples to be able to generate optimal hash codes and a significantly high computational cost to train. In this paper, we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00134","kind":"arxiv","version":3},"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/2003.00134/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.00134","created_at":"2026-07-05T01:05:44.293473+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.00134v3","created_at":"2026-07-05T01:05:44.293473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00134","created_at":"2026-07-05T01:05:44.293473+00:00"},{"alias_kind":"pith_short_12","alias_value":"576HIILU7AEO","created_at":"2026-07-05T01:05:44.293473+00:00"},{"alias_kind":"pith_short_16","alias_value":"576HIILU7AEOZ46G","created_at":"2026-07-05T01:05:44.293473+00:00"},{"alias_kind":"pith_short_8","alias_value":"576HIILU","created_at":"2026-07-05T01:05:44.293473+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z","json":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z.json","graph_json":"https://pith.science/api/pith-number/576HIILU7AEOZ46GDGWXVCIN6Z/graph.json","events_json":"https://pith.science/api/pith-number/576HIILU7AEOZ46GDGWXVCIN6Z/events.json","paper":"https://pith.science/paper/576HIILU"},"agent_actions":{"view_html":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z","download_json":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z.json","view_paper":"https://pith.science/paper/576HIILU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.00134&json=true","fetch_graph":"https://pith.science/api/pith-number/576HIILU7AEOZ46GDGWXVCIN6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/576HIILU7AEOZ46GDGWXVCIN6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z/action/storage_attestation","attest_author":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z/action/author_attestation","sign_citation":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z/action/citation_signature","submit_replication":"https://pith.science/pith/576HIILU7AEOZ46GDGWXVCIN6Z/action/replication_record"}},"created_at":"2026-07-05T01:05:44.293473+00:00","updated_at":"2026-07-05T01:05:44.293473+00:00"}