{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FDTBQP57GTRXNHZDKEUTFITXE3","short_pith_number":"pith:FDTBQP57","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"},"canonical_sha256":"28e6183fbf34e3769f23512932a27726eed1b15eefd8ae7435da17305d87ece9","source":{"kind":"arxiv","id":"1510.04493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04493","created_at":"2026-05-18T01:30:06Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04493v1","created_at":"2026-05-18T01:30:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04493","created_at":"2026-05-18T01:30:06Z"},{"alias_kind":"pith_short_12","alias_value":"FDTBQP57GTRX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FDTBQP57GTRXNHZD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FDTBQP57","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FDTBQP57GTRXNHZDKEUTFITXE3","target":"record","payload":{"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"},"canonical_sha256":"28e6183fbf34e3769f23512932a27726eed1b15eefd8ae7435da17305d87ece9","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"},"source_kind":"arxiv","source_id":"1510.04493","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-18T01:30:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spt5oI6Po/ZbOeFYZrRgMiIMJINjqh1fMi8E4DJqJTGOudqVWYo/iVhYxRccqBBVGG9emHed6duhbm+e4vQxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:19:15.634977Z"},"content_sha256":"56b3896db90210aa40b104ad4ca4914cd89125d5be95177e11589cc688d924db","schema_version":"1.0","event_id":"sha256:56b3896db90210aa40b104ad4ca4914cd89125d5be95177e11589cc688d924db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FDTBQP57GTRXNHZDKEUTFITXE3","target":"graph","payload":{"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"},"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-18T01:30:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMaEKTinw3A0CSZwv+eP9t2ZoxuE2RgpopRhOd2f+nZ8eowqnRNf8dnVoN86zEMi7yGQvEWbBMKVHYmCIhQbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:19:15.635606Z"},"content_sha256":"8dd708856d6517c7b255bf17da5df15f798cdc33e75be990e71ae36fa8511c27","schema_version":"1.0","event_id":"sha256:8dd708856d6517c7b255bf17da5df15f798cdc33e75be990e71ae36fa8511c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/bundle.json","state_url":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDTBQP57GTRXNHZDKEUTFITXE3/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-06-02T04:19:15Z","links":{"resolver":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3","bundle":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/bundle.json","state":"https://pith.science/pith/FDTBQP57GTRXNHZDKEUTFITXE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDTBQP57GTRXNHZDKEUTFITXE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FDTBQP57GTRXNHZDKEUTFITXE3","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":"c76d3d60ac69ff5ac63e6a83b94bd7e0d3b7e967f07f81416661acf400d2489f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-15T12:18:58Z","title_canon_sha256":"7b8f8082f8752e80f650144f76ba330f54f92fa9db14b4b5934349420ad5c9ef"},"schema_version":"1.0","source":{"id":"1510.04493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04493","created_at":"2026-05-18T01:30:06Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04493v1","created_at":"2026-05-18T01:30:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04493","created_at":"2026-05-18T01:30:06Z"},{"alias_kind":"pith_short_12","alias_value":"FDTBQP57GTRX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FDTBQP57GTRXNHZD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FDTBQP57","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:8dd708856d6517c7b255bf17da5df15f798cdc33e75be990e71ae36fa8511c27","target":"graph","created_at":"2026-05-18T01:30:06Z","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":"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","authors_text":"Athanasios A. Rontogiannis, Konstantinos D. Koutroumbas, Spyridoula D. Xenaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-15T12:18:58Z","title":"Sparsity-aware Possibilistic Clustering Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04493","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:56b3896db90210aa40b104ad4ca4914cd89125d5be95177e11589cc688d924db","target":"record","created_at":"2026-05-18T01:30:06Z","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":"c76d3d60ac69ff5ac63e6a83b94bd7e0d3b7e967f07f81416661acf400d2489f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-15T12:18:58Z","title_canon_sha256":"7b8f8082f8752e80f650144f76ba330f54f92fa9db14b4b5934349420ad5c9ef"},"schema_version":"1.0","source":{"id":"1510.04493","kind":"arxiv","version":1}},"canonical_sha256":"28e6183fbf34e3769f23512932a27726eed1b15eefd8ae7435da17305d87ece9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28e6183fbf34e3769f23512932a27726eed1b15eefd8ae7435da17305d87ece9","first_computed_at":"2026-05-18T01:30:06.994629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:06.994629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DVIyInd1/HpB8UiTGDHeGsJGsqX2XF55eYJQ9zgjqELgI122w0qqKH9E2qkAYqAkKB0RQQcO2Sa7HMcf1uAQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:06.995208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56b3896db90210aa40b104ad4ca4914cd89125d5be95177e11589cc688d924db","sha256:8dd708856d6517c7b255bf17da5df15f798cdc33e75be990e71ae36fa8511c27"],"state_sha256":"d32394ac843a2d99625defcabb0cb289252d3d0c4d7a697452b18928e2764dfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWRcAdTfMudsOQb20Zfv1EaI9o1NvxY8iTyCB6qSGyrybB9oSm9e3q0zBLnkPryDCQSlQPM926pqbLO4d/KzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:19:15.638718Z","bundle_sha256":"78cb409387dc0771a8b983a8ad3d06da5921548ec47ac649777534198b77871c"}}