{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XZ4GEKDWTSUYONRAEFG54UVIM2","short_pith_number":"pith:XZ4GEKDW","schema_version":"1.0","canonical_sha256":"be786228769ca9873620214dde52a8669e19f10fa5396222e4d30b0de18f67c5","source":{"kind":"arxiv","id":"1607.08220","version":1},"attestation_state":"computed","paper":{"title":"PANDA: Extreme Scale Parallel K-Nearest Neighbor on Distributed Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Craig Tull, Evan Racah, Jialin Liu, Md. Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram, Peter Sadowski, Prabhat, Pradeep Dubey, Suren Byna, Wahid Bhimji","submitted_at":"2016-07-27T19:13:07Z","abstract_excerpt":"Computing $k$-Nearest Neighbors (KNN) is one of the core kernels used in many machine learning, data mining and scientific computing applications. Although kd-tree based $O(\\log n)$ algorithms have been proposed for computing KNN, due to its inherent sequentiality, linear algorithms are being used in practice. This limits the applicability of such methods to millions of data points, with limited scalability for Big Data analytics challenges in the scientific domain. In this paper, we present parallel and highly optimized kd-tree based KNN algorithms (both construction and querying) suitable fo"},"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":"1607.08220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-27T19:13:07Z","cross_cats_sorted":[],"title_canon_sha256":"5c8330c95b877f6378ed6ce922855f008499a49feb0e7d3e61a66def045e6ed9","abstract_canon_sha256":"86cc81488abce396fad6d6ab59db8a67f77441656a820e865c5ab2ce831d704c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:28.655371Z","signature_b64":"FP2me3UDvCvicOM+Yq8i1zztsXLZpGvTNRgm673t5qJ2vM5Cc2jR5Uc1m/x7D7Ll3dinjLa71xOjUrq8MgCrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be786228769ca9873620214dde52a8669e19f10fa5396222e4d30b0de18f67c5","last_reissued_at":"2026-05-18T00:58:28.654773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:28.654773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PANDA: Extreme Scale Parallel K-Nearest Neighbor on Distributed Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Craig Tull, Evan Racah, Jialin Liu, Md. Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram, Peter Sadowski, Prabhat, Pradeep Dubey, Suren Byna, Wahid Bhimji","submitted_at":"2016-07-27T19:13:07Z","abstract_excerpt":"Computing $k$-Nearest Neighbors (KNN) is one of the core kernels used in many machine learning, data mining and scientific computing applications. Although kd-tree based $O(\\log n)$ algorithms have been proposed for computing KNN, due to its inherent sequentiality, linear algorithms are being used in practice. This limits the applicability of such methods to millions of data points, with limited scalability for Big Data analytics challenges in the scientific domain. In this paper, we present parallel and highly optimized kd-tree based KNN algorithms (both construction and querying) suitable fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08220","kind":"arxiv","version":1},"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":"1607.08220","created_at":"2026-05-18T00:58:28.654857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08220v1","created_at":"2026-05-18T00:58:28.654857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08220","created_at":"2026-05-18T00:58:28.654857+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZ4GEKDWTSUY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZ4GEKDWTSUYONRA","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZ4GEKDW","created_at":"2026-05-18T12:30:51.357362+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/XZ4GEKDWTSUYONRAEFG54UVIM2","json":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2.json","graph_json":"https://pith.science/api/pith-number/XZ4GEKDWTSUYONRAEFG54UVIM2/graph.json","events_json":"https://pith.science/api/pith-number/XZ4GEKDWTSUYONRAEFG54UVIM2/events.json","paper":"https://pith.science/paper/XZ4GEKDW"},"agent_actions":{"view_html":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2","download_json":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2.json","view_paper":"https://pith.science/paper/XZ4GEKDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08220&json=true","fetch_graph":"https://pith.science/api/pith-number/XZ4GEKDWTSUYONRAEFG54UVIM2/graph.json","fetch_events":"https://pith.science/api/pith-number/XZ4GEKDWTSUYONRAEFG54UVIM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2/action/storage_attestation","attest_author":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2/action/author_attestation","sign_citation":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2/action/citation_signature","submit_replication":"https://pith.science/pith/XZ4GEKDWTSUYONRAEFG54UVIM2/action/replication_record"}},"created_at":"2026-05-18T00:58:28.654857+00:00","updated_at":"2026-05-18T00:58:28.654857+00:00"}