{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6EHGGBR4XYPFUNSAUDRM3OBVZL","short_pith_number":"pith:6EHGGBR4","canonical_record":{"source":{"id":"1312.3386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-12T02:37:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c8dcda193b3bd217c5d11cb4d5887d22a0c6d1395d57e4b644f19595de64fe41","abstract_canon_sha256":"e54183da59e48ed5b1b08cfd153ae23cce2f8a7c0b0a8b4b9d93bb96904ee243"},"schema_version":"1.0"},"canonical_sha256":"f10e63063cbe1e5a3640a0e2cdb835cacf124523f16d512c5fe00753b217b144","source":{"kind":"arxiv","id":"1312.3386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3386","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3386v2","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3386","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"6EHGGBR4XYPF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6EHGGBR4XYPFUNSA","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6EHGGBR4","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6EHGGBR4XYPFUNSAUDRM3OBVZL","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-12T02:37:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c8dcda193b3bd217c5d11cb4d5887d22a0c6d1395d57e4b644f19595de64fe41","abstract_canon_sha256":"e54183da59e48ed5b1b08cfd153ae23cce2f8a7c0b0a8b4b9d93bb96904ee243"},"schema_version":"1.0"},"canonical_sha256":"f10e63063cbe1e5a3640a0e2cdb835cacf124523f16d512c5fe00753b217b144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:46.677941Z","signature_b64":"vqAQER9UB3XieQ9uWmtSNKmra4FTKF9hdMLCRFIXMICHCSvw1A62be1WDgWP78ucHiFl2qOWY70TQanY8Q5RBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f10e63063cbe1e5a3640a0e2cdb835cacf124523f16d512c5fe00753b217b144","last_reissued_at":"2026-05-18T03:03:46.677362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:46.677362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3386","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-18T03:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSg3Q/MPuKoJhNg2H7oMarhSf+/Hx1T/AGAONCGT4NTkUiPm7A248FJzWiK7fZfhdhrm9biozkqRs2Pv6bsBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:02:08.752774Z"},"content_sha256":"517cc955ac0208fd70dad08653adcfcfc3d76005fdd143edec042327604b721f","schema_version":"1.0","event_id":"sha256:517cc955ac0208fd70dad08653adcfcfc3d76005fdd143edec042327604b721f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6EHGGBR4XYPFUNSAUDRM3OBVZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering for high-dimension, low-sample size data using distance vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Yoshikazu Terada","submitted_at":"2013-12-12T02:37:36Z","abstract_excerpt":"In high-dimension, low-sample size (HDLSS) data, it is not always true that closeness of two objects reflects a hidden cluster structure. We point out the important fact that it is not the closeness, but the \"values\" of distance that contain information of the cluster structure in high-dimensional space. Based on this fact, we propose an efficient and simple clustering approach, called distance vector clustering, for HDLSS data. Under the assumptions given in the work of Hall et al. (2005), we show the proposed approach provides a true cluster label under milder conditions when the dimension t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3386","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-18T03:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPLR49v/Wqlm2uXFOkERgSUQt/9Bj1T3f7jkN+khzRnWkvRkO5E0IMj6e8QAp4rW67gqN7PmycyLXzL3Pug8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:02:08.753496Z"},"content_sha256":"400ac8246e6ffbe3bbea9007e069cf9f067a546147813275d0aec955beb83c5e","schema_version":"1.0","event_id":"sha256:400ac8246e6ffbe3bbea9007e069cf9f067a546147813275d0aec955beb83c5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EHGGBR4XYPFUNSAUDRM3OBVZL/bundle.json","state_url":"https://pith.science/pith/6EHGGBR4XYPFUNSAUDRM3OBVZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EHGGBR4XYPFUNSAUDRM3OBVZL/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-05T20:02:08Z","links":{"resolver":"https://pith.science/pith/6EHGGBR4XYPFUNSAUDRM3OBVZL","bundle":"https://pith.science/pith/6EHGGBR4XYPFUNSAUDRM3OBVZL/bundle.json","state":"https://pith.science/pith/6EHGGBR4XYPFUNSAUDRM3OBVZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EHGGBR4XYPFUNSAUDRM3OBVZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6EHGGBR4XYPFUNSAUDRM3OBVZL","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":"e54183da59e48ed5b1b08cfd153ae23cce2f8a7c0b0a8b4b9d93bb96904ee243","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-12T02:37:36Z","title_canon_sha256":"c8dcda193b3bd217c5d11cb4d5887d22a0c6d1395d57e4b644f19595de64fe41"},"schema_version":"1.0","source":{"id":"1312.3386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3386","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3386v2","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3386","created_at":"2026-05-18T03:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"6EHGGBR4XYPF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6EHGGBR4XYPFUNSA","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6EHGGBR4","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:400ac8246e6ffbe3bbea9007e069cf9f067a546147813275d0aec955beb83c5e","target":"graph","created_at":"2026-05-18T03:03:46Z","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":"In high-dimension, low-sample size (HDLSS) data, it is not always true that closeness of two objects reflects a hidden cluster structure. We point out the important fact that it is not the closeness, but the \"values\" of distance that contain information of the cluster structure in high-dimensional space. Based on this fact, we propose an efficient and simple clustering approach, called distance vector clustering, for HDLSS data. Under the assumptions given in the work of Hall et al. (2005), we show the proposed approach provides a true cluster label under milder conditions when the dimension t","authors_text":"Yoshikazu Terada","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-12T02:37:36Z","title":"Clustering for high-dimension, low-sample size data using distance vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3386","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:517cc955ac0208fd70dad08653adcfcfc3d76005fdd143edec042327604b721f","target":"record","created_at":"2026-05-18T03:03:46Z","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":"e54183da59e48ed5b1b08cfd153ae23cce2f8a7c0b0a8b4b9d93bb96904ee243","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-12T02:37:36Z","title_canon_sha256":"c8dcda193b3bd217c5d11cb4d5887d22a0c6d1395d57e4b644f19595de64fe41"},"schema_version":"1.0","source":{"id":"1312.3386","kind":"arxiv","version":2}},"canonical_sha256":"f10e63063cbe1e5a3640a0e2cdb835cacf124523f16d512c5fe00753b217b144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f10e63063cbe1e5a3640a0e2cdb835cacf124523f16d512c5fe00753b217b144","first_computed_at":"2026-05-18T03:03:46.677362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:46.677362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqAQER9UB3XieQ9uWmtSNKmra4FTKF9hdMLCRFIXMICHCSvw1A62be1WDgWP78ucHiFl2qOWY70TQanY8Q5RBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:46.677941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:517cc955ac0208fd70dad08653adcfcfc3d76005fdd143edec042327604b721f","sha256:400ac8246e6ffbe3bbea9007e069cf9f067a546147813275d0aec955beb83c5e"],"state_sha256":"56438ca4573861b4d38c08d4aecd7bb36650525dad16cf16051cda54252bc63e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ly0dFPwKj7WvtYZO8h3d19OfA2Gm+xAupJ8CW+kszLRjpwenRBIdyZ2Ibcvy6Gc2JxREfp/yvTmvHduBEuCSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:02:08.758307Z","bundle_sha256":"e2c43693f1aaef50a8ced5fb6bb7fe68bf2586e4cb7e1b0d63811de966ff9b76"}}