{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PF555TYELBQUNPSGYOI3Z4EENH","short_pith_number":"pith:PF555TYE","canonical_record":{"source":{"id":"1606.00985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T07:09:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a092f2f6b6cd0fa5eba6dabebeabd2545e3e401135e9fad93f44e97a3514e6b2","abstract_canon_sha256":"236dd3c89dde1a637b784577f0997ec809c04de87a0f7c44f5992148f7317c49"},"schema_version":"1.0"},"canonical_sha256":"797bdecf04586146be46c391bcf08469ef1e5839e53cda236dccffbcc9d39903","source":{"kind":"arxiv","id":"1606.00985","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00985","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00985v1","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00985","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"PF555TYELBQU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PF555TYELBQUNPSG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PF555TYE","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PF555TYELBQUNPSGYOI3Z4EENH","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T07:09:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a092f2f6b6cd0fa5eba6dabebeabd2545e3e401135e9fad93f44e97a3514e6b2","abstract_canon_sha256":"236dd3c89dde1a637b784577f0997ec809c04de87a0f7c44f5992148f7317c49"},"schema_version":"1.0"},"canonical_sha256":"797bdecf04586146be46c391bcf08469ef1e5839e53cda236dccffbcc9d39903","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:59.949413Z","signature_b64":"I8vAzC1U179Bk4k5ew3SNhzVJTHlkXRoirG+sy9pL8MeQbOvX2N6ylMpm3q9NkTB3LlPkNOu5jClskO4ZeeyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797bdecf04586146be46c391bcf08469ef1e5839e53cda236dccffbcc9d39903","last_reissued_at":"2026-05-18T01:12:59.949039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:59.949039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00985","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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENXleZ1Z042hIxKvKOrnb1p+qLEogQj8XAyKeqNn4tpeTpD0bMup9uitWhNl7j+/yoIsQK53Ck2pXD3EqLyGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:13:40.489016Z"},"content_sha256":"263ac36af10d9d59d3a72dbce9d285c74c50091f79711d327b6270c18ca7037f","schema_version":"1.0","event_id":"sha256:263ac36af10d9d59d3a72dbce9d285c74c50091f79711d327b6270c18ca7037f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PF555TYELBQUNPSGYOI3Z4EENH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Enmei Tu, Jie Yang, Lin Zhu, Nikola Kasabov, Yaqian Zhang","submitted_at":"2016-06-03T07:09:26Z","abstract_excerpt":"$k$ Nearest Neighbors ($k$NN) is one of the most widely used supervised learning algorithms to classify Gaussian distributed data, but it does not achieve good results when it is applied to nonlinear manifold distributed data, especially when a very limited amount of labeled samples are available. In this paper, we propose a new graph-based $k$NN algorithm which can effectively handle both Gaussian distributed data and nonlinear manifold distributed data. To achieve this goal, we first propose a constrained Tired Random Walk (TRW) by constructing an $R$-level nearest-neighbor strengthened tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00985","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-18T01:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Odga2agctQEw5LPgDFP35/6oCXjywJJaQKuw0WaD8S1BwkPfxImtnz3E0/RI47+T7d4rQF8vC5BieP4wObJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:13:40.489391Z"},"content_sha256":"82fca91b8ae599940dedd25d99183d7870e1dfd342b3a1c5bc2b2857eafafef0","schema_version":"1.0","event_id":"sha256:82fca91b8ae599940dedd25d99183d7870e1dfd342b3a1c5bc2b2857eafafef0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PF555TYELBQUNPSGYOI3Z4EENH/bundle.json","state_url":"https://pith.science/pith/PF555TYELBQUNPSGYOI3Z4EENH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PF555TYELBQUNPSGYOI3Z4EENH/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-07-02T19:13:40Z","links":{"resolver":"https://pith.science/pith/PF555TYELBQUNPSGYOI3Z4EENH","bundle":"https://pith.science/pith/PF555TYELBQUNPSGYOI3Z4EENH/bundle.json","state":"https://pith.science/pith/PF555TYELBQUNPSGYOI3Z4EENH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PF555TYELBQUNPSGYOI3Z4EENH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PF555TYELBQUNPSGYOI3Z4EENH","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":"236dd3c89dde1a637b784577f0997ec809c04de87a0f7c44f5992148f7317c49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T07:09:26Z","title_canon_sha256":"a092f2f6b6cd0fa5eba6dabebeabd2545e3e401135e9fad93f44e97a3514e6b2"},"schema_version":"1.0","source":{"id":"1606.00985","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00985","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00985v1","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00985","created_at":"2026-05-18T01:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"PF555TYELBQU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PF555TYELBQUNPSG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PF555TYE","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:82fca91b8ae599940dedd25d99183d7870e1dfd342b3a1c5bc2b2857eafafef0","target":"graph","created_at":"2026-05-18T01:12:59Z","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":"$k$ Nearest Neighbors ($k$NN) is one of the most widely used supervised learning algorithms to classify Gaussian distributed data, but it does not achieve good results when it is applied to nonlinear manifold distributed data, especially when a very limited amount of labeled samples are available. In this paper, we propose a new graph-based $k$NN algorithm which can effectively handle both Gaussian distributed data and nonlinear manifold distributed data. To achieve this goal, we first propose a constrained Tired Random Walk (TRW) by constructing an $R$-level nearest-neighbor strengthened tree","authors_text":"Enmei Tu, Jie Yang, Lin Zhu, Nikola Kasabov, Yaqian Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T07:09:26Z","title":"A Graph-Based Semi-Supervised k Nearest-Neighbor Method for Nonlinear Manifold Distributed Data Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00985","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:263ac36af10d9d59d3a72dbce9d285c74c50091f79711d327b6270c18ca7037f","target":"record","created_at":"2026-05-18T01:12:59Z","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":"236dd3c89dde1a637b784577f0997ec809c04de87a0f7c44f5992148f7317c49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T07:09:26Z","title_canon_sha256":"a092f2f6b6cd0fa5eba6dabebeabd2545e3e401135e9fad93f44e97a3514e6b2"},"schema_version":"1.0","source":{"id":"1606.00985","kind":"arxiv","version":1}},"canonical_sha256":"797bdecf04586146be46c391bcf08469ef1e5839e53cda236dccffbcc9d39903","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"797bdecf04586146be46c391bcf08469ef1e5839e53cda236dccffbcc9d39903","first_computed_at":"2026-05-18T01:12:59.949039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:59.949039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I8vAzC1U179Bk4k5ew3SNhzVJTHlkXRoirG+sy9pL8MeQbOvX2N6ylMpm3q9NkTB3LlPkNOu5jClskO4ZeeyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:59.949413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00985","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:263ac36af10d9d59d3a72dbce9d285c74c50091f79711d327b6270c18ca7037f","sha256:82fca91b8ae599940dedd25d99183d7870e1dfd342b3a1c5bc2b2857eafafef0"],"state_sha256":"7940954abcd78a6c8ae8232c7b7ec7f29b221904b1ff65b44284f92bb2b59817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5OKk3YvruHplF8Zakdkp5fUUGebIELN2bOMlKsdidtgk2xYP1SUJPbP6DeMDqOx037/MlF0fVj6YB2+vELXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T19:13:40.491386Z","bundle_sha256":"827c6a30c789f0ebd835731740482c8ccb1b9c4952ca5a73cab72e128e7b1509"}}