{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BTSPG4S4JQTTOFFZNXKUZWIRGM","short_pith_number":"pith:BTSPG4S4","schema_version":"1.0","canonical_sha256":"0ce4f3725c4c273714b96dd54cd911333c9313814a7447a25bdf3d58a8705548","source":{"kind":"arxiv","id":"1406.7130","version":4},"attestation_state":"computed","paper":{"title":"A Fuzzy Clustering Algorithm for the Mode Seeking Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Steve Oudot, Thomas Bonis","submitted_at":"2014-06-27T09:48:05Z","abstract_excerpt":"In this paper, we propose a new fuzzy clustering algorithm based on the mode-seeking framework. Given a dataset in $\\mathbb{R}^d$, we define regions of high density that we call cluster cores. We then consider a random walk on a neighborhood graph built on top of our data points which is designed to be attracted by high density regions. The strength of this attraction is controlled by a temperature parameter $\\beta > 0$. The membership of a point to a given cluster is then the probability for the random walk to hit the corresponding cluster core before any other. While many properties of rando"},"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":"1406.7130","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T09:48:05Z","cross_cats_sorted":[],"title_canon_sha256":"28babea78df571a882d45a4c18c6f32e91847b018f106fc33f4898ee1ae7a794","abstract_canon_sha256":"38957321c1e9bc24c3b741e5813d022705f09ac36d6e8d9220185074aade404e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.960034Z","signature_b64":"lQbhKs/BkF94eIpQs9CAyUSp/WAJTanrnDkXorIK1skBOPl0q0llt/G7DAVF7H6zUTO7ebZ5sG5Wx/5o8CSMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ce4f3725c4c273714b96dd54cd911333c9313814a7447a25bdf3d58a8705548","last_reissued_at":"2026-05-18T01:12:01.959630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.959630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fuzzy Clustering Algorithm for the Mode Seeking Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Steve Oudot, Thomas Bonis","submitted_at":"2014-06-27T09:48:05Z","abstract_excerpt":"In this paper, we propose a new fuzzy clustering algorithm based on the mode-seeking framework. Given a dataset in $\\mathbb{R}^d$, we define regions of high density that we call cluster cores. We then consider a random walk on a neighborhood graph built on top of our data points which is designed to be attracted by high density regions. The strength of this attraction is controlled by a temperature parameter $\\beta > 0$. The membership of a point to a given cluster is then the probability for the random walk to hit the corresponding cluster core before any other. While many properties of rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7130","kind":"arxiv","version":4},"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":"1406.7130","created_at":"2026-05-18T01:12:01.959696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7130v4","created_at":"2026-05-18T01:12:01.959696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7130","created_at":"2026-05-18T01:12:01.959696+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTSPG4S4JQTT","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTSPG4S4JQTTOFFZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTSPG4S4","created_at":"2026-05-18T12:28:22.404517+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/BTSPG4S4JQTTOFFZNXKUZWIRGM","json":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM.json","graph_json":"https://pith.science/api/pith-number/BTSPG4S4JQTTOFFZNXKUZWIRGM/graph.json","events_json":"https://pith.science/api/pith-number/BTSPG4S4JQTTOFFZNXKUZWIRGM/events.json","paper":"https://pith.science/paper/BTSPG4S4"},"agent_actions":{"view_html":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM","download_json":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM.json","view_paper":"https://pith.science/paper/BTSPG4S4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7130&json=true","fetch_graph":"https://pith.science/api/pith-number/BTSPG4S4JQTTOFFZNXKUZWIRGM/graph.json","fetch_events":"https://pith.science/api/pith-number/BTSPG4S4JQTTOFFZNXKUZWIRGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/action/storage_attestation","attest_author":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/action/author_attestation","sign_citation":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/action/citation_signature","submit_replication":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/action/replication_record"}},"created_at":"2026-05-18T01:12:01.959696+00:00","updated_at":"2026-05-18T01:12:01.959696+00:00"}