{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IHUE3BX226XOYIGEXEYCC3XB2B","short_pith_number":"pith:IHUE3BX2","schema_version":"1.0","canonical_sha256":"41e84d86fad7aeec20c4b930216ee1d07f51bc8785d46bcb4132a825af1542c3","source":{"kind":"arxiv","id":"1412.3613","version":3},"attestation_state":"computed","paper":{"title":"A Novel Adaptive Possibilistic Clustering Algorithm","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":"2014-12-11T11:44:43Z","abstract_excerpt":"In this paper a novel possibilistic c-means clustering algorithm, called Adaptive Possibilistic c-means, is presented. Its main feature is that {\\it all} its parameters, after their initialization, are properly adapted during its execution. Provided that the algorithm starts with a reasonable overestimate of the number of physical clusters formed by the data, it is capable, in principle, to unravel them (a long-standing issue in the clustering literature). This is due to the fully adaptive nature of the proposed algorithm that enables the removal of the clusters that gradually become obsolete."},"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":"1412.3613","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-11T11:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"35d70082425f58950cac39091aae77e8f9b03ac9a82cea6270ab80b486ae9ccf","abstract_canon_sha256":"ee9ae3a6cda4f44c57e1be4c694f0ae591637a38b7f12065817b86722c8d90e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:08.216108Z","signature_b64":"hMl1+UH6d+k+XWsHeCFJau3NAXh7aLmXjjX+XjmAOI7DJMz/7Kgxy+zZN0Zn7HTk/fxQno5xZrkCDXAmwwiBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41e84d86fad7aeec20c4b930216ee1d07f51bc8785d46bcb4132a825af1542c3","last_reissued_at":"2026-05-18T01:30:08.215585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:08.215585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Adaptive Possibilistic Clustering Algorithm","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":"2014-12-11T11:44:43Z","abstract_excerpt":"In this paper a novel possibilistic c-means clustering algorithm, called Adaptive Possibilistic c-means, is presented. Its main feature is that {\\it all} its parameters, after their initialization, are properly adapted during its execution. Provided that the algorithm starts with a reasonable overestimate of the number of physical clusters formed by the data, it is capable, in principle, to unravel them (a long-standing issue in the clustering literature). This is due to the fully adaptive nature of the proposed algorithm that enables the removal of the clusters that gradually become obsolete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3613","kind":"arxiv","version":3},"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":"1412.3613","created_at":"2026-05-18T01:30:08.215667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3613v3","created_at":"2026-05-18T01:30:08.215667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3613","created_at":"2026-05-18T01:30:08.215667+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHUE3BX226XO","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHUE3BX226XOYIGE","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHUE3BX2","created_at":"2026-05-18T12:28:33.132498+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/IHUE3BX226XOYIGEXEYCC3XB2B","json":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B.json","graph_json":"https://pith.science/api/pith-number/IHUE3BX226XOYIGEXEYCC3XB2B/graph.json","events_json":"https://pith.science/api/pith-number/IHUE3BX226XOYIGEXEYCC3XB2B/events.json","paper":"https://pith.science/paper/IHUE3BX2"},"agent_actions":{"view_html":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B","download_json":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B.json","view_paper":"https://pith.science/paper/IHUE3BX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3613&json=true","fetch_graph":"https://pith.science/api/pith-number/IHUE3BX226XOYIGEXEYCC3XB2B/graph.json","fetch_events":"https://pith.science/api/pith-number/IHUE3BX226XOYIGEXEYCC3XB2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/action/storage_attestation","attest_author":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/action/author_attestation","sign_citation":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/action/citation_signature","submit_replication":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/action/replication_record"}},"created_at":"2026-05-18T01:30:08.215667+00:00","updated_at":"2026-05-18T01:30:08.215667+00:00"}