{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VJNYZUC6OFYS4KCOYIC6OYI7E4","short_pith_number":"pith:VJNYZUC6","schema_version":"1.0","canonical_sha256":"aa5b8cd05e71712e284ec205e7611f27020b92bf0dc3fb758a5a6433fa506345","source":{"kind":"arxiv","id":"1901.05135","version":1},"attestation_state":"computed","paper":{"title":"Deep Supervised Hashing leveraging Quadratic Spherical Mutual Information for Content-based Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anastasios Tefas, Nikolaos Passalis","submitted_at":"2019-01-16T05:03:54Z","abstract_excerpt":"Several deep supervised hashing techniques have been proposed to allow for efficiently querying large image databases. However, deep supervised image hashing techniques are developed, to a great extent, heuristically often leading to suboptimal results. Contrary to this, we propose an efficient deep supervised hashing algorithm that optimizes the learned codes using an information-theoretic measure, the Quadratic Mutual Information (QMI). The proposed method is adapted to the needs of large-scale hashing and information retrieval leading to a novel information-theoretic measure, the Quadratic "},"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":"1901.05135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T05:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"1a26096bc62df47b87a3457b72aee21c02b5201a049e320e85bc6b4569863ac9","abstract_canon_sha256":"1c0ba2234c9b09b773d3797eae93a1f6472c775240a33849e34342822875de85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:11.792749Z","signature_b64":"WJq2lJ6kM25XY1J9b/SBwh4rM/7RErC1nt1IaRmvoZlHkW3IS17PBTXLMq9GzOqynzvkG+RccKG9ei7zSofWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa5b8cd05e71712e284ec205e7611f27020b92bf0dc3fb758a5a6433fa506345","last_reissued_at":"2026-05-17T23:56:11.792182Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:11.792182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Supervised Hashing leveraging Quadratic Spherical Mutual Information for Content-based Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anastasios Tefas, Nikolaos Passalis","submitted_at":"2019-01-16T05:03:54Z","abstract_excerpt":"Several deep supervised hashing techniques have been proposed to allow for efficiently querying large image databases. However, deep supervised image hashing techniques are developed, to a great extent, heuristically often leading to suboptimal results. Contrary to this, we propose an efficient deep supervised hashing algorithm that optimizes the learned codes using an information-theoretic measure, the Quadratic Mutual Information (QMI). The proposed method is adapted to the needs of large-scale hashing and information retrieval leading to a novel information-theoretic measure, the Quadratic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05135","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.05135","created_at":"2026-05-17T23:56:11.792273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05135v1","created_at":"2026-05-17T23:56:11.792273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05135","created_at":"2026-05-17T23:56:11.792273+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJNYZUC6OFYS","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJNYZUC6OFYS4KCO","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJNYZUC6","created_at":"2026-05-18T12:33:30.264802+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/VJNYZUC6OFYS4KCOYIC6OYI7E4","json":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4.json","graph_json":"https://pith.science/api/pith-number/VJNYZUC6OFYS4KCOYIC6OYI7E4/graph.json","events_json":"https://pith.science/api/pith-number/VJNYZUC6OFYS4KCOYIC6OYI7E4/events.json","paper":"https://pith.science/paper/VJNYZUC6"},"agent_actions":{"view_html":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4","download_json":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4.json","view_paper":"https://pith.science/paper/VJNYZUC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05135&json=true","fetch_graph":"https://pith.science/api/pith-number/VJNYZUC6OFYS4KCOYIC6OYI7E4/graph.json","fetch_events":"https://pith.science/api/pith-number/VJNYZUC6OFYS4KCOYIC6OYI7E4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/action/storage_attestation","attest_author":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/action/author_attestation","sign_citation":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/action/citation_signature","submit_replication":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/action/replication_record"}},"created_at":"2026-05-17T23:56:11.792273+00:00","updated_at":"2026-05-17T23:56:11.792273+00:00"}