{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JF7QXKQYKQAJNQ3IT3JXQS7D57","short_pith_number":"pith:JF7QXKQY","schema_version":"1.0","canonical_sha256":"497f0baa18540096c3689ed3784be3efcb1e7265da086c4cb7df885b26bc1c7d","source":{"kind":"arxiv","id":"2606.11383","version":1},"attestation_state":"computed","paper":{"title":"Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elisabeth Wybo, Ji\\v{r}\\'i Guth Jarkovsk\\'y, Martin Leib, Patricia Bickert","submitted_at":"2026-06-09T19:06:55Z","abstract_excerpt":"Rolling stock planning is a complex optimization problem in railway management that involves assigning physical trains to scheduled trips while minimizing operational costs. In this work, we address a specific instance of this problem featuring 190 trips over two days, subject to constraints such as mandatory maintenance stops. We reformulate the problem as a Maximum-Weight Independent Set (MWIS) problem on a graph where nodes represent feasible train cycles. To handle the computational complexity of the large search space, we propose a hybrid divide-and-conquer algorithm. This approach iterat"},"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":"2606.11383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-09T19:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"ed1f9d84616df0c4e0f86a735d86181bdbc4622439f2b8b29fa59fdcd154b8a6","abstract_canon_sha256":"ea017a2b84410c39198a84b1675af4a32895a938f266027f98f3fbf36be579d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T00:08:22.681867Z","signature_b64":"AVD+zyZctFzMLESFKTnhUUOz3W0nmOWcIcbFsrNWGbBoeL5hxG+ZeJAmege7N3+j2LJGgHJ/Vg8u+CeAscm5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"497f0baa18540096c3689ed3784be3efcb1e7265da086c4cb7df885b26bc1c7d","last_reissued_at":"2026-06-11T00:08:22.681028Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T00:08:22.681028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elisabeth Wybo, Ji\\v{r}\\'i Guth Jarkovsk\\'y, Martin Leib, Patricia Bickert","submitted_at":"2026-06-09T19:06:55Z","abstract_excerpt":"Rolling stock planning is a complex optimization problem in railway management that involves assigning physical trains to scheduled trips while minimizing operational costs. In this work, we address a specific instance of this problem featuring 190 trips over two days, subject to constraints such as mandatory maintenance stops. We reformulate the problem as a Maximum-Weight Independent Set (MWIS) problem on a graph where nodes represent feasible train cycles. To handle the computational complexity of the large search space, we propose a hybrid divide-and-conquer algorithm. This approach iterat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11383","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/2606.11383/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":"2606.11383","created_at":"2026-06-11T00:08:22.681176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11383v1","created_at":"2026-06-11T00:08:22.681176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11383","created_at":"2026-06-11T00:08:22.681176+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF7QXKQYKQAJ","created_at":"2026-06-11T00:08:22.681176+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF7QXKQYKQAJNQ3I","created_at":"2026-06-11T00:08:22.681176+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF7QXKQY","created_at":"2026-06-11T00:08:22.681176+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/JF7QXKQYKQAJNQ3IT3JXQS7D57","json":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57.json","graph_json":"https://pith.science/api/pith-number/JF7QXKQYKQAJNQ3IT3JXQS7D57/graph.json","events_json":"https://pith.science/api/pith-number/JF7QXKQYKQAJNQ3IT3JXQS7D57/events.json","paper":"https://pith.science/paper/JF7QXKQY"},"agent_actions":{"view_html":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57","download_json":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57.json","view_paper":"https://pith.science/paper/JF7QXKQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11383&json=true","fetch_graph":"https://pith.science/api/pith-number/JF7QXKQYKQAJNQ3IT3JXQS7D57/graph.json","fetch_events":"https://pith.science/api/pith-number/JF7QXKQYKQAJNQ3IT3JXQS7D57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/action/storage_attestation","attest_author":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/action/author_attestation","sign_citation":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/action/citation_signature","submit_replication":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/action/replication_record"}},"created_at":"2026-06-11T00:08:22.681176+00:00","updated_at":"2026-06-11T00:08:22.681176+00:00"}