{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:W4UBUH3SVHXZKGQY5D6JTQO26I","short_pith_number":"pith:W4UBUH3S","canonical_record":{"source":{"id":"1105.0540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-03T10:34:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"45244a3b89d1186169c7848cce803e70d870dbdd9f3532dbb9767e95eec1f710","abstract_canon_sha256":"3d7159e3ee11925056c6d919a7ca437b8f244ca0558a92497afcdeb24d1148f8"},"schema_version":"1.0"},"canonical_sha256":"b7281a1f72a9ef951a18e8fc99c1daf212a868bba4767049237e047006466daf","source":{"kind":"arxiv","id":"1105.0540","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0540","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0540v2","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0540","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"W4UBUH3SVHXZ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W4UBUH3SVHXZKGQY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W4UBUH3S","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:W4UBUH3SVHXZKGQY5D6JTQO26I","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-03T10:34:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"45244a3b89d1186169c7848cce803e70d870dbdd9f3532dbb9767e95eec1f710","abstract_canon_sha256":"3d7159e3ee11925056c6d919a7ca437b8f244ca0558a92497afcdeb24d1148f8"},"schema_version":"1.0"},"canonical_sha256":"b7281a1f72a9ef951a18e8fc99c1daf212a868bba4767049237e047006466daf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:49.681326Z","signature_b64":"/WaNsUTJ1otITmDXnRvVImnD4jM5uybpT6GGvsqUboo7RRZ1kUJP85S/onOYpyR6VYYPJj5GCar3bDyJLht3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7281a1f72a9ef951a18e8fc99c1daf212a868bba4767049237e047006466daf","last_reissued_at":"2026-05-18T04:22:49.680693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:49.680693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0540","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-18T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBb4TCCVz8dSULCJOTQpgoKFYxNe+CnNj/8IFGkX+w1atRjXaMFZlpdsGB1FSAIAVc1lqYd7yUXNEgYrdwjkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:05:47.127026Z"},"content_sha256":"49a3788ab869f66a3fe6649c1a49340ed8de40f0343397e6ad7fea1c2a2de8da","schema_version":"1.0","event_id":"sha256:49a3788ab869f66a3fe6649c1a49340ed8de40f0343397e6ad7fea1c2a2de8da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:W4UBUH3SVHXZKGQY5D6JTQO26I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruning nearest neighbor cluster trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Samory Kpotufe, Ulrike von Luxburg","submitted_at":"2011-05-03T10:34:25Z","abstract_excerpt":"Nearest neighbor (k-NN) graphs are widely used in machine learning and data mining applications, and our aim is to better understand what they reveal about the cluster structure of the unknown underlying distribution of points. Moreover, is it possible to identify spurious structures that might arise due to sampling variability?\n  Our first contribution is a statistical analysis that reveals how certain subgraphs of a k-NN graph form a consistent estimator of the cluster tree of the underlying distribution of points. Our second and perhaps most important contribution is the following finite sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0540","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-18T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REPYREv0ghMcAjbW1POJP1bWX2voqKz6zZKnWbivmBFVvPWxErJX6/zWnZqbzuzpsF0pHU0pPY1lkVGdenrKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:05:47.127380Z"},"content_sha256":"82221a7511ad808396997f565db22ebf28819f9fe79b2c5501d26b43123eec5b","schema_version":"1.0","event_id":"sha256:82221a7511ad808396997f565db22ebf28819f9fe79b2c5501d26b43123eec5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4UBUH3SVHXZKGQY5D6JTQO26I/bundle.json","state_url":"https://pith.science/pith/W4UBUH3SVHXZKGQY5D6JTQO26I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4UBUH3SVHXZKGQY5D6JTQO26I/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-06-22T18:05:47Z","links":{"resolver":"https://pith.science/pith/W4UBUH3SVHXZKGQY5D6JTQO26I","bundle":"https://pith.science/pith/W4UBUH3SVHXZKGQY5D6JTQO26I/bundle.json","state":"https://pith.science/pith/W4UBUH3SVHXZKGQY5D6JTQO26I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4UBUH3SVHXZKGQY5D6JTQO26I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:W4UBUH3SVHXZKGQY5D6JTQO26I","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":"3d7159e3ee11925056c6d919a7ca437b8f244ca0558a92497afcdeb24d1148f8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-03T10:34:25Z","title_canon_sha256":"45244a3b89d1186169c7848cce803e70d870dbdd9f3532dbb9767e95eec1f710"},"schema_version":"1.0","source":{"id":"1105.0540","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0540","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0540v2","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0540","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"W4UBUH3SVHXZ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W4UBUH3SVHXZKGQY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W4UBUH3S","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:82221a7511ad808396997f565db22ebf28819f9fe79b2c5501d26b43123eec5b","target":"graph","created_at":"2026-05-18T04:22:49Z","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":"Nearest neighbor (k-NN) graphs are widely used in machine learning and data mining applications, and our aim is to better understand what they reveal about the cluster structure of the unknown underlying distribution of points. Moreover, is it possible to identify spurious structures that might arise due to sampling variability?\n  Our first contribution is a statistical analysis that reveals how certain subgraphs of a k-NN graph form a consistent estimator of the cluster tree of the underlying distribution of points. Our second and perhaps most important contribution is the following finite sa","authors_text":"Samory Kpotufe, Ulrike von Luxburg","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-03T10:34:25Z","title":"Pruning nearest neighbor cluster trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0540","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:49a3788ab869f66a3fe6649c1a49340ed8de40f0343397e6ad7fea1c2a2de8da","target":"record","created_at":"2026-05-18T04:22:49Z","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":"3d7159e3ee11925056c6d919a7ca437b8f244ca0558a92497afcdeb24d1148f8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-05-03T10:34:25Z","title_canon_sha256":"45244a3b89d1186169c7848cce803e70d870dbdd9f3532dbb9767e95eec1f710"},"schema_version":"1.0","source":{"id":"1105.0540","kind":"arxiv","version":2}},"canonical_sha256":"b7281a1f72a9ef951a18e8fc99c1daf212a868bba4767049237e047006466daf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7281a1f72a9ef951a18e8fc99c1daf212a868bba4767049237e047006466daf","first_computed_at":"2026-05-18T04:22:49.680693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:49.680693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/WaNsUTJ1otITmDXnRvVImnD4jM5uybpT6GGvsqUboo7RRZ1kUJP85S/onOYpyR6VYYPJj5GCar3bDyJLht3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:49.681326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0540","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49a3788ab869f66a3fe6649c1a49340ed8de40f0343397e6ad7fea1c2a2de8da","sha256:82221a7511ad808396997f565db22ebf28819f9fe79b2c5501d26b43123eec5b"],"state_sha256":"70f980119adedab4e44403acc6b74d36d7f20cbd547af6d512e3ebd1da526cd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zvw3Q/PeYbL9uZnMnbECMHkSNAgFIi4BAKv31ni7TKHcWYGsRXgpM8Bw+2poEUkPz4CCOZUS/8D6NdrYSzgSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:05:47.129377Z","bundle_sha256":"d2b85c1d4cdeebf146c14efb48dc0c7d4498a6ff664e9d2d08af11a5b171dbdd"}}