{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IX5N6S4EXKTOWIWKULYEWKSKPR","short_pith_number":"pith:IX5N6S4E","schema_version":"1.0","canonical_sha256":"45fadf4b84baa6eb22caa2f04b2a4a7c790cf73b1b87f8d7e9940da882fc853f","source":{"kind":"arxiv","id":"1905.03694","version":2},"attestation_state":"computed","paper":{"title":"Supervised Online Hashing via Hadamard Codebook Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Hong Liu, Mingbao Lin, Rongrong Ji, Yongjian Liu","submitted_at":"2019-04-28T02:33:53Z","abstract_excerpt":"In recent years, binary code learning, a.k.a hashing, has received extensive attention in large-scale multimedia retrieval. It aims to encode high-dimensional data points to binary codes, hence the original high-dimensional metric space can be efficiently approximated via Hamming space. However, most existing hashing methods adopted offline batch learning, which is not suitable to handle incremental datasets with streaming data or new instances. In contrast, the robustness of the existing online hashing remains as an open problem, while the embedding of supervised/semantic information hardly b"},"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":"1905.03694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-28T02:33:53Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"17ffc43b1a499fa9729aff97e029693e7792049ae8bf3a30a89352068f2c5f90","abstract_canon_sha256":"6ad642b4fdc700e99548c23b275053e4d3135e8418d3aca1471190fd61af5593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.888939Z","signature_b64":"F6rxZ+2eHlc8zH6gmSiqHdl0rkctY7tWo5l0tas/6HYz/AXTBLed8gDnRByfnfqIqKgGyJfwoYBMWk6tSIbWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45fadf4b84baa6eb22caa2f04b2a4a7c790cf73b1b87f8d7e9940da882fc853f","last_reissued_at":"2026-05-17T23:45:08.888258Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.888258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised Online Hashing via Hadamard Codebook Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Hong Liu, Mingbao Lin, Rongrong Ji, Yongjian Liu","submitted_at":"2019-04-28T02:33:53Z","abstract_excerpt":"In recent years, binary code learning, a.k.a hashing, has received extensive attention in large-scale multimedia retrieval. It aims to encode high-dimensional data points to binary codes, hence the original high-dimensional metric space can be efficiently approximated via Hamming space. However, most existing hashing methods adopted offline batch learning, which is not suitable to handle incremental datasets with streaming data or new instances. In contrast, the robustness of the existing online hashing remains as an open problem, while the embedding of supervised/semantic information hardly b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03694","kind":"arxiv","version":2},"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":"1905.03694","created_at":"2026-05-17T23:45:08.888369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03694v2","created_at":"2026-05-17T23:45:08.888369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03694","created_at":"2026-05-17T23:45:08.888369+00:00"},{"alias_kind":"pith_short_12","alias_value":"IX5N6S4EXKTO","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IX5N6S4EXKTOWIWK","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IX5N6S4E","created_at":"2026-05-18T12:33:18.533446+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/IX5N6S4EXKTOWIWKULYEWKSKPR","json":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR.json","graph_json":"https://pith.science/api/pith-number/IX5N6S4EXKTOWIWKULYEWKSKPR/graph.json","events_json":"https://pith.science/api/pith-number/IX5N6S4EXKTOWIWKULYEWKSKPR/events.json","paper":"https://pith.science/paper/IX5N6S4E"},"agent_actions":{"view_html":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR","download_json":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR.json","view_paper":"https://pith.science/paper/IX5N6S4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03694&json=true","fetch_graph":"https://pith.science/api/pith-number/IX5N6S4EXKTOWIWKULYEWKSKPR/graph.json","fetch_events":"https://pith.science/api/pith-number/IX5N6S4EXKTOWIWKULYEWKSKPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR/action/storage_attestation","attest_author":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR/action/author_attestation","sign_citation":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR/action/citation_signature","submit_replication":"https://pith.science/pith/IX5N6S4EXKTOWIWKULYEWKSKPR/action/replication_record"}},"created_at":"2026-05-17T23:45:08.888369+00:00","updated_at":"2026-05-17T23:45:08.888369+00:00"}