{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GUZI2PM5Y5EW4G6S7UC5D3SGTE","short_pith_number":"pith:GUZI2PM5","schema_version":"1.0","canonical_sha256":"35328d3d9dc7496e1bd2fd05d1ee46990eba97288219479d6e8eaa21c08b4c7b","source":{"kind":"arxiv","id":"2312.03940","version":3},"attestation_state":"computed","paper":{"title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Joshua Engels, Julian Shun, Shangdi Yu, Yihao Huang","submitted_at":"2023-12-06T22:43:50Z","abstract_excerpt":"This paper studies density-based clustering of point sets. These methods use dense regions of points to detect clusters of arbitrary shapes. In particular, we study variants of density peaks clustering, a popular type of algorithm that has been shown to work well in practice. Our goal is to cluster large high-dimensional datasets, which are prevalent in practice. Prior solutions are either sequential, and cannot scale to large data, or are specialized for low-dimensional data.\n  This paper unifies the different variants of density peaks clustering into a single framework, PECANN, by abstractin"},"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":"2312.03940","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-06T22:43:50Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"a35aceadbdba30ba629de6e5f4e807eebae0ec867e6534d0c832a4b75646e81f","abstract_canon_sha256":"99096471e83f41e5e9bd67919e36beea05666c3acfb424ad7ea8bd7cef3d436a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:46.277830Z","signature_b64":"mZjVjFwns5OIkjT1OqywqxGjUg2z88Wx2iNKELgT8tP+s9ARn/EYNQgywT22AkkLdtu1KU/pcUje55svJGGMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35328d3d9dc7496e1bd2fd05d1ee46990eba97288219479d6e8eaa21c08b4c7b","last_reissued_at":"2026-07-05T11:14:46.277382Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:46.277382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Joshua Engels, Julian Shun, Shangdi Yu, Yihao Huang","submitted_at":"2023-12-06T22:43:50Z","abstract_excerpt":"This paper studies density-based clustering of point sets. These methods use dense regions of points to detect clusters of arbitrary shapes. In particular, we study variants of density peaks clustering, a popular type of algorithm that has been shown to work well in practice. Our goal is to cluster large high-dimensional datasets, which are prevalent in practice. Prior solutions are either sequential, and cannot scale to large data, or are specialized for low-dimensional data.\n  This paper unifies the different variants of density peaks clustering into a single framework, PECANN, by abstractin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03940","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.03940/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2312.03940","created_at":"2026-07-05T11:14:46.277443+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.03940v3","created_at":"2026-07-05T11:14:46.277443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03940","created_at":"2026-07-05T11:14:46.277443+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUZI2PM5Y5EW","created_at":"2026-07-05T11:14:46.277443+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUZI2PM5Y5EW4G6S","created_at":"2026-07-05T11:14:46.277443+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUZI2PM5","created_at":"2026-07-05T11:14:46.277443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17094","citing_title":"PathWeaver: A High-Throughput Multi-GPU System for Graph-Based Approximate Nearest Neighbor Search","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE","json":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE.json","graph_json":"https://pith.science/api/pith-number/GUZI2PM5Y5EW4G6S7UC5D3SGTE/graph.json","events_json":"https://pith.science/api/pith-number/GUZI2PM5Y5EW4G6S7UC5D3SGTE/events.json","paper":"https://pith.science/paper/GUZI2PM5"},"agent_actions":{"view_html":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE","download_json":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE.json","view_paper":"https://pith.science/paper/GUZI2PM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.03940&json=true","fetch_graph":"https://pith.science/api/pith-number/GUZI2PM5Y5EW4G6S7UC5D3SGTE/graph.json","fetch_events":"https://pith.science/api/pith-number/GUZI2PM5Y5EW4G6S7UC5D3SGTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE/action/storage_attestation","attest_author":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE/action/author_attestation","sign_citation":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE/action/citation_signature","submit_replication":"https://pith.science/pith/GUZI2PM5Y5EW4G6S7UC5D3SGTE/action/replication_record"}},"created_at":"2026-07-05T11:14:46.277443+00:00","updated_at":"2026-07-05T11:14:46.277443+00:00"}