{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VJNYZUC6OFYS4KCOYIC6OYI7E4","short_pith_number":"pith:VJNYZUC6","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"},"canonical_sha256":"aa5b8cd05e71712e284ec205e7611f27020b92bf0dc3fb758a5a6433fa506345","source":{"kind":"arxiv","id":"1901.05135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05135","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05135v1","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05135","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"VJNYZUC6OFYS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VJNYZUC6OFYS4KCO","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VJNYZUC6","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VJNYZUC6OFYS4KCOYIC6OYI7E4","target":"record","payload":{"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"},"canonical_sha256":"aa5b8cd05e71712e284ec205e7611f27020b92bf0dc3fb758a5a6433fa506345","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"},"source_kind":"arxiv","source_id":"1901.05135","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWpAW9XbOYFApmURhbVORtgB5XMYMowfoIW0pS88/uDnXSvYtj+F0qX1O7Nk26O7soxCjz83JG9Out6oTRGdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:59:52.749617Z"},"content_sha256":"c04b1ff161c226bb5ff649cebbda779bc1492e9a36d184e48a244c824025f6c7","schema_version":"1.0","event_id":"sha256:c04b1ff161c226bb5ff649cebbda779bc1492e9a36d184e48a244c824025f6c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VJNYZUC6OFYS4KCOYIC6OYI7E4","target":"graph","payload":{"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"},"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PF0cRv4+v8+hVzJ7PKrwshBL303YMxiTldm2QVBBKB3msn6t2ljRse8Gu1HmezrXRDS42StYF4HPBhVsuZx8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:59:52.749970Z"},"content_sha256":"3369b2f41cefc931049776249011339b08ff31bb4507a565571a03fc0c7d04e7","schema_version":"1.0","event_id":"sha256:3369b2f41cefc931049776249011339b08ff31bb4507a565571a03fc0c7d04e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/bundle.json","state_url":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/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-24T12:59:52Z","links":{"resolver":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4","bundle":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/bundle.json","state":"https://pith.science/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJNYZUC6OFYS4KCOYIC6OYI7E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VJNYZUC6OFYS4KCOYIC6OYI7E4","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":"1c0ba2234c9b09b773d3797eae93a1f6472c775240a33849e34342822875de85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T05:03:54Z","title_canon_sha256":"1a26096bc62df47b87a3457b72aee21c02b5201a049e320e85bc6b4569863ac9"},"schema_version":"1.0","source":{"id":"1901.05135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05135","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05135v1","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05135","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"VJNYZUC6OFYS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VJNYZUC6OFYS4KCO","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VJNYZUC6","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:3369b2f41cefc931049776249011339b08ff31bb4507a565571a03fc0c7d04e7","target":"graph","created_at":"2026-05-17T23:56:11Z","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":"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 ","authors_text":"Anastasios Tefas, Nikolaos Passalis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T05:03:54Z","title":"Deep Supervised Hashing leveraging Quadratic Spherical Mutual Information for Content-based Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05135","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:c04b1ff161c226bb5ff649cebbda779bc1492e9a36d184e48a244c824025f6c7","target":"record","created_at":"2026-05-17T23:56:11Z","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":"1c0ba2234c9b09b773d3797eae93a1f6472c775240a33849e34342822875de85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-16T05:03:54Z","title_canon_sha256":"1a26096bc62df47b87a3457b72aee21c02b5201a049e320e85bc6b4569863ac9"},"schema_version":"1.0","source":{"id":"1901.05135","kind":"arxiv","version":1}},"canonical_sha256":"aa5b8cd05e71712e284ec205e7611f27020b92bf0dc3fb758a5a6433fa506345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa5b8cd05e71712e284ec205e7611f27020b92bf0dc3fb758a5a6433fa506345","first_computed_at":"2026-05-17T23:56:11.792182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:11.792182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WJq2lJ6kM25XY1J9b/SBwh4rM/7RErC1nt1IaRmvoZlHkW3IS17PBTXLMq9GzOqynzvkG+RccKG9ei7zSofWBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:11.792749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c04b1ff161c226bb5ff649cebbda779bc1492e9a36d184e48a244c824025f6c7","sha256:3369b2f41cefc931049776249011339b08ff31bb4507a565571a03fc0c7d04e7"],"state_sha256":"ac471211f914dfa5da65839ce441e36362c9e74960bd93b3fa05d25b14f64d8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ln7pinq8RZznySNpyOo7aoPfzLf8VrnHcnkc7CNZmNVqtIEzbvXIjNKoivNSJVrIOgF8grJGILoyyRHiCu/AAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:59:52.751981Z","bundle_sha256":"7287dcd1d39b740b312360f4a936b68c1f5fcb3e012cdb91febc951fddbb957d"}}