{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LZHDPNSXO5MGZAUY5R6R6PAAZ5","short_pith_number":"pith:LZHDPNSX","canonical_record":{"source":{"id":"1811.05062","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-13T01:44:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"60d334b3657b6a1f90b241a398eecf0fb7644d341f9147f94c49f4fb82f75948","abstract_canon_sha256":"797041ec445d7a048fc35605aa03b18f7454bd623d3433c5bfbf7c839ccb49ef"},"schema_version":"1.0"},"canonical_sha256":"5e4e37b65777586c8298ec7d1f3c00cf692900f6d29bab7000f1a0a1e9157a18","source":{"kind":"arxiv","id":"1811.05062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05062","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05062v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05062","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"LZHDPNSXO5MG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZHDPNSXO5MGZAUY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZHDPNSX","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LZHDPNSXO5MGZAUY5R6R6PAAZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05062","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-13T01:44:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"60d334b3657b6a1f90b241a398eecf0fb7644d341f9147f94c49f4fb82f75948","abstract_canon_sha256":"797041ec445d7a048fc35605aa03b18f7454bd623d3433c5bfbf7c839ccb49ef"},"schema_version":"1.0"},"canonical_sha256":"5e4e37b65777586c8298ec7d1f3c00cf692900f6d29bab7000f1a0a1e9157a18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:01.314574Z","signature_b64":"1njwEC7zIDC3TH4wDVLo4QSFFY3CkbM8GydNzvg0zkP3Zglu7NHUkkDu91/3xMbDc8KBOmYod34OUB/dMB6xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e4e37b65777586c8298ec7d1f3c00cf692900f6d29bab7000f1a0a1e9157a18","last_reissued_at":"2026-05-18T00:01:01.313943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:01.313943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05062","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yySOzaZdy8mOP5tyuKGOBcOK91p0XXrEpVBApyIUnbFXsDAtu9CeX/sOW5kNN9VTdGMN+We0+PB5rNytwLh+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:37:59.325835Z"},"content_sha256":"ed3a9a4281060d7c069d992a44149542d084a30f46f469196965cb474a634508","schema_version":"1.0","event_id":"sha256:ed3a9a4281060d7c069d992a44149542d084a30f46f469196965cb474a634508"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LZHDPNSXO5MGZAUY5R6R6PAAZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Feature Scaling for K-Nearest Neighbor Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chandrasekaran Anirudh Bhardwaj, Kalyani Desikan, Megha Mishra","submitted_at":"2018-11-13T01:44:55Z","abstract_excerpt":"Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selection process for neighbors in the Hermitian space is done with the help of distance metrics such as Euclidean distance, Minkowski distance, Mahalanobis distance etc. A majority of the metrics such as Euclidean distance are scale variant, meaning that the results could vary for diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05062","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mcp/Vt5pJDdJIDICRBxV2cGxOH2mzU+Fhb1nt7iuULq2rNBMCnoJippMGHgwofIWQA8rJ6sJV3t5vkcT+BR0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:37:59.326172Z"},"content_sha256":"5610d42a4b5d09981c807728a486bb7fe0c51234f5ea07798285f86e6e79b59d","schema_version":"1.0","event_id":"sha256:5610d42a4b5d09981c807728a486bb7fe0c51234f5ea07798285f86e6e79b59d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZHDPNSXO5MGZAUY5R6R6PAAZ5/bundle.json","state_url":"https://pith.science/pith/LZHDPNSXO5MGZAUY5R6R6PAAZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZHDPNSXO5MGZAUY5R6R6PAAZ5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T23:37:59Z","links":{"resolver":"https://pith.science/pith/LZHDPNSXO5MGZAUY5R6R6PAAZ5","bundle":"https://pith.science/pith/LZHDPNSXO5MGZAUY5R6R6PAAZ5/bundle.json","state":"https://pith.science/pith/LZHDPNSXO5MGZAUY5R6R6PAAZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZHDPNSXO5MGZAUY5R6R6PAAZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LZHDPNSXO5MGZAUY5R6R6PAAZ5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"797041ec445d7a048fc35605aa03b18f7454bd623d3433c5bfbf7c839ccb49ef","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-13T01:44:55Z","title_canon_sha256":"60d334b3657b6a1f90b241a398eecf0fb7644d341f9147f94c49f4fb82f75948"},"schema_version":"1.0","source":{"id":"1811.05062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05062","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05062v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05062","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"LZHDPNSXO5MG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LZHDPNSXO5MGZAUY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LZHDPNSX","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:5610d42a4b5d09981c807728a486bb7fe0c51234f5ea07798285f86e6e79b59d","target":"graph","created_at":"2026-05-18T00:01:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selection process for neighbors in the Hermitian space is done with the help of distance metrics such as Euclidean distance, Minkowski distance, Mahalanobis distance etc. A majority of the metrics such as Euclidean distance are scale variant, meaning that the results could vary for diff","authors_text":"Chandrasekaran Anirudh Bhardwaj, Kalyani Desikan, Megha Mishra","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-13T01:44:55Z","title":"Dynamic Feature Scaling for K-Nearest Neighbor Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05062","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ed3a9a4281060d7c069d992a44149542d084a30f46f469196965cb474a634508","target":"record","created_at":"2026-05-18T00:01:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"797041ec445d7a048fc35605aa03b18f7454bd623d3433c5bfbf7c839ccb49ef","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-13T01:44:55Z","title_canon_sha256":"60d334b3657b6a1f90b241a398eecf0fb7644d341f9147f94c49f4fb82f75948"},"schema_version":"1.0","source":{"id":"1811.05062","kind":"arxiv","version":1}},"canonical_sha256":"5e4e37b65777586c8298ec7d1f3c00cf692900f6d29bab7000f1a0a1e9157a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e4e37b65777586c8298ec7d1f3c00cf692900f6d29bab7000f1a0a1e9157a18","first_computed_at":"2026-05-18T00:01:01.313943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:01.313943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1njwEC7zIDC3TH4wDVLo4QSFFY3CkbM8GydNzvg0zkP3Zglu7NHUkkDu91/3xMbDc8KBOmYod34OUB/dMB6xDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:01.314574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed3a9a4281060d7c069d992a44149542d084a30f46f469196965cb474a634508","sha256:5610d42a4b5d09981c807728a486bb7fe0c51234f5ea07798285f86e6e79b59d"],"state_sha256":"6e56c672429083db64d5392e3b9c0355145ea8801e52fe1db1c726af2b8b467f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1/XW7r3wcL9059h2jRVV5zgRT3hX32Vaxp1ZAM5mW4y7xGH6IbGZw70m451x1ajyQcw/HVNvuav85PxrJoOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:37:59.328051Z","bundle_sha256":"e9e7fb24d8ff71a2dffa8d836f33d2de9970a43a4faccc32ce535339ab0a695b"}}