{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DE2FZL3TSMBTZOY2B24CUQ6SBR","short_pith_number":"pith:DE2FZL3T","schema_version":"1.0","canonical_sha256":"19345caf7393033cbb1a0eb82a43d20c630bed5dc89ee01f06f9ada774c50767","source":{"kind":"arxiv","id":"1810.01776","version":1},"attestation_state":"computed","paper":{"title":"Efficient Fastest-Path Computations in Road Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Craig Gotsman, Renjie Chen","submitted_at":"2018-10-02T13:47:04Z","abstract_excerpt":"In the age of real-time online traffic information and GPS-enabled devices, fastest-path computations between two points in a road network modeled as a directed graph, where each directed edge is weighted by a \"travel time\" value, are becoming a standard feature of many navigation-related applications. To support this, very efficient computation of these paths in very large road networks is critical. Fastest paths may be computed as minimal-cost paths in a weighted directed graph, but traditional minimal-cost path algorithms based on variants of the classic Dijkstra algorithm do not scale well"},"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":"1810.01776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T13:47:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cecd33c34a3e088ede0ac0ccef83ed671e992679ab9909568cadf57884a24a76","abstract_canon_sha256":"7069b0c412ae0d6f99852b38bf47efa6ff67df73f1c4c764d357405f8aaba5d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:11.030340Z","signature_b64":"jZyJ69WaQSmmKneko525E2l9wNGLKJEVa5rom2cw5k9mORwGI2wrwRVL+IOr1G2suhXyXuHRMEOjKk9DYi1yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19345caf7393033cbb1a0eb82a43d20c630bed5dc89ee01f06f9ada774c50767","last_reissued_at":"2026-05-18T00:04:11.029681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:11.029681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Fastest-Path Computations in Road Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Craig Gotsman, Renjie Chen","submitted_at":"2018-10-02T13:47:04Z","abstract_excerpt":"In the age of real-time online traffic information and GPS-enabled devices, fastest-path computations between two points in a road network modeled as a directed graph, where each directed edge is weighted by a \"travel time\" value, are becoming a standard feature of many navigation-related applications. To support this, very efficient computation of these paths in very large road networks is critical. Fastest paths may be computed as minimal-cost paths in a weighted directed graph, but traditional minimal-cost path algorithms based on variants of the classic Dijkstra algorithm do not scale well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01776","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":"1810.01776","created_at":"2026-05-18T00:04:11.029777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01776v1","created_at":"2026-05-18T00:04:11.029777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01776","created_at":"2026-05-18T00:04:11.029777+00:00"},{"alias_kind":"pith_short_12","alias_value":"DE2FZL3TSMBT","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DE2FZL3TSMBTZOY2","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DE2FZL3T","created_at":"2026-05-18T12:32:19.392346+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/DE2FZL3TSMBTZOY2B24CUQ6SBR","json":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR.json","graph_json":"https://pith.science/api/pith-number/DE2FZL3TSMBTZOY2B24CUQ6SBR/graph.json","events_json":"https://pith.science/api/pith-number/DE2FZL3TSMBTZOY2B24CUQ6SBR/events.json","paper":"https://pith.science/paper/DE2FZL3T"},"agent_actions":{"view_html":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR","download_json":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR.json","view_paper":"https://pith.science/paper/DE2FZL3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01776&json=true","fetch_graph":"https://pith.science/api/pith-number/DE2FZL3TSMBTZOY2B24CUQ6SBR/graph.json","fetch_events":"https://pith.science/api/pith-number/DE2FZL3TSMBTZOY2B24CUQ6SBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/action/storage_attestation","attest_author":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/action/author_attestation","sign_citation":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/action/citation_signature","submit_replication":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/action/replication_record"}},"created_at":"2026-05-18T00:04:11.029777+00:00","updated_at":"2026-05-18T00:04:11.029777+00:00"}