{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LOEIYFH5RM3VCKYCV6WWRAM6T2","short_pith_number":"pith:LOEIYFH5","schema_version":"1.0","canonical_sha256":"5b888c14fd8b37512b02afad68819e9ea11fdf58e265c2328b37ebe73fdeaa97","source":{"kind":"arxiv","id":"2603.12592","version":3},"attestation_state":"computed","paper":{"title":"Early Pruning for Public Transport Routing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Early pruning discards unproductive transfers to speed up public transport routing queries by up to 57%.","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.DS","authors_text":"Abdallah Abuaisha, Andrii Rohovyi, Toby Walsh","submitted_at":"2026-03-13T02:49:32Z","abstract_excerpt":"Routing algorithms for public transport, particularly the widely used RAPTOR and its variants, often face performance bottlenecks during the transfer relaxation phase, especially on dense transfer graphs, when supporting unlimited transfers. This inefficiency arises from iterating over many potential inter-stop connections (walks, bikes, e-scooters, etc.). To maintain acceptable performance, practitioners often limit transfer distances or exclude certain transfer options, which can reduce path optimality and restrict the multimodal options presented to travellers.\n  This paper introduces Early"},"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.12592","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-03-13T02:49:32Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"bf160862255704a59bed2299b5f3ede2cbf872ec04bb4a361b4e01e13872c69e","abstract_canon_sha256":"7875771bab34dbd40477311f4f823d464be291d3a8dc2b0c659114384997065c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:08.285559Z","signature_b64":"E23ldnqWYRDKfF40PRUxM7T7yEyPC35cVqHvuIbFh1h8d3ZNJ6bZsreytBd27T/AW+SdBmr3OWZQK+UJJwd1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b888c14fd8b37512b02afad68819e9ea11fdf58e265c2328b37ebe73fdeaa97","last_reissued_at":"2026-05-20T00:03:08.284717Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:08.284717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Early Pruning for Public Transport Routing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Early pruning discards unproductive transfers to speed up public transport routing queries by up to 57%.","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.DS","authors_text":"Abdallah Abuaisha, Andrii Rohovyi, Toby Walsh","submitted_at":"2026-03-13T02:49:32Z","abstract_excerpt":"Routing algorithms for public transport, particularly the widely used RAPTOR and its variants, often face performance bottlenecks during the transfer relaxation phase, especially on dense transfer graphs, when supporting unlimited transfers. This inefficiency arises from iterating over many potential inter-stop connections (walks, bikes, e-scooters, etc.). To maintain acceptable performance, practitioners often limit transfer distances or exclude certain transfer options, which can reduce path optimality and restrict the multimodal options presented to travellers.\n  This paper introduces Early"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Across multiple state-of-the-art RAPTOR-based solutions... we achieved query time reductions of up to 57%. This approach provides a generalizable improvement to the efficiency of transit pathfinding algorithms.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The additional optimization criteria are monotonically non-decreasing in transfer duration (required to preserve Pareto-optimality in extended-criteria settings).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Early Pruning accelerates RAPTOR-based public transport routing by up to 57% via pre-sorting transfers by duration and pruning longer ones that cannot improve arrival times, while preserving Pareto optimality when extra criteria are monotonic in duration.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Early pruning discards unproductive transfers to speed up public transport routing queries by up to 57%.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ff643f29ad47042eeb8ac63b279acf78a92735bf6ebbee64e24d458ef9e9e90f"},"source":{"id":"2603.12592","kind":"arxiv","version":3},"verdict":{"id":"b9662cb3-2daf-4009-92ef-ad5eb6734ae7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T12:17:42.782042Z","strongest_claim":"Across multiple state-of-the-art RAPTOR-based solutions... we achieved query time reductions of up to 57%. This approach provides a generalizable improvement to the efficiency of transit pathfinding algorithms.","one_line_summary":"Early Pruning accelerates RAPTOR-based public transport routing by up to 57% via pre-sorting transfers by duration and pruning longer ones that cannot improve arrival times, while preserving Pareto optimality when extra criteria are monotonic in duration.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The additional optimization criteria are monotonically non-decreasing in transfer duration (required to preserve Pareto-optimality in extended-criteria settings).","pith_extraction_headline":"Early pruning discards unproductive transfers to speed up public transport routing queries by up to 57%."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.12592/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":"9a8e050af9e24d030236a089ac059ce803dd175c80136590b8137ad6e68fdf4b"},"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.12592","created_at":"2026-05-20T00:03:08.284845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.12592v3","created_at":"2026-05-20T00:03:08.284845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.12592","created_at":"2026-05-20T00:03:08.284845+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOEIYFH5RM3V","created_at":"2026-05-20T00:03:08.284845+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOEIYFH5RM3VCKYC","created_at":"2026-05-20T00:03:08.284845+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOEIYFH5","created_at":"2026-05-20T00:03:08.284845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.16149","citing_title":"Fast and Memory Efficient Multimodal Journey Planning with Delays","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16149","citing_title":"Fast and Memory Efficient Multimodal Journey Planning with Delays","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2","json":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2.json","graph_json":"https://pith.science/api/pith-number/LOEIYFH5RM3VCKYCV6WWRAM6T2/graph.json","events_json":"https://pith.science/api/pith-number/LOEIYFH5RM3VCKYCV6WWRAM6T2/events.json","paper":"https://pith.science/paper/LOEIYFH5"},"agent_actions":{"view_html":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2","download_json":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2.json","view_paper":"https://pith.science/paper/LOEIYFH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.12592&json=true","fetch_graph":"https://pith.science/api/pith-number/LOEIYFH5RM3VCKYCV6WWRAM6T2/graph.json","fetch_events":"https://pith.science/api/pith-number/LOEIYFH5RM3VCKYCV6WWRAM6T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2/action/storage_attestation","attest_author":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2/action/author_attestation","sign_citation":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2/action/citation_signature","submit_replication":"https://pith.science/pith/LOEIYFH5RM3VCKYCV6WWRAM6T2/action/replication_record"}},"created_at":"2026-05-20T00:03:08.284845+00:00","updated_at":"2026-05-20T00:03:08.284845+00:00"}