{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4MZMBU5KSE5YWCNI6D4MSCHLR4","short_pith_number":"pith:4MZMBU5K","schema_version":"1.0","canonical_sha256":"e332c0d3aa913b8b09a8f0f8c908eb8f16ff7b7bfd270602f76e8d40c9b2d1ba","source":{"kind":"arxiv","id":"1905.10415","version":3},"attestation_state":"computed","paper":{"title":"Quantum-inspired algorithms in practice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alain Delgado, Bhaskar Roy Bardhan, Juan Miguel Arrazola, Seth Lloyd","submitted_at":"2019-05-24T19:17:30Z","abstract_excerpt":"We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for problems involving low-rank matrices, but with complexity bounds that exhibit a hefty polynomial overhead compared to quantum algorithms. This raised the question of whether these methods were actually useful in practice. We conduct a theoretical analysis aimed at identifying their computational bottlenecks, then implement and benchmark the algorithms"},"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":"1905.10415","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-05-24T19:17:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f4511ef8938753be6c5386b7d2931a95b34cf47d5dbb12f035bb37edceef77e9","abstract_canon_sha256":"05bd080b845a75d397a64051c4a71b6ba5071d15f8c1e6daf4b6b6bbaa857d17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:28:04.120537Z","signature_b64":"X4Pil20Tu5iCJcWVbQaCt/m7NsIP1eJpR9QsDMImHhnBggYfCAt6q+ZQfDZJ2s+qgJh+lAI04hVFKPawGCteBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e332c0d3aa913b8b09a8f0f8c908eb8f16ff7b7bfd270602f76e8d40c9b2d1ba","last_reissued_at":"2026-07-05T01:28:04.120128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:28:04.120128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-inspired algorithms in practice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alain Delgado, Bhaskar Roy Bardhan, Juan Miguel Arrazola, Seth Lloyd","submitted_at":"2019-05-24T19:17:30Z","abstract_excerpt":"We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for problems involving low-rank matrices, but with complexity bounds that exhibit a hefty polynomial overhead compared to quantum algorithms. This raised the question of whether these methods were actually useful in practice. We conduct a theoretical analysis aimed at identifying their computational bottlenecks, then implement and benchmark the algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10415","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.10415/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.10415","created_at":"2026-07-05T01:28:04.120183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10415v3","created_at":"2026-07-05T01:28:04.120183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10415","created_at":"2026-07-05T01:28:04.120183+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MZMBU5KSE5Y","created_at":"2026-07-05T01:28:04.120183+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MZMBU5KSE5YWCNI","created_at":"2026-07-05T01:28:04.120183+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MZMBU5K","created_at":"2026-07-05T01:28:04.120183+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14703","citing_title":"A brief history of quantum vs classical computational advantage","ref_index":106,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4","json":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4.json","graph_json":"https://pith.science/api/pith-number/4MZMBU5KSE5YWCNI6D4MSCHLR4/graph.json","events_json":"https://pith.science/api/pith-number/4MZMBU5KSE5YWCNI6D4MSCHLR4/events.json","paper":"https://pith.science/paper/4MZMBU5K"},"agent_actions":{"view_html":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4","download_json":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4.json","view_paper":"https://pith.science/paper/4MZMBU5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10415&json=true","fetch_graph":"https://pith.science/api/pith-number/4MZMBU5KSE5YWCNI6D4MSCHLR4/graph.json","fetch_events":"https://pith.science/api/pith-number/4MZMBU5KSE5YWCNI6D4MSCHLR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4/action/storage_attestation","attest_author":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4/action/author_attestation","sign_citation":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4/action/citation_signature","submit_replication":"https://pith.science/pith/4MZMBU5KSE5YWCNI6D4MSCHLR4/action/replication_record"}},"created_at":"2026-07-05T01:28:04.120183+00:00","updated_at":"2026-07-05T01:28:04.120183+00:00"}