{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BGSDNIHI7WUSER47YVTCTA3ZFM","short_pith_number":"pith:BGSDNIHI","schema_version":"1.0","canonical_sha256":"09a436a0e8fda922479fc5662983792b31ea73a9fc2e2acf49730874e271d66e","source":{"kind":"arxiv","id":"1402.7063","version":1},"attestation_state":"computed","paper":{"title":"Rapid AkNN Query Processing for Fast Classification of Multidimensional Data in the Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dimitrios Tsoumakos, Evaggelia Pitoura, Giannis Tzimas, Nikolaos Nodarakis, Spyros Sioutas","submitted_at":"2014-02-27T20:46:09Z","abstract_excerpt":"A $k$-nearest neighbor ($k$NN) query determines the $k$ nearest points, using distance metrics, from a specific location. An all $k$-nearest neighbor (A$k$NN) query constitutes a variation of a $k$NN query and retrieves the $k$ nearest points for each point inside a database. Their main usage resonates in spatial databases and they consist the backbone of many location-based applications and not only (i.e. $k$NN joins in databases, classification in data mining). So, it is very crucial to develop methods that answer them efficiently. In this work, we propose a novel method for classifying mult"},"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":"1402.7063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-02-27T20:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"b877868f1ff71c3f15dccfe38752573f8c42c6f95b8be398a1abb89bf4aedb8f","abstract_canon_sha256":"3677b9e93984a84b6310e6e32dbbeb262d203cb0d4677d010dc95c89d54b5602"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:36.342124Z","signature_b64":"V7edrlUaxfmI3R57jfPaMywf7dreVKNCXgyMtj3E54SXsEVdZ0TwfI0shVZNaWlgF6NhzSYPU6D3vW7yLsm6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09a436a0e8fda922479fc5662983792b31ea73a9fc2e2acf49730874e271d66e","last_reissued_at":"2026-05-18T02:57:36.341294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:36.341294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rapid AkNN Query Processing for Fast Classification of Multidimensional Data in the Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dimitrios Tsoumakos, Evaggelia Pitoura, Giannis Tzimas, Nikolaos Nodarakis, Spyros Sioutas","submitted_at":"2014-02-27T20:46:09Z","abstract_excerpt":"A $k$-nearest neighbor ($k$NN) query determines the $k$ nearest points, using distance metrics, from a specific location. An all $k$-nearest neighbor (A$k$NN) query constitutes a variation of a $k$NN query and retrieves the $k$ nearest points for each point inside a database. Their main usage resonates in spatial databases and they consist the backbone of many location-based applications and not only (i.e. $k$NN joins in databases, classification in data mining). So, it is very crucial to develop methods that answer them efficiently. In this work, we propose a novel method for classifying mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7063","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":"1402.7063","created_at":"2026-05-18T02:57:36.341458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7063v1","created_at":"2026-05-18T02:57:36.341458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7063","created_at":"2026-05-18T02:57:36.341458+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGSDNIHI7WUS","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGSDNIHI7WUSER47","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGSDNIHI","created_at":"2026-05-18T12:28:22.404517+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/BGSDNIHI7WUSER47YVTCTA3ZFM","json":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM.json","graph_json":"https://pith.science/api/pith-number/BGSDNIHI7WUSER47YVTCTA3ZFM/graph.json","events_json":"https://pith.science/api/pith-number/BGSDNIHI7WUSER47YVTCTA3ZFM/events.json","paper":"https://pith.science/paper/BGSDNIHI"},"agent_actions":{"view_html":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM","download_json":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM.json","view_paper":"https://pith.science/paper/BGSDNIHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7063&json=true","fetch_graph":"https://pith.science/api/pith-number/BGSDNIHI7WUSER47YVTCTA3ZFM/graph.json","fetch_events":"https://pith.science/api/pith-number/BGSDNIHI7WUSER47YVTCTA3ZFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM/action/storage_attestation","attest_author":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM/action/author_attestation","sign_citation":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM/action/citation_signature","submit_replication":"https://pith.science/pith/BGSDNIHI7WUSER47YVTCTA3ZFM/action/replication_record"}},"created_at":"2026-05-18T02:57:36.341458+00:00","updated_at":"2026-05-18T02:57:36.341458+00:00"}