{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KJP2ZNGMFPHJSTSNPRYESRCQJA","short_pith_number":"pith:KJP2ZNGM","schema_version":"1.0","canonical_sha256":"525facb4cc2bce994e4d7c704944504825e1a37a061d0589bf649f2b5915317f","source":{"kind":"arxiv","id":"2402.00608","version":1},"attestation_state":"computed","paper":{"title":"Deep Clustering Using the Soft Silhouette Score: Towards Compact and Well-Separated Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Aristidis Likas, Georgios Vardakas, Ioannis Papakostas","submitted_at":"2024-02-01T14:02:06Z","abstract_excerpt":"Unsupervised learning has gained prominence in the big data era, offering a means to extract valuable insights from unlabeled datasets. Deep clustering has emerged as an important unsupervised category, aiming to exploit the non-linear mapping capabilities of neural networks in order to enhance clustering performance. The majority of deep clustering literature focuses on minimizing the inner-cluster variability in some embedded space while keeping the learned representation consistent with the original high-dimensional dataset. In this work, we propose soft silhoutte, a probabilistic formulati"},"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":"2402.00608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-01T14:02:06Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"f76e3ff4131b436bbe72e4c7dad77a422fe00d14cf5bdcf9a0c681b48921f422","abstract_canon_sha256":"6553cd4bb8d8cfc406d285cdee6a925c3b184d456cd54f1718f9b4a7a84a54b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:14.648607Z","signature_b64":"GKk2pdKEn9DUF0/ULq3uqeA8QVY5i6BtNCPTDYP+3xNFrzRlFeqbtzB7bgyBe8aEgur2k0+K8pFGRGOMIw9zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"525facb4cc2bce994e4d7c704944504825e1a37a061d0589bf649f2b5915317f","last_reissued_at":"2026-07-05T07:40:14.648150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:14.648150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Clustering Using the Soft Silhouette Score: Towards Compact and Well-Separated Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Aristidis Likas, Georgios Vardakas, Ioannis Papakostas","submitted_at":"2024-02-01T14:02:06Z","abstract_excerpt":"Unsupervised learning has gained prominence in the big data era, offering a means to extract valuable insights from unlabeled datasets. Deep clustering has emerged as an important unsupervised category, aiming to exploit the non-linear mapping capabilities of neural networks in order to enhance clustering performance. The majority of deep clustering literature focuses on minimizing the inner-cluster variability in some embedded space while keeping the learned representation consistent with the original high-dimensional dataset. In this work, we propose soft silhoutte, a probabilistic formulati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00608","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/2402.00608/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.00608","created_at":"2026-07-05T07:40:14.648207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.00608v1","created_at":"2026-07-05T07:40:14.648207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00608","created_at":"2026-07-05T07:40:14.648207+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJP2ZNGMFPHJ","created_at":"2026-07-05T07:40:14.648207+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJP2ZNGMFPHJSTSN","created_at":"2026-07-05T07:40:14.648207+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJP2ZNGM","created_at":"2026-07-05T07:40:14.648207+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23655","citing_title":"CVSearch: Empowering Multimodal LLMs with Cognitive Visual Search for High-Resolution Image Perception","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA","json":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA.json","graph_json":"https://pith.science/api/pith-number/KJP2ZNGMFPHJSTSNPRYESRCQJA/graph.json","events_json":"https://pith.science/api/pith-number/KJP2ZNGMFPHJSTSNPRYESRCQJA/events.json","paper":"https://pith.science/paper/KJP2ZNGM"},"agent_actions":{"view_html":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA","download_json":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA.json","view_paper":"https://pith.science/paper/KJP2ZNGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.00608&json=true","fetch_graph":"https://pith.science/api/pith-number/KJP2ZNGMFPHJSTSNPRYESRCQJA/graph.json","fetch_events":"https://pith.science/api/pith-number/KJP2ZNGMFPHJSTSNPRYESRCQJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA/action/storage_attestation","attest_author":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA/action/author_attestation","sign_citation":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA/action/citation_signature","submit_replication":"https://pith.science/pith/KJP2ZNGMFPHJSTSNPRYESRCQJA/action/replication_record"}},"created_at":"2026-07-05T07:40:14.648207+00:00","updated_at":"2026-07-05T07:40:14.648207+00:00"}