{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:KVAWN2HWGNR2PXHTWGBZAOBVTG","short_pith_number":"pith:KVAWN2HW","canonical_record":{"source":{"id":"2305.00578","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-04-30T21:18:20Z","cross_cats_sorted":[],"title_canon_sha256":"81ffd3eab8906a6d75308cbd5b09b06432e1833138c71ba24f420ccc65c52d29","abstract_canon_sha256":"6e3e139c73c4e6f3804866ad6de3f33a9d914baa5fb288f3caada58f5f7c5998"},"schema_version":"1.0"},"canonical_sha256":"554166e8f63363a7dcf3b183903835998b389c5f4a18d878728689c9c11874f3","source":{"kind":"arxiv","id":"2305.00578","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.00578","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2305.00578v3","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00578","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"KVAWN2HWGNR2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KVAWN2HWGNR2PXHT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KVAWN2HW","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:KVAWN2HWGNR2PXHTWGBZAOBVTG","target":"record","payload":{"canonical_record":{"source":{"id":"2305.00578","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-04-30T21:18:20Z","cross_cats_sorted":[],"title_canon_sha256":"81ffd3eab8906a6d75308cbd5b09b06432e1833138c71ba24f420ccc65c52d29","abstract_canon_sha256":"6e3e139c73c4e6f3804866ad6de3f33a9d914baa5fb288f3caada58f5f7c5998"},"schema_version":"1.0"},"canonical_sha256":"554166e8f63363a7dcf3b183903835998b389c5f4a18d878728689c9c11874f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.545950Z","signature_b64":"rcHmojCY/WlhNqydT7hDd+stTxfcnuP12T0+NEzUd/s7F0dTLHGLqc4AwhEXcjeVIfnMB1m+7nbkeernYIDDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"554166e8f63363a7dcf3b183903835998b389c5f4a18d878728689c9c11874f3","last_reissued_at":"2026-05-17T23:39:18.545268Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.545268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.00578","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-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6yuuGCtdbYe9HOTKXxu4KJPiM4q4jwsMc2btvFn/kWWRY+fY6nVh6tjJvjRl7QcY7g9vOGHqwSmUeW624ZiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:58:28.215146Z"},"content_sha256":"0aaae544d7586154d0e91cfb69ca83953b1ecc9dea815afd9723b5e875f23b5b","schema_version":"1.0","event_id":"sha256:0aaae544d7586154d0e91cfb69ca83953b1ecc9dea815afd9723b5e875f23b5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:KVAWN2HWGNR2PXHTWGBZAOBVTG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Dimensional Clustering via Nearest-Neighbor Asymmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Hao Chen, Xiancheng Lin","submitted_at":"2023-04-30T21:18:20Z","abstract_excerpt":"High-dimensional clustering often relies on geometric or local-similarity structure, but the dominant separation between groups may not always be location-based. Differences in dispersion can create asymmetric local-neighborhood patterns: points from a more dispersed component may be closer to points in a more concentrated component than to points from their own component. We turn this high-dimensional phenomenon into a clustering principle. The proposed method, NAC (Nearest-neighbor Asymmetry Clustering), constructs a directed $k$-nearest-neighbor graph and evaluates candidate partitions usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00578","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-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OkA06JX/doMrXnjyigzjZ1ZKJMf60aIutIrMMtF1+zE9PNgXCfEpNKMBEYh+W5bryMr05a753LoYZZzWA1BuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:58:28.215519Z"},"content_sha256":"e03ba901389f3ae6cbf5d186b3995a421ae978d8d9585121a2df44c0f20bd9f7","schema_version":"1.0","event_id":"sha256:e03ba901389f3ae6cbf5d186b3995a421ae978d8d9585121a2df44c0f20bd9f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/bundle.json","state_url":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/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-24T23:58:28Z","links":{"resolver":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG","bundle":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/bundle.json","state":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KVAWN2HWGNR2PXHTWGBZAOBVTG","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":"6e3e139c73c4e6f3804866ad6de3f33a9d914baa5fb288f3caada58f5f7c5998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-04-30T21:18:20Z","title_canon_sha256":"81ffd3eab8906a6d75308cbd5b09b06432e1833138c71ba24f420ccc65c52d29"},"schema_version":"1.0","source":{"id":"2305.00578","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.00578","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2305.00578v3","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00578","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"KVAWN2HWGNR2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KVAWN2HWGNR2PXHT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KVAWN2HW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e03ba901389f3ae6cbf5d186b3995a421ae978d8d9585121a2df44c0f20bd9f7","target":"graph","created_at":"2026-05-17T23:39:18Z","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":"High-dimensional clustering often relies on geometric or local-similarity structure, but the dominant separation between groups may not always be location-based. Differences in dispersion can create asymmetric local-neighborhood patterns: points from a more dispersed component may be closer to points in a more concentrated component than to points from their own component. We turn this high-dimensional phenomenon into a clustering principle. The proposed method, NAC (Nearest-neighbor Asymmetry Clustering), constructs a directed $k$-nearest-neighbor graph and evaluates candidate partitions usin","authors_text":"Hao Chen, Xiancheng Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-04-30T21:18:20Z","title":"High-Dimensional Clustering via Nearest-Neighbor Asymmetry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00578","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:0aaae544d7586154d0e91cfb69ca83953b1ecc9dea815afd9723b5e875f23b5b","target":"record","created_at":"2026-05-17T23:39:18Z","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":"6e3e139c73c4e6f3804866ad6de3f33a9d914baa5fb288f3caada58f5f7c5998","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-04-30T21:18:20Z","title_canon_sha256":"81ffd3eab8906a6d75308cbd5b09b06432e1833138c71ba24f420ccc65c52d29"},"schema_version":"1.0","source":{"id":"2305.00578","kind":"arxiv","version":3}},"canonical_sha256":"554166e8f63363a7dcf3b183903835998b389c5f4a18d878728689c9c11874f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"554166e8f63363a7dcf3b183903835998b389c5f4a18d878728689c9c11874f3","first_computed_at":"2026-05-17T23:39:18.545268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:18.545268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rcHmojCY/WlhNqydT7hDd+stTxfcnuP12T0+NEzUd/s7F0dTLHGLqc4AwhEXcjeVIfnMB1m+7nbkeernYIDDCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:18.545950Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.00578","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0aaae544d7586154d0e91cfb69ca83953b1ecc9dea815afd9723b5e875f23b5b","sha256:e03ba901389f3ae6cbf5d186b3995a421ae978d8d9585121a2df44c0f20bd9f7"],"state_sha256":"5c547962ce490af79c6d6e59a3bece25cfa038efb27d5b4c4ec4e8f988ef032d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4d5qqZoplDGZwBDLw05DifcBv3V15J6blT0b+nrG9Ic5rW9JarnrfJmwGIWERerKh9I1G8XhlSKf9skSe3uyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:58:28.217746Z","bundle_sha256":"6311dddda45b76b7f36fd5034040eed48ab19c045a6d4f1818b095376a9a423f"}}