{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4LUIM3RXB3NU5ARXNNPVD46NCE","short_pith_number":"pith:4LUIM3RX","schema_version":"1.0","canonical_sha256":"e2e8866e370edb4e82376b5f51f3cd113531ce8f2ba37b6ea666b390d1d4df06","source":{"kind":"arxiv","id":"1801.07301","version":2},"attestation_state":"computed","paper":{"title":"Secure $k$-ish Nearest Neighbors Classifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CR"],"primary_cat":"cs.DS","authors_text":"Dan Feldman, Daniela Rus, Hayim Shaul","submitted_at":"2018-01-22T20:11:09Z","abstract_excerpt":"In machine learning, classifiers are used to predict a class of a given query based on an existing (classified) database. Given a database S of n d-dimensional points and a d-dimensional query q, the k-nearest neighbors (kNN) classifier assigns q with the majority class of its k nearest neighbors in S.\n  In the secure version of kNN, S and q are owned by two different parties that do not want to share their data. Unfortunately, all known solutions for secure kNN either require a large communication complexity between the parties, or are very inefficient to run.\n  In this work we present a clas"},"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":"1801.07301","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-22T20:11:09Z","cross_cats_sorted":["cs.CG","cs.CR"],"title_canon_sha256":"dacb4cda30f45ea6e3e27564db8c65c9ffc63e2a85ef046633dc5c28ecd0e0dd","abstract_canon_sha256":"fc5d1a27db7c8d558fd03c52320bcbb6eda97d3b7e48a989c94b1393e791e663"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:31.530261Z","signature_b64":"nEfIS6155ij7vvViaqHWnDibVbLWmcs5aTvlMuGMbsOTpZfXBK9RG2BdGGYbX+CvN/aNY53Bou89OcPk+y69Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2e8866e370edb4e82376b5f51f3cd113531ce8f2ba37b6ea666b390d1d4df06","last_reissued_at":"2026-05-17T23:47:31.529602Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:31.529602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure $k$-ish Nearest Neighbors Classifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CR"],"primary_cat":"cs.DS","authors_text":"Dan Feldman, Daniela Rus, Hayim Shaul","submitted_at":"2018-01-22T20:11:09Z","abstract_excerpt":"In machine learning, classifiers are used to predict a class of a given query based on an existing (classified) database. Given a database S of n d-dimensional points and a d-dimensional query q, the k-nearest neighbors (kNN) classifier assigns q with the majority class of its k nearest neighbors in S.\n  In the secure version of kNN, S and q are owned by two different parties that do not want to share their data. Unfortunately, all known solutions for secure kNN either require a large communication complexity between the parties, or are very inefficient to run.\n  In this work we present a clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07301","kind":"arxiv","version":2},"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":"1801.07301","created_at":"2026-05-17T23:47:31.529699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07301v2","created_at":"2026-05-17T23:47:31.529699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07301","created_at":"2026-05-17T23:47:31.529699+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LUIM3RXB3NU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LUIM3RXB3NU5ARX","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LUIM3RX","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.00546","citing_title":"Lightweight, Practical Encrypted Face Recognition with GPU Support","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE","json":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE.json","graph_json":"https://pith.science/api/pith-number/4LUIM3RXB3NU5ARXNNPVD46NCE/graph.json","events_json":"https://pith.science/api/pith-number/4LUIM3RXB3NU5ARXNNPVD46NCE/events.json","paper":"https://pith.science/paper/4LUIM3RX"},"agent_actions":{"view_html":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE","download_json":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE.json","view_paper":"https://pith.science/paper/4LUIM3RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07301&json=true","fetch_graph":"https://pith.science/api/pith-number/4LUIM3RXB3NU5ARXNNPVD46NCE/graph.json","fetch_events":"https://pith.science/api/pith-number/4LUIM3RXB3NU5ARXNNPVD46NCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE/action/storage_attestation","attest_author":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE/action/author_attestation","sign_citation":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE/action/citation_signature","submit_replication":"https://pith.science/pith/4LUIM3RXB3NU5ARXNNPVD46NCE/action/replication_record"}},"created_at":"2026-05-17T23:47:31.529699+00:00","updated_at":"2026-05-17T23:47:31.529699+00:00"}