{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VWFKNL4BAFMIW3KY3LBWIDMGAO","short_pith_number":"pith:VWFKNL4B","schema_version":"1.0","canonical_sha256":"ad8aa6af8101588b6d58dac3640d8603bdd9b473f1651769229802b7dba3f755","source":{"kind":"arxiv","id":"1601.05904","version":1},"attestation_state":"computed","paper":{"title":"Improving GPU-accelerated Adaptive IDW Interpolation Algorithm Using Fast kNN Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gang Mei, Liangliang Xu, Nengxiong Xu","submitted_at":"2016-01-22T08:19:39Z","abstract_excerpt":"This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-Nearest Neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN searc"},"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":"1601.05904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-22T08:19:39Z","cross_cats_sorted":[],"title_canon_sha256":"fba116458581a99f14115bfe725c945f47503ceaefb00266a47c5e5e2673efd3","abstract_canon_sha256":"4d5f865f873ffd9371439ea35fe13549460bad205c7f8459d62e53a5a9d0c23d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:55.985609Z","signature_b64":"1pbhLoQtRe5kUgVtSXRjXRJ6mUQtCOX9hLai8qRBt97McrpoBrgfQYIZFN+d6FqMeLClUjZNnA9cO0HTvVDPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad8aa6af8101588b6d58dac3640d8603bdd9b473f1651769229802b7dba3f755","last_reissued_at":"2026-05-18T01:04:55.984982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:55.984982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving GPU-accelerated Adaptive IDW Interpolation Algorithm Using Fast kNN Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gang Mei, Liangliang Xu, Nengxiong Xu","submitted_at":"2016-01-22T08:19:39Z","abstract_excerpt":"This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-Nearest Neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN searc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05904","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":"1601.05904","created_at":"2026-05-18T01:04:55.985077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05904v1","created_at":"2026-05-18T01:04:55.985077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05904","created_at":"2026-05-18T01:04:55.985077+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWFKNL4BAFMI","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWFKNL4BAFMIW3KY","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWFKNL4B","created_at":"2026-05-18T12:30:48.956258+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/VWFKNL4BAFMIW3KY3LBWIDMGAO","json":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO.json","graph_json":"https://pith.science/api/pith-number/VWFKNL4BAFMIW3KY3LBWIDMGAO/graph.json","events_json":"https://pith.science/api/pith-number/VWFKNL4BAFMIW3KY3LBWIDMGAO/events.json","paper":"https://pith.science/paper/VWFKNL4B"},"agent_actions":{"view_html":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO","download_json":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO.json","view_paper":"https://pith.science/paper/VWFKNL4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05904&json=true","fetch_graph":"https://pith.science/api/pith-number/VWFKNL4BAFMIW3KY3LBWIDMGAO/graph.json","fetch_events":"https://pith.science/api/pith-number/VWFKNL4BAFMIW3KY3LBWIDMGAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO/action/storage_attestation","attest_author":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO/action/author_attestation","sign_citation":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO/action/citation_signature","submit_replication":"https://pith.science/pith/VWFKNL4BAFMIW3KY3LBWIDMGAO/action/replication_record"}},"created_at":"2026-05-18T01:04:55.985077+00:00","updated_at":"2026-05-18T01:04:55.985077+00:00"}