Pith Number

pith:HLPEXUWK

pith:2026:HLPEXUWK37HQQJYLBYSJL4XSSJ

not attested not anchored not stored refs resolved

Fast and Memory Efficient Multimodal Journey Planning with Delays

Andrii Rohovyi, Denys Katkalo, Toby Walsh

Adapting ULTRA, CSA and RAPTOR for delays yields faster and more memory-efficient multimodal journey planning.

arxiv:2604.16149 v4 · 2026-04-17 · cs.DS

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{HLPEXUWK37HQQJYLBYSJL4XSSJ}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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).

C3one 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.

References

15 extracted · 15 resolved · 2 Pith anchors

[1] 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 2010

[2] Improved bounds for online stochastic matching · doi:10.1007/978-3-642-15775-2

[3] Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, and Tobias Z ¨undorf 2019 · doi:10.1145/1671970.1671976

[4] Gerth Stølting Brodal and Riko Jacob · doi:10.1137/1.9781611977929.8

[5] URL https://cs.au.dk/∼gerth/papers/atmos03.pdf 2003 · doi:10.1016/s1571-0661(05)80494-7

Formal links

1 machine-checked theorem link

Receipt and verification

First computed	2026-05-20T00:00:38.318889Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

3ade4bd2cadfcf08270b0e2495f2f29274589d76ca6c7afdec6019baeeb05f05

Aliases

arxiv: 2604.16149 · arxiv_version: 2604.16149v4 · doi: 10.48550/arxiv.2604.16149 · pith_short_12: HLPEXUWK37HQ · pith_short_16: HLPEXUWK37HQQJYL · pith_short_8: HLPEXUWK

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/HLPEXUWK37HQQJYLBYSJL4XSSJ \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 3ade4bd2cadfcf08270b0e2495f2f29274589d76ca6c7afdec6019baeeb05f05

Canonical record JSON

{
  "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
  }
}