{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BTSPG4S4JQTTOFFZNXKUZWIRGM","short_pith_number":"pith:BTSPG4S4","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"},"canonical_sha256":"0ce4f3725c4c273714b96dd54cd911333c9313814a7447a25bdf3d58a8705548","source":{"kind":"arxiv","id":"1406.7130","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7130","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7130v4","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7130","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"BTSPG4S4JQTT","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BTSPG4S4JQTTOFFZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BTSPG4S4","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BTSPG4S4JQTTOFFZNXKUZWIRGM","target":"record","payload":{"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"},"canonical_sha256":"0ce4f3725c4c273714b96dd54cd911333c9313814a7447a25bdf3d58a8705548","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"},"source_kind":"arxiv","source_id":"1406.7130","source_version":4,"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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMxptHyNLkzC/bo8hwsKcIB7nt751YNDPfE0UKAQAhSLpwS3JDDqA4y59fI5Ym0P+XpFvLLQvGYgUCI43i6sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:42:25.177111Z"},"content_sha256":"68a15eda7c007696d2d51df6e92243a673e6fbb896b012ce8467bd43b2046463","schema_version":"1.0","event_id":"sha256:68a15eda7c007696d2d51df6e92243a673e6fbb896b012ce8467bd43b2046463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BTSPG4S4JQTTOFFZNXKUZWIRGM","target":"graph","payload":{"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"},"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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XX58p/Ln68cSNU7VymK6ClJ37n/EeM6i89LaTnKctbN0FYRDs670kzzdS2fPr/Xv5oy9s0geUjx9DXoOlwaFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:42:25.177469Z"},"content_sha256":"6c701acb839b62f1ef927beb3fc8435a08b61e566edd8f1d2194b67b3f0ab285","schema_version":"1.0","event_id":"sha256:6c701acb839b62f1ef927beb3fc8435a08b61e566edd8f1d2194b67b3f0ab285"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/bundle.json","state_url":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/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-02T00:42:25Z","links":{"resolver":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM","bundle":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/bundle.json","state":"https://pith.science/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTSPG4S4JQTTOFFZNXKUZWIRGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BTSPG4S4JQTTOFFZNXKUZWIRGM","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":"38957321c1e9bc24c3b741e5813d022705f09ac36d6e8d9220185074aade404e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T09:48:05Z","title_canon_sha256":"28babea78df571a882d45a4c18c6f32e91847b018f106fc33f4898ee1ae7a794"},"schema_version":"1.0","source":{"id":"1406.7130","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7130","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7130v4","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7130","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"BTSPG4S4JQTT","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BTSPG4S4JQTTOFFZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BTSPG4S4","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:6c701acb839b62f1ef927beb3fc8435a08b61e566edd8f1d2194b67b3f0ab285","target":"graph","created_at":"2026-05-18T01:12:01Z","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, 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","authors_text":"Steve Oudot, Thomas Bonis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T09:48:05Z","title":"A Fuzzy Clustering Algorithm for the Mode Seeking Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7130","kind":"arxiv","version":4},"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:68a15eda7c007696d2d51df6e92243a673e6fbb896b012ce8467bd43b2046463","target":"record","created_at":"2026-05-18T01:12:01Z","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":"38957321c1e9bc24c3b741e5813d022705f09ac36d6e8d9220185074aade404e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-27T09:48:05Z","title_canon_sha256":"28babea78df571a882d45a4c18c6f32e91847b018f106fc33f4898ee1ae7a794"},"schema_version":"1.0","source":{"id":"1406.7130","kind":"arxiv","version":4}},"canonical_sha256":"0ce4f3725c4c273714b96dd54cd911333c9313814a7447a25bdf3d58a8705548","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ce4f3725c4c273714b96dd54cd911333c9313814a7447a25bdf3d58a8705548","first_computed_at":"2026-05-18T01:12:01.959630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:01.959630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lQbhKs/BkF94eIpQs9CAyUSp/WAJTanrnDkXorIK1skBOPl0q0llt/G7DAVF7H6zUTO7ebZ5sG5Wx/5o8CSMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:01.960034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7130","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68a15eda7c007696d2d51df6e92243a673e6fbb896b012ce8467bd43b2046463","sha256:6c701acb839b62f1ef927beb3fc8435a08b61e566edd8f1d2194b67b3f0ab285"],"state_sha256":"3d2b523a479e04e88e0ad232cabf546dd7ff04af0e9d878e9dddc2343577096a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHe4cfKjCY7lVhA7IkFfcld9zTbMB9BFkmwzjbZSLNyLnR1hpzm2MI/yFttKbusnL8oIPMul8Uuk4fa6wpmYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:42:25.179520Z","bundle_sha256":"9e8853f6a61f006fd7154070c36ef7930ddb3a8f2b28c841804d4535e7cba818"}}