{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JNVM523GHH7VGGNPJNPK2VYQ5G","short_pith_number":"pith:JNVM523G","schema_version":"1.0","canonical_sha256":"4b6aceeb6639ff5319af4b5ead5710e984807c744db2b40e70570d4b3f7a25cc","source":{"kind":"arxiv","id":"1406.1546","version":1},"attestation_state":"computed","paper":{"title":"Consistent procedures for cluster tree estimation and pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Kamalika Chaudhuri, Samory Kpotufe, Sanjoy Dasgupta, Ulrike von Luxburg","submitted_at":"2014-06-05T23:34:06Z","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"},"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":"1406.1546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-05T23:34:06Z","cross_cats_sorted":[],"title_canon_sha256":"a84d8910362fb66cdf147f799ae4357acdb3c7ba8dcdf2f5407812683a66cd76","abstract_canon_sha256":"b382abed430b907318c7bf15a1658cb097c9ca6ddbcb2aa30d3e900592baa868"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:22.361684Z","signature_b64":"1xIzOgQOEaqbfC4rsKHqXpiWtFgBdlH3KT8goL8t+m4nPSnL4Z9k7K8v3Q9ub3k2R/Nf19F0UH7P1l00VAadBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6aceeb6639ff5319af4b5ead5710e984807c744db2b40e70570d4b3f7a25cc","last_reissued_at":"2026-05-18T02:50:22.361179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:22.361179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistent procedures for cluster tree estimation and pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Kamalika Chaudhuri, Samory Kpotufe, Sanjoy Dasgupta, Ulrike von Luxburg","submitted_at":"2014-06-05T23:34:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1546","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":"1406.1546","created_at":"2026-05-18T02:50:22.361250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1546v1","created_at":"2026-05-18T02:50:22.361250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1546","created_at":"2026-05-18T02:50:22.361250+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNVM523GHH7V","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNVM523GHH7VGGNP","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNVM523G","created_at":"2026-05-18T12:28:35.611951+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/JNVM523GHH7VGGNPJNPK2VYQ5G","json":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G.json","graph_json":"https://pith.science/api/pith-number/JNVM523GHH7VGGNPJNPK2VYQ5G/graph.json","events_json":"https://pith.science/api/pith-number/JNVM523GHH7VGGNPJNPK2VYQ5G/events.json","paper":"https://pith.science/paper/JNVM523G"},"agent_actions":{"view_html":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G","download_json":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G.json","view_paper":"https://pith.science/paper/JNVM523G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1546&json=true","fetch_graph":"https://pith.science/api/pith-number/JNVM523GHH7VGGNPJNPK2VYQ5G/graph.json","fetch_events":"https://pith.science/api/pith-number/JNVM523GHH7VGGNPJNPK2VYQ5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/action/storage_attestation","attest_author":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/action/author_attestation","sign_citation":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/action/citation_signature","submit_replication":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/action/replication_record"}},"created_at":"2026-05-18T02:50:22.361250+00:00","updated_at":"2026-05-18T02:50:22.361250+00:00"}