{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IKFDFBPBNXXMWRAPHN36SPO772","short_pith_number":"pith:IKFDFBPB","schema_version":"1.0","canonical_sha256":"428a3285e16deecb440f3b77e93ddffeb9ea5647128695219011d6483a9d7ddb","source":{"kind":"arxiv","id":"1504.05140","version":1},"attestation_state":"computed","paper":{"title":"Route Planning in Transportation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Goldberg, Daniel Delling, Dorothea Wagner, Hannah Bast, Matthias M\\\"uller-Hannemann, Peter Sanders, Renato F. Werneck, Thomas Pajor","submitted_at":"2015-04-20T18:04:20Z","abstract_excerpt":"We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent "},"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":"1504.05140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-20T18:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"744e5cbca6fe4ae8b914804ba6a74bb10213433a890ee4d775bbddbdd7963d1c","abstract_canon_sha256":"8c6613769beb0fe12e61940e04ae3f0d5e579690497dd0099fd8fa4c96ffb5b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:22.531756Z","signature_b64":"P97SSxrxNifOakW8Do0ebCc2/EWcl/UpiF2N2PEI8zlpgRx9wPNs2fe3SwO4afl526H7KntTZSSdLk2KLadDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428a3285e16deecb440f3b77e93ddffeb9ea5647128695219011d6483a9d7ddb","last_reissued_at":"2026-05-18T02:18:22.531004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:22.531004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Route Planning in Transportation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Goldberg, Daniel Delling, Dorothea Wagner, Hannah Bast, Matthias M\\\"uller-Hannemann, Peter Sanders, Renato F. Werneck, Thomas Pajor","submitted_at":"2015-04-20T18:04:20Z","abstract_excerpt":"We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05140","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1504.05140","created_at":"2026-05-18T02:18:22.531127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05140v1","created_at":"2026-05-18T02:18:22.531127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05140","created_at":"2026-05-18T02:18:22.531127+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKFDFBPBNXXM","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKFDFBPBNXXMWRAP","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKFDFBPB","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772","json":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772.json","graph_json":"https://pith.science/api/pith-number/IKFDFBPBNXXMWRAPHN36SPO772/graph.json","events_json":"https://pith.science/api/pith-number/IKFDFBPBNXXMWRAPHN36SPO772/events.json","paper":"https://pith.science/paper/IKFDFBPB"},"agent_actions":{"view_html":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772","download_json":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772.json","view_paper":"https://pith.science/paper/IKFDFBPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05140&json=true","fetch_graph":"https://pith.science/api/pith-number/IKFDFBPBNXXMWRAPHN36SPO772/graph.json","fetch_events":"https://pith.science/api/pith-number/IKFDFBPBNXXMWRAPHN36SPO772/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772/action/storage_attestation","attest_author":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772/action/author_attestation","sign_citation":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772/action/citation_signature","submit_replication":"https://pith.science/pith/IKFDFBPBNXXMWRAPHN36SPO772/action/replication_record"}},"created_at":"2026-05-18T02:18:22.531127+00:00","updated_at":"2026-05-18T02:18:22.531127+00:00"}