{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5OOOPJH7QVNZWI3CSR3VU2YTCV","short_pith_number":"pith:5OOOPJH7","schema_version":"1.0","canonical_sha256":"eb9ce7a4ff855b9b236294775a6b13156072ba0347a0e54a740982c04f67faf4","source":{"kind":"arxiv","id":"1603.08675","version":3},"attestation_state":"computed","paper":{"title":"Quantum Recommendation Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"quant-ph","authors_text":"Anupam Prakash, Iordanis Kerenidis","submitted_at":"2016-03-29T08:25:22Z","abstract_excerpt":"A recommendation system uses the past purchases or ratings of $n$ products by a group of $m$ users, in order to provide personalized recommendations to individual users. The information is modeled as an $m \\times n$ preference matrix which is assumed to have a good rank-$k$ approximation, for a small constant $k$.\n  In this work, we present a quantum algorithm for recommendation systems that has running time $O(\\text{poly}(k)\\text{polylog}(mn))$. All known classical algorithms for recommendation systems that work through reconstructing an approximation of the preference matrix run in time poly"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.08675","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2016-03-29T08:25:22Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"0cb40030fd74a0cc985846400128dfff19814b3ebfd2209340a215c61e255a21","abstract_canon_sha256":"8a428cf7b0cb521505dcbd683ca55b70a6edd427be463a52e57fe8ff695d4b3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:05.642942Z","signature_b64":"U5A08Cjhley1Pmk3qHmgY1NP2g63UlfB67M7Hp98EJrPlUZ3ayMTUz/0Kf4ABij85J+tvJVX2UL+6EuzQvjVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb9ce7a4ff855b9b236294775a6b13156072ba0347a0e54a740982c04f67faf4","last_reissued_at":"2026-05-18T01:04:05.642465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:05.642465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Recommendation Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"quant-ph","authors_text":"Anupam Prakash, Iordanis Kerenidis","submitted_at":"2016-03-29T08:25:22Z","abstract_excerpt":"A recommendation system uses the past purchases or ratings of $n$ products by a group of $m$ users, in order to provide personalized recommendations to individual users. The information is modeled as an $m \\times n$ preference matrix which is assumed to have a good rank-$k$ approximation, for a small constant $k$.\n  In this work, we present a quantum algorithm for recommendation systems that has running time $O(\\text{poly}(k)\\text{polylog}(mn))$. All known classical algorithms for recommendation systems that work through reconstructing an approximation of the preference matrix run in time poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08675","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.08675","created_at":"2026-05-18T01:04:05.642529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08675v3","created_at":"2026-05-18T01:04:05.642529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08675","created_at":"2026-05-18T01:04:05.642529+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OOOPJH7QVNZ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OOOPJH7QVNZWI3C","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OOOPJH7","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2408.03085","citing_title":"Universal Matrix Multiplication on Quantum Computer","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06949","citing_title":"Quantum Data Fitting Algorithm for Non-sparse Matrices","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2301.01232","citing_title":"Sample efficient graph classification using binary Gaussian boson sampling","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":157,"is_internal_anchor":true},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":157,"is_internal_anchor":true},{"citing_arxiv_id":"2603.24654","citing_title":"Spectral methods: crucial for machine learning, natural for quantum computers?","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25825","citing_title":"A Quantum Spectral Framework for Solving PDEs","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV","json":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV.json","graph_json":"https://pith.science/api/pith-number/5OOOPJH7QVNZWI3CSR3VU2YTCV/graph.json","events_json":"https://pith.science/api/pith-number/5OOOPJH7QVNZWI3CSR3VU2YTCV/events.json","paper":"https://pith.science/paper/5OOOPJH7"},"agent_actions":{"view_html":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV","download_json":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV.json","view_paper":"https://pith.science/paper/5OOOPJH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08675&json=true","fetch_graph":"https://pith.science/api/pith-number/5OOOPJH7QVNZWI3CSR3VU2YTCV/graph.json","fetch_events":"https://pith.science/api/pith-number/5OOOPJH7QVNZWI3CSR3VU2YTCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV/action/storage_attestation","attest_author":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV/action/author_attestation","sign_citation":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV/action/citation_signature","submit_replication":"https://pith.science/pith/5OOOPJH7QVNZWI3CSR3VU2YTCV/action/replication_record"}},"created_at":"2026-05-18T01:04:05.642529+00:00","updated_at":"2026-05-18T01:04:05.642529+00:00"}