{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N3UC6MNBBVYJXXX4YNPMXOHPPL","short_pith_number":"pith:N3UC6MNB","schema_version":"1.0","canonical_sha256":"6ee82f31a10d709bdefcc35ecbb8ef7af1ad9ef03f9e9406c4ad64f400d3f1d6","source":{"kind":"arxiv","id":"2405.13427","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Fuzzy C-Means with Graph Embedding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Qiang Chen, Weizhong Yu, Xuelong Li","submitted_at":"2024-05-22T08:15:50Z","abstract_excerpt":"Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods. However, for almost all existing FCM based methods, how to automatically selecting proper membership degree hyper-parameter values remains a challenging and unsolved problem. Mixture model based methods, while circumventing the difficulty of manually adjusting membership degree hyper-parameters inherent in FCM based methods, often have a preference for specific distributions, such as the Gaussian distribution. In this paper, we propose a novel FCM base"},"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":"2405.13427","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-22T08:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"178085fefb8b548909af4713d5b90e81d54e109b95438d8fc9eecab5fdee31dc","abstract_canon_sha256":"288567212c026791686d6cee655367ce245f80fd111c7c558d0af7e6f6a1275d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:02.701536Z","signature_b64":"FNqpoax3uN2r9XcpSHihfY/TahXMqzDfmfXPL1IJ6+RhHVsCYhAgWHEXWcpZwYdgjPchnxw96KKdZfxlv2t/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee82f31a10d709bdefcc35ecbb8ef7af1ad9ef03f9e9406c4ad64f400d3f1d6","last_reissued_at":"2026-07-05T08:22:02.701088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:02.701088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Fuzzy C-Means with Graph Embedding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Qiang Chen, Weizhong Yu, Xuelong Li","submitted_at":"2024-05-22T08:15:50Z","abstract_excerpt":"Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods. However, for almost all existing FCM based methods, how to automatically selecting proper membership degree hyper-parameter values remains a challenging and unsolved problem. Mixture model based methods, while circumventing the difficulty of manually adjusting membership degree hyper-parameters inherent in FCM based methods, often have a preference for specific distributions, such as the Gaussian distribution. In this paper, we propose a novel FCM base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13427","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.13427/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.13427","created_at":"2026-07-05T08:22:02.701146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.13427v1","created_at":"2026-07-05T08:22:02.701146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13427","created_at":"2026-07-05T08:22:02.701146+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3UC6MNBBVYJ","created_at":"2026-07-05T08:22:02.701146+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3UC6MNBBVYJXXX4","created_at":"2026-07-05T08:22:02.701146+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3UC6MNB","created_at":"2026-07-05T08:22:02.701146+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10935","citing_title":"CLP: Collocation-Length Prediction for Zero-Loss Adaptive Multi-Token Inference","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL","json":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL.json","graph_json":"https://pith.science/api/pith-number/N3UC6MNBBVYJXXX4YNPMXOHPPL/graph.json","events_json":"https://pith.science/api/pith-number/N3UC6MNBBVYJXXX4YNPMXOHPPL/events.json","paper":"https://pith.science/paper/N3UC6MNB"},"agent_actions":{"view_html":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL","download_json":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL.json","view_paper":"https://pith.science/paper/N3UC6MNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.13427&json=true","fetch_graph":"https://pith.science/api/pith-number/N3UC6MNBBVYJXXX4YNPMXOHPPL/graph.json","fetch_events":"https://pith.science/api/pith-number/N3UC6MNBBVYJXXX4YNPMXOHPPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL/action/storage_attestation","attest_author":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL/action/author_attestation","sign_citation":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL/action/citation_signature","submit_replication":"https://pith.science/pith/N3UC6MNBBVYJXXX4YNPMXOHPPL/action/replication_record"}},"created_at":"2026-07-05T08:22:02.701146+00:00","updated_at":"2026-07-05T08:22:02.701146+00:00"}