{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3VUR7WFJDIJSAEDXPS26OQVAIB","short_pith_number":"pith:3VUR7WFJ","schema_version":"1.0","canonical_sha256":"dd691fd8a91a132010777cb5e742a04060519f8dc93a9c5015ce65eacee04ab0","source":{"kind":"arxiv","id":"2404.01055","version":2},"attestation_state":"computed","paper":{"title":"Quantum circuit scheduler for QPUs usage optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Enrique Moguel, Jaime Alvarado-Valiente, Javier Berrocal, Javier Romero-Alvarez, Jorge Casco-Seco, Jose Garcia-Alonso, Juan M. Murillo","submitted_at":"2024-04-01T11:34:26Z","abstract_excerpt":"Progress in the realm of quantum technologies is paving the way for a multitude of potential applications across different sectors. However, the reduced number of available quantum computers, their technical limitations and the high demand for their use are posing some problems for developers and researchers. Mainly, users trying to execute quantum circuits on these devices are usually facing long waiting times in the tasks queues. In this context, this work propose a technique to reduce waiting times and optimize quantum computers usage by scheduling circuits from different users into combine"},"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":"2404.01055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-04-01T11:34:26Z","cross_cats_sorted":[],"title_canon_sha256":"3b3fb68adaae94532167cd5e2848f5a34b72e5385d038787446be50a1f3156e4","abstract_canon_sha256":"976cb9ccf8d313a9155036aeb668dfbab598e69be9dc3d09b2d209f23d80e90b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:04.520618Z","signature_b64":"TNTpFBXeow3o73V088APwHY7bqlMZ6KAwU5XcTOnsKlxKGq54sfB6NfJ/TCqgtZZKwGQfgyXSw5cW1xTh+6NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd691fd8a91a132010777cb5e742a04060519f8dc93a9c5015ce65eacee04ab0","last_reissued_at":"2026-07-05T09:06:04.520184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:04.520184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuit scheduler for QPUs usage optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Enrique Moguel, Jaime Alvarado-Valiente, Javier Berrocal, Javier Romero-Alvarez, Jorge Casco-Seco, Jose Garcia-Alonso, Juan M. Murillo","submitted_at":"2024-04-01T11:34:26Z","abstract_excerpt":"Progress in the realm of quantum technologies is paving the way for a multitude of potential applications across different sectors. However, the reduced number of available quantum computers, their technical limitations and the high demand for their use are posing some problems for developers and researchers. Mainly, users trying to execute quantum circuits on these devices are usually facing long waiting times in the tasks queues. In this context, this work propose a technique to reduce waiting times and optimize quantum computers usage by scheduling circuits from different users into combine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.01055","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/2404.01055/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":"2404.01055","created_at":"2026-07-05T09:06:04.520242+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.01055v2","created_at":"2026-07-05T09:06:04.520242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.01055","created_at":"2026-07-05T09:06:04.520242+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VUR7WFJDIJS","created_at":"2026-07-05T09:06:04.520242+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VUR7WFJDIJSAEDX","created_at":"2026-07-05T09:06:04.520242+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VUR7WFJ","created_at":"2026-07-05T09:06:04.520242+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.04171","citing_title":"Advantages of Co-locating Quantum-HPC Platforms: A Survey for Near-Future Industrial Applications","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB","json":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB.json","graph_json":"https://pith.science/api/pith-number/3VUR7WFJDIJSAEDXPS26OQVAIB/graph.json","events_json":"https://pith.science/api/pith-number/3VUR7WFJDIJSAEDXPS26OQVAIB/events.json","paper":"https://pith.science/paper/3VUR7WFJ"},"agent_actions":{"view_html":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB","download_json":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB.json","view_paper":"https://pith.science/paper/3VUR7WFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.01055&json=true","fetch_graph":"https://pith.science/api/pith-number/3VUR7WFJDIJSAEDXPS26OQVAIB/graph.json","fetch_events":"https://pith.science/api/pith-number/3VUR7WFJDIJSAEDXPS26OQVAIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB/action/storage_attestation","attest_author":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB/action/author_attestation","sign_citation":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB/action/citation_signature","submit_replication":"https://pith.science/pith/3VUR7WFJDIJSAEDXPS26OQVAIB/action/replication_record"}},"created_at":"2026-07-05T09:06:04.520242+00:00","updated_at":"2026-07-05T09:06:04.520242+00:00"}