{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WN6ZFBHT57JGNS6W4EFB5STSP7","short_pith_number":"pith:WN6ZFBHT","canonical_record":{"source":{"id":"2407.00836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-30T21:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"6885782ae3148bfb1ffcb35434434f2e2ec72fb09224e69f20435c55fe8ab52b","abstract_canon_sha256":"63f9dbf13a8465edf3d7a72c5d93ae737294381f91cdec204914a78746bcb1d4"},"schema_version":"1.0"},"canonical_sha256":"b37d9284f3efd266cbd6e10a1eca727fdfe21d5419bd406f29675281101fad80","source":{"kind":"arxiv","id":"2407.00836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.00836","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"arxiv_version","alias_value":"2407.00836v1","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00836","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"pith_short_12","alias_value":"WN6ZFBHT57JG","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"pith_short_16","alias_value":"WN6ZFBHT57JGNS6W","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"pith_short_8","alias_value":"WN6ZFBHT","created_at":"2026-07-05T08:38:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WN6ZFBHT57JGNS6W4EFB5STSP7","target":"record","payload":{"canonical_record":{"source":{"id":"2407.00836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-30T21:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"6885782ae3148bfb1ffcb35434434f2e2ec72fb09224e69f20435c55fe8ab52b","abstract_canon_sha256":"63f9dbf13a8465edf3d7a72c5d93ae737294381f91cdec204914a78746bcb1d4"},"schema_version":"1.0"},"canonical_sha256":"b37d9284f3efd266cbd6e10a1eca727fdfe21d5419bd406f29675281101fad80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:25.281367Z","signature_b64":"8QmSI2rYeEVfn/4RIqgnvm3zrUN3Ed9STT/7DSrrMD198gruIrfEMIrRmyJZm/SKQQzeNbPBev8B/ssfME7KAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b37d9284f3efd266cbd6e10a1eca727fdfe21d5419bd406f29675281101fad80","last_reissued_at":"2026-07-05T08:38:25.280930Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:25.280930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.00836","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-07-05T08:38:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDSei9rbpunXax07huikPw97xiTzyN0QQkfzVrvEXmujVosQ4MjDyR8QS2zkOCVrx8v7F6xR++a5DYFFnNYcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:25:52.931880Z"},"content_sha256":"8576adf5a8ca0ef4ee35bfadec9aae1b970c7f33e98e2e1873e831ae34d8723a","schema_version":"1.0","event_id":"sha256:8576adf5a8ca0ef4ee35bfadec9aae1b970c7f33e98e2e1873e831ae34d8723a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WN6ZFBHT57JGNS6W4EFB5STSP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incorporating Service Reliability in Multi-depot Vehicle Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amer Shalaby, Margarita P. Castro, Merve Bodur","submitted_at":"2024-06-30T21:36:09Z","abstract_excerpt":"The multi-depot vehicle scheduling problem (MDVSP) is a critical planning challenge for transit agencies. We introduce a novel approach to MDVSP by incorporating service reliability through chance-constrained programming (CCP), targeting the pivotal issue of travel time uncertainty and its impact on transit service quality. Our model guarantees service reliability measured by on-time performance (OTP), a primary metric for transit agencies, and fairness across different service areas.We propose an exact branch-and-cut (B&C) scheme to solve our CCP model. We present several cut-generation proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00836","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/2407.00836/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-07-05T08:38:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2I0Q1pnI35MszhtzKND4luXz44UY190BrnJdIDppNPb6ecNnjN8jCCQwlucIZZF3TdERU+0lHESuhg1v5ojDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:25:52.932385Z"},"content_sha256":"d41a2336c02949170d1eeccefe76ae0046d77f4469420f2c885de3bbee5666ed","schema_version":"1.0","event_id":"sha256:d41a2336c02949170d1eeccefe76ae0046d77f4469420f2c885de3bbee5666ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WN6ZFBHT57JGNS6W4EFB5STSP7/bundle.json","state_url":"https://pith.science/pith/WN6ZFBHT57JGNS6W4EFB5STSP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WN6ZFBHT57JGNS6W4EFB5STSP7/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-05T20:25:52Z","links":{"resolver":"https://pith.science/pith/WN6ZFBHT57JGNS6W4EFB5STSP7","bundle":"https://pith.science/pith/WN6ZFBHT57JGNS6W4EFB5STSP7/bundle.json","state":"https://pith.science/pith/WN6ZFBHT57JGNS6W4EFB5STSP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WN6ZFBHT57JGNS6W4EFB5STSP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WN6ZFBHT57JGNS6W4EFB5STSP7","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":"63f9dbf13a8465edf3d7a72c5d93ae737294381f91cdec204914a78746bcb1d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-30T21:36:09Z","title_canon_sha256":"6885782ae3148bfb1ffcb35434434f2e2ec72fb09224e69f20435c55fe8ab52b"},"schema_version":"1.0","source":{"id":"2407.00836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.00836","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"arxiv_version","alias_value":"2407.00836v1","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00836","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"pith_short_12","alias_value":"WN6ZFBHT57JG","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"pith_short_16","alias_value":"WN6ZFBHT57JGNS6W","created_at":"2026-07-05T08:38:25Z"},{"alias_kind":"pith_short_8","alias_value":"WN6ZFBHT","created_at":"2026-07-05T08:38:25Z"}],"graph_snapshots":[{"event_id":"sha256:d41a2336c02949170d1eeccefe76ae0046d77f4469420f2c885de3bbee5666ed","target":"graph","created_at":"2026-07-05T08:38:25Z","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/2407.00836/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The multi-depot vehicle scheduling problem (MDVSP) is a critical planning challenge for transit agencies. We introduce a novel approach to MDVSP by incorporating service reliability through chance-constrained programming (CCP), targeting the pivotal issue of travel time uncertainty and its impact on transit service quality. Our model guarantees service reliability measured by on-time performance (OTP), a primary metric for transit agencies, and fairness across different service areas.We propose an exact branch-and-cut (B&C) scheme to solve our CCP model. We present several cut-generation proce","authors_text":"Amer Shalaby, Margarita P. Castro, Merve Bodur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-30T21:36:09Z","title":"Incorporating Service Reliability in Multi-depot Vehicle Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00836","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:8576adf5a8ca0ef4ee35bfadec9aae1b970c7f33e98e2e1873e831ae34d8723a","target":"record","created_at":"2026-07-05T08:38:25Z","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":"63f9dbf13a8465edf3d7a72c5d93ae737294381f91cdec204914a78746bcb1d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-30T21:36:09Z","title_canon_sha256":"6885782ae3148bfb1ffcb35434434f2e2ec72fb09224e69f20435c55fe8ab52b"},"schema_version":"1.0","source":{"id":"2407.00836","kind":"arxiv","version":1}},"canonical_sha256":"b37d9284f3efd266cbd6e10a1eca727fdfe21d5419bd406f29675281101fad80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b37d9284f3efd266cbd6e10a1eca727fdfe21d5419bd406f29675281101fad80","first_computed_at":"2026-07-05T08:38:25.280930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:38:25.280930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8QmSI2rYeEVfn/4RIqgnvm3zrUN3Ed9STT/7DSrrMD198gruIrfEMIrRmyJZm/SKQQzeNbPBev8B/ssfME7KAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:38:25.281367Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.00836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8576adf5a8ca0ef4ee35bfadec9aae1b970c7f33e98e2e1873e831ae34d8723a","sha256:d41a2336c02949170d1eeccefe76ae0046d77f4469420f2c885de3bbee5666ed"],"state_sha256":"81d3a3a04d15fbb02f070afb5514b1eabe8fc0a4294216666c2ab6560bf07574"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQS7oGz/AVeBb2Jm8gYBcs9IY+13lXqJJLrchN8gDJu5WCXc9JCovLkQJLAca3A7XdHEyfSW8DRcVxdiOYlpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T20:25:52.936402Z","bundle_sha256":"27d4d5409b5e8c584fe14a630bf52f1834a5eda56cbc23d8023c08de8521b387"}}