{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3UNC7HTBTLM3G5L3TCD5BCJ5MM","short_pith_number":"pith:3UNC7HTB","schema_version":"1.0","canonical_sha256":"dd1a2f9e619ad9b3757b9887d0893d630e8354fc0b72585e24f3edd78cb35baa","source":{"kind":"arxiv","id":"2210.12953","version":2},"attestation_state":"computed","paper":{"title":"Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Chen-Yu Liu, Ching-Jui Lai, Hsin-Yu Wang, Min-Hsiu Hsieh, Pei-Yen Liao","submitted_at":"2022-10-24T04:56:47Z","abstract_excerpt":"Factorization Machine (FM) is the most commonly used model to build a recommendation system since it can incorporate side information to improve performance. However, producing item suggestions for a given user with a trained FM is time-consuming. It requires a run-time of $O((N_m \\log N_m)^2)$, where $N_m$ is the number of items in the dataset. To address this problem, we propose a quadratic unconstrained binary optimization (QUBO) scheme to combine with FM and apply quantum annealing (QA) computation. Compared to classical methods, this hybrid algorithm provides a faster than quadratic speed"},"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":"2210.12953","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-24T04:56:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a234a8c40bb479ba4f89d14ed0e55589c3ea18e4392bb6844df60cd58de4a690","abstract_canon_sha256":"3bc46b379b3e5b58cc40e5f5ae3c266b262a6ecc57cb6803ae0dcb75d29dfcce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:21.384909Z","signature_b64":"3c98h39xbezKzFY+PIY/+8gygFCE7X9DjXRY11s9WrXXZObFnYKny7omcmZmm2x7sF0/ZwZdLY0THdLRkmiVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd1a2f9e619ad9b3757b9887d0893d630e8354fc0b72585e24f3edd78cb35baa","last_reissued_at":"2026-07-05T07:10:21.384384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:21.384384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Chen-Yu Liu, Ching-Jui Lai, Hsin-Yu Wang, Min-Hsiu Hsieh, Pei-Yen Liao","submitted_at":"2022-10-24T04:56:47Z","abstract_excerpt":"Factorization Machine (FM) is the most commonly used model to build a recommendation system since it can incorporate side information to improve performance. However, producing item suggestions for a given user with a trained FM is time-consuming. It requires a run-time of $O((N_m \\log N_m)^2)$, where $N_m$ is the number of items in the dataset. To address this problem, we propose a quadratic unconstrained binary optimization (QUBO) scheme to combine with FM and apply quantum annealing (QA) computation. Compared to classical methods, this hybrid algorithm provides a faster than quadratic speed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12953","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/2210.12953/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":"2210.12953","created_at":"2026-07-05T07:10:21.384443+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.12953v2","created_at":"2026-07-05T07:10:21.384443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12953","created_at":"2026-07-05T07:10:21.384443+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UNC7HTBTLM3","created_at":"2026-07-05T07:10:21.384443+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UNC7HTBTLM3G5L3","created_at":"2026-07-05T07:10:21.384443+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UNC7HTB","created_at":"2026-07-05T07:10:21.384443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09395","citing_title":"Quantum-Enhanced Parameter-Efficient Learning for Typhoon Trajectory Forecasting","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM","json":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM.json","graph_json":"https://pith.science/api/pith-number/3UNC7HTBTLM3G5L3TCD5BCJ5MM/graph.json","events_json":"https://pith.science/api/pith-number/3UNC7HTBTLM3G5L3TCD5BCJ5MM/events.json","paper":"https://pith.science/paper/3UNC7HTB"},"agent_actions":{"view_html":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM","download_json":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM.json","view_paper":"https://pith.science/paper/3UNC7HTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.12953&json=true","fetch_graph":"https://pith.science/api/pith-number/3UNC7HTBTLM3G5L3TCD5BCJ5MM/graph.json","fetch_events":"https://pith.science/api/pith-number/3UNC7HTBTLM3G5L3TCD5BCJ5MM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM/action/storage_attestation","attest_author":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM/action/author_attestation","sign_citation":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM/action/citation_signature","submit_replication":"https://pith.science/pith/3UNC7HTBTLM3G5L3TCD5BCJ5MM/action/replication_record"}},"created_at":"2026-07-05T07:10:21.384443+00:00","updated_at":"2026-07-05T07:10:21.384443+00:00"}