{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:THRCCBPXVGXY7QJH77HOCBANQX","short_pith_number":"pith:THRCCBPX","schema_version":"1.0","canonical_sha256":"99e22105f7a9af8fc127ffcee1040d85d688173c15575f28ace0c2fc32a386c4","source":{"kind":"arxiv","id":"2508.04974","version":1},"attestation_state":"computed","paper":{"title":"QFOR: A Fidelity-aware Orchestrator for Quantum Computing Environments using Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Hoa T. Nguyen, Muhammad Usman, Rajkumar Buyya","submitted_at":"2025-08-07T02:00:50Z","abstract_excerpt":"Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of available quantum hardware create significant challenges for efficient resource orchestration. These issues complicate the optimization of quantum task allocation and scheduling, as existing heuristic methods fall short in adapting to dynamic conditions or effectively balancing execution fidelity and time. Here, we propose QFOR, a Quantum Fidelity-aware Orchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep Reinforcement learning. We model the quantu"},"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":"2508.04974","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-07T02:00:50Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"152f3b2db9ccfabde783b96384416586d4c0f9269447dde5710aace11abf777f","abstract_canon_sha256":"ec52c745539958c5b1e748f97dbacc5a6f40efaa9b63aa5c84c7723495c45dcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:04.988425Z","signature_b64":"PnYnWQP24ChdWk46EkD/WTFkEN1Gyf77t/EFtHKexM+Jvtj00Q67BF5v+/MHLoEsEnc9JGCyF2xv5/oCKvwUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e22105f7a9af8fc127ffcee1040d85d688173c15575f28ace0c2fc32a386c4","last_reissued_at":"2026-07-05T11:50:04.988017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:04.988017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QFOR: A Fidelity-aware Orchestrator for Quantum Computing Environments using Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Hoa T. Nguyen, Muhammad Usman, Rajkumar Buyya","submitted_at":"2025-08-07T02:00:50Z","abstract_excerpt":"Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of available quantum hardware create significant challenges for efficient resource orchestration. These issues complicate the optimization of quantum task allocation and scheduling, as existing heuristic methods fall short in adapting to dynamic conditions or effectively balancing execution fidelity and time. Here, we propose QFOR, a Quantum Fidelity-aware Orchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep Reinforcement learning. We model the quantu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04974","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/2508.04974/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":"2508.04974","created_at":"2026-07-05T11:50:04.988065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04974v1","created_at":"2026-07-05T11:50:04.988065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04974","created_at":"2026-07-05T11:50:04.988065+00:00"},{"alias_kind":"pith_short_12","alias_value":"THRCCBPXVGXY","created_at":"2026-07-05T11:50:04.988065+00:00"},{"alias_kind":"pith_short_16","alias_value":"THRCCBPXVGXY7QJH","created_at":"2026-07-05T11:50:04.988065+00:00"},{"alias_kind":"pith_short_8","alias_value":"THRCCBPX","created_at":"2026-07-05T11:50:04.988065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12816","citing_title":"Graph Reinforcement Learning for Calibration-Aware Quantum Circuit Routing","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03445","citing_title":"Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management","ref_index":89,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX","json":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX.json","graph_json":"https://pith.science/api/pith-number/THRCCBPXVGXY7QJH77HOCBANQX/graph.json","events_json":"https://pith.science/api/pith-number/THRCCBPXVGXY7QJH77HOCBANQX/events.json","paper":"https://pith.science/paper/THRCCBPX"},"agent_actions":{"view_html":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX","download_json":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX.json","view_paper":"https://pith.science/paper/THRCCBPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04974&json=true","fetch_graph":"https://pith.science/api/pith-number/THRCCBPXVGXY7QJH77HOCBANQX/graph.json","fetch_events":"https://pith.science/api/pith-number/THRCCBPXVGXY7QJH77HOCBANQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX/action/storage_attestation","attest_author":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX/action/author_attestation","sign_citation":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX/action/citation_signature","submit_replication":"https://pith.science/pith/THRCCBPXVGXY7QJH77HOCBANQX/action/replication_record"}},"created_at":"2026-07-05T11:50:04.988065+00:00","updated_at":"2026-07-05T11:50:04.988065+00:00"}