{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KWS76XGR2VIXDHFXPDJXYVM5MY","short_pith_number":"pith:KWS76XGR","schema_version":"1.0","canonical_sha256":"55a5ff5cd1d551719cb778d37c559d660dd2cbfa31226e74d8bb78d07351eed6","source":{"kind":"arxiv","id":"1810.03402","version":1},"attestation_state":"computed","paper":{"title":"Deep LDA Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Di Hu, Feiping Nie, Xuelong Li","submitted_at":"2018-10-08T12:27:35Z","abstract_excerpt":"The conventional supervised hashing methods based on classification do not entirely meet the requirements of hashing technique, but Linear Discriminant Analysis (LDA) does. In this paper, we propose to perform a revised LDA objective over deep networks to learn efficient hashing codes in a truly end-to-end fashion. However, the complicated eigenvalue decomposition within each mini-batch in every epoch has to be faced with when simply optimizing the deep network w.r.t. the LDA objective. In this work, the revised LDA objective is transformed into a simple least square problem, which naturally o"},"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":"1810.03402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-08T12:27:35Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"83b19985ca63736283502dd51fd5d77759fa1dcd54d4c921c4b55d0f1ed300c9","abstract_canon_sha256":"17ee44921f9a5790b67ea81bc1a407f4b239c056debfac844967e867f0adb79b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:51.411917Z","signature_b64":"D46NlCQlVDpTUKU6G4Z99L19Ajs5xU0meTGHClRaEKdcTYju1Yw2hFyoVGkcitUVzHHCN1rBC7WBk6q0A8vfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a5ff5cd1d551719cb778d37c559d660dd2cbfa31226e74d8bb78d07351eed6","last_reissued_at":"2026-05-18T00:03:51.409696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:51.409696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep LDA Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Di Hu, Feiping Nie, Xuelong Li","submitted_at":"2018-10-08T12:27:35Z","abstract_excerpt":"The conventional supervised hashing methods based on classification do not entirely meet the requirements of hashing technique, but Linear Discriminant Analysis (LDA) does. In this paper, we propose to perform a revised LDA objective over deep networks to learn efficient hashing codes in a truly end-to-end fashion. However, the complicated eigenvalue decomposition within each mini-batch in every epoch has to be faced with when simply optimizing the deep network w.r.t. the LDA objective. In this work, the revised LDA objective is transformed into a simple least square problem, which naturally o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03402","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":"1810.03402","created_at":"2026-05-18T00:03:51.409782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03402v1","created_at":"2026-05-18T00:03:51.409782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03402","created_at":"2026-05-18T00:03:51.409782+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWS76XGR2VIX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWS76XGR2VIXDHFX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWS76XGR","created_at":"2026-05-18T12:32:33.847187+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/KWS76XGR2VIXDHFXPDJXYVM5MY","json":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY.json","graph_json":"https://pith.science/api/pith-number/KWS76XGR2VIXDHFXPDJXYVM5MY/graph.json","events_json":"https://pith.science/api/pith-number/KWS76XGR2VIXDHFXPDJXYVM5MY/events.json","paper":"https://pith.science/paper/KWS76XGR"},"agent_actions":{"view_html":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY","download_json":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY.json","view_paper":"https://pith.science/paper/KWS76XGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03402&json=true","fetch_graph":"https://pith.science/api/pith-number/KWS76XGR2VIXDHFXPDJXYVM5MY/graph.json","fetch_events":"https://pith.science/api/pith-number/KWS76XGR2VIXDHFXPDJXYVM5MY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY/action/storage_attestation","attest_author":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY/action/author_attestation","sign_citation":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY/action/citation_signature","submit_replication":"https://pith.science/pith/KWS76XGR2VIXDHFXPDJXYVM5MY/action/replication_record"}},"created_at":"2026-05-18T00:03:51.409782+00:00","updated_at":"2026-05-18T00:03:51.409782+00:00"}