{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KVAWN2HWGNR2PXHTWGBZAOBVTG","short_pith_number":"pith:KVAWN2HW","schema_version":"1.0","canonical_sha256":"554166e8f63363a7dcf3b183903835998b389c5f4a18d878728689c9c11874f3","source":{"kind":"arxiv","id":"2305.00578","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.00578","created_at":"2026-05-17T23:39:18.545380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.00578v3","created_at":"2026-05-17T23:39:18.545380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00578","created_at":"2026-05-17T23:39:18.545380+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVAWN2HWGNR2","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVAWN2HWGNR2PXHT","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVAWN2HW","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG","json":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG.json","graph_json":"https://pith.science/api/pith-number/KVAWN2HWGNR2PXHTWGBZAOBVTG/graph.json","events_json":"https://pith.science/api/pith-number/KVAWN2HWGNR2PXHTWGBZAOBVTG/events.json","paper":"https://pith.science/paper/KVAWN2HW"},"agent_actions":{"view_html":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG","download_json":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG.json","view_paper":"https://pith.science/paper/KVAWN2HW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.00578&json=true","fetch_graph":"https://pith.science/api/pith-number/KVAWN2HWGNR2PXHTWGBZAOBVTG/graph.json","fetch_events":"https://pith.science/api/pith-number/KVAWN2HWGNR2PXHTWGBZAOBVTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/action/storage_attestation","attest_author":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/action/author_attestation","sign_citation":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/action/citation_signature","submit_replication":"https://pith.science/pith/KVAWN2HWGNR2PXHTWGBZAOBVTG/action/replication_record"}},"created_at":"2026-05-17T23:39:18.545380+00:00","updated_at":"2026-05-17T23:39:18.545380+00:00"}