{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:U5OHEOAFS3RMLJQ2CQQXRE64JU","short_pith_number":"pith:U5OHEOAF","canonical_record":{"source":{"id":"2411.03978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-06T15:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"575fb35c70c96422ffca82ce427586a028dc377b45e600af8e4c18e5e2c0515c","abstract_canon_sha256":"d6685090907435457f0596a98f06b4e77ca23810d93df6760b0216e24992f6e8"},"schema_version":"1.0"},"canonical_sha256":"a75c72380596e2c5a61a14217893dc4d07f3c6b337cfa766de97b60f92788db8","source":{"kind":"arxiv","id":"2411.03978","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03978","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03978v1","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03978","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"U5OHEOAFS3RM","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"pith_short_16","alias_value":"U5OHEOAFS3RMLJQ2","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"pith_short_8","alias_value":"U5OHEOAF","created_at":"2026-07-05T09:31:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:U5OHEOAFS3RMLJQ2CQQXRE64JU","target":"record","payload":{"canonical_record":{"source":{"id":"2411.03978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-06T15:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"575fb35c70c96422ffca82ce427586a028dc377b45e600af8e4c18e5e2c0515c","abstract_canon_sha256":"d6685090907435457f0596a98f06b4e77ca23810d93df6760b0216e24992f6e8"},"schema_version":"1.0"},"canonical_sha256":"a75c72380596e2c5a61a14217893dc4d07f3c6b337cfa766de97b60f92788db8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:58.969085Z","signature_b64":"8sHsIfDPogE/+s5pRkqMIRKptWBKzhjho+gl1504RhdoN3xSHEnffmaztylN2DOVeyEhsbuSkhbOS0vc1FEADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a75c72380596e2c5a61a14217893dc4d07f3c6b337cfa766de97b60f92788db8","last_reissued_at":"2026-07-05T09:31:58.968679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:58.968679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.03978","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-07-05T09:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIoFn0ksM7e7PeYL+j8RWB+Rk72YxB0v/I8WhmVnBJCf+evc+hhI1gjzQIVoNQios7jZS8d/yHGzHVSplW2KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:24:18.605926Z"},"content_sha256":"b3d7876a540bfdd7bc7a382859f24486801b709f01a20c4230e2a548f551bf53","schema_version":"1.0","event_id":"sha256:b3d7876a540bfdd7bc7a382859f24486801b709f01a20c4230e2a548f551bf53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:U5OHEOAFS3RMLJQ2CQQXRE64JU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Customized Multiple Clustering via Multi-Modal Subspace Proxy Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiawei Yao, Juhua Hu, Qi Qian","submitted_at":"2024-11-06T15:14:27Z","abstract_excerpt":"Multiple clustering aims to discover various latent structures of data from different aspects. Deep multiple clustering methods have achieved remarkable performance by exploiting complex patterns and relationships in data. However, existing works struggle to flexibly adapt to diverse user-specific needs in data grouping, which may require manual understanding of each clustering. To address these limitations, we introduce Multi-Sub, a novel end-to-end multiple clustering approach that incorporates a multi-modal subspace proxy learning framework in this work. Utilizing the synergistic capabiliti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03978","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.03978/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Y36lOQICw0gSyGC1IFazVNJaQAl6eNhdI+i5w+A1gQp0UwhY9l3OlQgES2KlV9kyBFZrNbk22LDMw7pErf8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:24:18.606289Z"},"content_sha256":"ce899834b43101df85dd88503797ed0b34e687995218923a383b3545fd3b59ab","schema_version":"1.0","event_id":"sha256:ce899834b43101df85dd88503797ed0b34e687995218923a383b3545fd3b59ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5OHEOAFS3RMLJQ2CQQXRE64JU/bundle.json","state_url":"https://pith.science/pith/U5OHEOAFS3RMLJQ2CQQXRE64JU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5OHEOAFS3RMLJQ2CQQXRE64JU/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-08-21T04:24:18Z","links":{"resolver":"https://pith.science/pith/U5OHEOAFS3RMLJQ2CQQXRE64JU","bundle":"https://pith.science/pith/U5OHEOAFS3RMLJQ2CQQXRE64JU/bundle.json","state":"https://pith.science/pith/U5OHEOAFS3RMLJQ2CQQXRE64JU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5OHEOAFS3RMLJQ2CQQXRE64JU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:U5OHEOAFS3RMLJQ2CQQXRE64JU","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":"d6685090907435457f0596a98f06b4e77ca23810d93df6760b0216e24992f6e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-06T15:14:27Z","title_canon_sha256":"575fb35c70c96422ffca82ce427586a028dc377b45e600af8e4c18e5e2c0515c"},"schema_version":"1.0","source":{"id":"2411.03978","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03978","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03978v1","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03978","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"U5OHEOAFS3RM","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"pith_short_16","alias_value":"U5OHEOAFS3RMLJQ2","created_at":"2026-07-05T09:31:58Z"},{"alias_kind":"pith_short_8","alias_value":"U5OHEOAF","created_at":"2026-07-05T09:31:58Z"}],"graph_snapshots":[{"event_id":"sha256:ce899834b43101df85dd88503797ed0b34e687995218923a383b3545fd3b59ab","target":"graph","created_at":"2026-07-05T09:31:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.03978/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multiple clustering aims to discover various latent structures of data from different aspects. Deep multiple clustering methods have achieved remarkable performance by exploiting complex patterns and relationships in data. However, existing works struggle to flexibly adapt to diverse user-specific needs in data grouping, which may require manual understanding of each clustering. To address these limitations, we introduce Multi-Sub, a novel end-to-end multiple clustering approach that incorporates a multi-modal subspace proxy learning framework in this work. Utilizing the synergistic capabiliti","authors_text":"Jiawei Yao, Juhua Hu, Qi Qian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-06T15:14:27Z","title":"Customized Multiple Clustering via Multi-Modal Subspace Proxy Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03978","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:b3d7876a540bfdd7bc7a382859f24486801b709f01a20c4230e2a548f551bf53","target":"record","created_at":"2026-07-05T09:31:58Z","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":"d6685090907435457f0596a98f06b4e77ca23810d93df6760b0216e24992f6e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-06T15:14:27Z","title_canon_sha256":"575fb35c70c96422ffca82ce427586a028dc377b45e600af8e4c18e5e2c0515c"},"schema_version":"1.0","source":{"id":"2411.03978","kind":"arxiv","version":1}},"canonical_sha256":"a75c72380596e2c5a61a14217893dc4d07f3c6b337cfa766de97b60f92788db8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a75c72380596e2c5a61a14217893dc4d07f3c6b337cfa766de97b60f92788db8","first_computed_at":"2026-07-05T09:31:58.968679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:31:58.968679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8sHsIfDPogE/+s5pRkqMIRKptWBKzhjho+gl1504RhdoN3xSHEnffmaztylN2DOVeyEhsbuSkhbOS0vc1FEADQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:31:58.969085Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.03978","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3d7876a540bfdd7bc7a382859f24486801b709f01a20c4230e2a548f551bf53","sha256:ce899834b43101df85dd88503797ed0b34e687995218923a383b3545fd3b59ab"],"state_sha256":"036ca7df88ce8dd205ba3ed9ce23f4352664ea973e530305d8d54f74323fa345"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WA8GJC8HeUAmAiz+iDBUU3/e69HCBSw741wxoICCPoWmM2LLrAM0TP+n4f74HdLGocOcpclMXVW3hSclxa05CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T04:24:18.609504Z","bundle_sha256":"cd6f7ef8b0ff10d65cb5bab4491498709baa3682073c8bcdd9089bb1b0b14d2b"}}