{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:E7B62HSQ4CQSIRCKLTFNFGEXCI","short_pith_number":"pith:E7B62HSQ","schema_version":"1.0","canonical_sha256":"27c3ed1e50e0a124444a5ccad298971234be45879051b47da87d21e8548d8a87","source":{"kind":"arxiv","id":"2205.04844","version":1},"attestation_state":"computed","paper":{"title":"Solving workflow scheduling problems with QUBO modeling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. Alekseyenko, A. I. Pakhomchik, M. R. Perelshtein, S. Yarkoni, S. Yudin","submitted_at":"2022-05-10T12:38:17Z","abstract_excerpt":"In this paper we investigate the workflow scheduling problem, a known NP-hard class of scheduling problems. We derive problem instances from an industrial use case and compare against several quantum, classical, and hybrid quantum-classical algorithms. We develop a novel QUBO to represent our scheduling problem and show how the QUBO complexity depends on the input problem. We derive and present a decomposition method for this specific application to mitigate this complexity and demonstrate the effectiveness of the approach."},"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":"2205.04844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-10T12:38:17Z","cross_cats_sorted":[],"title_canon_sha256":"360f9edf914856438ec01b64885ff1bc24d4d80b944c777d48705d5e984ab546","abstract_canon_sha256":"d911cd2d2bdfd1c5517176fef8b454f068c0024a8d49ed6b328f286a364c388c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:11.093868Z","signature_b64":"Bw7EactTSK4S/XE9K5VIIq+WhlR+thWy95muzT+ic85gYShf9SDBOj/HpBdbnwzK8BjMyPe45os64MvafaFDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27c3ed1e50e0a124444a5ccad298971234be45879051b47da87d21e8548d8a87","last_reissued_at":"2026-07-05T04:22:11.093425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:11.093425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving workflow scheduling problems with QUBO modeling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. Alekseyenko, A. I. Pakhomchik, M. R. Perelshtein, S. Yarkoni, S. Yudin","submitted_at":"2022-05-10T12:38:17Z","abstract_excerpt":"In this paper we investigate the workflow scheduling problem, a known NP-hard class of scheduling problems. We derive problem instances from an industrial use case and compare against several quantum, classical, and hybrid quantum-classical algorithms. We develop a novel QUBO to represent our scheduling problem and show how the QUBO complexity depends on the input problem. We derive and present a decomposition method for this specific application to mitigate this complexity and demonstrate the effectiveness of the approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.04844","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/2205.04844/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":"2205.04844","created_at":"2026-07-05T04:22:11.093497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.04844v1","created_at":"2026-07-05T04:22:11.093497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.04844","created_at":"2026-07-05T04:22:11.093497+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7B62HSQ4CQS","created_at":"2026-07-05T04:22:11.093497+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7B62HSQ4CQSIRCK","created_at":"2026-07-05T04:22:11.093497+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7B62HSQ","created_at":"2026-07-05T04:22:11.093497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI","json":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI.json","graph_json":"https://pith.science/api/pith-number/E7B62HSQ4CQSIRCKLTFNFGEXCI/graph.json","events_json":"https://pith.science/api/pith-number/E7B62HSQ4CQSIRCKLTFNFGEXCI/events.json","paper":"https://pith.science/paper/E7B62HSQ"},"agent_actions":{"view_html":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI","download_json":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI.json","view_paper":"https://pith.science/paper/E7B62HSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.04844&json=true","fetch_graph":"https://pith.science/api/pith-number/E7B62HSQ4CQSIRCKLTFNFGEXCI/graph.json","fetch_events":"https://pith.science/api/pith-number/E7B62HSQ4CQSIRCKLTFNFGEXCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI/action/storage_attestation","attest_author":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI/action/author_attestation","sign_citation":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI/action/citation_signature","submit_replication":"https://pith.science/pith/E7B62HSQ4CQSIRCKLTFNFGEXCI/action/replication_record"}},"created_at":"2026-07-05T04:22:11.093497+00:00","updated_at":"2026-07-05T04:22:11.093497+00:00"}