{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UPNCR6A62VXGW4L27XZFJBCY2V","short_pith_number":"pith:UPNCR6A6","schema_version":"1.0","canonical_sha256":"a3da28f81ed56e6b717afdf2548458d56dfe2140256248ede10382d8e9793157","source":{"kind":"arxiv","id":"1508.01057","version":2},"attestation_state":"computed","paper":{"title":"On the convergence of the sparse possibilistic c-means 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":"2015-08-05T13:02:48Z","abstract_excerpt":"In this paper, a convergence proof for the recently proposed sparse possibilistic c-means (SPCM) algorithm is provided, utilizing the celebrated Zangwill convergence theorem. It is shown that the iterative sequence generated by SPCM converges to a stationary point or there exists a subsequence of it that converges to a stationary point of the cost function of the algorithm."},"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":"1508.01057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-05T13:02:48Z","cross_cats_sorted":[],"title_canon_sha256":"700261a7886e3cefa9e9b00e2ac5a1c9434e2add0afb865b5eb2f33eb80e506a","abstract_canon_sha256":"74a9f5a9b9e2c4bae8de32fd2be51b51466ca9f8e832c29b1b05f7e33eb08c77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:08.432838Z","signature_b64":"X6Q8wsvzZeHuP7HXchobTiEH+aqPujyu25DfjycoD+IU9eI6bIbx16VWtaIVDA8BGKyWaA8zZNztmsGjprKBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3da28f81ed56e6b717afdf2548458d56dfe2140256248ede10382d8e9793157","last_reissued_at":"2026-05-18T00:46:08.432146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:08.432146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the convergence of the sparse possibilistic c-means 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":"2015-08-05T13:02:48Z","abstract_excerpt":"In this paper, a convergence proof for the recently proposed sparse possibilistic c-means (SPCM) algorithm is provided, utilizing the celebrated Zangwill convergence theorem. It is shown that the iterative sequence generated by SPCM converges to a stationary point or there exists a subsequence of it that converges to a stationary point of the cost function of the algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01057","kind":"arxiv","version":2},"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":"1508.01057","created_at":"2026-05-18T00:46:08.432252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01057v2","created_at":"2026-05-18T00:46:08.432252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01057","created_at":"2026-05-18T00:46:08.432252+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPNCR6A62VXG","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPNCR6A62VXGW4L2","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPNCR6A6","created_at":"2026-05-18T12:29:44.643036+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/UPNCR6A62VXGW4L27XZFJBCY2V","json":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V.json","graph_json":"https://pith.science/api/pith-number/UPNCR6A62VXGW4L27XZFJBCY2V/graph.json","events_json":"https://pith.science/api/pith-number/UPNCR6A62VXGW4L27XZFJBCY2V/events.json","paper":"https://pith.science/paper/UPNCR6A6"},"agent_actions":{"view_html":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V","download_json":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V.json","view_paper":"https://pith.science/paper/UPNCR6A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01057&json=true","fetch_graph":"https://pith.science/api/pith-number/UPNCR6A62VXGW4L27XZFJBCY2V/graph.json","fetch_events":"https://pith.science/api/pith-number/UPNCR6A62VXGW4L27XZFJBCY2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V/action/storage_attestation","attest_author":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V/action/author_attestation","sign_citation":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V/action/citation_signature","submit_replication":"https://pith.science/pith/UPNCR6A62VXGW4L27XZFJBCY2V/action/replication_record"}},"created_at":"2026-05-18T00:46:08.432252+00:00","updated_at":"2026-05-18T00:46:08.432252+00:00"}