Pith Number

pith:PQOSP4EQ

pith:2026:PQOSP4EQS3GOED4KKBP4KAE32R

not attested not anchored not stored refs pending

Adapting Dijkstra for Buffers and Unlimited Transfers

Andrii Rohovyi, Denys Katkalo, Toby Walsh

Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.

arxiv:2603.11729 v4 · 2026-03-12 · cs.DS · cs.AI · cs.RO

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{PQOSP4EQS3GOED4KKBP4KAE32R}

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

Our experiments on London and Switzerland networks show that we can achieve a greater than two time speed-up over MR while producing optimal results on both networks with and without buffer times.

C2weakest assumption

That scanning entire trip sequences in TAD adds negligible overhead compared with edge-by-edge filtering and that the two test networks are representative of the general case where buffer times matter.

C3one line summary

TAD adapts Dijkstra to scan trip sequences instead of edges, correctly managing buffer times for optimal unlimited-transfer routing with over 2x speedup versus MR on real networks.

Formal links

2 machine-checked theorem links

Cited by

2 papers in Pith

Early Pruning for Public Transport Routing

Receipt and verification

First computed	2026-05-25T02:01:17.145276Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

7c1d27f09096cce20f8a505fc5009bd44e3a426a122b67ff6ce6664eaa4fd370

Aliases

arxiv: 2603.11729 · arxiv_version: 2603.11729v4 · doi: 10.48550/arxiv.2603.11729 · pith_short_12: PQOSP4EQS3GO · pith_short_16: PQOSP4EQS3GOED4K · pith_short_8: PQOSP4EQ

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/PQOSP4EQS3GOED4KKBP4KAE32R \
  | 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: 7c1d27f09096cce20f8a505fc5009bd44e3a426a122b67ff6ce6664eaa4fd370

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "7095744b30f40c9663387a4c45315b1fb64210943a4431c70b3cf8f255f89ddd",
    "cross_cats_sorted": [
      "cs.AI",
      "cs.RO"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.DS",
    "submitted_at": "2026-03-12T09:36:50Z",
    "title_canon_sha256": "9bc81581c2ff0e5986f835b771dffe23e73967795a58f880e607b2ff65a3ffd0"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2603.11729",
    "kind": "arxiv",
    "version": 4
  }
}