{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4OJF7JBKV367H7NLQAB4TQMCOP","short_pith_number":"pith:4OJF7JBK","canonical_record":{"source":{"id":"1805.06260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-16T11:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"9c4952e172607d2eada2c01e5fe0059e68f264531d2e4343e98edb021716caea","abstract_canon_sha256":"946e44783bcb809fcf7d013596adfb204136f31c860a8e4ee18e9e5e8675494d"},"schema_version":"1.0"},"canonical_sha256":"e3925fa42aaefdf3fdab8003c9c18273c4578794d63283c02451e4c209a96b4d","source":{"kind":"arxiv","id":"1805.06260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06260","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06260v1","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06260","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"4OJF7JBKV367","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4OJF7JBKV367H7NL","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4OJF7JBK","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4OJF7JBKV367H7NLQAB4TQMCOP","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-16T11:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"9c4952e172607d2eada2c01e5fe0059e68f264531d2e4343e98edb021716caea","abstract_canon_sha256":"946e44783bcb809fcf7d013596adfb204136f31c860a8e4ee18e9e5e8675494d"},"schema_version":"1.0"},"canonical_sha256":"e3925fa42aaefdf3fdab8003c9c18273c4578794d63283c02451e4c209a96b4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:48.257687Z","signature_b64":"ESJULiJsa7azUL0jITCZ7NfQ6bUUaxV9YYIsNn7yZm2j0sGswOU6ZzrE3QAyxUvmWfmTQdJGS/xr3C5nthqBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3925fa42aaefdf3fdab8003c9c18273c4578794d63283c02451e4c209a96b4d","last_reissued_at":"2026-05-18T00:15:48.257140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:48.257140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06260","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:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MeQHvMYhACebEwBEDd7pp+cOqbAtzH0a7INAwn64mfa0VGwxEZDoIAEE/pOY/XobHnuky1K9hI4EyZN3hSGAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:08:04.990244Z"},"content_sha256":"36749d6a45205f5ef0732d2bc2b71922ec941e2efd4f86a98abfd474e804d5f8","schema_version":"1.0","event_id":"sha256:36749d6a45205f5ef0732d2bc2b71922ec941e2efd4f86a98abfd474e804d5f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4OJF7JBKV367H7NLQAB4TQMCOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Image Classification Based on Quantum KNN Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"2, 3), Beijing, Beijing University of Technology, China), China (2) Beijing Key Laboratory of Trusted Computing, China (3) National Engineering Laboratory for Critical Technologies of Information Security Classified Protection, China (4) School of Information Science, Hao Hu (1, Linyi, Linyi University, Nan Jiang (1, Technology, Wenyin Zhang (4) ((1) Faculty of Information Technology, Yijie Dang (1, Zhuoxiao Ji (1","submitted_at":"2018-05-16T11:59:54Z","abstract_excerpt":"Image classification is an important task in the field of machine learning and image processing. However, the usually used classification method --- the K Nearest-Neighbor algorithm has high complexity, because its two main processes: similarity computing and searching are time-consuming. Especially in the era of big data, the problem is prominent when the amount of images to be classified is large. In this paper, we try to use the powerful parallel computing ability of quantum computers to optimize the efficiency of image classification. The scheme is based on quantum K Nearest-Neighbor algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06260","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:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzvOwmHg4E+DVkM4KIlwngJdJhIewy7yr884ovsikqB1GuxMUGQep1LC/oQk7jlvaHqqjq3U4YFBDyxck9k8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:08:04.990610Z"},"content_sha256":"4560aaad21094b749ded3f8d8bae4d222908a4b2daa026e896b26b560a916e49","schema_version":"1.0","event_id":"sha256:4560aaad21094b749ded3f8d8bae4d222908a4b2daa026e896b26b560a916e49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OJF7JBKV367H7NLQAB4TQMCOP/bundle.json","state_url":"https://pith.science/pith/4OJF7JBKV367H7NLQAB4TQMCOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OJF7JBKV367H7NLQAB4TQMCOP/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-27T05:08:04Z","links":{"resolver":"https://pith.science/pith/4OJF7JBKV367H7NLQAB4TQMCOP","bundle":"https://pith.science/pith/4OJF7JBKV367H7NLQAB4TQMCOP/bundle.json","state":"https://pith.science/pith/4OJF7JBKV367H7NLQAB4TQMCOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OJF7JBKV367H7NLQAB4TQMCOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4OJF7JBKV367H7NLQAB4TQMCOP","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":"946e44783bcb809fcf7d013596adfb204136f31c860a8e4ee18e9e5e8675494d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-16T11:59:54Z","title_canon_sha256":"9c4952e172607d2eada2c01e5fe0059e68f264531d2e4343e98edb021716caea"},"schema_version":"1.0","source":{"id":"1805.06260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06260","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06260v1","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06260","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"4OJF7JBKV367","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4OJF7JBKV367H7NL","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4OJF7JBK","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:4560aaad21094b749ded3f8d8bae4d222908a4b2daa026e896b26b560a916e49","target":"graph","created_at":"2026-05-18T00:15:48Z","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":"Image classification is an important task in the field of machine learning and image processing. However, the usually used classification method --- the K Nearest-Neighbor algorithm has high complexity, because its two main processes: similarity computing and searching are time-consuming. Especially in the era of big data, the problem is prominent when the amount of images to be classified is large. In this paper, we try to use the powerful parallel computing ability of quantum computers to optimize the efficiency of image classification. The scheme is based on quantum K Nearest-Neighbor algor","authors_text":"2, 3), Beijing, Beijing University of Technology, China), China (2) Beijing Key Laboratory of Trusted Computing, China (3) National Engineering Laboratory for Critical Technologies of Information Security Classified Protection, China (4) School of Information Science, Hao Hu (1, Linyi, Linyi University, Nan Jiang (1, Technology, Wenyin Zhang (4) ((1) Faculty of Information Technology, Yijie Dang (1, Zhuoxiao Ji (1","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-16T11:59:54Z","title":"Image Classification Based on Quantum KNN Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06260","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:36749d6a45205f5ef0732d2bc2b71922ec941e2efd4f86a98abfd474e804d5f8","target":"record","created_at":"2026-05-18T00:15:48Z","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":"946e44783bcb809fcf7d013596adfb204136f31c860a8e4ee18e9e5e8675494d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-16T11:59:54Z","title_canon_sha256":"9c4952e172607d2eada2c01e5fe0059e68f264531d2e4343e98edb021716caea"},"schema_version":"1.0","source":{"id":"1805.06260","kind":"arxiv","version":1}},"canonical_sha256":"e3925fa42aaefdf3fdab8003c9c18273c4578794d63283c02451e4c209a96b4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3925fa42aaefdf3fdab8003c9c18273c4578794d63283c02451e4c209a96b4d","first_computed_at":"2026-05-18T00:15:48.257140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:48.257140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ESJULiJsa7azUL0jITCZ7NfQ6bUUaxV9YYIsNn7yZm2j0sGswOU6ZzrE3QAyxUvmWfmTQdJGS/xr3C5nthqBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:48.257687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36749d6a45205f5ef0732d2bc2b71922ec941e2efd4f86a98abfd474e804d5f8","sha256:4560aaad21094b749ded3f8d8bae4d222908a4b2daa026e896b26b560a916e49"],"state_sha256":"abc2408bbfcd9a934153fba49a33b79924207e1ab04d507dbab662abf722a6d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vO+A3SgEB2peOq8nXGm7h72WEO7H8qDuESxCw9d0dKdvx9VqL3okABnB4C8Kl1V4KMhk8sBohyCMkQ9bLS0OBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T05:08:04.992640Z","bundle_sha256":"5cacf693503b7d870508470686077180b0bfee95f3467087c7877964b4e71ab5"}}