{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IHUE3BX226XOYIGEXEYCC3XB2B","short_pith_number":"pith:IHUE3BX2","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"},"canonical_sha256":"41e84d86fad7aeec20c4b930216ee1d07f51bc8785d46bcb4132a825af1542c3","source":{"kind":"arxiv","id":"1412.3613","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3613","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3613v3","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3613","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"IHUE3BX226XO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IHUE3BX226XOYIGE","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IHUE3BX2","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IHUE3BX226XOYIGEXEYCC3XB2B","target":"record","payload":{"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"},"canonical_sha256":"41e84d86fad7aeec20c4b930216ee1d07f51bc8785d46bcb4132a825af1542c3","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"},"source_kind":"arxiv","source_id":"1412.3613","source_version":3,"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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZ7iFzV3RxHI4xegtSINMnj5DxwkNYDsTYWHVZd/ukuH10cpz2FiKNvOf7+m0LQgy168kEBevnKEkl08EP9MBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:30:24.933739Z"},"content_sha256":"c82dcc7069611564c0cd9efbc4f7915f0b9b425aa8be3044b0fbd171e774c05b","schema_version":"1.0","event_id":"sha256:c82dcc7069611564c0cd9efbc4f7915f0b9b425aa8be3044b0fbd171e774c05b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IHUE3BX226XOYIGEXEYCC3XB2B","target":"graph","payload":{"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"},"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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GpIB6pngmsYZq9WUZNsSwn/7f+kwxh4YCBQ/v1Ntla/X/MOPsr8d3Do6KjL57r/A5veKyPMLGJ490/Gn2Jg+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:30:24.934085Z"},"content_sha256":"cc3d3179792087683189de72857edc8525e3ccad3a5390088b78105dc08bc69c","schema_version":"1.0","event_id":"sha256:cc3d3179792087683189de72857edc8525e3ccad3a5390088b78105dc08bc69c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/bundle.json","state_url":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHUE3BX226XOYIGEXEYCC3XB2B/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-02T14:30:24Z","links":{"resolver":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B","bundle":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/bundle.json","state":"https://pith.science/pith/IHUE3BX226XOYIGEXEYCC3XB2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHUE3BX226XOYIGEXEYCC3XB2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IHUE3BX226XOYIGEXEYCC3XB2B","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":"ee9ae3a6cda4f44c57e1be4c694f0ae591637a38b7f12065817b86722c8d90e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-11T11:44:43Z","title_canon_sha256":"35d70082425f58950cac39091aae77e8f9b03ac9a82cea6270ab80b486ae9ccf"},"schema_version":"1.0","source":{"id":"1412.3613","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3613","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3613v3","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3613","created_at":"2026-05-18T01:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"IHUE3BX226XO","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IHUE3BX226XOYIGE","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IHUE3BX2","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:cc3d3179792087683189de72857edc8525e3ccad3a5390088b78105dc08bc69c","target":"graph","created_at":"2026-05-18T01:30:08Z","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 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.","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":"2014-12-11T11:44:43Z","title":"A Novel Adaptive Possibilistic Clustering Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3613","kind":"arxiv","version":3},"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:c82dcc7069611564c0cd9efbc4f7915f0b9b425aa8be3044b0fbd171e774c05b","target":"record","created_at":"2026-05-18T01:30:08Z","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":"ee9ae3a6cda4f44c57e1be4c694f0ae591637a38b7f12065817b86722c8d90e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-11T11:44:43Z","title_canon_sha256":"35d70082425f58950cac39091aae77e8f9b03ac9a82cea6270ab80b486ae9ccf"},"schema_version":"1.0","source":{"id":"1412.3613","kind":"arxiv","version":3}},"canonical_sha256":"41e84d86fad7aeec20c4b930216ee1d07f51bc8785d46bcb4132a825af1542c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41e84d86fad7aeec20c4b930216ee1d07f51bc8785d46bcb4132a825af1542c3","first_computed_at":"2026-05-18T01:30:08.215585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:08.215585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hMl1+UH6d+k+XWsHeCFJau3NAXh7aLmXjjX+XjmAOI7DJMz/7Kgxy+zZN0Zn7HTk/fxQno5xZrkCDXAmwwiBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:08.216108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3613","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c82dcc7069611564c0cd9efbc4f7915f0b9b425aa8be3044b0fbd171e774c05b","sha256:cc3d3179792087683189de72857edc8525e3ccad3a5390088b78105dc08bc69c"],"state_sha256":"121c623b7002e34118590ebab4fd08ce9690b5ad2718dd2e68a3f0385434e8b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrNvR8v7U7I22ebKRdjaZhcmhjoY7HPc5OTXV/Ak/tuBoUMST7hDiMNswPCXuxBWe0ZrtBDnpb2ioQySbYTOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:30:24.936038Z","bundle_sha256":"607d14993c67b0e6aeb90cb037918d11c3d3f743d7173ea115cc734358b302a1"}}