{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FDTBQP57GTRXNHZDKEUTFITXE3","short_pith_number":"pith:FDTBQP57","schema_version":"1.0","canonical_sha256":"28e6183fbf34e3769f23512932a27726eed1b15eefd8ae7435da17305d87ece9","source":{"kind":"arxiv","id":"1510.04493","version":1},"attestation_state":"computed","paper":{"title":"Sparsity-aware Possibilistic Clustering Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas, Spyridoula D. Xenaki","submitted_at":"2015-10-15T12:18:58Z","abstract_excerpt":"In this paper two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits sparsity and can deal well with closely located clusters that may also be of significantly different densities. The second one, called sparse adaptive possibilistic c-means, is an extension of the first, where now the involved parameters are dynamically adapted. The latter can deal well with even more challenging cases, where, in addition to the above, clusters may be of significantly different variances. More specificall"},"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":"1510.04493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-15T12:18:58Z","cross_cats_sorted":[],"title_canon_sha256":"7b8f8082f8752e80f650144f76ba330f54f92fa9db14b4b5934349420ad5c9ef","abstract_canon_sha256":"c76d3d60ac69ff5ac63e6a83b94bd7e0d3b7e967f07f81416661acf400d2489f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:06.995208Z","signature_b64":"DVIyInd1/HpB8UiTGDHeGsJGsqX2XF55eYJQ9zgjqELgI122w0qqKH9E2qkAYqAkKB0RQQcO2Sa7HMcf1uAQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e6183fbf34e3769f23512932a27726eed1b15eefd8ae7435da17305d87ece9","last_reissued_at":"2026-05-18T01:30:06.994629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:06.994629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity-aware Possibilistic Clustering Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas, Spyridoula D. Xenaki","submitted_at":"2015-10-15T12:18:58Z","abstract_excerpt":"In this paper two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits sparsity and can deal well with closely located clusters that may also be of significantly different densities. The second one, called sparse adaptive possibilistic c-means, is an extension of the first, where now the involved parameters are dynamically adapted. The latter can deal well with even more challenging cases, where, in addition to the above, clusters may be of significantly different variances. More specificall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04493","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":"1510.04493","created_at":"2026-05-18T01:30:06.994702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04493v1","created_at":"2026-05-18T01:30:06.994702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04493","created_at":"2026-05-18T01:30:06.994702+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDTBQP57GTRX","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDTBQP57GTRXNHZD","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDTBQP57","created_at":"2026-05-18T12:29:19.899920+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/FDTBQP57GTRXNHZDKEUTFITXE3","json":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3.json","graph_json":"https://pith.science/api/pith-number/FDTBQP57GTRXNHZDKEUTFITXE3/graph.json","events_json":"https://pith.science/api/pith-number/FDTBQP57GTRXNHZDKEUTFITXE3/events.json","paper":"https://pith.science/paper/FDTBQP57"},"agent_actions":{"view_html":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3","download_json":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3.json","view_paper":"https://pith.science/paper/FDTBQP57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04493&json=true","fetch_graph":"https://pith.science/api/pith-number/FDTBQP57GTRXNHZDKEUTFITXE3/graph.json","fetch_events":"https://pith.science/api/pith-number/FDTBQP57GTRXNHZDKEUTFITXE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/action/storage_attestation","attest_author":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/action/author_attestation","sign_citation":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/action/citation_signature","submit_replication":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/action/replication_record"}},"created_at":"2026-05-18T01:30:06.994702+00:00","updated_at":"2026-05-18T01:30:06.994702+00:00"}