{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DE2FZL3TSMBTZOY2B24CUQ6SBR","short_pith_number":"pith:DE2FZL3T","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"},"canonical_sha256":"19345caf7393033cbb1a0eb82a43d20c630bed5dc89ee01f06f9ada774c50767","source":{"kind":"arxiv","id":"1810.01776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01776","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01776v1","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01776","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"pith_short_12","alias_value":"DE2FZL3TSMBT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DE2FZL3TSMBTZOY2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DE2FZL3T","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DE2FZL3TSMBTZOY2B24CUQ6SBR","target":"record","payload":{"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"},"canonical_sha256":"19345caf7393033cbb1a0eb82a43d20c630bed5dc89ee01f06f9ada774c50767","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"},"source_kind":"arxiv","source_id":"1810.01776","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itcjv3BUY1C6dZxOvsC8xjkVqiQob/zMxljkYz/6OZHGFyVm6PtZ/bRfZCQYNPwwpbNvlCxvYvGqBFgGhdSWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:03:36.460953Z"},"content_sha256":"9d82347ce9584fdd0bcc5cdf90c1613d08fd06f9776f6cef798a69dd4c790923","schema_version":"1.0","event_id":"sha256:9d82347ce9584fdd0bcc5cdf90c1613d08fd06f9776f6cef798a69dd4c790923"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DE2FZL3TSMBTZOY2B24CUQ6SBR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1p/CoruRymX0HCd1VboAOnTnezvFSvtPBPy5uCmYD4a74P0stGHUHPCqkVoBICaVhILu70jBsY5yGz9IcGJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:03:36.461532Z"},"content_sha256":"ce38538cf7f5d146a0fc6fefd96212aca7213b36a82ca904b111b2916702adfc","schema_version":"1.0","event_id":"sha256:ce38538cf7f5d146a0fc6fefd96212aca7213b36a82ca904b111b2916702adfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/bundle.json","state_url":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T13:03:36Z","links":{"resolver":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR","bundle":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/bundle.json","state":"https://pith.science/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DE2FZL3TSMBTZOY2B24CUQ6SBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DE2FZL3TSMBTZOY2B24CUQ6SBR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7069b0c412ae0d6f99852b38bf47efa6ff67df73f1c4c764d357405f8aaba5d1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T13:47:04Z","title_canon_sha256":"cecd33c34a3e088ede0ac0ccef83ed671e992679ab9909568cadf57884a24a76"},"schema_version":"1.0","source":{"id":"1810.01776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01776","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01776v1","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01776","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"pith_short_12","alias_value":"DE2FZL3TSMBT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DE2FZL3TSMBTZOY2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DE2FZL3T","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:ce38538cf7f5d146a0fc6fefd96212aca7213b36a82ca904b111b2916702adfc","target":"graph","created_at":"2026-05-18T00:04:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Craig Gotsman, Renjie Chen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T13:47:04Z","title":"Efficient Fastest-Path Computations in Road Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01776","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d82347ce9584fdd0bcc5cdf90c1613d08fd06f9776f6cef798a69dd4c790923","target":"record","created_at":"2026-05-18T00:04:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7069b0c412ae0d6f99852b38bf47efa6ff67df73f1c4c764d357405f8aaba5d1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T13:47:04Z","title_canon_sha256":"cecd33c34a3e088ede0ac0ccef83ed671e992679ab9909568cadf57884a24a76"},"schema_version":"1.0","source":{"id":"1810.01776","kind":"arxiv","version":1}},"canonical_sha256":"19345caf7393033cbb1a0eb82a43d20c630bed5dc89ee01f06f9ada774c50767","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19345caf7393033cbb1a0eb82a43d20c630bed5dc89ee01f06f9ada774c50767","first_computed_at":"2026-05-18T00:04:11.029681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:11.029681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZyJ69WaQSmmKneko525E2l9wNGLKJEVa5rom2cw5k9mORwGI2wrwRVL+IOr1G2suhXyXuHRMEOjKk9DYi1yBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:11.030340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d82347ce9584fdd0bcc5cdf90c1613d08fd06f9776f6cef798a69dd4c790923","sha256:ce38538cf7f5d146a0fc6fefd96212aca7213b36a82ca904b111b2916702adfc"],"state_sha256":"2c2da76d73b4ee1fb01c748d79c54eada23551f1f8a8c3448a95f0d7ef5cba08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdWQT8YWU2RnoS/E91T77p9xfEVawLDhYKyV1UXowQutR+fLLF9s+p/luUpI/pEbs0tyt42sYINrn/LEZuw9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:03:36.464248Z","bundle_sha256":"5807b9559927a2640eb8f036209b3eca020c201bf7d4fb50e7d909c1f1841fd8"}}