{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2NYARPNTBWYSMQJF5RVBPAMUPX","short_pith_number":"pith:2NYARPNT","schema_version":"1.0","canonical_sha256":"d37008bdb30db1264125ec6a1781947dea1a168aacd9651e1160710d68494696","source":{"kind":"arxiv","id":"2410.15715","version":2},"attestation_state":"computed","paper":{"title":"Timetable Nodes for Public Transport Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG"],"primary_cat":"cs.DS","authors_text":"Andrii Rohovyi, Peter J. Stuckey, Toby Walsh","submitted_at":"2024-10-21T07:34:04Z","abstract_excerpt":"Faster pathfinding in time-dependent transport networks is an important and challenging problem in navigation systems. There are two main types of transport networks: road networks for car driving and public transport route network. The solutions that work well in road networks, such as Time-dependent Contraction Hierarchies and other graph-based approaches, do not usually apply in transport networks. In transport networks, non-graph solutions such as CSA and RAPTOR show the best results compared to graph-based techniques. In our work, we propose a method that advances graph-based approaches b"},"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":false},"canonical_record":{"source":{"id":"2410.15715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-21T07:34:04Z","cross_cats_sorted":["cs.AI","cs.CG"],"title_canon_sha256":"77dfb577a24ea3d55ae4ced851799287e9db13aa6b7d12160ea268f821aaab96","abstract_canon_sha256":"0191f9f9ca9584ed6b6ab451888f018eb79f5faf9c8944a0b64a1f60c8ee44a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:18.879858Z","signature_b64":"UqOu3aUJc1PnqbxMisOOOy0H01MKZiDb+wgRMvj6VZ3Aib0laaY9uff/TVSVGRoU/tf2hkK1Pr5V2RS3PYfPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d37008bdb30db1264125ec6a1781947dea1a168aacd9651e1160710d68494696","last_reissued_at":"2026-07-05T09:24:18.879353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:18.879353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Timetable Nodes for Public Transport Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG"],"primary_cat":"cs.DS","authors_text":"Andrii Rohovyi, Peter J. Stuckey, Toby Walsh","submitted_at":"2024-10-21T07:34:04Z","abstract_excerpt":"Faster pathfinding in time-dependent transport networks is an important and challenging problem in navigation systems. There are two main types of transport networks: road networks for car driving and public transport route network. The solutions that work well in road networks, such as Time-dependent Contraction Hierarchies and other graph-based approaches, do not usually apply in transport networks. In transport networks, non-graph solutions such as CSA and RAPTOR show the best results compared to graph-based techniques. In our work, we propose a method that advances graph-based approaches b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15715","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.15715/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":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2410.15715","created_at":"2026-07-05T09:24:18.879415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.15715v2","created_at":"2026-07-05T09:24:18.879415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15715","created_at":"2026-07-05T09:24:18.879415+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NYARPNTBWYS","created_at":"2026-07-05T09:24:18.879415+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NYARPNTBWYSMQJF","created_at":"2026-07-05T09:24:18.879415+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NYARPNT","created_at":"2026-07-05T09:24:18.879415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.12592","citing_title":"Early Pruning for Public Transport Routing","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2603.12592","citing_title":"Early Pruning for Public Transport Routing","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX","json":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX.json","graph_json":"https://pith.science/api/pith-number/2NYARPNTBWYSMQJF5RVBPAMUPX/graph.json","events_json":"https://pith.science/api/pith-number/2NYARPNTBWYSMQJF5RVBPAMUPX/events.json","paper":"https://pith.science/paper/2NYARPNT"},"agent_actions":{"view_html":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX","download_json":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX.json","view_paper":"https://pith.science/paper/2NYARPNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.15715&json=true","fetch_graph":"https://pith.science/api/pith-number/2NYARPNTBWYSMQJF5RVBPAMUPX/graph.json","fetch_events":"https://pith.science/api/pith-number/2NYARPNTBWYSMQJF5RVBPAMUPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX/action/storage_attestation","attest_author":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX/action/author_attestation","sign_citation":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX/action/citation_signature","submit_replication":"https://pith.science/pith/2NYARPNTBWYSMQJF5RVBPAMUPX/action/replication_record"}},"created_at":"2026-07-05T09:24:18.879415+00:00","updated_at":"2026-07-05T09:24:18.879415+00:00"}