{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EJHUVUJN6SML7T4L5FQ5AIQ42X","short_pith_number":"pith:EJHUVUJN","canonical_record":{"source":{"id":"1812.03584","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-10T00:25:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e84f76d2bd3628631cd84eede93421d98c99736c27447b6b3fdd872d7bf60bbb","abstract_canon_sha256":"73c0056f667cf31c5da2ad446c4e8242ea846b34f2a28836408e2400579899bd"},"schema_version":"1.0"},"canonical_sha256":"224f4ad12df498bfcf8be961d0221cd5d92063ed03ae616a10dbba52f9bda1de","source":{"kind":"arxiv","id":"1812.03584","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03584","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03584v2","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03584","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"pith_short_12","alias_value":"EJHUVUJN6SML","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"pith_short_16","alias_value":"EJHUVUJN6SML7T4L","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"pith_short_8","alias_value":"EJHUVUJN","created_at":"2026-07-05T02:48:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EJHUVUJN6SML7T4L5FQ5AIQ42X","target":"record","payload":{"canonical_record":{"source":{"id":"1812.03584","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-10T00:25:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e84f76d2bd3628631cd84eede93421d98c99736c27447b6b3fdd872d7bf60bbb","abstract_canon_sha256":"73c0056f667cf31c5da2ad446c4e8242ea846b34f2a28836408e2400579899bd"},"schema_version":"1.0"},"canonical_sha256":"224f4ad12df498bfcf8be961d0221cd5d92063ed03ae616a10dbba52f9bda1de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:15.852143Z","signature_b64":"UZTjmSoKZKwQkAa5flb4vTjorNfNhlhud9GQguMSMZ+RWRcrD6Lt+cCcogBDUFgdJ/u3XfVS9n6TXO7ag9KpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"224f4ad12df498bfcf8be961d0221cd5d92063ed03ae616a10dbba52f9bda1de","last_reissued_at":"2026-07-05T02:48:15.851696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:15.851696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.03584","source_version":2,"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-07-05T02:48:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ow1PTNfe4TnDZsJaE5SEgAwSspzKeYtaxQhia314jQC0OuF4NB2HbiAnsdFBhRMERL67P/rKHcOs8Az993YUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:06:30.408425Z"},"content_sha256":"23889ba42f63a079874cdd4aca4d5d500f6d557b680d54170ed04b9e53a9b46a","schema_version":"1.0","event_id":"sha256:23889ba42f63a079874cdd4aca4d5d500f6d557b680d54170ed04b9e53a9b46a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EJHUVUJN6SML7T4L5FQ5AIQ42X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"q-means: A quantum algorithm for unsupervised machine learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Alessandro Luongo, Anupam Prakash, Iordanis Kerenidis, Jonas Landman","submitted_at":"2018-12-10T00:25:50Z","abstract_excerpt":"Quantum machine learning is one of the most promising applications of a full-scale quantum computer. Over the past few years, many quantum machine learning algorithms have been proposed that can potentially offer considerable speedups over the corresponding classical algorithms. In this paper, we introduce q-means, a new quantum algorithm for clustering which is a canonical problem in unsupervised machine learning. The $q$-means algorithm has convergence and precision guarantees similar to $k$-means, and it outputs with high probability a good approximation of the $k$ cluster centroids like th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03584","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1812.03584/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:48:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgZRO7yMg41S29U9BQblOs3If21CuXHdiJ8D0OzlFSrqbfHirYfgMbeTOEDkVam1eS8Ak+ORSUe7CAh964MmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:06:30.408814Z"},"content_sha256":"fdacd8d3591a722a54f6f0003702bc914dc330417342780be1d11629e7a753f2","schema_version":"1.0","event_id":"sha256:fdacd8d3591a722a54f6f0003702bc914dc330417342780be1d11629e7a753f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJHUVUJN6SML7T4L5FQ5AIQ42X/bundle.json","state_url":"https://pith.science/pith/EJHUVUJN6SML7T4L5FQ5AIQ42X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJHUVUJN6SML7T4L5FQ5AIQ42X/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-05T15:06:30Z","links":{"resolver":"https://pith.science/pith/EJHUVUJN6SML7T4L5FQ5AIQ42X","bundle":"https://pith.science/pith/EJHUVUJN6SML7T4L5FQ5AIQ42X/bundle.json","state":"https://pith.science/pith/EJHUVUJN6SML7T4L5FQ5AIQ42X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJHUVUJN6SML7T4L5FQ5AIQ42X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EJHUVUJN6SML7T4L5FQ5AIQ42X","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":"73c0056f667cf31c5da2ad446c4e8242ea846b34f2a28836408e2400579899bd","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-10T00:25:50Z","title_canon_sha256":"e84f76d2bd3628631cd84eede93421d98c99736c27447b6b3fdd872d7bf60bbb"},"schema_version":"1.0","source":{"id":"1812.03584","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03584","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03584v2","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03584","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"pith_short_12","alias_value":"EJHUVUJN6SML","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"pith_short_16","alias_value":"EJHUVUJN6SML7T4L","created_at":"2026-07-05T02:48:15Z"},{"alias_kind":"pith_short_8","alias_value":"EJHUVUJN","created_at":"2026-07-05T02:48:15Z"}],"graph_snapshots":[{"event_id":"sha256:fdacd8d3591a722a54f6f0003702bc914dc330417342780be1d11629e7a753f2","target":"graph","created_at":"2026-07-05T02:48:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1812.03584/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum machine learning is one of the most promising applications of a full-scale quantum computer. Over the past few years, many quantum machine learning algorithms have been proposed that can potentially offer considerable speedups over the corresponding classical algorithms. In this paper, we introduce q-means, a new quantum algorithm for clustering which is a canonical problem in unsupervised machine learning. The $q$-means algorithm has convergence and precision guarantees similar to $k$-means, and it outputs with high probability a good approximation of the $k$ cluster centroids like th","authors_text":"Alessandro Luongo, Anupam Prakash, Iordanis Kerenidis, Jonas Landman","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-10T00:25:50Z","title":"q-means: A quantum algorithm for unsupervised machine learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03584","kind":"arxiv","version":2},"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:23889ba42f63a079874cdd4aca4d5d500f6d557b680d54170ed04b9e53a9b46a","target":"record","created_at":"2026-07-05T02:48:15Z","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":"73c0056f667cf31c5da2ad446c4e8242ea846b34f2a28836408e2400579899bd","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2018-12-10T00:25:50Z","title_canon_sha256":"e84f76d2bd3628631cd84eede93421d98c99736c27447b6b3fdd872d7bf60bbb"},"schema_version":"1.0","source":{"id":"1812.03584","kind":"arxiv","version":2}},"canonical_sha256":"224f4ad12df498bfcf8be961d0221cd5d92063ed03ae616a10dbba52f9bda1de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"224f4ad12df498bfcf8be961d0221cd5d92063ed03ae616a10dbba52f9bda1de","first_computed_at":"2026-07-05T02:48:15.851696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:48:15.851696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZTjmSoKZKwQkAa5flb4vTjorNfNhlhud9GQguMSMZ+RWRcrD6Lt+cCcogBDUFgdJ/u3XfVS9n6TXO7ag9KpBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:48:15.852143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.03584","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23889ba42f63a079874cdd4aca4d5d500f6d557b680d54170ed04b9e53a9b46a","sha256:fdacd8d3591a722a54f6f0003702bc914dc330417342780be1d11629e7a753f2"],"state_sha256":"68ad153cc52f3b07b4c4bee55b7e3f5c6ed8521187f1b185d1df3782e4b770a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71V3je6UDi1VaEWylfNAXgM2JoT5WKpIKedbnxHB2arzN+OUQdbPJmk/EdoRs7g76kni2BXjVBzEuwuVGFHRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:06:30.410929Z","bundle_sha256":"311e5d44c2ceefd943ffcfd31e40f918057bc5715fe8d3d2aa317c21b627a8a8"}}