{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U2CAQYLDC6Z75YW63K4TCMGFV3","short_pith_number":"pith:U2CAQYLD","canonical_record":{"source":{"id":"1107.0798","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-05T07:02:14Z","cross_cats_sorted":[],"title_canon_sha256":"b63d897de44f0501c88632c51d91d2bfcf00042b37ee456fbb02f375f4db0d8c","abstract_canon_sha256":"8d2860412777081843e4c936da1c75b057c9c4aac3b6e90175dbdc349235e389"},"schema_version":"1.0"},"canonical_sha256":"a68408616317b3fee2dedab93130c5aec6de97bdd4bc075105966dd1769c7895","source":{"kind":"arxiv","id":"1107.0798","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0798","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0798v3","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0798","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"U2CAQYLDC6Z7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U2CAQYLDC6Z75YW6","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U2CAQYLD","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U2CAQYLDC6Z75YW63K4TCMGFV3","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0798","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-05T07:02:14Z","cross_cats_sorted":[],"title_canon_sha256":"b63d897de44f0501c88632c51d91d2bfcf00042b37ee456fbb02f375f4db0d8c","abstract_canon_sha256":"8d2860412777081843e4c936da1c75b057c9c4aac3b6e90175dbdc349235e389"},"schema_version":"1.0"},"canonical_sha256":"a68408616317b3fee2dedab93130c5aec6de97bdd4bc075105966dd1769c7895","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:36.253149Z","signature_b64":"E0t2NrdCCf7wqRQIysjIVl8p+KY3QlFUdpngUsEeN4wo0g/tbrkGzWtqyn+/xvdFJ1KBvx9+6BTczmAgPkkVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a68408616317b3fee2dedab93130c5aec6de97bdd4bc075105966dd1769c7895","last_reissued_at":"2026-05-18T04:09:36.252731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:36.252731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0798","source_version":3,"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-18T04:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wBzV1XORXkkeZ608mYkFVJRNQokVpvUtd7OZO+PjAQfu/32cD99e9X+290LoaMlHlh7mSmt/p/0NyGBkCGxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:08:05.164558Z"},"content_sha256":"28912f91d8b0816e2380ad1cc732b7fd3f4c4a428c5f1ab7373f02c009a233ce","schema_version":"1.0","event_id":"sha256:28912f91d8b0816e2380ad1cc732b7fd3f4c4a428c5f1ab7373f02c009a233ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U2CAQYLDC6Z75YW63K4TCMGFV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Maneuvers in Route Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ondrej Moris, Petr Hlineny","submitted_at":"2011-07-05T07:02:14Z","abstract_excerpt":"We study an important practical aspect of the route planning problem in real-world road networks -- maneuvers. Informally, maneuvers represent various irregularities of the road network graph such as turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. We propose a generalized model which can handle arbitrarily complex (and even negative) maneuvers, and outline how to enhance Dijkstra's algorithm in order to solve route planning queries in this model without prior adjustments of the underlying road network graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0798","kind":"arxiv","version":3},"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-18T04:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/IqJeRIoDXXe0cPmgJiNiIWOisGu/WWXyqwLyrTgh4TdRVEM4TTSSHlN3Y1TGsQiDR8IulEIyB7NbntJ6aXaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:08:05.165142Z"},"content_sha256":"3b851055bdeb1083fe7918f36a671126b2b251cb5d0090f95273e7067f153904","schema_version":"1.0","event_id":"sha256:3b851055bdeb1083fe7918f36a671126b2b251cb5d0090f95273e7067f153904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2CAQYLDC6Z75YW63K4TCMGFV3/bundle.json","state_url":"https://pith.science/pith/U2CAQYLDC6Z75YW63K4TCMGFV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2CAQYLDC6Z75YW63K4TCMGFV3/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-08T02:08:05Z","links":{"resolver":"https://pith.science/pith/U2CAQYLDC6Z75YW63K4TCMGFV3","bundle":"https://pith.science/pith/U2CAQYLDC6Z75YW63K4TCMGFV3/bundle.json","state":"https://pith.science/pith/U2CAQYLDC6Z75YW63K4TCMGFV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2CAQYLDC6Z75YW63K4TCMGFV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U2CAQYLDC6Z75YW63K4TCMGFV3","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":"8d2860412777081843e4c936da1c75b057c9c4aac3b6e90175dbdc349235e389","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-05T07:02:14Z","title_canon_sha256":"b63d897de44f0501c88632c51d91d2bfcf00042b37ee456fbb02f375f4db0d8c"},"schema_version":"1.0","source":{"id":"1107.0798","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0798","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0798v3","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0798","created_at":"2026-05-18T04:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"U2CAQYLDC6Z7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U2CAQYLDC6Z75YW6","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U2CAQYLD","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:3b851055bdeb1083fe7918f36a671126b2b251cb5d0090f95273e7067f153904","target":"graph","created_at":"2026-05-18T04:09:36Z","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":"We study an important practical aspect of the route planning problem in real-world road networks -- maneuvers. Informally, maneuvers represent various irregularities of the road network graph such as turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. We propose a generalized model which can handle arbitrarily complex (and even negative) maneuvers, and outline how to enhance Dijkstra's algorithm in order to solve route planning queries in this model without prior adjustments of the underlying road network graph.","authors_text":"Ondrej Moris, Petr Hlineny","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-05T07:02:14Z","title":"Generalized Maneuvers in Route Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0798","kind":"arxiv","version":3},"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:28912f91d8b0816e2380ad1cc732b7fd3f4c4a428c5f1ab7373f02c009a233ce","target":"record","created_at":"2026-05-18T04:09:36Z","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":"8d2860412777081843e4c936da1c75b057c9c4aac3b6e90175dbdc349235e389","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-05T07:02:14Z","title_canon_sha256":"b63d897de44f0501c88632c51d91d2bfcf00042b37ee456fbb02f375f4db0d8c"},"schema_version":"1.0","source":{"id":"1107.0798","kind":"arxiv","version":3}},"canonical_sha256":"a68408616317b3fee2dedab93130c5aec6de97bdd4bc075105966dd1769c7895","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a68408616317b3fee2dedab93130c5aec6de97bdd4bc075105966dd1769c7895","first_computed_at":"2026-05-18T04:09:36.252731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:36.252731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E0t2NrdCCf7wqRQIysjIVl8p+KY3QlFUdpngUsEeN4wo0g/tbrkGzWtqyn+/xvdFJ1KBvx9+6BTczmAgPkkVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:36.253149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0798","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28912f91d8b0816e2380ad1cc732b7fd3f4c4a428c5f1ab7373f02c009a233ce","sha256:3b851055bdeb1083fe7918f36a671126b2b251cb5d0090f95273e7067f153904"],"state_sha256":"3832aa1bc90df480c794b75ef99a26e6abe3d422d8d7d3515e53ddcf6c4e6e0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouLppJ4Sl29vhbEgtFXgxJTAbJzmPTClkDiJvn2QRsfHQj3SoOzPh25CN2M24h8IXatNRz0y/wpUPMrVtRQAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:08:05.168533Z","bundle_sha256":"87090ce64b81a85f857d226df3618e9d0609233fa98fb370e11572752a8e7875"}}