{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FC4XWAKUTYZMRVYCPKEIBS2C4J","short_pith_number":"pith:FC4XWAKU","schema_version":"1.0","canonical_sha256":"28b97b01549e32c8d7027a8880cb42e26ca21666e247acdd5ec59afcf1573f72","source":{"kind":"arxiv","id":"1411.0894","version":2},"attestation_state":"computed","paper":{"title":"Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Cl\\'ement Marteau, S\\'ebastien Gadat, Thierry Klein","submitted_at":"2014-11-04T13:05:08Z","abstract_excerpt":"Given an $n$-sample of random vectors $(X_i,Y_i)_{1 \\leq i \\leq n}$ whose joint law is unknown, the long-standing problem of supervised classification aims to \\textit{optimally} predict the label $Y$ of a given a new observation $X$. In this context, the nearest neighbor rule is a popular flexible and intuitive method in non-parametric situations.\n  Even if this algorithm is commonly used in the machine learning and statistics communities, less is known about its prediction ability in general finite dimensional spaces, especially when the support of the density of the observations is $\\mathbb{"},"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":"1411.0894","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.ST","submitted_at":"2014-11-04T13:05:08Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"166f4a1e96cae036e36ee6606196ae51890323dd5a0074d9c5b62824208b3489","abstract_canon_sha256":"dfa1905bdfd846aeca7431b195e9235e26601306b8e45d3613315b36595bc843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:36.412353Z","signature_b64":"rWIbrdNXlBBP7C8s3N9IrOHMPOYZNIxbmWIcklf1n1ZkZlW/ylOiUKlSan4zMIqYAQKGxHgadt87ALPt1lblCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b97b01549e32c8d7027a8880cb42e26ca21666e247acdd5ec59afcf1573f72","last_reissued_at":"2026-05-18T02:38:36.411692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:36.411692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification with the nearest neighbor rule in general finite dimensional spaces: necessary and sufficient conditions","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Cl\\'ement Marteau, S\\'ebastien Gadat, Thierry Klein","submitted_at":"2014-11-04T13:05:08Z","abstract_excerpt":"Given an $n$-sample of random vectors $(X_i,Y_i)_{1 \\leq i \\leq n}$ whose joint law is unknown, the long-standing problem of supervised classification aims to \\textit{optimally} predict the label $Y$ of a given a new observation $X$. In this context, the nearest neighbor rule is a popular flexible and intuitive method in non-parametric situations.\n  Even if this algorithm is commonly used in the machine learning and statistics communities, less is known about its prediction ability in general finite dimensional spaces, especially when the support of the density of the observations is $\\mathbb{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0894","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":"1411.0894","created_at":"2026-05-18T02:38:36.411784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0894v2","created_at":"2026-05-18T02:38:36.411784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0894","created_at":"2026-05-18T02:38:36.411784+00:00"},{"alias_kind":"pith_short_12","alias_value":"FC4XWAKUTYZM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FC4XWAKUTYZMRVYC","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FC4XWAKU","created_at":"2026-05-18T12:28:28.263976+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/FC4XWAKUTYZMRVYCPKEIBS2C4J","json":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J.json","graph_json":"https://pith.science/api/pith-number/FC4XWAKUTYZMRVYCPKEIBS2C4J/graph.json","events_json":"https://pith.science/api/pith-number/FC4XWAKUTYZMRVYCPKEIBS2C4J/events.json","paper":"https://pith.science/paper/FC4XWAKU"},"agent_actions":{"view_html":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J","download_json":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J.json","view_paper":"https://pith.science/paper/FC4XWAKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0894&json=true","fetch_graph":"https://pith.science/api/pith-number/FC4XWAKUTYZMRVYCPKEIBS2C4J/graph.json","fetch_events":"https://pith.science/api/pith-number/FC4XWAKUTYZMRVYCPKEIBS2C4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J/action/storage_attestation","attest_author":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J/action/author_attestation","sign_citation":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J/action/citation_signature","submit_replication":"https://pith.science/pith/FC4XWAKUTYZMRVYCPKEIBS2C4J/action/replication_record"}},"created_at":"2026-05-18T02:38:36.411784+00:00","updated_at":"2026-05-18T02:38:36.411784+00:00"}