{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X6VIE3NMLHCLEBSBW567YSHOOR","short_pith_number":"pith:X6VIE3NM","canonical_record":{"source":{"id":"1704.06475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-21T10:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"bd6caecbfaf411bc4a73bb62a44e71c7eced1faf05241f34792b72609741f08d","abstract_canon_sha256":"810c0209fca2dfe3b440825949bc5aee52175f5190c51da104bfe64325d4c32e"},"schema_version":"1.0"},"canonical_sha256":"bfaa826dac59c4b20641b77dfc48ee744216854445efdb10ce330e3e40cf41a4","source":{"kind":"arxiv","id":"1704.06475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06475","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06475v1","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06475","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"X6VIE3NMLHCL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X6VIE3NMLHCLEBSB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X6VIE3NM","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X6VIE3NMLHCLEBSBW567YSHOOR","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-21T10:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"bd6caecbfaf411bc4a73bb62a44e71c7eced1faf05241f34792b72609741f08d","abstract_canon_sha256":"810c0209fca2dfe3b440825949bc5aee52175f5190c51da104bfe64325d4c32e"},"schema_version":"1.0"},"canonical_sha256":"bfaa826dac59c4b20641b77dfc48ee744216854445efdb10ce330e3e40cf41a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:59.602308Z","signature_b64":"hBr+1/VH+euR3773R7ixOZZTSsSYjMpmjr0oB3yFAH7Y/WNKpIdVdZgXdI5wTsR24VXlITdtkh+MpPryJYCCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfaa826dac59c4b20641b77dfc48ee744216854445efdb10ce330e3e40cf41a4","last_reissued_at":"2026-05-18T00:45:59.601650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:59.601650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06475","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:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE9egCVUfE8uzl9iyqnV8zpwOnTNSQMSv0Ek1tdUD+CT/aH+UKNB1JBB8Hn4m9sqflGdBK7IwlAG+E3IeiqLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:14:04.732975Z"},"content_sha256":"e2891f00a21af0711f03a6620c94bf93e2a6a03bc4d0baf1c35dd112fe81cee2","schema_version":"1.0","event_id":"sha256:e2891f00a21af0711f03a6620c94bf93e2a6a03bc4d0baf1c35dd112fe81cee2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X6VIE3NMLHCLEBSBW567YSHOOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification Problem in a Quantum Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Enrica Santucci, Giuseppe Sergioli","submitted_at":"2017-04-21T10:50:41Z","abstract_excerpt":"The aim of this paper is to provide a quantum counterpart of the well known minimum-distance classifier named Nearest Mean Classifier (NMC). In particular, we refer to the following previous works: i) in Sergioli et al. 2016, we have introduced a detailed quantum version of the NMC, named Quantum Nearest Mean Classifier (QNMC), for two-dimensional problems and we have proposed a generalization to abitrary dimensions; ii) in Sergioli et al. 2017, the n-dimensional problem was analyzed in detail and a particular encoding for arbitrary n-feature vectors into density operators has been presented. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06475","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:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9L5FCpi30wp8d+ebCpcwT9fRO4ZCZqa49OcT1jWSeyv1p8lRSF9I4eQlOlRczjGIkAWkPj2r43uq63tOBgIPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:14:04.733451Z"},"content_sha256":"379cac4a17cd7b9095a43feab4586199c76b04194180f08ec378bfa55c21f5e4","schema_version":"1.0","event_id":"sha256:379cac4a17cd7b9095a43feab4586199c76b04194180f08ec378bfa55c21f5e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6VIE3NMLHCLEBSBW567YSHOOR/bundle.json","state_url":"https://pith.science/pith/X6VIE3NMLHCLEBSBW567YSHOOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6VIE3NMLHCLEBSBW567YSHOOR/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-05-31T01:14:04Z","links":{"resolver":"https://pith.science/pith/X6VIE3NMLHCLEBSBW567YSHOOR","bundle":"https://pith.science/pith/X6VIE3NMLHCLEBSBW567YSHOOR/bundle.json","state":"https://pith.science/pith/X6VIE3NMLHCLEBSBW567YSHOOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6VIE3NMLHCLEBSBW567YSHOOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X6VIE3NMLHCLEBSBW567YSHOOR","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":"810c0209fca2dfe3b440825949bc5aee52175f5190c51da104bfe64325d4c32e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-21T10:50:41Z","title_canon_sha256":"bd6caecbfaf411bc4a73bb62a44e71c7eced1faf05241f34792b72609741f08d"},"schema_version":"1.0","source":{"id":"1704.06475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06475","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06475v1","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06475","created_at":"2026-05-18T00:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"X6VIE3NMLHCL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X6VIE3NMLHCLEBSB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X6VIE3NM","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:379cac4a17cd7b9095a43feab4586199c76b04194180f08ec378bfa55c21f5e4","target":"graph","created_at":"2026-05-18T00:45: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":"The aim of this paper is to provide a quantum counterpart of the well known minimum-distance classifier named Nearest Mean Classifier (NMC). In particular, we refer to the following previous works: i) in Sergioli et al. 2016, we have introduced a detailed quantum version of the NMC, named Quantum Nearest Mean Classifier (QNMC), for two-dimensional problems and we have proposed a generalization to abitrary dimensions; ii) in Sergioli et al. 2017, the n-dimensional problem was analyzed in detail and a particular encoding for arbitrary n-feature vectors into density operators has been presented. ","authors_text":"Enrica Santucci, Giuseppe Sergioli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-21T10:50:41Z","title":"Classification Problem in a Quantum Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06475","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:e2891f00a21af0711f03a6620c94bf93e2a6a03bc4d0baf1c35dd112fe81cee2","target":"record","created_at":"2026-05-18T00:45: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":"810c0209fca2dfe3b440825949bc5aee52175f5190c51da104bfe64325d4c32e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-04-21T10:50:41Z","title_canon_sha256":"bd6caecbfaf411bc4a73bb62a44e71c7eced1faf05241f34792b72609741f08d"},"schema_version":"1.0","source":{"id":"1704.06475","kind":"arxiv","version":1}},"canonical_sha256":"bfaa826dac59c4b20641b77dfc48ee744216854445efdb10ce330e3e40cf41a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfaa826dac59c4b20641b77dfc48ee744216854445efdb10ce330e3e40cf41a4","first_computed_at":"2026-05-18T00:45:59.601650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:59.601650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hBr+1/VH+euR3773R7ixOZZTSsSYjMpmjr0oB3yFAH7Y/WNKpIdVdZgXdI5wTsR24VXlITdtkh+MpPryJYCCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:59.602308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2891f00a21af0711f03a6620c94bf93e2a6a03bc4d0baf1c35dd112fe81cee2","sha256:379cac4a17cd7b9095a43feab4586199c76b04194180f08ec378bfa55c21f5e4"],"state_sha256":"19be91ec967e30ff16fd04a3f97c7f0d660c198efc24bba4fb2e98713cb4d014"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIFEVIynEMTX5tcu9DRddZbvLkfGvTsu1Z1qa9xON8hf5klfuC31k6R1vLBnDEZ4iplnoPYqE/K/+snD704bBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:14:04.736547Z","bundle_sha256":"418697e241a8a84c628965e9a61505c7ebb5d8b1fca6ca162638900f49bdad4a"}}