{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3TRLFVSBKKWKVBGCEQUUGCTPOQ","short_pith_number":"pith:3TRLFVSB","canonical_record":{"source":{"id":"1509.02805","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T15:15:44Z","cross_cats_sorted":["cs.CV","cs.LG","stat.ME"],"title_canon_sha256":"324aa5c8927f61719ba191f6537a2685b3e37d7f90f75ffa0bb4f8b0b2043c55","abstract_canon_sha256":"c937a2021570d8bf64c8dd85cb4f9289812406b683e6b7045b094a2170d7732a"},"schema_version":"1.0"},"canonical_sha256":"dce2b2d64152acaa84c22429430a6f7431fc4da91ebbf70d3548ae9621b29e8a","source":{"kind":"arxiv","id":"1509.02805","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02805","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02805v3","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02805","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"3TRLFVSBKKWK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3TRLFVSBKKWKVBGC","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3TRLFVSB","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3TRLFVSBKKWKVBGCEQUUGCTPOQ","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02805","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T15:15:44Z","cross_cats_sorted":["cs.CV","cs.LG","stat.ME"],"title_canon_sha256":"324aa5c8927f61719ba191f6537a2685b3e37d7f90f75ffa0bb4f8b0b2043c55","abstract_canon_sha256":"c937a2021570d8bf64c8dd85cb4f9289812406b683e6b7045b094a2170d7732a"},"schema_version":"1.0"},"canonical_sha256":"dce2b2d64152acaa84c22429430a6f7431fc4da91ebbf70d3548ae9621b29e8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:38.629124Z","signature_b64":"6Qqkcw/7J6ZnUU3+oAlujqjhCu9oEq5s6ltakxu/9AL/rTFvm15sOaoFNDhcJ3U6hd3oHybhllVMCgWqp7E1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dce2b2d64152acaa84c22429430a6f7431fc4da91ebbf70d3548ae9621b29e8a","last_reissued_at":"2026-05-18T01:19:38.628635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:38.628635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02805","source_version":3,"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-18T01:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oN5WKyKf9DGkW4rtBNLVchLWDV2YknyJoSaMSLkM+WvPAtFt4NUpo4RLKV33ARAhiMSWqo6I5tNoD6LTmRJtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:58:41.321721Z"},"content_sha256":"7c6c73b9b8e7d22c394c3a0270424186e5bf8fcb1c70815421614b05b8654246","schema_version":"1.0","event_id":"sha256:7c6c73b9b8e7d22c394c3a0270424186e5bf8fcb1c70815421614b05b8654246"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3TRLFVSBKKWKVBGCEQUUGCTPOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering by Hierarchical Nearest Neighbor Descent (H-NND)","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Teng Qiu, Yongjie Li","submitted_at":"2015-09-09T15:15:44Z","abstract_excerpt":"Previously in 2014, we proposed the Nearest Descent (ND) method, capable of generating an efficient Graph, called the in-tree (IT). Due to some beautiful and effective features, this IT structure proves well suited for data clustering. Although there exist some redundant edges in IT, they usually have salient features and thus it is not hard to remove them.\n  Subsequently, in order to prevent the seemingly redundant edges from occurring, we proposed the Nearest Neighbor Descent (NND) by adding the \"Neighborhood\" constraint on ND. Consequently, clusters automatically emerged, without the additi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02805","kind":"arxiv","version":3},"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-18T01:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tn1rSntohY5ZtSW4TH0vJi2dvwZOCYhgxo3vGDZy9GaInZGKUljyrYZXfG0zwTMyhj0/usd/RNh4qhbukZJLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:58:41.322076Z"},"content_sha256":"10098c97acb266fd6ae12fcab26e32618c2921a7921894dd49e346ac6e1e60d1","schema_version":"1.0","event_id":"sha256:10098c97acb266fd6ae12fcab26e32618c2921a7921894dd49e346ac6e1e60d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TRLFVSBKKWKVBGCEQUUGCTPOQ/bundle.json","state_url":"https://pith.science/pith/3TRLFVSBKKWKVBGCEQUUGCTPOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TRLFVSBKKWKVBGCEQUUGCTPOQ/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-29T01:58:41Z","links":{"resolver":"https://pith.science/pith/3TRLFVSBKKWKVBGCEQUUGCTPOQ","bundle":"https://pith.science/pith/3TRLFVSBKKWKVBGCEQUUGCTPOQ/bundle.json","state":"https://pith.science/pith/3TRLFVSBKKWKVBGCEQUUGCTPOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TRLFVSBKKWKVBGCEQUUGCTPOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3TRLFVSBKKWKVBGCEQUUGCTPOQ","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":"c937a2021570d8bf64c8dd85cb4f9289812406b683e6b7045b094a2170d7732a","cross_cats_sorted":["cs.CV","cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T15:15:44Z","title_canon_sha256":"324aa5c8927f61719ba191f6537a2685b3e37d7f90f75ffa0bb4f8b0b2043c55"},"schema_version":"1.0","source":{"id":"1509.02805","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02805","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02805v3","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02805","created_at":"2026-05-18T01:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"3TRLFVSBKKWK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3TRLFVSBKKWKVBGC","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3TRLFVSB","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:10098c97acb266fd6ae12fcab26e32618c2921a7921894dd49e346ac6e1e60d1","target":"graph","created_at":"2026-05-18T01:19:38Z","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":"Previously in 2014, we proposed the Nearest Descent (ND) method, capable of generating an efficient Graph, called the in-tree (IT). Due to some beautiful and effective features, this IT structure proves well suited for data clustering. Although there exist some redundant edges in IT, they usually have salient features and thus it is not hard to remove them.\n  Subsequently, in order to prevent the seemingly redundant edges from occurring, we proposed the Nearest Neighbor Descent (NND) by adding the \"Neighborhood\" constraint on ND. Consequently, clusters automatically emerged, without the additi","authors_text":"Teng Qiu, Yongjie Li","cross_cats":["cs.CV","cs.LG","stat.ME"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T15:15:44Z","title":"Clustering by Hierarchical Nearest Neighbor Descent (H-NND)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02805","kind":"arxiv","version":3},"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:7c6c73b9b8e7d22c394c3a0270424186e5bf8fcb1c70815421614b05b8654246","target":"record","created_at":"2026-05-18T01:19:38Z","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":"c937a2021570d8bf64c8dd85cb4f9289812406b683e6b7045b094a2170d7732a","cross_cats_sorted":["cs.CV","cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T15:15:44Z","title_canon_sha256":"324aa5c8927f61719ba191f6537a2685b3e37d7f90f75ffa0bb4f8b0b2043c55"},"schema_version":"1.0","source":{"id":"1509.02805","kind":"arxiv","version":3}},"canonical_sha256":"dce2b2d64152acaa84c22429430a6f7431fc4da91ebbf70d3548ae9621b29e8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dce2b2d64152acaa84c22429430a6f7431fc4da91ebbf70d3548ae9621b29e8a","first_computed_at":"2026-05-18T01:19:38.628635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:38.628635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Qqkcw/7J6ZnUU3+oAlujqjhCu9oEq5s6ltakxu/9AL/rTFvm15sOaoFNDhcJ3U6hd3oHybhllVMCgWqp7E1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:38.629124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02805","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c6c73b9b8e7d22c394c3a0270424186e5bf8fcb1c70815421614b05b8654246","sha256:10098c97acb266fd6ae12fcab26e32618c2921a7921894dd49e346ac6e1e60d1"],"state_sha256":"27fdc3cbd4b7e9a96bb61208c659d8c233f1ba9576245ebc828ba0f1f617440c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NezHIEGD8Hm9MMkHVHUFFnSIKhK5x2pO9R58SSEpBHhgk1Zh0gag5SLET/xFcHNP/3HYFzRxUPn3XtUVm6V5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T01:58:41.324045Z","bundle_sha256":"3a19408e9ce335d0f99c5ef9670767856daa0147d364c7e583a4254980677ff9"}}