{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PQOSP4EQS3GOED4KKBP4KAE32R","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":"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.11729","created_at":"2026-05-25T02:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"2603.11729v4","created_at":"2026-05-25T02:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.11729","created_at":"2026-05-25T02:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"PQOSP4EQS3GO","created_at":"2026-05-25T02:01:17Z"},{"alias_kind":"pith_short_16","alias_value":"PQOSP4EQS3GOED4K","created_at":"2026-05-25T02:01:17Z"},{"alias_kind":"pith_short_8","alias_value":"PQOSP4EQ","created_at":"2026-05-25T02:01:17Z"}],"graph_snapshots":[{"event_id":"sha256:550ca5546ea4a296cff48dd487cbd4ee9e4615137e5eeae26c31bee95a7ee3bb","target":"graph","created_at":"2026-05-25T02:01:17Z","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":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers."}],"snapshot_sha256":"6f718afb4b60d5afede763061a2b33ec8d452eccdc50b2fef081c26784c8a8ad"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5596cbeb4f6f8754ee180784163b316a983ea268792fa383a6b5c9ce58de0007"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.11729/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrii Rohovyi, Denys Katkalo, Toby Walsh","cross_cats":["cs.AI","cs.RO"],"headline":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-03-12T09:36:50Z","title":"Adapting Dijkstra for Buffers and Unlimited Transfers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.11729","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-15T12:29:38.226645Z","id":"8cbd3620-011b-4d3d-8678-6a9dd66a41f3","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Transfer Aware Dijkstra correctly handles buffer times for optimal public transit paths with unlimited transfers.","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.","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."}},"verdict_id":"8cbd3620-011b-4d3d-8678-6a9dd66a41f3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:221318bf176aa6f3f843147f501d2801fd348f0dd6c3b4adfdd829ddd409cc02","target":"record","created_at":"2026-05-25T02:01:17Z","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":"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}},"canonical_sha256":"7c1d27f09096cce20f8a505fc5009bd44e3a426a122b67ff6ce6664eaa4fd370","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c1d27f09096cce20f8a505fc5009bd44e3a426a122b67ff6ce6664eaa4fd370","first_computed_at":"2026-05-25T02:01:17.145276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:17.145276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mq6hyWn8EYvv7Fjyu/coW3wlNJisIN1nHwp8iCB8W2Pm/VQQsnMXFXtk+Jn9f35bVgKBqvJsNIpkjozv6pZBCw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:17.146106Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.11729","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:221318bf176aa6f3f843147f501d2801fd348f0dd6c3b4adfdd829ddd409cc02","sha256:550ca5546ea4a296cff48dd487cbd4ee9e4615137e5eeae26c31bee95a7ee3bb"],"state_sha256":"99e373239f4c5850211eb34520f66bf84c5ed9fcb8c44d6a8f0cf38330d69218"}