{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HOOCPBB5H7WIBLUB6L4666APRM","short_pith_number":"pith:HOOCPBB5","canonical_record":{"source":{"id":"1807.04271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-10T20:57:24Z","cross_cats_sorted":["cs.DS","cs.LG","quant-ph"],"title_canon_sha256":"466fd3704e18bfb926f6858294fd78441bb7cf1d685f03c5aa1e2858364425f7","abstract_canon_sha256":"26e0b2b137083177969f683ea7b9c3622094731a810315e9b2232471b6dfd014"},"schema_version":"1.0"},"canonical_sha256":"3b9c27843d3fec80ae81f2f9ef780f8b3ba0053d9a57b38b1a0113ead2185da1","source":{"kind":"arxiv","id":"1807.04271","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04271","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04271v3","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04271","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"pith_short_12","alias_value":"HOOCPBB5H7WI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HOOCPBB5H7WIBLUB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HOOCPBB5","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HOOCPBB5H7WIBLUB6L4666APRM","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04271","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-10T20:57:24Z","cross_cats_sorted":["cs.DS","cs.LG","quant-ph"],"title_canon_sha256":"466fd3704e18bfb926f6858294fd78441bb7cf1d685f03c5aa1e2858364425f7","abstract_canon_sha256":"26e0b2b137083177969f683ea7b9c3622094731a810315e9b2232471b6dfd014"},"schema_version":"1.0"},"canonical_sha256":"3b9c27843d3fec80ae81f2f9ef780f8b3ba0053d9a57b38b1a0113ead2185da1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:41.756663Z","signature_b64":"kEYBlUv7TJ8Q1QAkbyELc1TKtVJLveW1UeDJuDfd5YJtJF9lXthL4kJihRyrKvCyfPQT2g4sJcdFbG5z4/99Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9c27843d3fec80ae81f2f9ef780f8b3ba0053d9a57b38b1a0113ead2185da1","last_reissued_at":"2026-05-17T23:46:41.755889Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:41.755889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04271","source_version":3,"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-17T23:46:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xP4pKo/WipOI710a7pB2uSy75ZhRft/MK3ah8dsjZdPMqI8yyp89K9YXrizSwOqGiefoeJ3czeYVPTAvbQShDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:26:12.786388Z"},"content_sha256":"503a7cd8dcf9352d1824fc83f443e12021fad13386ae883bb56b8083b58b3c32","schema_version":"1.0","event_id":"sha256:503a7cd8dcf9352d1824fc83f443e12021fad13386ae883bb56b8083b58b3c32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HOOCPBB5H7WIBLUB6L4666APRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A quantum-inspired classical algorithm for recommendation systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","quant-ph"],"primary_cat":"cs.IR","authors_text":"Ewin Tang","submitted_at":"2018-07-10T20:57:24Z","abstract_excerpt":"We give a classical analogue to Kerenidis and Prakash's quantum recommendation system, previously believed to be one of the strongest candidates for provably exponential speedups in quantum machine learning. Our main result is an algorithm that, given an $m \\times n$ matrix in a data structure supporting certain $\\ell^2$-norm sampling operations, outputs an $\\ell^2$-norm sample from a rank-$k$ approximation of that matrix in time $O(\\text{poly}(k)\\log(mn))$, only polynomially slower than the quantum algorithm. As a consequence, Kerenidis and Prakash's algorithm does not in fact give an exponen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04271","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"},"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-17T23:46:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mozy2EkSoGl45gtdnDesoFvhUaiQ9lvuJZtTyrFi6AobcRoqOcnZ/vDBCu9++GW1YCW3vwL2eHOfPfyO0WbNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:26:12.787134Z"},"content_sha256":"70035f726a1bc99cc8c869bcd34e9f11c0855b9b0ddc4ce6e087bae0facb2c27","schema_version":"1.0","event_id":"sha256:70035f726a1bc99cc8c869bcd34e9f11c0855b9b0ddc4ce6e087bae0facb2c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOOCPBB5H7WIBLUB6L4666APRM/bundle.json","state_url":"https://pith.science/pith/HOOCPBB5H7WIBLUB6L4666APRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOOCPBB5H7WIBLUB6L4666APRM/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-10T03:26:12Z","links":{"resolver":"https://pith.science/pith/HOOCPBB5H7WIBLUB6L4666APRM","bundle":"https://pith.science/pith/HOOCPBB5H7WIBLUB6L4666APRM/bundle.json","state":"https://pith.science/pith/HOOCPBB5H7WIBLUB6L4666APRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOOCPBB5H7WIBLUB6L4666APRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HOOCPBB5H7WIBLUB6L4666APRM","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":"26e0b2b137083177969f683ea7b9c3622094731a810315e9b2232471b6dfd014","cross_cats_sorted":["cs.DS","cs.LG","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-10T20:57:24Z","title_canon_sha256":"466fd3704e18bfb926f6858294fd78441bb7cf1d685f03c5aa1e2858364425f7"},"schema_version":"1.0","source":{"id":"1807.04271","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04271","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04271v3","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04271","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"pith_short_12","alias_value":"HOOCPBB5H7WI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HOOCPBB5H7WIBLUB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HOOCPBB5","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:70035f726a1bc99cc8c869bcd34e9f11c0855b9b0ddc4ce6e087bae0facb2c27","target":"graph","created_at":"2026-05-17T23:46:41Z","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":"We give a classical analogue to Kerenidis and Prakash's quantum recommendation system, previously believed to be one of the strongest candidates for provably exponential speedups in quantum machine learning. Our main result is an algorithm that, given an $m \\times n$ matrix in a data structure supporting certain $\\ell^2$-norm sampling operations, outputs an $\\ell^2$-norm sample from a rank-$k$ approximation of that matrix in time $O(\\text{poly}(k)\\log(mn))$, only polynomially slower than the quantum algorithm. As a consequence, Kerenidis and Prakash's algorithm does not in fact give an exponen","authors_text":"Ewin Tang","cross_cats":["cs.DS","cs.LG","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-10T20:57:24Z","title":"A quantum-inspired classical algorithm for recommendation systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04271","kind":"arxiv","version":3},"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:503a7cd8dcf9352d1824fc83f443e12021fad13386ae883bb56b8083b58b3c32","target":"record","created_at":"2026-05-17T23:46:41Z","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":"26e0b2b137083177969f683ea7b9c3622094731a810315e9b2232471b6dfd014","cross_cats_sorted":["cs.DS","cs.LG","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-07-10T20:57:24Z","title_canon_sha256":"466fd3704e18bfb926f6858294fd78441bb7cf1d685f03c5aa1e2858364425f7"},"schema_version":"1.0","source":{"id":"1807.04271","kind":"arxiv","version":3}},"canonical_sha256":"3b9c27843d3fec80ae81f2f9ef780f8b3ba0053d9a57b38b1a0113ead2185da1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b9c27843d3fec80ae81f2f9ef780f8b3ba0053d9a57b38b1a0113ead2185da1","first_computed_at":"2026-05-17T23:46:41.755889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:41.755889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kEYBlUv7TJ8Q1QAkbyELc1TKtVJLveW1UeDJuDfd5YJtJF9lXthL4kJihRyrKvCyfPQT2g4sJcdFbG5z4/99Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:41.756663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04271","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:503a7cd8dcf9352d1824fc83f443e12021fad13386ae883bb56b8083b58b3c32","sha256:70035f726a1bc99cc8c869bcd34e9f11c0855b9b0ddc4ce6e087bae0facb2c27"],"state_sha256":"9a2b66b7c2bd170e1fd80c877542f4cb81e40e91cd456f8ea2be040918048009"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcGu0DjziO1vgS+g0CrM1breqTEYFQpp1lIWyrpw5K3VlNUDwAKNq583Pfq2sicXildiTwhc1YNOTywQFqFyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T03:26:12.791641Z","bundle_sha256":"9eec0016c60915ea524b3f3c5f916462d6a862e0c2e4573b433ed0f98e97754c"}}