{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KLZPJ37P62GE2CHRUH2TAPYFAC","short_pith_number":"pith:KLZPJ37P","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"},"canonical_sha256":"52f2f4efeff68c4d08f1a1f5303f0500b4426bb3035845a5218a9107b347c465","source":{"kind":"arxiv","id":"1809.05992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05992","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05992v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05992","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"KLZPJ37P62GE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KLZPJ37P62GE2CHR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KLZPJ37P","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KLZPJ37P62GE2CHRUH2TAPYFAC","target":"record","payload":{"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"},"canonical_sha256":"52f2f4efeff68c4d08f1a1f5303f0500b4426bb3035845a5218a9107b347c465","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"},"source_kind":"arxiv","source_id":"1809.05992","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-18T00:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBjkUjMFc2bR2mUU9Ucdue0xQtGF/SIcVS3bLn3QGDu8cEoSXzYapQ0OECub1VUiiLaLGTETknCzj/8lAkYkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:42:33.691131Z"},"content_sha256":"a516e2aa0492108b0dd4e45c3b3dc5f94be0a56d7924b107d6ce3f688b7ae3eb","schema_version":"1.0","event_id":"sha256:a516e2aa0492108b0dd4e45c3b3dc5f94be0a56d7924b107d6ce3f688b7ae3eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KLZPJ37P62GE2CHRUH2TAPYFAC","target":"graph","payload":{"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"},"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-18T00:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lf6CEjC/xc5qMv5ZF6P+dYrkCQ5Q38eTwGx6qnAzhJfzszcvFeBw68avX5zsUA5cNX4x7U2SCC96Vp+/TYO4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:42:33.691504Z"},"content_sha256":"67622f2266d8181c189d5733f177b7ff6e1f45b4b59df27f0e8b901650191b13","schema_version":"1.0","event_id":"sha256:67622f2266d8181c189d5733f177b7ff6e1f45b4b59df27f0e8b901650191b13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/bundle.json","state_url":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/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-05-30T09:42:33Z","links":{"resolver":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC","bundle":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/bundle.json","state":"https://pith.science/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLZPJ37P62GE2CHRUH2TAPYFAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KLZPJ37P62GE2CHRUH2TAPYFAC","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":"94ea84a54090e4acef405341ca6c7e02c74bd9eb29702950d94fb8ba07bff2e1","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-09-17T01:35:42Z","title_canon_sha256":"f10b2d0a74a4c2867eeda81de09bc607b72986f717ce50aa3a2cc4126b208bc9"},"schema_version":"1.0","source":{"id":"1809.05992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05992","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05992v1","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05992","created_at":"2026-05-18T00:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"KLZPJ37P62GE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KLZPJ37P62GE2CHR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KLZPJ37P","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:67622f2266d8181c189d5733f177b7ff6e1f45b4b59df27f0e8b901650191b13","target":"graph","created_at":"2026-05-18T00:05:35Z","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":"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","authors_text":"Fan Zhu, Fumin Shen, Heng Tao Shen, Jie Qin, Li Liu, Ling Shao, Yong Xu, Zheng Zhang","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-09-17T01:35:42Z","title":"Highly-Economized Multi-View Binary Compression for Scalable Image Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05992","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:a516e2aa0492108b0dd4e45c3b3dc5f94be0a56d7924b107d6ce3f688b7ae3eb","target":"record","created_at":"2026-05-18T00:05:35Z","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":"94ea84a54090e4acef405341ca6c7e02c74bd9eb29702950d94fb8ba07bff2e1","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-09-17T01:35:42Z","title_canon_sha256":"f10b2d0a74a4c2867eeda81de09bc607b72986f717ce50aa3a2cc4126b208bc9"},"schema_version":"1.0","source":{"id":"1809.05992","kind":"arxiv","version":1}},"canonical_sha256":"52f2f4efeff68c4d08f1a1f5303f0500b4426bb3035845a5218a9107b347c465","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f2f4efeff68c4d08f1a1f5303f0500b4426bb3035845a5218a9107b347c465","first_computed_at":"2026-05-18T00:05:35.929895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:35.929895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PxnQwM0E7AQdQUFo3zK9HIHu6L79pfRTiIhfzmDS/oGyRXPNIDPJLdu8fDCvAVD1LgqZ+5L+jhf4k6LgqEMUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:35.930388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a516e2aa0492108b0dd4e45c3b3dc5f94be0a56d7924b107d6ce3f688b7ae3eb","sha256:67622f2266d8181c189d5733f177b7ff6e1f45b4b59df27f0e8b901650191b13"],"state_sha256":"b68eef85df1d87aea6046d23d4c97b86dfb01095a2d04613f5ddb9e602e4c596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H65fMV8WzttTLJOVQu+E2DrHfB99ESVfqjHuUpXdo7//A94JVrgPCV0T8XU0Zoek/DLePICGWtlrw3FgZ2LaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:42:33.693757Z","bundle_sha256":"27302819db1db986a89cabe62b9d04ae6d3cb96aee4250b4d6c824f7422f2c10"}}