{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HLPEXUWK37HQQJYLBYSJL4XSSJ","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":"d543fad76463a3312365eb896c86bbde1e35e0eae8ca5afdead7dafd32cf8a25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-04-17T15:20:45Z","title_canon_sha256":"cc0a3078aba0e7d18453b1280cd1a99f290e19f09d976490399a622a613bae08"},"schema_version":"1.0","source":{"id":"2604.16149","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.16149","created_at":"2026-05-20T00:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"2604.16149v4","created_at":"2026-05-20T00:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.16149","created_at":"2026-05-20T00:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"HLPEXUWK37HQ","created_at":"2026-05-20T00:00:38Z"},{"alias_kind":"pith_short_16","alias_value":"HLPEXUWK37HQQJYL","created_at":"2026-05-20T00:00:38Z"},{"alias_kind":"pith_short_8","alias_value":"HLPEXUWK","created_at":"2026-05-20T00:00:38Z"}],"graph_snapshots":[{"event_id":"sha256:c29c218cc7d7b4c0d2cd6af04ba95b35a88d5921a5368cae69a8a17ca266c87a","target":"graph","created_at":"2026-05-20T00:00:38Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We demonstrate a speedup of 1.9-4.2x over existing algorithms in the single-objective search (earliest arrival time). In the bicriteria setting, we achieve competitive speedup results but greater accuracy. We also find that our method scales much better as the delay buffer Delta increases."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The delay model and graph representations used in the adaptations of ULTRA, CSA, and RAPTOR are sufficient to maintain correctness and the claimed accuracy improvements on the evaluated instances (implicit in the abstract's performance claims)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Extensions to delay-aware multimodal journey planning frameworks (ULTRA, CSA, RAPTOR) deliver 1.9-4.2x speedups in earliest-arrival queries, competitive bicriteria performance with higher accuracy, and better scaling as the delay buffer Delta grows."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Adapting ULTRA, CSA and RAPTOR for delays yields faster and more memory-efficient multimodal journey planning."}],"snapshot_sha256":"cb95491be0a867d3918f4e73f9f52a164554366151abaf4dbb3edfb6ba0e5695"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"76aaf20ddd16db32efefa3a34ae9cc7f8cb3629e8be1a267c2e3a13ae7b3c953"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.16149/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"State-of-the-art multimodal journey-planning algorithms, such as ULTRA, have recently been adapted to account for delays. In this work, we extend this approach to be more memory-efficient, faster, and accurate. We also adapt this framework to other state-of-the-art algorithms, like CSA and RAPTOR. We demonstrate a speedup of 1.9-4.2x over existing algorithms in the single-objective search (earliest arrival time). In the bicriteria setting, we achieve competitive speedup results but greater accuracy. We also find that our method scales much better as the delay buffer Delta increases.","authors_text":"Andrii Rohovyi, Denys Katkalo, Toby Walsh","cross_cats":[],"headline":"Adapting ULTRA, CSA and RAPTOR for delays yields faster and more memory-efficient multimodal journey planning.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-04-17T15:20:45Z","title":"Fast and Memory Efficient Multimodal Journey Planning with Delays"},"references":{"count":15,"internal_anchors":2,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, C. Harrelson, V . Raychev, and F. Viger. Fast routing in very large public transportation networks using transfer patterns. InESA 2010, volume 6346","work_id":"f8e936b7-0eca-4191-aea8-6b4002ff1d55","year":2010},{"cited_arxiv_id":"","doi":"10.1007/978-3-642-15775-2","is_internal_anchor":false,"ref_index":2,"title":"Improved bounds for online stochastic matching","work_id":"c8804d22-b85b-449c-af4e-df7b8cb8f395","year":null},{"cited_arxiv_id":"","doi":"10.1145/1671970.1671976","is_internal_anchor":false,"ref_index":3,"title":"Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, and Tobias Z ¨undorf","work_id":"e7e0bbed-2799-4c28-8d0d-dcfcab3c199d","year":2019},{"cited_arxiv_id":"","doi":"10.1137/1.9781611977929.8","is_internal_anchor":false,"ref_index":4,"title":"Gerth Stølting Brodal and Riko Jacob","work_id":"d23dfb4c-a6f7-4e9f-9881-09a8381a6ef4","year":null},{"cited_arxiv_id":"","doi":"10.1016/s1571-0661(05)80494-7","is_internal_anchor":false,"ref_index":5,"title":"URL https://cs.au.dk/∼gerth/papers/atmos03.pdf","work_id":"83bd447d-a9e2-4d9e-b56e-19baeea616bd","year":2003}],"snapshot_sha256":"3a2ab9a1226c432317a2b6de791195eb69673b4dc12d2d49309cb4fd7abd251b"},"source":{"id":"2604.16149","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-19T16:53:12.008826Z","id":"9edce1c6-a0d2-48d3-a0da-977137659413","model_set":{"reader":"grok-4.3"},"one_line_summary":"Extensions to delay-aware multimodal journey planning frameworks (ULTRA, CSA, RAPTOR) deliver 1.9-4.2x speedups in earliest-arrival queries, competitive bicriteria performance with higher accuracy, and better scaling as the delay buffer Delta grows.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Adapting ULTRA, CSA and RAPTOR for delays yields faster and more memory-efficient multimodal journey planning.","strongest_claim":"We demonstrate a speedup of 1.9-4.2x over existing algorithms in the single-objective search (earliest arrival time). In the bicriteria setting, we achieve competitive speedup results but greater accuracy. We also find that our method scales much better as the delay buffer Delta increases.","weakest_assumption":"The delay model and graph representations used in the adaptations of ULTRA, CSA, and RAPTOR are sufficient to maintain correctness and the claimed accuracy improvements on the evaluated instances (implicit in the abstract's performance claims)."}},"verdict_id":"9edce1c6-a0d2-48d3-a0da-977137659413"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b15bbe1511e6e39c53020c6314cdcced3d8d4953ea5b381a7b0ccad2e6ff1a6","target":"record","created_at":"2026-05-20T00:00:38Z","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":"d543fad76463a3312365eb896c86bbde1e35e0eae8ca5afdead7dafd32cf8a25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-04-17T15:20:45Z","title_canon_sha256":"cc0a3078aba0e7d18453b1280cd1a99f290e19f09d976490399a622a613bae08"},"schema_version":"1.0","source":{"id":"2604.16149","kind":"arxiv","version":4}},"canonical_sha256":"3ade4bd2cadfcf08270b0e2495f2f29274589d76ca6c7afdec6019baeeb05f05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ade4bd2cadfcf08270b0e2495f2f29274589d76ca6c7afdec6019baeeb05f05","first_computed_at":"2026-05-20T00:00:38.318889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:38.318889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nGUm65mqzKWYI/YrWuDoYV9ojebbr5HiXYitH8FWL1ZcyfeO5RYlxbY+BPTwuV3SxXgI+61qsg+51S+JqsVRAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:38.319442Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.16149","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b15bbe1511e6e39c53020c6314cdcced3d8d4953ea5b381a7b0ccad2e6ff1a6","sha256:c29c218cc7d7b4c0d2cd6af04ba95b35a88d5921a5368cae69a8a17ca266c87a"],"state_sha256":"89277afbf451594904b321e528859be34737b4e595490fddacb4529f90d3d6c9"}