{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OYUMKJNRLNBJBLC7HCFTECAJFV","short_pith_number":"pith:OYUMKJNR","canonical_record":{"source":{"id":"1307.0411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-07-01T15:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"afa990b7c40d5071d755647a20c37185c8e36d16e15af027d8e6121b23da9fba","abstract_canon_sha256":"16b2990182e443d57097cc74251c82891f5aedc080ba3a57614a885d1078fa9a"},"schema_version":"1.0"},"canonical_sha256":"7628c525b15b4290ac5f388b3208092d6ac6ffa0391104451b2d29b3903c076d","source":{"kind":"arxiv","id":"1307.0411","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0411","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0411v2","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0411","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"OYUMKJNRLNBJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OYUMKJNRLNBJBLC7","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OYUMKJNR","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OYUMKJNRLNBJBLC7HCFTECAJFV","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-07-01T15:38:12Z","cross_cats_sorted":[],"title_canon_sha256":"afa990b7c40d5071d755647a20c37185c8e36d16e15af027d8e6121b23da9fba","abstract_canon_sha256":"16b2990182e443d57097cc74251c82891f5aedc080ba3a57614a885d1078fa9a"},"schema_version":"1.0"},"canonical_sha256":"7628c525b15b4290ac5f388b3208092d6ac6ffa0391104451b2d29b3903c076d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:04.068311Z","signature_b64":"O8c296wL8jYGqNWPqV1MIwyHUvneVjzWFIIqB/Cew+2BMmH0ZQNn2CWXWsVKdQFgzXJA8KpN/YxAo24gzSjGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7628c525b15b4290ac5f388b3208092d6ac6ffa0391104451b2d29b3903c076d","last_reissued_at":"2026-05-18T03:08:04.067641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:04.067641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0411","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-05-18T03:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVuQDbzMaHtOhbj7N7DDsiansW1WY8kldVbwp3mWZfODrEgNmA3sGIExmCU6Ij6yt/AHzQNGeIFiey0rbW6HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:04:20.839767Z"},"content_sha256":"eeb11f563397bb89c98afc06a402f30c6eccb1223dd31aa7f94494d0fc653008","schema_version":"1.0","event_id":"sha256:eeb11f563397bb89c98afc06a402f30c6eccb1223dd31aa7f94494d0fc653008"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OYUMKJNRLNBJBLC7HCFTECAJFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithms for supervised and unsupervised machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masoud Mohseni, Patrick Rebentrost, Seth Lloyd","submitted_at":"2013-07-01T15:38:12Z","abstract_excerpt":"Machine-learning tasks frequently involve problems of manipulating and classifying large numbers of vectors in high-dimensional spaces. Classical algorithms for solving such problems typically take time polynomial in the number of vectors and the dimension of the space. Quantum computers are good at manipulating high-dimensional vectors in large tensor product spaces. This paper provides supervised and unsupervised quantum machine learning algorithms for cluster assignment and cluster finding. Quantum machine learning can take time logarithmic in both the number of vectors and their dimension,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0411","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":""},"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-18T03:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93OezKRnWq/J+hVUp5JaJNW/2IzolSClJxocj3SL2vRCe9Q8Jefk3w9T+a1qEZbzH7Oe7Z2z28SSn9+2itD4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:04:20.840133Z"},"content_sha256":"86767281722988901ba9fa4b426944c2ad1884065b43eaadb291b6adc0e56b62","schema_version":"1.0","event_id":"sha256:86767281722988901ba9fa4b426944c2ad1884065b43eaadb291b6adc0e56b62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/bundle.json","state_url":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/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-02T10:04:20Z","links":{"resolver":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV","bundle":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/bundle.json","state":"https://pith.science/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYUMKJNRLNBJBLC7HCFTECAJFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OYUMKJNRLNBJBLC7HCFTECAJFV","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":"16b2990182e443d57097cc74251c82891f5aedc080ba3a57614a885d1078fa9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-07-01T15:38:12Z","title_canon_sha256":"afa990b7c40d5071d755647a20c37185c8e36d16e15af027d8e6121b23da9fba"},"schema_version":"1.0","source":{"id":"1307.0411","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0411","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0411v2","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0411","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"OYUMKJNRLNBJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OYUMKJNRLNBJBLC7","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OYUMKJNR","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:86767281722988901ba9fa4b426944c2ad1884065b43eaadb291b6adc0e56b62","target":"graph","created_at":"2026-05-18T03:08:04Z","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":"Machine-learning tasks frequently involve problems of manipulating and classifying large numbers of vectors in high-dimensional spaces. Classical algorithms for solving such problems typically take time polynomial in the number of vectors and the dimension of the space. Quantum computers are good at manipulating high-dimensional vectors in large tensor product spaces. This paper provides supervised and unsupervised quantum machine learning algorithms for cluster assignment and cluster finding. Quantum machine learning can take time logarithmic in both the number of vectors and their dimension,","authors_text":"Masoud Mohseni, Patrick Rebentrost, Seth Lloyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-07-01T15:38:12Z","title":"Quantum algorithms for supervised and unsupervised machine learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0411","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:eeb11f563397bb89c98afc06a402f30c6eccb1223dd31aa7f94494d0fc653008","target":"record","created_at":"2026-05-18T03:08:04Z","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":"16b2990182e443d57097cc74251c82891f5aedc080ba3a57614a885d1078fa9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-07-01T15:38:12Z","title_canon_sha256":"afa990b7c40d5071d755647a20c37185c8e36d16e15af027d8e6121b23da9fba"},"schema_version":"1.0","source":{"id":"1307.0411","kind":"arxiv","version":2}},"canonical_sha256":"7628c525b15b4290ac5f388b3208092d6ac6ffa0391104451b2d29b3903c076d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7628c525b15b4290ac5f388b3208092d6ac6ffa0391104451b2d29b3903c076d","first_computed_at":"2026-05-18T03:08:04.067641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:04.067641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O8c296wL8jYGqNWPqV1MIwyHUvneVjzWFIIqB/Cew+2BMmH0ZQNn2CWXWsVKdQFgzXJA8KpN/YxAo24gzSjGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:04.068311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0411","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeb11f563397bb89c98afc06a402f30c6eccb1223dd31aa7f94494d0fc653008","sha256:86767281722988901ba9fa4b426944c2ad1884065b43eaadb291b6adc0e56b62"],"state_sha256":"900e1d7e2d7073ffd46160827aad60d2e9b76a086bbbe53cc15957e704d4a6a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swdysmYiwgxPSzrjuHaIoM7Er1jhfYh1UXxUHoc3X3+cHGvIfnWmkfzTK7G4b/X3JbH7kOHZqEGT01778z1lBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:04:20.842277Z","bundle_sha256":"f17e99de4f92c6ebbe9b193c5de32119a61d5dffc4f1ed2ef53e06936bf61e65"}}