{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CJZ3HLRM3UCEPPU3JKEBUTJ3F3","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":"d848d3e16ced5257c1acb85843e8259f8ff98dd81f2182c78f466e06f8c395aa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-24T17:19:22Z","title_canon_sha256":"6c8447d6fcef11179cd1ff6b8ea3a70eaa3de74cd469d6cae3e38bd0d96f4afe"},"schema_version":"1.0","source":{"id":"1906.10094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10094","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10094v1","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10094","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"CJZ3HLRM3UCE","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CJZ3HLRM3UCEPPU3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CJZ3HLRM","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:d7e1472de27a7c716dbd2f723218477904ce3711fb6931045a187baff8ec6a19","target":"graph","created_at":"2026-05-17T23:42:35Z","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":"Single-level density-based approach has long been widely acknowledged to be a conceptually and mathematically convincing clustering method. In this paper, we propose an algorithm called \"best-scored clustering forest\" that can obtain the optimal level and determine corresponding clusters. The terminology \"best-scored\" means to select one random tree with the best empirical performance out of a certain number of purely random tree candidates. From the theoretical perspective, we first show that consistency of our proposed algorithm can be guaranteed. Moreover, under certain mild restrictions on","authors_text":"Hanfang Yang, Hanyuan Hang, Yuchao Cai","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-24T17:19:22Z","title":"Density-based Clustering with Best-scored Random Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10094","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:6da200e4b2e8529ca03b7bdcddb06c0b9af23ea08c7cb65b959605f4717a838c","target":"record","created_at":"2026-05-17T23:42:35Z","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":"d848d3e16ced5257c1acb85843e8259f8ff98dd81f2182c78f466e06f8c395aa","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-24T17:19:22Z","title_canon_sha256":"6c8447d6fcef11179cd1ff6b8ea3a70eaa3de74cd469d6cae3e38bd0d96f4afe"},"schema_version":"1.0","source":{"id":"1906.10094","kind":"arxiv","version":1}},"canonical_sha256":"1273b3ae2cdd0447be9b4a881a4d3b2eca709525915cc0ccf91aaeb2fdfec85d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1273b3ae2cdd0447be9b4a881a4d3b2eca709525915cc0ccf91aaeb2fdfec85d","first_computed_at":"2026-05-17T23:42:35.496090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:35.496090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DUplG/iIDlXInNbh8jCU2yc1s4GT8/dRnhoRKbBsjxx3b+edXrUl5HNpD0Wl+HEbM43k4v7+7qxMWxUMCJNQBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:35.496782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6da200e4b2e8529ca03b7bdcddb06c0b9af23ea08c7cb65b959605f4717a838c","sha256:d7e1472de27a7c716dbd2f723218477904ce3711fb6931045a187baff8ec6a19"],"state_sha256":"71d9c47171c204655184e4e4bb32213cb299c7a752e80f771cb6e7234b838449"}