{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7WD4PZ7NN2NDKLM6Y4LARD3SWJ","short_pith_number":"pith:7WD4PZ7N","schema_version":"1.0","canonical_sha256":"fd87c7e7ed6e9a352d9ec716088f72b27acdee9b9b6750405b255977b1b34aca","source":{"kind":"arxiv","id":"1802.08465","version":2},"attestation_state":"computed","paper":{"title":"AEkNN: An AutoEncoder kNN-based classifier with built-in dimensionality reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Antonio J. Rivera, Francisco Charte, Francisco J. Pulgar, Mar\\'ia J. del Jesus","submitted_at":"2018-02-23T10:02:02Z","abstract_excerpt":"High dimensionality, i.e. data having a large number of variables, tends to be a challenge for most machine learning tasks, including classification. A classifier usually builds a model representing how a set of inputs explain the outputs. The larger is the set of inputs and/or outputs, the more complex would be that model. There is a family of classification algorithms, known as lazy learning methods, which does not build a model. One of the best known members of this family is the kNN algorithm. Its strategy relies on searching a set of nearest neighbors, using the input variables as positio"},"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":"1802.08465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-23T10:02:02Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"e32e81cb908c2fcd5bbb5b5e0186fad66978c1f7948e8c4bcf432d09b074a755","abstract_canon_sha256":"11f2ec85739409319b39a3271eb68ad660730d7e71f1d4c05e7dd349483b340d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:40.271927Z","signature_b64":"8mZU+nf6b4suRIeHAiG5q5M2SNEq2Qgdjbq1L4wsJcGjriQneE54vIAUe7ZgUafkkmS41+AEv5ihzbbUMINJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd87c7e7ed6e9a352d9ec716088f72b27acdee9b9b6750405b255977b1b34aca","last_reissued_at":"2026-05-18T00:21:40.271286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:40.271286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AEkNN: An AutoEncoder kNN-based classifier with built-in dimensionality reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Antonio J. Rivera, Francisco Charte, Francisco J. Pulgar, Mar\\'ia J. del Jesus","submitted_at":"2018-02-23T10:02:02Z","abstract_excerpt":"High dimensionality, i.e. data having a large number of variables, tends to be a challenge for most machine learning tasks, including classification. A classifier usually builds a model representing how a set of inputs explain the outputs. The larger is the set of inputs and/or outputs, the more complex would be that model. There is a family of classification algorithms, known as lazy learning methods, which does not build a model. One of the best known members of this family is the kNN algorithm. Its strategy relies on searching a set of nearest neighbors, using the input variables as positio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08465","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":"1802.08465","created_at":"2026-05-18T00:21:40.271386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08465v2","created_at":"2026-05-18T00:21:40.271386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08465","created_at":"2026-05-18T00:21:40.271386+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WD4PZ7NN2ND","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WD4PZ7NN2NDKLM6","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WD4PZ7N","created_at":"2026-05-18T12:32:11.075285+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/7WD4PZ7NN2NDKLM6Y4LARD3SWJ","json":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ.json","graph_json":"https://pith.science/api/pith-number/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/graph.json","events_json":"https://pith.science/api/pith-number/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/events.json","paper":"https://pith.science/paper/7WD4PZ7N"},"agent_actions":{"view_html":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ","download_json":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ.json","view_paper":"https://pith.science/paper/7WD4PZ7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08465&json=true","fetch_graph":"https://pith.science/api/pith-number/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/action/storage_attestation","attest_author":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/action/author_attestation","sign_citation":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/action/citation_signature","submit_replication":"https://pith.science/pith/7WD4PZ7NN2NDKLM6Y4LARD3SWJ/action/replication_record"}},"created_at":"2026-05-18T00:21:40.271386+00:00","updated_at":"2026-05-18T00:21:40.271386+00:00"}