{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JNVM523GHH7VGGNPJNPK2VYQ5G","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":"b382abed430b907318c7bf15a1658cb097c9ca6ddbcb2aa30d3e900592baa868","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-05T23:34:06Z","title_canon_sha256":"a84d8910362fb66cdf147f799ae4357acdb3c7ba8dcdf2f5407812683a66cd76"},"schema_version":"1.0","source":{"id":"1406.1546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1546","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1546v1","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1546","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"JNVM523GHH7V","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JNVM523GHH7VGGNP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JNVM523G","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:739f7b3fe7d3c3ea4d39b2d506975a3f5f11898b6f53cd3dc55c19519df6138d","target":"graph","created_at":"2026-05-18T02:50:22Z","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":"For a density $f$ on ${\\mathbb R}^d$, a {\\it high-density cluster} is any connected component of $\\{x: f(x) \\geq \\lambda\\}$, for some $\\lambda > 0$. The set of all high-density clusters forms a hierarchy called the {\\it cluster tree} of $f$. We present two procedures for estimating the cluster tree given samples from $f$. The first is a robust variant of the single linkage algorithm for hierarchical clustering. The second is based on the $k$-nearest neighbor graph of the samples. We give finite-sample convergence rates for these algorithms which also imply consistency, and we derive lower boun","authors_text":"Kamalika Chaudhuri, Samory Kpotufe, Sanjoy Dasgupta, Ulrike von Luxburg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-05T23:34:06Z","title":"Consistent procedures for cluster tree estimation and pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1546","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:bd046f7c1ef670d676a967cf6d7bb06f88069038e5489ac803393cff4125cd81","target":"record","created_at":"2026-05-18T02:50:22Z","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":"b382abed430b907318c7bf15a1658cb097c9ca6ddbcb2aa30d3e900592baa868","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-05T23:34:06Z","title_canon_sha256":"a84d8910362fb66cdf147f799ae4357acdb3c7ba8dcdf2f5407812683a66cd76"},"schema_version":"1.0","source":{"id":"1406.1546","kind":"arxiv","version":1}},"canonical_sha256":"4b6aceeb6639ff5319af4b5ead5710e984807c744db2b40e70570d4b3f7a25cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6aceeb6639ff5319af4b5ead5710e984807c744db2b40e70570d4b3f7a25cc","first_computed_at":"2026-05-18T02:50:22.361179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:22.361179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1xIzOgQOEaqbfC4rsKHqXpiWtFgBdlH3KT8goL8t+m4nPSnL4Z9k7K8v3Q9ub3k2R/Nf19F0UH7P1l00VAadBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:22.361684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd046f7c1ef670d676a967cf6d7bb06f88069038e5489ac803393cff4125cd81","sha256:739f7b3fe7d3c3ea4d39b2d506975a3f5f11898b6f53cd3dc55c19519df6138d"],"state_sha256":"00a11749663d9b6e00e117253bcc098c4fd7c0dc2572035eee0fb250b5a3bf07"}