{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2IK76SUNQQEFQTXVI4N2UXOKCM","short_pith_number":"pith:2IK76SUN","canonical_record":{"source":{"id":"1808.00197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-01T07:07:15Z","cross_cats_sorted":["cs.DB","stat.ML"],"title_canon_sha256":"2abd0f044f17632c7828e6f519d99c610179b1e0ab073662d36aa336d3766dd8","abstract_canon_sha256":"ad289d9aa5d1cab7cbdc09f67f2a861f9c92a8d1c8c5f8da4f49de970f7b06e8"},"schema_version":"1.0"},"canonical_sha256":"d215ff4a8d8408584ef5471baa5dca13102a536379cafe7185ec719de12c96e2","source":{"kind":"arxiv","id":"1808.00197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00197","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00197v1","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00197","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"2IK76SUNQQEF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2IK76SUNQQEFQTXV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2IK76SUN","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2IK76SUNQQEFQTXVI4N2UXOKCM","target":"record","payload":{"canonical_record":{"source":{"id":"1808.00197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-01T07:07:15Z","cross_cats_sorted":["cs.DB","stat.ML"],"title_canon_sha256":"2abd0f044f17632c7828e6f519d99c610179b1e0ab073662d36aa336d3766dd8","abstract_canon_sha256":"ad289d9aa5d1cab7cbdc09f67f2a861f9c92a8d1c8c5f8da4f49de970f7b06e8"},"schema_version":"1.0"},"canonical_sha256":"d215ff4a8d8408584ef5471baa5dca13102a536379cafe7185ec719de12c96e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:08.449816Z","signature_b64":"nXK3vGe1aUhXBG7grdZQ6KkQhMFWYjVHDmJZbes1vVs3MMuNCZRzXYIgBQbG/E+JsVB76HKrcAxWUjvUIFnVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d215ff4a8d8408584ef5471baa5dca13102a536379cafe7185ec719de12c96e2","last_reissued_at":"2026-05-18T00:09:08.449423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:08.449423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.00197","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-18T00:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIZO4UEIQticeoLHiny/N6rpJZw40rYY/deBl1SqptOG+Y4948/b4rebI1V3hjw6xwC8ONOjMZ7bJgHu0a7VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:42.951298Z"},"content_sha256":"169366d31168b455f75e101e491080885c3cc22df39b89ad58c39117de16738d","schema_version":"1.0","event_id":"sha256:169366d31168b455f75e101e491080885c3cc22df39b89ad58c39117de16738d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2IK76SUNQQEFQTXVI4N2UXOKCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MaxMin Linear Initialization for Fuzzy C-Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","stat.ML"],"primary_cat":"cs.LG","authors_text":"ARAR), Ayb\\\"uk\\\"e Ozt\\\"urk (ERIC, J\\'er\\^ome Darmont (ERIC), St\\'ephane Lallich (ERIC), Sylvie Yona Waksman (ARAR)","submitted_at":"2018-08-01T07:07:15Z","abstract_excerpt":"Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters, as is the case in text categorization. Thus, we need more flexible clustering. Fuzzy clustering methods, where each data point can belong to several clusters, are an interesting alternative. Yet, seeding iterative fuzzy algorithms to achieve high quality clustering is an issue."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00197","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-18T00:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXh1DUrSlJO+f0kcl2JaNREOmwMuj78fTt8LNi5ywI+M2ix+EU1U76GE7jRAvJig3XnC7UsbczN99mU3H9QtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:42.951663Z"},"content_sha256":"57968f43d389fb702da21e194c008bdfe481e1abc3507d8b676b1d19ad39748b","schema_version":"1.0","event_id":"sha256:57968f43d389fb702da21e194c008bdfe481e1abc3507d8b676b1d19ad39748b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IK76SUNQQEFQTXVI4N2UXOKCM/bundle.json","state_url":"https://pith.science/pith/2IK76SUNQQEFQTXVI4N2UXOKCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IK76SUNQQEFQTXVI4N2UXOKCM/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-09T14:14:42Z","links":{"resolver":"https://pith.science/pith/2IK76SUNQQEFQTXVI4N2UXOKCM","bundle":"https://pith.science/pith/2IK76SUNQQEFQTXVI4N2UXOKCM/bundle.json","state":"https://pith.science/pith/2IK76SUNQQEFQTXVI4N2UXOKCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IK76SUNQQEFQTXVI4N2UXOKCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2IK76SUNQQEFQTXVI4N2UXOKCM","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":"ad289d9aa5d1cab7cbdc09f67f2a861f9c92a8d1c8c5f8da4f49de970f7b06e8","cross_cats_sorted":["cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-01T07:07:15Z","title_canon_sha256":"2abd0f044f17632c7828e6f519d99c610179b1e0ab073662d36aa336d3766dd8"},"schema_version":"1.0","source":{"id":"1808.00197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00197","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00197v1","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00197","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"2IK76SUNQQEF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2IK76SUNQQEFQTXV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2IK76SUN","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:57968f43d389fb702da21e194c008bdfe481e1abc3507d8b676b1d19ad39748b","target":"graph","created_at":"2026-05-18T00:09: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":"Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters, as is the case in text categorization. Thus, we need more flexible clustering. Fuzzy clustering methods, where each data point can belong to several clusters, are an interesting alternative. Yet, seeding iterative fuzzy algorithms to achieve high quality clustering is an issue.","authors_text":"ARAR), Ayb\\\"uk\\\"e Ozt\\\"urk (ERIC, J\\'er\\^ome Darmont (ERIC), St\\'ephane Lallich (ERIC), Sylvie Yona Waksman (ARAR)","cross_cats":["cs.DB","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-01T07:07:15Z","title":"MaxMin Linear Initialization for Fuzzy C-Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00197","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:169366d31168b455f75e101e491080885c3cc22df39b89ad58c39117de16738d","target":"record","created_at":"2026-05-18T00:09: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":"ad289d9aa5d1cab7cbdc09f67f2a861f9c92a8d1c8c5f8da4f49de970f7b06e8","cross_cats_sorted":["cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-01T07:07:15Z","title_canon_sha256":"2abd0f044f17632c7828e6f519d99c610179b1e0ab073662d36aa336d3766dd8"},"schema_version":"1.0","source":{"id":"1808.00197","kind":"arxiv","version":1}},"canonical_sha256":"d215ff4a8d8408584ef5471baa5dca13102a536379cafe7185ec719de12c96e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d215ff4a8d8408584ef5471baa5dca13102a536379cafe7185ec719de12c96e2","first_computed_at":"2026-05-18T00:09:08.449423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:08.449423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nXK3vGe1aUhXBG7grdZQ6KkQhMFWYjVHDmJZbes1vVs3MMuNCZRzXYIgBQbG/E+JsVB76HKrcAxWUjvUIFnVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:08.449816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:169366d31168b455f75e101e491080885c3cc22df39b89ad58c39117de16738d","sha256:57968f43d389fb702da21e194c008bdfe481e1abc3507d8b676b1d19ad39748b"],"state_sha256":"a1ed00a66943678a55a42fb19c06968873e976cfc3c720b8dd793fb13d7e6548"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Y5C+yo5RBtVomhDQlkIFoetzuIxSUO+LUqTtzNEWW+0ysTot6PbGYceHkWNnLSBjiDVkIq/UqvKCIID27uuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:14:42.953597Z","bundle_sha256":"b2008d3f8dd18716d5e7591a4defc021b81b5bb47bcbcfc1e2df4cc8fb4afa7f"}}