{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BIA4RWR64HK3SSPSIPU6EUHNAC","short_pith_number":"pith:BIA4RWR6","schema_version":"1.0","canonical_sha256":"0a01c8da3ee1d5b949f243e9e250ed00bbf04eccfd2729e11fbd5e04c94eb844","source":{"kind":"arxiv","id":"1501.04262","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Colin White","submitted_at":"2015-01-18T03:45:37Z","abstract_excerpt":"In the last decade, there has been a substantial amount of research in finding routing algorithms designed specifically to run on real-world graphs. In 2010, Abraham et al. showed upper bounds on the query time in terms of a graph's highway dimension and diameter for the current fastest routing algorithms, including contraction hierarchies, transit node routing, and hub labeling. In this paper, we show corresponding lower bounds for the same three algorithms. We also show how to improve a result by Milosavljevic which lower bounds the number of shortcuts added in the preprocessing stage for co"},"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":"1501.04262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-18T03:45:37Z","cross_cats_sorted":[],"title_canon_sha256":"0a534f161c64a5ac3ed7826c22744bb00cb5edf2f81efea4e1b7a2b1ded9580b","abstract_canon_sha256":"19d0588e575522e92091d479b90e4ae069a5d2a988e75d8271a7b7032397735b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:56.858921Z","signature_b64":"UamhhHj3fT5022DU1NkYJfZuTIL8MzcrdP59X0+T3PdFXooOtWfwBSXhbZ9+4A8RRo5r9qRb1clONsrWQdSVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a01c8da3ee1d5b949f243e9e250ed00bbf04eccfd2729e11fbd5e04c94eb844","last_reissued_at":"2026-05-18T01:33:56.858570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:56.858570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Colin White","submitted_at":"2015-01-18T03:45:37Z","abstract_excerpt":"In the last decade, there has been a substantial amount of research in finding routing algorithms designed specifically to run on real-world graphs. In 2010, Abraham et al. showed upper bounds on the query time in terms of a graph's highway dimension and diameter for the current fastest routing algorithms, including contraction hierarchies, transit node routing, and hub labeling. In this paper, we show corresponding lower bounds for the same three algorithms. We also show how to improve a result by Milosavljevic which lower bounds the number of shortcuts added in the preprocessing stage for co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04262","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":""},"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":"1501.04262","created_at":"2026-05-18T01:33:56.858628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04262v2","created_at":"2026-05-18T01:33:56.858628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04262","created_at":"2026-05-18T01:33:56.858628+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIA4RWR64HK3","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIA4RWR64HK3SSPS","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIA4RWR6","created_at":"2026-05-18T12:29:14.074870+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/BIA4RWR64HK3SSPSIPU6EUHNAC","json":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC.json","graph_json":"https://pith.science/api/pith-number/BIA4RWR64HK3SSPSIPU6EUHNAC/graph.json","events_json":"https://pith.science/api/pith-number/BIA4RWR64HK3SSPSIPU6EUHNAC/events.json","paper":"https://pith.science/paper/BIA4RWR6"},"agent_actions":{"view_html":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC","download_json":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC.json","view_paper":"https://pith.science/paper/BIA4RWR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04262&json=true","fetch_graph":"https://pith.science/api/pith-number/BIA4RWR64HK3SSPSIPU6EUHNAC/graph.json","fetch_events":"https://pith.science/api/pith-number/BIA4RWR64HK3SSPSIPU6EUHNAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC/action/storage_attestation","attest_author":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC/action/author_attestation","sign_citation":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC/action/citation_signature","submit_replication":"https://pith.science/pith/BIA4RWR64HK3SSPSIPU6EUHNAC/action/replication_record"}},"created_at":"2026-05-18T01:33:56.858628+00:00","updated_at":"2026-05-18T01:33:56.858628+00:00"}