{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7ZH7HSRAM35XGQAMATPBU46CLW","short_pith_number":"pith:7ZH7HSRA","canonical_record":{"source":{"id":"1501.04267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-18T05:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"7399d21a31a598394b43f68f2e7545b3e33273486891d30cd5c33d90b645cb9a","abstract_canon_sha256":"cec4017145d41c0a212946f1650844279d4da73706e2d1ffc467623d20fb4364"},"schema_version":"1.0"},"canonical_sha256":"fe4ff3ca2066fb73400c04de1a73c25d86fceaec179c33e67c24437a43f7d4ce","source":{"kind":"arxiv","id":"1501.04267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04267","created_at":"2026-05-18T02:29:08Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04267v2","created_at":"2026-05-18T02:29:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04267","created_at":"2026-05-18T02:29:08Z"},{"alias_kind":"pith_short_12","alias_value":"7ZH7HSRAM35X","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7ZH7HSRAM35XGQAM","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7ZH7HSRA","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7ZH7HSRAM35XGQAMATPBU46CLW","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-18T05:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"7399d21a31a598394b43f68f2e7545b3e33273486891d30cd5c33d90b645cb9a","abstract_canon_sha256":"cec4017145d41c0a212946f1650844279d4da73706e2d1ffc467623d20fb4364"},"schema_version":"1.0"},"canonical_sha256":"fe4ff3ca2066fb73400c04de1a73c25d86fceaec179c33e67c24437a43f7d4ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:08.055626Z","signature_b64":"o0OwhVrGS3EMpvxrEGeovmvR2PFeF1rIL9OsfiggO247+4LCaDHjcoaiiJDgXZeQi19deu/MiVAY1WNTKB2TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe4ff3ca2066fb73400c04de1a73c25d86fceaec179c33e67c24437a43f7d4ce","last_reissued_at":"2026-05-18T02:29:08.055110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:08.055110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04267","source_version":2,"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-18T02:29:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERBIIsk2xxpC9MkHT7VieFVD1UApGabJzPo9OL2mRM1r44J8w54kHF5lS1pKnD2HvQISDbLcxzIZApMwxpdiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:29:36.868970Z"},"content_sha256":"758a9835031e8049301fec9bd8ee722edcce5b142a59d8370371d97d373fd137","schema_version":"1.0","event_id":"sha256:758a9835031e8049301fec9bd8ee722edcce5b142a59d8370371d97d373fd137"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7ZH7HSRAM35XGQAMATPBU46CLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comment on \"Clustering by fast search and find of density peaks\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Caoyuan Li, Dakui Wang, Shuliang Wang, Yan Li","submitted_at":"2015-01-18T05:15:55Z","abstract_excerpt":"In [1], a clustering algorithm was given to find the centers of clusters quickly. However, the accuracy of this algorithm heavily depend on the threshold value of d-c. Furthermore, [1] has not provided any efficient way to select the threshold value of d-c, that is, one can have to estimate the value of d_c depend on one's subjective experience. In this paper, based on the data field [2], we propose a new way to automatically extract the threshold value of d_c from the original data set by using the potential entropy of data field. For any data set to be clustered, the most reasonable value of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04267","kind":"arxiv","version":2},"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-18T02:29:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItAzXCkE9wJGC2yHJsC/pFhaNq7liX9V+08LlXN30D+iUmd2AXU/Lez4EXnP+ORj8aqpzJviX/b5ou0rSF6gDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:29:36.869700Z"},"content_sha256":"4b3ea9ab83ce74b035e371ffc411b70cd0fd9df72daeb4e5ad1b8bb119d44f33","schema_version":"1.0","event_id":"sha256:4b3ea9ab83ce74b035e371ffc411b70cd0fd9df72daeb4e5ad1b8bb119d44f33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZH7HSRAM35XGQAMATPBU46CLW/bundle.json","state_url":"https://pith.science/pith/7ZH7HSRAM35XGQAMATPBU46CLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZH7HSRAM35XGQAMATPBU46CLW/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-05-29T14:29:36Z","links":{"resolver":"https://pith.science/pith/7ZH7HSRAM35XGQAMATPBU46CLW","bundle":"https://pith.science/pith/7ZH7HSRAM35XGQAMATPBU46CLW/bundle.json","state":"https://pith.science/pith/7ZH7HSRAM35XGQAMATPBU46CLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZH7HSRAM35XGQAMATPBU46CLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7ZH7HSRAM35XGQAMATPBU46CLW","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":"cec4017145d41c0a212946f1650844279d4da73706e2d1ffc467623d20fb4364","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-18T05:15:55Z","title_canon_sha256":"7399d21a31a598394b43f68f2e7545b3e33273486891d30cd5c33d90b645cb9a"},"schema_version":"1.0","source":{"id":"1501.04267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04267","created_at":"2026-05-18T02:29:08Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04267v2","created_at":"2026-05-18T02:29:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04267","created_at":"2026-05-18T02:29:08Z"},{"alias_kind":"pith_short_12","alias_value":"7ZH7HSRAM35X","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7ZH7HSRAM35XGQAM","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7ZH7HSRA","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:4b3ea9ab83ce74b035e371ffc411b70cd0fd9df72daeb4e5ad1b8bb119d44f33","target":"graph","created_at":"2026-05-18T02:29:08Z","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 [1], a clustering algorithm was given to find the centers of clusters quickly. However, the accuracy of this algorithm heavily depend on the threshold value of d-c. Furthermore, [1] has not provided any efficient way to select the threshold value of d-c, that is, one can have to estimate the value of d_c depend on one's subjective experience. In this paper, based on the data field [2], we propose a new way to automatically extract the threshold value of d_c from the original data set by using the potential entropy of data field. For any data set to be clustered, the most reasonable value of","authors_text":"Caoyuan Li, Dakui Wang, Shuliang Wang, Yan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-18T05:15:55Z","title":"Comment on \"Clustering by fast search and find of density peaks\""},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04267","kind":"arxiv","version":2},"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:758a9835031e8049301fec9bd8ee722edcce5b142a59d8370371d97d373fd137","target":"record","created_at":"2026-05-18T02:29:08Z","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":"cec4017145d41c0a212946f1650844279d4da73706e2d1ffc467623d20fb4364","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-18T05:15:55Z","title_canon_sha256":"7399d21a31a598394b43f68f2e7545b3e33273486891d30cd5c33d90b645cb9a"},"schema_version":"1.0","source":{"id":"1501.04267","kind":"arxiv","version":2}},"canonical_sha256":"fe4ff3ca2066fb73400c04de1a73c25d86fceaec179c33e67c24437a43f7d4ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe4ff3ca2066fb73400c04de1a73c25d86fceaec179c33e67c24437a43f7d4ce","first_computed_at":"2026-05-18T02:29:08.055110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:08.055110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o0OwhVrGS3EMpvxrEGeovmvR2PFeF1rIL9OsfiggO247+4LCaDHjcoaiiJDgXZeQi19deu/MiVAY1WNTKB2TCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:08.055626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:758a9835031e8049301fec9bd8ee722edcce5b142a59d8370371d97d373fd137","sha256:4b3ea9ab83ce74b035e371ffc411b70cd0fd9df72daeb4e5ad1b8bb119d44f33"],"state_sha256":"39d90dbdb88e87e5e2dc2a321eca46528e3e19430c1d2c06bf572cb4414e9a8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbOtmAG17BzfcaRTIqrd2/y3EzunHMx7dgbTGG9WfnF+lq8U8dnA2kIBQcGYveLHJzXEinx+YmDSXT2vMpMbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:29:36.873575Z","bundle_sha256":"bcc5c4d52c5776cba5bcf554213159b2e35be73573d983f90f5434b653560cee"}}