{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JNVM523GHH7VGGNPJNPK2VYQ5G","short_pith_number":"pith:JNVM523G","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"},"canonical_sha256":"4b6aceeb6639ff5319af4b5ead5710e984807c744db2b40e70570d4b3f7a25cc","source":{"kind":"arxiv","id":"1406.1546","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JNVM523GHH7VGGNPJNPK2VYQ5G","target":"record","payload":{"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"},"canonical_sha256":"4b6aceeb6639ff5319af4b5ead5710e984807c744db2b40e70570d4b3f7a25cc","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"},"source_kind":"arxiv","source_id":"1406.1546","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-18T02:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7hHYNshx/oryZNp5yHPqkMbh2TM6vVXkLwq/88PsE6cvhVB6p2KXO0zuK/aAxggASFao0vljDPCAQ+9S6EwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:09:01.402659Z"},"content_sha256":"bd046f7c1ef670d676a967cf6d7bb06f88069038e5489ac803393cff4125cd81","schema_version":"1.0","event_id":"sha256:bd046f7c1ef670d676a967cf6d7bb06f88069038e5489ac803393cff4125cd81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JNVM523GHH7VGGNPJNPK2VYQ5G","target":"graph","payload":{"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"},"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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjUJ/4wnRruvvn4HxGo/Pdbpm5+eJ/S2t03GZV9eivjLi6yKddqJw4GMM7BgixyI67qkEvXoF93QrcaWBOsdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:09:01.403380Z"},"content_sha256":"739f7b3fe7d3c3ea4d39b2d506975a3f5f11898b6f53cd3dc55c19519df6138d","schema_version":"1.0","event_id":"sha256:739f7b3fe7d3c3ea4d39b2d506975a3f5f11898b6f53cd3dc55c19519df6138d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/bundle.json","state_url":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/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-26T23:09:01Z","links":{"resolver":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G","bundle":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/bundle.json","state":"https://pith.science/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNVM523GHH7VGGNPJNPK2VYQ5G/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kT3Fw16VBybtE7U01N4ZrZ9rDSF2ki7SNzdEqoRdIc9i9W8/XhK7X18OfXgZsqprj2K+B4473AdaGu2QBEDoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:09:01.407259Z","bundle_sha256":"244fa197831e3b115d3ceba3f22bef3ae814e7618f37f5d6a3ae98299456d859"}}