{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PQOSP4EQS3GOED4KKBP4KAE32R","short_pith_number":"pith:PQOSP4EQ","schema_version":"1.0","canonical_sha256":"7c1d27f09096cce20f8a505fc5009bd44e3a426a122b67ff6ce6664eaa4fd370","source":{"kind":"arxiv","id":"2603.11729","version":4},"attestation_state":"computed","paper":{"title":"Adapting Dijkstra for Buffers and Unlimited Transfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.DS","authors_text":"Andrii Rohovyi, Denys Katkalo, Toby Walsh","submitted_at":"2026-03-12T09:36:50Z","abstract_excerpt":"In recent years, RAPTOR based algorithms have been considered the state-of-the-art for path-finding with unlimited transfers without preprocessing. However, this status largely stems from the evolution of routing research, where Dijkstra-based solutions were superseded by timetable-based algorithms without a systematic comparison. In this work, we revisit classical Dijkstra-based approaches for public transit routing with unlimited transfers and demonstrate that Time-Dependent Dijkstra (TD-Dijkstra) outperforms MR. However, efficient TD-Dijkstra implementations rely on filtering dominated conn"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2603.11729","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-03-12T09:36:50Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"9bc81581c2ff0e5986f835b771dffe23e73967795a58f880e607b2ff65a3ffd0","abstract_canon_sha256":"7095744b30f40c9663387a4c45315b1fb64210943a4431c70b3cf8f255f89ddd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:17.146106Z","signature_b64":"mq6hyWn8EYvv7Fjyu/coW3wlNJisIN1nHwp8iCB8W2Pm/VQQsnMXFXtk+Jn9f35bVgKBqvJsNIpkjozv6pZBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c1d27f09096cce20f8a505fc5009bd44e3a426a122b67ff6ce6664eaa4fd370","last_reissued_at":"2026-05-25T02:01:17.145276Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:17.145276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adapting Dijkstra for Buffers and Unlimited Transfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.DS","authors_text":"Andrii Rohovyi, Denys Katkalo, Toby Walsh","submitted_at":"2026-03-12T09:36:50Z","abstract_excerpt":"In recent years, RAPTOR based algorithms have been considered the state-of-the-art for path-finding with unlimited transfers without preprocessing. However, this status largely stems from the evolution of routing research, where Dijkstra-based solutions were superseded by timetable-based algorithms without a systematic comparison. In this work, we revisit classical Dijkstra-based approaches for public transit routing with unlimited transfers and demonstrate that Time-Dependent Dijkstra (TD-Dijkstra) outperforms MR. However, efficient TD-Dijkstra implementations rely on filtering dominated conn"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6f718afb4b60d5afede763061a2b33ec8d452eccdc50b2fef081c26784c8a8ad"},"source":{"id":"2603.11729","kind":"arxiv","version":4},"verdict":{"id":"8cbd3620-011b-4d3d-8678-6a9dd66a41f3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T12:29:38.226645Z","strongest_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.","one_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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.11729/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":2,"snapshot_sha256":"5596cbeb4f6f8754ee180784163b316a983ea268792fa383a6b5c9ce58de0007"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.11729","created_at":"2026-05-25T02:01:17.145400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.11729v4","created_at":"2026-05-25T02:01:17.145400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.11729","created_at":"2026-05-25T02:01:17.145400+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQOSP4EQS3GO","created_at":"2026-05-25T02:01:17.145400+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQOSP4EQS3GOED4K","created_at":"2026-05-25T02:01:17.145400+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQOSP4EQ","created_at":"2026-05-25T02:01:17.145400+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2603.12592","citing_title":"Early Pruning for Public Transport Routing","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2603.12592","citing_title":"Early Pruning for Public Transport Routing","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R","json":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R.json","graph_json":"https://pith.science/api/pith-number/PQOSP4EQS3GOED4KKBP4KAE32R/graph.json","events_json":"https://pith.science/api/pith-number/PQOSP4EQS3GOED4KKBP4KAE32R/events.json","paper":"https://pith.science/paper/PQOSP4EQ"},"agent_actions":{"view_html":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R","download_json":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R.json","view_paper":"https://pith.science/paper/PQOSP4EQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.11729&json=true","fetch_graph":"https://pith.science/api/pith-number/PQOSP4EQS3GOED4KKBP4KAE32R/graph.json","fetch_events":"https://pith.science/api/pith-number/PQOSP4EQS3GOED4KKBP4KAE32R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R/action/storage_attestation","attest_author":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R/action/author_attestation","sign_citation":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R/action/citation_signature","submit_replication":"https://pith.science/pith/PQOSP4EQS3GOED4KKBP4KAE32R/action/replication_record"}},"created_at":"2026-05-25T02:01:17.145400+00:00","updated_at":"2026-05-25T02:01:17.145400+00:00"}