{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CZ4YDR67VURP3KRIXU5FXRHVXN","short_pith_number":"pith:CZ4YDR67","schema_version":"1.0","canonical_sha256":"167981c7dfad22fdaa28bd3a5bc4f5bb50ec1bae99352d0395932609047fe2e2","source":{"kind":"arxiv","id":"2301.05096","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous training of quantum reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.LG","cs.NE"],"primary_cat":"quant-ph","authors_text":"Samuel Yen-Chi Chen","submitted_at":"2023-01-12T15:54:44Z","abstract_excerpt":"The development of quantum machine learning (QML) has received a lot of interest recently thanks to developments in both quantum computing (QC) and machine learning (ML). One of the ML paradigms that can be utilized to address challenging sequential decision-making issues is reinforcement learning (RL). It has been demonstrated that classical RL can successfully complete many difficult tasks. A leading method of building quantum RL agents relies on the variational quantum circuits (VQC). However, training QRL algorithms with VQCs requires significant amount of computational resources. This iss"},"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":"2301.05096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-12T15:54:44Z","cross_cats_sorted":["cs.AI","cs.DC","cs.LG","cs.NE"],"title_canon_sha256":"2644d23f3017b7f85d3274abbe1d745be5ac4c44f1e7d64a5ab2e475a6e08639","abstract_canon_sha256":"131e1f0b585d4825eda185b72c391f5e6091a75a3473379060e8e537b728a932"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:39.922830Z","signature_b64":"B/HozbGst8pzqT7Dc513HljkguekZYBQt+X+PYcE9WrzdR8G9eqxgytEeDgnbselcLkyVFuQpR/BICMaUAaYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"167981c7dfad22fdaa28bd3a5bc4f5bb50ec1bae99352d0395932609047fe2e2","last_reissued_at":"2026-07-05T05:32:39.922355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:39.922355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous training of quantum reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.LG","cs.NE"],"primary_cat":"quant-ph","authors_text":"Samuel Yen-Chi Chen","submitted_at":"2023-01-12T15:54:44Z","abstract_excerpt":"The development of quantum machine learning (QML) has received a lot of interest recently thanks to developments in both quantum computing (QC) and machine learning (ML). One of the ML paradigms that can be utilized to address challenging sequential decision-making issues is reinforcement learning (RL). It has been demonstrated that classical RL can successfully complete many difficult tasks. A leading method of building quantum RL agents relies on the variational quantum circuits (VQC). However, training QRL algorithms with VQCs requires significant amount of computational resources. This iss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05096","kind":"arxiv","version":1},"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/2301.05096/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":"2301.05096","created_at":"2026-07-05T05:32:39.922415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.05096v1","created_at":"2026-07-05T05:32:39.922415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05096","created_at":"2026-07-05T05:32:39.922415+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZ4YDR67VURP","created_at":"2026-07-05T05:32:39.922415+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZ4YDR67VURP3KRI","created_at":"2026-07-05T05:32:39.922415+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZ4YDR67","created_at":"2026-07-05T05:32:39.922415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.10673","citing_title":"Hybrid-Quantum Neural Architecture Search for The Proximal Policy Optimization Algorithm","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN","json":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN.json","graph_json":"https://pith.science/api/pith-number/CZ4YDR67VURP3KRIXU5FXRHVXN/graph.json","events_json":"https://pith.science/api/pith-number/CZ4YDR67VURP3KRIXU5FXRHVXN/events.json","paper":"https://pith.science/paper/CZ4YDR67"},"agent_actions":{"view_html":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN","download_json":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN.json","view_paper":"https://pith.science/paper/CZ4YDR67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.05096&json=true","fetch_graph":"https://pith.science/api/pith-number/CZ4YDR67VURP3KRIXU5FXRHVXN/graph.json","fetch_events":"https://pith.science/api/pith-number/CZ4YDR67VURP3KRIXU5FXRHVXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN/action/storage_attestation","attest_author":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN/action/author_attestation","sign_citation":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN/action/citation_signature","submit_replication":"https://pith.science/pith/CZ4YDR67VURP3KRIXU5FXRHVXN/action/replication_record"}},"created_at":"2026-07-05T05:32:39.922415+00:00","updated_at":"2026-07-05T05:32:39.922415+00:00"}