{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GFEPFCHY2RJW4S4BZIHRHZJDT6","short_pith_number":"pith:GFEPFCHY","schema_version":"1.0","canonical_sha256":"3148f288f8d4536e4b81ca0f13e5239fad7cb80b0c2b05a6314e09731633c6c1","source":{"kind":"arxiv","id":"1302.5611","version":1},"attestation_state":"computed","paper":{"title":"Transit Node Routing Reconsidered","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dennis Luxen, Julian Arz, Peter Sanders","submitted_at":"2013-02-22T14:43:06Z","abstract_excerpt":"Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR. First, we give a surprisingly simple implementation fully based on Contraction Hierarchies that speeds up preprocessing by an order of magnitude approaching the time for just finding a CH (which alone has two orders of magnitude larger query time). We also develop a very effective purely graph theoretical locality filter without any compromise in query times. Finally, we show that a specialization to the online many-to-one (or one-to-many) shortest path further speeds up query"},"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":"1302.5611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-22T14:43:06Z","cross_cats_sorted":[],"title_canon_sha256":"8f0f1acf8802760742d9f5452e91b7b556c6a28c013b64dd5b42cd6b898c340c","abstract_canon_sha256":"c8d6a6399009acf9c132a900e318fd6816227e2e9b49c21375040955ac95d81e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:46.244707Z","signature_b64":"NP3nvJ+W4xTVoG9eLSgE/RI+fxd2BlOy5VgkZ8+rxVpo5PaGs3UJPtfWWmKAoZVbF8sas9vdeDNxTdrc+FEGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3148f288f8d4536e4b81ca0f13e5239fad7cb80b0c2b05a6314e09731633c6c1","last_reissued_at":"2026-05-18T03:32:46.244113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:46.244113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transit Node Routing Reconsidered","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dennis Luxen, Julian Arz, Peter Sanders","submitted_at":"2013-02-22T14:43:06Z","abstract_excerpt":"Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR. First, we give a surprisingly simple implementation fully based on Contraction Hierarchies that speeds up preprocessing by an order of magnitude approaching the time for just finding a CH (which alone has two orders of magnitude larger query time). We also develop a very effective purely graph theoretical locality filter without any compromise in query times. Finally, we show that a specialization to the online many-to-one (or one-to-many) shortest path further speeds up query"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5611","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":"1302.5611","created_at":"2026-05-18T03:32:46.244200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5611v1","created_at":"2026-05-18T03:32:46.244200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5611","created_at":"2026-05-18T03:32:46.244200+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFEPFCHY2RJW","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFEPFCHY2RJW4S4B","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFEPFCHY","created_at":"2026-05-18T12:27:45.050594+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/GFEPFCHY2RJW4S4BZIHRHZJDT6","json":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6.json","graph_json":"https://pith.science/api/pith-number/GFEPFCHY2RJW4S4BZIHRHZJDT6/graph.json","events_json":"https://pith.science/api/pith-number/GFEPFCHY2RJW4S4BZIHRHZJDT6/events.json","paper":"https://pith.science/paper/GFEPFCHY"},"agent_actions":{"view_html":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6","download_json":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6.json","view_paper":"https://pith.science/paper/GFEPFCHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5611&json=true","fetch_graph":"https://pith.science/api/pith-number/GFEPFCHY2RJW4S4BZIHRHZJDT6/graph.json","fetch_events":"https://pith.science/api/pith-number/GFEPFCHY2RJW4S4BZIHRHZJDT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6/action/storage_attestation","attest_author":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6/action/author_attestation","sign_citation":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6/action/citation_signature","submit_replication":"https://pith.science/pith/GFEPFCHY2RJW4S4BZIHRHZJDT6/action/replication_record"}},"created_at":"2026-05-18T03:32:46.244200+00:00","updated_at":"2026-05-18T03:32:46.244200+00:00"}