{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MOZ3VAQDNXX5RARKUDCBA4QCT7","short_pith_number":"pith:MOZ3VAQD","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"},"canonical_sha256":"63b3ba82036defd8822aa0c41072029fcc8f55697878c0b719dcf056ae0d18fc","source":{"kind":"arxiv","id":"1712.07454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07454","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07454v1","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07454","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"MOZ3VAQDNXX5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MOZ3VAQDNXX5RARK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MOZ3VAQD","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MOZ3VAQDNXX5RARKUDCBA4QCT7","target":"record","payload":{"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"},"canonical_sha256":"63b3ba82036defd8822aa0c41072029fcc8f55697878c0b719dcf056ae0d18fc","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"},"source_kind":"arxiv","source_id":"1712.07454","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:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11w/8U5+zFnHZ786hL28xoLGscB21cfL7wf3d54d362GmyxryPr2spmR6aEqsPwb+6OTo4dKdSnl7sEqTfutDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:32:29.381672Z"},"content_sha256":"22b12633150bbf7d71549cdee2427a8e6a11ca5f2575c80f7839945e5137ca8b","schema_version":"1.0","event_id":"sha256:22b12633150bbf7d71549cdee2427a8e6a11ca5f2575c80f7839945e5137ca8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MOZ3VAQDNXX5RARKUDCBA4QCT7","target":"graph","payload":{"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"},"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:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4p3LcAmm/mGlpLCB6DxCFguybuAwlQZ2C2eyu03m6S1xn5xmNs4PgInSZ+VvhEy4Vgm8D9JNhM69AuiXDoyfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:32:29.382008Z"},"content_sha256":"66104b7811ee410cc81cfd45ff9594d0a09d956de5bdaa458243f24f76f36e73","schema_version":"1.0","event_id":"sha256:66104b7811ee410cc81cfd45ff9594d0a09d956de5bdaa458243f24f76f36e73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/bundle.json","state_url":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/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-30T09:32:29Z","links":{"resolver":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7","bundle":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/bundle.json","state":"https://pith.science/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOZ3VAQDNXX5RARKUDCBA4QCT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MOZ3VAQDNXX5RARKUDCBA4QCT7","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":"e6e94d15d310f3825dc38d383ba2886ca2d2ff475e6cb0a06b60bf78eb7f2f4b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-20T12:51:21Z","title_canon_sha256":"16ae71e42a76b1132cb1f97762642e571b105c896cd924783238a86d71fd6da9"},"schema_version":"1.0","source":{"id":"1712.07454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07454","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07454v1","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07454","created_at":"2026-05-18T00:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"MOZ3VAQDNXX5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MOZ3VAQDNXX5RARK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MOZ3VAQD","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:66104b7811ee410cc81cfd45ff9594d0a09d956de5bdaa458243f24f76f36e73","target":"graph","created_at":"2026-05-18T00:27:34Z","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":"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","authors_text":"Robert P.W. Duin, Sergey Verzakov","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-20T12:51:21Z","title":"Fast kNN mode seeking clustering applied to active learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07454","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:22b12633150bbf7d71549cdee2427a8e6a11ca5f2575c80f7839945e5137ca8b","target":"record","created_at":"2026-05-18T00:27:34Z","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":"e6e94d15d310f3825dc38d383ba2886ca2d2ff475e6cb0a06b60bf78eb7f2f4b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-20T12:51:21Z","title_canon_sha256":"16ae71e42a76b1132cb1f97762642e571b105c896cd924783238a86d71fd6da9"},"schema_version":"1.0","source":{"id":"1712.07454","kind":"arxiv","version":1}},"canonical_sha256":"63b3ba82036defd8822aa0c41072029fcc8f55697878c0b719dcf056ae0d18fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63b3ba82036defd8822aa0c41072029fcc8f55697878c0b719dcf056ae0d18fc","first_computed_at":"2026-05-18T00:27:34.493961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:34.493961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MSCFAEHMXMUv/hbf2BVKwNdYHlrwb+qUHIjK0XYpgWDeedy/hCdo337EZSN5TLfGnCVJsPhBBqNIyz8SBW7mCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:34.494558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22b12633150bbf7d71549cdee2427a8e6a11ca5f2575c80f7839945e5137ca8b","sha256:66104b7811ee410cc81cfd45ff9594d0a09d956de5bdaa458243f24f76f36e73"],"state_sha256":"c7fe7efd970526000088c9c9fce79916bf23d3bb8c21e691270312347e4c2df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Syyzfl6sUv5bFoe8hvdE9uaDbeVyyayMDvpsEpgQic/bcGxuWB0SObdLMWiCa/pMHm5xk/DCWPfRe+t9pcoqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T09:32:29.383866Z","bundle_sha256":"bea91c6eac92c243d938b557031099536cec93ce13b862ef43926b2c0ce55c60"}}