{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KUNGZLQTQURRU4DOAVOOI5PWYE","short_pith_number":"pith:KUNGZLQT","canonical_record":{"source":{"id":"2606.10081","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"63e43e2b7d8c849629cb1bea5261120d660c2ca22566e9f974dd79f1c2c16ab7","abstract_canon_sha256":"f63a2b5d306c62a293f39a0d62165fc2f4feb739b810a1ee9b1d20ff7a9d6ac9"},"schema_version":"1.0"},"canonical_sha256":"551a6cae1385231a706e055ce475f6c1296c9b499d9041848d48ce04409bdb4c","source":{"kind":"arxiv","id":"2606.10081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10081","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10081v1","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10081","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"KUNGZLQTQURR","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"pith_short_16","alias_value":"KUNGZLQTQURRU4DO","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"pith_short_8","alias_value":"KUNGZLQT","created_at":"2026-06-10T00:08:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KUNGZLQTQURRU4DOAVOOI5PWYE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.10081","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"63e43e2b7d8c849629cb1bea5261120d660c2ca22566e9f974dd79f1c2c16ab7","abstract_canon_sha256":"f63a2b5d306c62a293f39a0d62165fc2f4feb739b810a1ee9b1d20ff7a9d6ac9"},"schema_version":"1.0"},"canonical_sha256":"551a6cae1385231a706e055ce475f6c1296c9b499d9041848d48ce04409bdb4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T00:08:48.332175Z","signature_b64":"WdYZ6xIuZ1ddKQt7Ely3RPVVvSI6ZDk6N2pbWNNisjOL5P48tkg9j1Niq/ZJz4W7vwBuyDbfMevOHhytQ8zjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"551a6cae1385231a706e055ce475f6c1296c9b499d9041848d48ce04409bdb4c","last_reissued_at":"2026-06-10T00:08:48.331363Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T00:08:48.331363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.10081","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-10T00:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+W0QkPd+Kol5V0N0Oq59dIzxYCMG2Fne5gIKbYMzpwPrq5cqL4rxoZNf0ZozrYalxlchEHKfv5YHBV3qeh/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:46:32.509228Z"},"content_sha256":"35424ab1d026dbfb9b8db84d8193eef7cb05014a003c9bd5baa12d94ee634dd3","schema_version":"1.0","event_id":"sha256:35424ab1d026dbfb9b8db84d8193eef7cb05014a003c9bd5baa12d94ee634dd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KUNGZLQTQURRU4DOAVOOI5PWYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Branch and Price for Railway Crew Scheduling: Benchmark Instances and Computational Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bart van Rossum","submitted_at":"2026-06-08T19:04:31Z","abstract_excerpt":"Railway crew scheduling consists of assigning a set of tasks to crew members in the form of feasible duties so as to minimise costs, and is one of the key planning problems faced by railway operators. While column generation is the dominant solution method, literature on exact branch-and-price approaches is scarce. Moreover, few publicly available benchmark instances exist. We present a state-of-the-art branch-and-price algorithm and conduct a systematic computational study of its components, including branching rules, primal heuristics, and reduced cost fixing techniques. To this end, we intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10081","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.10081/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-10T00:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDe/Xon52vrEWkp4p1cQ56yIPqEXgt/WNLsss6V6P1tim8Zo9C6dDhkqFJCvRUZWl7Ybr5rfWCS3L7vS4TlECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:46:32.509628Z"},"content_sha256":"b319df12c8d43f7708f8969dc8de245e0f1db41dcbcebb84a514749664f7fdcf","schema_version":"1.0","event_id":"sha256:b319df12c8d43f7708f8969dc8de245e0f1db41dcbcebb84a514749664f7fdcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUNGZLQTQURRU4DOAVOOI5PWYE/bundle.json","state_url":"https://pith.science/pith/KUNGZLQTQURRU4DOAVOOI5PWYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUNGZLQTQURRU4DOAVOOI5PWYE/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-08-23T10:46:32Z","links":{"resolver":"https://pith.science/pith/KUNGZLQTQURRU4DOAVOOI5PWYE","bundle":"https://pith.science/pith/KUNGZLQTQURRU4DOAVOOI5PWYE/bundle.json","state":"https://pith.science/pith/KUNGZLQTQURRU4DOAVOOI5PWYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUNGZLQTQURRU4DOAVOOI5PWYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KUNGZLQTQURRU4DOAVOOI5PWYE","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":"f63a2b5d306c62a293f39a0d62165fc2f4feb739b810a1ee9b1d20ff7a9d6ac9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:04:31Z","title_canon_sha256":"63e43e2b7d8c849629cb1bea5261120d660c2ca22566e9f974dd79f1c2c16ab7"},"schema_version":"1.0","source":{"id":"2606.10081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10081","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10081v1","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10081","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"KUNGZLQTQURR","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"pith_short_16","alias_value":"KUNGZLQTQURRU4DO","created_at":"2026-06-10T00:08:48Z"},{"alias_kind":"pith_short_8","alias_value":"KUNGZLQT","created_at":"2026-06-10T00:08:48Z"}],"graph_snapshots":[{"event_id":"sha256:b319df12c8d43f7708f8969dc8de245e0f1db41dcbcebb84a514749664f7fdcf","target":"graph","created_at":"2026-06-10T00:08:48Z","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.10081/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Railway crew scheduling consists of assigning a set of tasks to crew members in the form of feasible duties so as to minimise costs, and is one of the key planning problems faced by railway operators. While column generation is the dominant solution method, literature on exact branch-and-price approaches is scarce. Moreover, few publicly available benchmark instances exist. We present a state-of-the-art branch-and-price algorithm and conduct a systematic computational study of its components, including branching rules, primal heuristics, and reduced cost fixing techniques. To this end, we intr","authors_text":"Bart van Rossum","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:04:31Z","title":"Branch and Price for Railway Crew Scheduling: Benchmark Instances and Computational Study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10081","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:35424ab1d026dbfb9b8db84d8193eef7cb05014a003c9bd5baa12d94ee634dd3","target":"record","created_at":"2026-06-10T00:08:48Z","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":"f63a2b5d306c62a293f39a0d62165fc2f4feb739b810a1ee9b1d20ff7a9d6ac9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:04:31Z","title_canon_sha256":"63e43e2b7d8c849629cb1bea5261120d660c2ca22566e9f974dd79f1c2c16ab7"},"schema_version":"1.0","source":{"id":"2606.10081","kind":"arxiv","version":1}},"canonical_sha256":"551a6cae1385231a706e055ce475f6c1296c9b499d9041848d48ce04409bdb4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"551a6cae1385231a706e055ce475f6c1296c9b499d9041848d48ce04409bdb4c","first_computed_at":"2026-06-10T00:08:48.331363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T00:08:48.331363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WdYZ6xIuZ1ddKQt7Ely3RPVVvSI6ZDk6N2pbWNNisjOL5P48tkg9j1Niq/ZJz4W7vwBuyDbfMevOHhytQ8zjCA==","signature_status":"signed_v1","signed_at":"2026-06-10T00:08:48.332175Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.10081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35424ab1d026dbfb9b8db84d8193eef7cb05014a003c9bd5baa12d94ee634dd3","sha256:b319df12c8d43f7708f8969dc8de245e0f1db41dcbcebb84a514749664f7fdcf"],"state_sha256":"ca278fddf0d638d61e49fb6c7c411884387e650a9a8dba2545062cb0597bd456"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1HkWvnsEUKd2BoigPyS9DF51jJQvVf3zsQH7Nk9BJaZVrWTy8wFNCM7LJWIRb4Tpdcb22ZCmg4EMahHK7f5zAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T10:46:32.512768Z","bundle_sha256":"1cd9dd07d6de5fedb19ca91fea69770b6f254c722c7a68fb64554e9bebea5a43"}}