{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MOZ3VAQDNXX5RARKUDCBA4QCT7","short_pith_number":"pith:MOZ3VAQD","schema_version":"1.0","canonical_sha256":"63b3ba82036defd8822aa0c41072029fcc8f55697878c0b719dcf056ae0d18fc","source":{"kind":"arxiv","id":"1712.07454","version":1},"attestation_state":"computed","paper":{"title":"Fast kNN mode seeking clustering applied to active learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Robert P.W. Duin, Sergey Verzakov","submitted_at":"2017-12-20T12:51:21Z","abstract_excerpt":"A significantly faster algorithm is presented for the original kNN mode seeking procedure. It has the advantages over the well-known mean shift algorithm that it is feasible in high-dimensional vector spaces and results in uniquely, well defined modes. Moreover, without any additional computational effort it may yield a multi-scale hierarchy of clusterings. The time complexity is just O(n^1.5). resulting computing times range from seconds for 10^4 objects to minutes for 10^5 objects and to less than an hour for 10^6 objects. The space complexity is just O(n). The procedure is well suited for f"},"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":"1712.07454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-20T12:51:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"16ae71e42a76b1132cb1f97762642e571b105c896cd924783238a86d71fd6da9","abstract_canon_sha256":"e6e94d15d310f3825dc38d383ba2886ca2d2ff475e6cb0a06b60bf78eb7f2f4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:34.494558Z","signature_b64":"MSCFAEHMXMUv/hbf2BVKwNdYHlrwb+qUHIjK0XYpgWDeedy/hCdo337EZSN5TLfGnCVJsPhBBqNIyz8SBW7mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63b3ba82036defd8822aa0c41072029fcc8f55697878c0b719dcf056ae0d18fc","last_reissued_at":"2026-05-18T00:27:34.493961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:34.493961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast kNN mode seeking clustering applied to active learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Robert P.W. Duin, Sergey Verzakov","submitted_at":"2017-12-20T12:51:21Z","abstract_excerpt":"A significantly faster algorithm is presented for the original kNN mode seeking procedure. It has the advantages over the well-known mean shift algorithm that it is feasible in high-dimensional vector spaces and results in uniquely, well defined modes. Moreover, without any additional computational effort it may yield a multi-scale hierarchy of clusterings. The time complexity is just O(n^1.5). resulting computing times range from seconds for 10^4 objects to minutes for 10^5 objects and to less than an hour for 10^6 objects. The space complexity is just O(n). The procedure is well suited for f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07454","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.07454","created_at":"2026-05-18T00:27:34.494056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07454v1","created_at":"2026-05-18T00:27:34.494056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07454","created_at":"2026-05-18T00:27:34.494056+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOZ3VAQDNXX5","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOZ3VAQDNXX5RARK","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOZ3VAQD","created_at":"2026-05-18T12:31:31.346846+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/MOZ3VAQDNXX5RARKUDCBA4QCT7","json":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7.json","graph_json":"https://pith.science/api/pith-number/MOZ3VAQDNXX5RARKUDCBA4QCT7/graph.json","events_json":"https://pith.science/api/pith-number/MOZ3VAQDNXX5RARKUDCBA4QCT7/events.json","paper":"https://pith.science/paper/MOZ3VAQD"},"agent_actions":{"view_html":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7","download_json":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7.json","view_paper":"https://pith.science/paper/MOZ3VAQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07454&json=true","fetch_graph":"https://pith.science/api/pith-number/MOZ3VAQDNXX5RARKUDCBA4QCT7/graph.json","fetch_events":"https://pith.science/api/pith-number/MOZ3VAQDNXX5RARKUDCBA4QCT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/action/storage_attestation","attest_author":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/action/author_attestation","sign_citation":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/action/citation_signature","submit_replication":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/action/replication_record"}},"created_at":"2026-05-18T00:27:34.494056+00:00","updated_at":"2026-05-18T00:27:34.494056+00:00"}