{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JF7QXKQYKQAJNQ3IT3JXQS7D57","short_pith_number":"pith:JF7QXKQY","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"},"canonical_sha256":"497f0baa18540096c3689ed3784be3efcb1e7265da086c4cb7df885b26bc1c7d","source":{"kind":"arxiv","id":"2606.11383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11383","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11383v1","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11383","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"JF7QXKQYKQAJ","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"pith_short_16","alias_value":"JF7QXKQYKQAJNQ3I","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"pith_short_8","alias_value":"JF7QXKQY","created_at":"2026-06-11T00:08:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JF7QXKQYKQAJNQ3IT3JXQS7D57","target":"record","payload":{"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"},"canonical_sha256":"497f0baa18540096c3689ed3784be3efcb1e7265da086c4cb7df885b26bc1c7d","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"},"source_kind":"arxiv","source_id":"2606.11383","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T00:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeF3S8sfJOc/LS6pIOBCRpFVb9geg+j30PReF3VrxSH5a7j+wHy8pTfsA52X4O3WMjI2fmi1Jv0bdgmEp5t6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:08:18.849949Z"},"content_sha256":"c054dcd5f710e1c964de8a3770288b54d6c5065bd58b690b64a41fe5b5c52f24","schema_version":"1.0","event_id":"sha256:c054dcd5f710e1c964de8a3770288b54d6c5065bd58b690b64a41fe5b5c52f24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JF7QXKQYKQAJNQ3IT3JXQS7D57","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T00:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yu3yMoqFcHgAF/kOAO/h+OohnLzyyo6VDtga6B/s1GQUI/MDd2HtLQk89itAB2s+Nc7zNun8BRaSHJ62QJoaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:08:18.850383Z"},"content_sha256":"1d49ccef61e9c42a31ac3b8db5752ac4795267481578de24f8eeb164e9730b97","schema_version":"1.0","event_id":"sha256:1d49ccef61e9c42a31ac3b8db5752ac4795267481578de24f8eeb164e9730b97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/bundle.json","state_url":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T11:08:18Z","links":{"resolver":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57","bundle":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/bundle.json","state":"https://pith.science/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JF7QXKQYKQAJNQ3IT3JXQS7D57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JF7QXKQYKQAJNQ3IT3JXQS7D57","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ea017a2b84410c39198a84b1675af4a32895a938f266027f98f3fbf36be579d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-09T19:06:55Z","title_canon_sha256":"ed1f9d84616df0c4e0f86a735d86181bdbc4622439f2b8b29fa59fdcd154b8a6"},"schema_version":"1.0","source":{"id":"2606.11383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11383","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11383v1","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11383","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"JF7QXKQYKQAJ","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"pith_short_16","alias_value":"JF7QXKQYKQAJNQ3I","created_at":"2026-06-11T00:08:22Z"},{"alias_kind":"pith_short_8","alias_value":"JF7QXKQY","created_at":"2026-06-11T00:08:22Z"}],"graph_snapshots":[{"event_id":"sha256:1d49ccef61e9c42a31ac3b8db5752ac4795267481578de24f8eeb164e9730b97","target":"graph","created_at":"2026-06-11T00:08:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.11383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Elisabeth Wybo, Ji\\v{r}\\'i Guth Jarkovsk\\'y, Martin Leib, Patricia Bickert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-09T19:06:55Z","title":"Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11383","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c054dcd5f710e1c964de8a3770288b54d6c5065bd58b690b64a41fe5b5c52f24","target":"record","created_at":"2026-06-11T00:08:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ea017a2b84410c39198a84b1675af4a32895a938f266027f98f3fbf36be579d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-09T19:06:55Z","title_canon_sha256":"ed1f9d84616df0c4e0f86a735d86181bdbc4622439f2b8b29fa59fdcd154b8a6"},"schema_version":"1.0","source":{"id":"2606.11383","kind":"arxiv","version":1}},"canonical_sha256":"497f0baa18540096c3689ed3784be3efcb1e7265da086c4cb7df885b26bc1c7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"497f0baa18540096c3689ed3784be3efcb1e7265da086c4cb7df885b26bc1c7d","first_computed_at":"2026-06-11T00:08:22.681028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T00:08:22.681028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AVD+zyZctFzMLESFKTnhUUOz3W0nmOWcIcbFsrNWGbBoeL5hxG+ZeJAmege7N3+j2LJGgHJ/Vg8u+CeAscm5BA==","signature_status":"signed_v1","signed_at":"2026-06-11T00:08:22.681867Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c054dcd5f710e1c964de8a3770288b54d6c5065bd58b690b64a41fe5b5c52f24","sha256:1d49ccef61e9c42a31ac3b8db5752ac4795267481578de24f8eeb164e9730b97"],"state_sha256":"5577ca8c020b0f6ae60f3dcba7e1c012c1b77021b9358198a1e8c3d44c2c1b7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMuTXIDd7a0rJfnibJCkvEdy/37ui45KIYMyENyFd5s7Hwk3Zrorqaz2zfA9d3mZjY21K2mhIbZH5E5fFTwaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:08:18.852405Z","bundle_sha256":"f8d638bdff3b7c3db8a1f49f06c6fb2bd4fde680476fe914674df31ee238f063"}}