{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KLZPJ37P62GE2CHRUH2TAPYFAC","short_pith_number":"pith:KLZPJ37P","schema_version":"1.0","canonical_sha256":"52f2f4efeff68c4d08f1a1f5303f0500b4426bb3035845a5218a9107b347c465","source":{"kind":"arxiv","id":"1809.05992","version":1},"attestation_state":"computed","paper":{"title":"Highly-Economized Multi-View Binary Compression for Scalable Image Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CV","authors_text":"Fan Zhu, Fumin Shen, Heng Tao Shen, Jie Qin, Li Liu, Ling Shao, Yong Xu, Zheng Zhang","submitted_at":"2018-09-17T01:35:42Z","abstract_excerpt":"How to economically cluster large-scale multi-view images is a long-standing problem in computer vision. To tackle this challenge, we introduce a novel approach named Highly-economized Scalable Image Clustering (HSIC) that radically surpasses conventional image clustering methods via binary compression. We intuitively unify the binary representation learning and efficient binary cluster structure learning into a joint framework. In particular, common binary representations are learned by exploiting both sharable and individual information across multiple views to capture their underlying corre"},"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":"1809.05992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-09-17T01:35:42Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"f10b2d0a74a4c2867eeda81de09bc607b72986f717ce50aa3a2cc4126b208bc9","abstract_canon_sha256":"94ea84a54090e4acef405341ca6c7e02c74bd9eb29702950d94fb8ba07bff2e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.930388Z","signature_b64":"PxnQwM0E7AQdQUFo3zK9HIHu6L79pfRTiIhfzmDS/oGyRXPNIDPJLdu8fDCvAVD1LgqZ+5L+jhf4k6LgqEMUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f2f4efeff68c4d08f1a1f5303f0500b4426bb3035845a5218a9107b347c465","last_reissued_at":"2026-05-18T00:05:35.929895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.929895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Highly-Economized Multi-View Binary Compression for Scalable Image Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.CV","authors_text":"Fan Zhu, Fumin Shen, Heng Tao Shen, Jie Qin, Li Liu, Ling Shao, Yong Xu, Zheng Zhang","submitted_at":"2018-09-17T01:35:42Z","abstract_excerpt":"How to economically cluster large-scale multi-view images is a long-standing problem in computer vision. To tackle this challenge, we introduce a novel approach named Highly-economized Scalable Image Clustering (HSIC) that radically surpasses conventional image clustering methods via binary compression. We intuitively unify the binary representation learning and efficient binary cluster structure learning into a joint framework. In particular, common binary representations are learned by exploiting both sharable and individual information across multiple views to capture their underlying corre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05992","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":"1809.05992","created_at":"2026-05-18T00:05:35.929975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05992v1","created_at":"2026-05-18T00:05:35.929975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05992","created_at":"2026-05-18T00:05:35.929975+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLZPJ37P62GE","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLZPJ37P62GE2CHR","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLZPJ37P","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/KLZPJ37P62GE2CHRUH2TAPYFAC","json":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC.json","graph_json":"https://pith.science/api/pith-number/KLZPJ37P62GE2CHRUH2TAPYFAC/graph.json","events_json":"https://pith.science/api/pith-number/KLZPJ37P62GE2CHRUH2TAPYFAC/events.json","paper":"https://pith.science/paper/KLZPJ37P"},"agent_actions":{"view_html":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC","download_json":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC.json","view_paper":"https://pith.science/paper/KLZPJ37P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05992&json=true","fetch_graph":"https://pith.science/api/pith-number/KLZPJ37P62GE2CHRUH2TAPYFAC/graph.json","fetch_events":"https://pith.science/api/pith-number/KLZPJ37P62GE2CHRUH2TAPYFAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/action/storage_attestation","attest_author":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/action/author_attestation","sign_citation":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/action/citation_signature","submit_replication":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/action/replication_record"}},"created_at":"2026-05-18T00:05:35.929975+00:00","updated_at":"2026-05-18T00:05:35.929975+00:00"}