{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CKHONY5W66FKP5QBGQYRTDK3LJ","short_pith_number":"pith:CKHONY5W","canonical_record":{"source":{"id":"1907.04554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-10T07:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"d7b9e21eb92e544ed21fe08ad618015e06fa2c2bf7f3ac3cc7f5267aadc56099","abstract_canon_sha256":"9896455fe2a4966f89c7c097257a26236927da7fc2f70c2580ae20484db8eeef"},"schema_version":"1.0"},"canonical_sha256":"128ee6e3b6f78aa7f6013431198d5b5a55b5455f3cb95416f03a4d6c1869382f","source":{"kind":"arxiv","id":"1907.04554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04554","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04554v1","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04554","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"CKHONY5W66FK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CKHONY5W66FKP5QB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CKHONY5W","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CKHONY5W66FKP5QBGQYRTDK3LJ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-10T07:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"d7b9e21eb92e544ed21fe08ad618015e06fa2c2bf7f3ac3cc7f5267aadc56099","abstract_canon_sha256":"9896455fe2a4966f89c7c097257a26236927da7fc2f70c2580ae20484db8eeef"},"schema_version":"1.0"},"canonical_sha256":"128ee6e3b6f78aa7f6013431198d5b5a55b5455f3cb95416f03a4d6c1869382f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:59.909815Z","signature_b64":"R2A48kO48j6iWO5Mv9XzNcaywsGLuiVyGXsHwdmjrgBSFoEmP2HzlpIQmHretSo0EoVonjWK2/RsYRuLfyrTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"128ee6e3b6f78aa7f6013431198d5b5a55b5455f3cb95416f03a4d6c1869382f","last_reissued_at":"2026-05-17T23:40:59.909261Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:59.909261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04554","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-05-17T23:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jeu1/tKBkuIcGnkMsgLMu4S3FBPpw6UufJO59r6GafUqnxZw2hhD5obJGqN8TVAHX6k0+EwZ8WhhxpJi8RMvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:34:02.267620Z"},"content_sha256":"2b3374a2c6df93eda18533877443f58c86c8ea68ce2068ae4f277837b4da6a0d","schema_version":"1.0","event_id":"sha256:2b3374a2c6df93eda18533877443f58c86c8ea68ce2068ae4f277837b4da6a0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CKHONY5W66FKP5QBGQYRTDK3LJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Robust Periodic Timetables by Integrating Delay Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Julius P\\\"atzold","submitted_at":"2019-07-10T07:54:01Z","abstract_excerpt":"This paper defines and solves a mathematical model for finding robust periodic timetables by proposing an extension of the Periodic Event Scheduling Problem (PESP). In order to model delayed and not nominal travel times already in the timetabling step, we integrate delay management into the periodic timetabling problem. After revisiting both (PESP) and delay management individually, we introduce a periodic delay management model capable of evaluating periodic timetables with respect to delay resistance. Having introduced periodic delay management, we define the Robust Periodic Timetabling prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04554","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":""},"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-05-17T23:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFvxtJRliz5gN0VsNAfi/ziBYkpcG88DBOc9cLvNYny4psPlIzQGfmy9yy6jDXxd9sN3j43in1Ow5HnLqgCRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:34:02.268348Z"},"content_sha256":"fe37817c25ecaa1a5b8f1cb714cb5c11f2377473f2bdd677b9bc6645de989150","schema_version":"1.0","event_id":"sha256:fe37817c25ecaa1a5b8f1cb714cb5c11f2377473f2bdd677b9bc6645de989150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKHONY5W66FKP5QBGQYRTDK3LJ/bundle.json","state_url":"https://pith.science/pith/CKHONY5W66FKP5QBGQYRTDK3LJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKHONY5W66FKP5QBGQYRTDK3LJ/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-05-25T22:34:02Z","links":{"resolver":"https://pith.science/pith/CKHONY5W66FKP5QBGQYRTDK3LJ","bundle":"https://pith.science/pith/CKHONY5W66FKP5QBGQYRTDK3LJ/bundle.json","state":"https://pith.science/pith/CKHONY5W66FKP5QBGQYRTDK3LJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKHONY5W66FKP5QBGQYRTDK3LJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CKHONY5W66FKP5QBGQYRTDK3LJ","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":"9896455fe2a4966f89c7c097257a26236927da7fc2f70c2580ae20484db8eeef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-10T07:54:01Z","title_canon_sha256":"d7b9e21eb92e544ed21fe08ad618015e06fa2c2bf7f3ac3cc7f5267aadc56099"},"schema_version":"1.0","source":{"id":"1907.04554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04554","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04554v1","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04554","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"CKHONY5W66FK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CKHONY5W66FKP5QB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CKHONY5W","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:fe37817c25ecaa1a5b8f1cb714cb5c11f2377473f2bdd677b9bc6645de989150","target":"graph","created_at":"2026-05-17T23:40:59Z","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"},"paper":{"abstract_excerpt":"This paper defines and solves a mathematical model for finding robust periodic timetables by proposing an extension of the Periodic Event Scheduling Problem (PESP). In order to model delayed and not nominal travel times already in the timetabling step, we integrate delay management into the periodic timetabling problem. After revisiting both (PESP) and delay management individually, we introduce a periodic delay management model capable of evaluating periodic timetables with respect to delay resistance. Having introduced periodic delay management, we define the Robust Periodic Timetabling prob","authors_text":"Julius P\\\"atzold","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-10T07:54:01Z","title":"Finding Robust Periodic Timetables by Integrating Delay Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04554","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:2b3374a2c6df93eda18533877443f58c86c8ea68ce2068ae4f277837b4da6a0d","target":"record","created_at":"2026-05-17T23:40:59Z","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":"9896455fe2a4966f89c7c097257a26236927da7fc2f70c2580ae20484db8eeef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-10T07:54:01Z","title_canon_sha256":"d7b9e21eb92e544ed21fe08ad618015e06fa2c2bf7f3ac3cc7f5267aadc56099"},"schema_version":"1.0","source":{"id":"1907.04554","kind":"arxiv","version":1}},"canonical_sha256":"128ee6e3b6f78aa7f6013431198d5b5a55b5455f3cb95416f03a4d6c1869382f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"128ee6e3b6f78aa7f6013431198d5b5a55b5455f3cb95416f03a4d6c1869382f","first_computed_at":"2026-05-17T23:40:59.909261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:59.909261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2A48kO48j6iWO5Mv9XzNcaywsGLuiVyGXsHwdmjrgBSFoEmP2HzlpIQmHretSo0EoVonjWK2/RsYRuLfyrTDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:59.909815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b3374a2c6df93eda18533877443f58c86c8ea68ce2068ae4f277837b4da6a0d","sha256:fe37817c25ecaa1a5b8f1cb714cb5c11f2377473f2bdd677b9bc6645de989150"],"state_sha256":"05102b21ad95ebe6239c4ade1be0b3d64ebab13bb7d609bed5fb9de321b69b86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQz3H9HoJGJlFf5ecWjst1NBsLIcmUsJzHObaFmEcs25JhJhtuV+y9/HQx+hgLbDYOIf/dF+QpgTZoRVgDNgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:34:02.272210Z","bundle_sha256":"fd46a8640d7e88df42bb3f84b968337161d1beb802c686da45fd9fd538ffa0d5"}}