{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HQ2442DCIVHBS3V5JPTGLJSHUC","short_pith_number":"pith:HQ2442DC","canonical_record":{"source":{"id":"2503.07812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-10T19:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"8791fb7272a0c7785b63238297d3c78f81905f24ec26479ad533a51e45445a9a","abstract_canon_sha256":"44e771cc3ac1bfb49ba42146716d44ef336d6a1f817024e82f54bb36029cbc64"},"schema_version":"1.0"},"canonical_sha256":"3c35ce6862454e196ebd4be665a647a0a6f52ceade56e81e0a4ebf817287a75e","source":{"kind":"arxiv","id":"2503.07812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.07812","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"2503.07812v1","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07812","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"HQ2442DCIVHB","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_16","alias_value":"HQ2442DCIVHBS3V5","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_8","alias_value":"HQ2442DC","created_at":"2026-07-05T10:28:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HQ2442DCIVHBS3V5JPTGLJSHUC","target":"record","payload":{"canonical_record":{"source":{"id":"2503.07812","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-10T19:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"8791fb7272a0c7785b63238297d3c78f81905f24ec26479ad533a51e45445a9a","abstract_canon_sha256":"44e771cc3ac1bfb49ba42146716d44ef336d6a1f817024e82f54bb36029cbc64"},"schema_version":"1.0"},"canonical_sha256":"3c35ce6862454e196ebd4be665a647a0a6f52ceade56e81e0a4ebf817287a75e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:44.284867Z","signature_b64":"GIFBrl0EL6LRQ+ZozZsCQFLWf0Yvis5++bwlpJ0TxY9FKe1jwFEuwkhmkDmGH3CLXhHs0wksVdjCMRj1AQKMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c35ce6862454e196ebd4be665a647a0a6f52ceade56e81e0a4ebf817287a75e","last_reissued_at":"2026-07-05T10:28:44.284358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:44.284358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.07812","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-05T10:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoMubkpRH5W5TsjKSrXK2Ri0HAeapgwIrQPedACgEc/ceXvEcRenqeDcLOa4IiaefR0rIxvdG33z31t4ozHaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:39:59.405683Z"},"content_sha256":"737af9e37558c67fa13a955800a1db964742eb5df9da1dbff6d3be9ad6b5c5dd","schema_version":"1.0","event_id":"sha256:737af9e37558c67fa13a955800a1db964742eb5df9da1dbff6d3be9ad6b5c5dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HQ2442DCIVHBS3V5JPTGLJSHUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Operational route planning under uncertainty for Demand Adaptive Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Axel Parmentier, Benedikt Lienkamp, Maximilian Schiffer, Mike Hewitt","submitted_at":"2025-03-10T19:52:05Z","abstract_excerpt":"With an increasing need for more flexible mobility services, we consider an operational problem arising in the planning of Demand Adaptive Systems (DAS). Motivated by the decision of whether to accept or reject passenger requests in real time in a DAS, we introduce the operational route planning problem of DASs. To this end, we propose an algorithmic framework that allows an operator to plan which passengers to serve in a DAS in real-time. To do so, we model the operational route planning problem as a Markov decision process (MDP) and utilize a rolling horizon approach to approximate the MDP v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07812","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/2503.07812/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-05T10:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHaqBYKFqfwQqI6KHTnHHiJKqeI8iOA3JC4CHKLLpke3I+HbCyJY9V1K7mBZvoKiR2BDYkp0AGzxsY63p/q+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:39:59.406304Z"},"content_sha256":"1d4306e650ddbb230c8dfae3de084f55916234e33ed66989dfc691424ac62d64","schema_version":"1.0","event_id":"sha256:1d4306e650ddbb230c8dfae3de084f55916234e33ed66989dfc691424ac62d64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQ2442DCIVHBS3V5JPTGLJSHUC/bundle.json","state_url":"https://pith.science/pith/HQ2442DCIVHBS3V5JPTGLJSHUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQ2442DCIVHBS3V5JPTGLJSHUC/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-16T20:39:59Z","links":{"resolver":"https://pith.science/pith/HQ2442DCIVHBS3V5JPTGLJSHUC","bundle":"https://pith.science/pith/HQ2442DCIVHBS3V5JPTGLJSHUC/bundle.json","state":"https://pith.science/pith/HQ2442DCIVHBS3V5JPTGLJSHUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQ2442DCIVHBS3V5JPTGLJSHUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HQ2442DCIVHBS3V5JPTGLJSHUC","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":"44e771cc3ac1bfb49ba42146716d44ef336d6a1f817024e82f54bb36029cbc64","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-10T19:52:05Z","title_canon_sha256":"8791fb7272a0c7785b63238297d3c78f81905f24ec26479ad533a51e45445a9a"},"schema_version":"1.0","source":{"id":"2503.07812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.07812","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"2503.07812v1","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07812","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"HQ2442DCIVHB","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_16","alias_value":"HQ2442DCIVHBS3V5","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_8","alias_value":"HQ2442DC","created_at":"2026-07-05T10:28:44Z"}],"graph_snapshots":[{"event_id":"sha256:1d4306e650ddbb230c8dfae3de084f55916234e33ed66989dfc691424ac62d64","target":"graph","created_at":"2026-07-05T10:28:44Z","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/2503.07812/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"With an increasing need for more flexible mobility services, we consider an operational problem arising in the planning of Demand Adaptive Systems (DAS). Motivated by the decision of whether to accept or reject passenger requests in real time in a DAS, we introduce the operational route planning problem of DASs. To this end, we propose an algorithmic framework that allows an operator to plan which passengers to serve in a DAS in real-time. To do so, we model the operational route planning problem as a Markov decision process (MDP) and utilize a rolling horizon approach to approximate the MDP v","authors_text":"Axel Parmentier, Benedikt Lienkamp, Maximilian Schiffer, Mike Hewitt","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-10T19:52:05Z","title":"Operational route planning under uncertainty for Demand Adaptive Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07812","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:737af9e37558c67fa13a955800a1db964742eb5df9da1dbff6d3be9ad6b5c5dd","target":"record","created_at":"2026-07-05T10:28:44Z","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":"44e771cc3ac1bfb49ba42146716d44ef336d6a1f817024e82f54bb36029cbc64","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-10T19:52:05Z","title_canon_sha256":"8791fb7272a0c7785b63238297d3c78f81905f24ec26479ad533a51e45445a9a"},"schema_version":"1.0","source":{"id":"2503.07812","kind":"arxiv","version":1}},"canonical_sha256":"3c35ce6862454e196ebd4be665a647a0a6f52ceade56e81e0a4ebf817287a75e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c35ce6862454e196ebd4be665a647a0a6f52ceade56e81e0a4ebf817287a75e","first_computed_at":"2026-07-05T10:28:44.284358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:28:44.284358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GIFBrl0EL6LRQ+ZozZsCQFLWf0Yvis5++bwlpJ0TxY9FKe1jwFEuwkhmkDmGH3CLXhHs0wksVdjCMRj1AQKMCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:28:44.284867Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.07812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:737af9e37558c67fa13a955800a1db964742eb5df9da1dbff6d3be9ad6b5c5dd","sha256:1d4306e650ddbb230c8dfae3de084f55916234e33ed66989dfc691424ac62d64"],"state_sha256":"f3cba14d69c24eb37324b7370824ed85cd1d2c6c04be1d24eb9a26467e03ebb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3L9HQVJV3yL3J04PpAk9c0SQ8rF+rx7NX9QWt2l1kGAakakOG9er6kDj3Cn8z1t2g7aZBp5z2vZgPGz9FVX9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:39:59.412800Z","bundle_sha256":"03e7b0b49caff32224589c302813f3f33950a863993638bb2111271343ed7873"}}