{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FT7USXI4E5FV4VH6N6LZD3ELZR","short_pith_number":"pith:FT7USXI4","canonical_record":{"source":{"id":"1610.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-14T19:39:10Z","cross_cats_sorted":[],"title_canon_sha256":"0249f0b460417585bbd390644fbbb5677433860db2d7ca1602b2b76ad0605a48","abstract_canon_sha256":"6a2ad170df5433789e78ed6fc3b5729cc271d26f669f7a39e940ca57ac0815a7"},"schema_version":"1.0"},"canonical_sha256":"2cff495d1c274b5e54fe6f9791ec8bcc677314bc6b26819721618873f1b31eff","source":{"kind":"arxiv","id":"1610.04597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04597","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04597v1","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04597","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"FT7USXI4E5FV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FT7USXI4E5FV4VH6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FT7USXI4","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FT7USXI4E5FV4VH6N6LZD3ELZR","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-14T19:39:10Z","cross_cats_sorted":[],"title_canon_sha256":"0249f0b460417585bbd390644fbbb5677433860db2d7ca1602b2b76ad0605a48","abstract_canon_sha256":"6a2ad170df5433789e78ed6fc3b5729cc271d26f669f7a39e940ca57ac0815a7"},"schema_version":"1.0"},"canonical_sha256":"2cff495d1c274b5e54fe6f9791ec8bcc677314bc6b26819721618873f1b31eff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:14.641552Z","signature_b64":"chTyCenwFDE99wrunBrP2IAv9ETKvX5aq7oPCnU1AEYVBCM5tUY2cVm/70M2CC0yeiuDyWvJuAIyFKTK0Zo/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cff495d1c274b5e54fe6f9791ec8bcc677314bc6b26819721618873f1b31eff","last_reissued_at":"2026-05-18T01:02:14.640940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:14.640940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04597","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-18T01:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GicQr+aZdiCUPB+4uPksS5br3hwaoO2eBDORTLIR0iel1x/AkuIBbvWeNEcDu2hhKVAdNp0FxI5DUk1X48N8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:46:10.450558Z"},"content_sha256":"bb10cb1ff497b2f042e34e2e70beef18b8e5d73c463bdff5bf884562f0975230","schema_version":"1.0","event_id":"sha256:bb10cb1ff497b2f042e34e2e70beef18b8e5d73c463bdff5bf884562f0975230"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FT7USXI4E5FV4VH6N6LZD3ELZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Application of Global Route-Planning Algorithms with Geodesy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Iury V. de Bessa, Lucas C. Cordeiro, William C. da Rosa","submitted_at":"2016-10-14T19:39:10Z","abstract_excerpt":"Global Route-Planning Algorithms (GRPA) are required to compute paths between several points located on Earth's surface. A geodesic algorithm is employed as an auxiliary tool, increasing the precision of distance calculations. This work presents a novel simulator for GRPA, which compares and evaluates three GRPAs implemented to solve the shortest path problem for points located at different cities: A*, LPA*, and D*Lite. The performance of each algorithm is investigated with a set of experiments, which are executed to check the answers provided by the algorithms and to compare their execution t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04597","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-18T01:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zI+WQCBogkv8mYT33XDE5ZBBx4naNYvhGzHm4uEjtjksV4lRc3HEIIiXRyrIdcL+dAEJgS26M7M8XWw0s/u2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:46:10.451236Z"},"content_sha256":"1f91210a3ed1ad5f767d78fa921254c7455c22ddbb020072a0503a00fedc0b02","schema_version":"1.0","event_id":"sha256:1f91210a3ed1ad5f767d78fa921254c7455c22ddbb020072a0503a00fedc0b02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/bundle.json","state_url":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/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-11T03:46:10Z","links":{"resolver":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR","bundle":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/bundle.json","state":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FT7USXI4E5FV4VH6N6LZD3ELZR","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":"6a2ad170df5433789e78ed6fc3b5729cc271d26f669f7a39e940ca57ac0815a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-14T19:39:10Z","title_canon_sha256":"0249f0b460417585bbd390644fbbb5677433860db2d7ca1602b2b76ad0605a48"},"schema_version":"1.0","source":{"id":"1610.04597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04597","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04597v1","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04597","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"FT7USXI4E5FV","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FT7USXI4E5FV4VH6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FT7USXI4","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:1f91210a3ed1ad5f767d78fa921254c7455c22ddbb020072a0503a00fedc0b02","target":"graph","created_at":"2026-05-18T01:02:14Z","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":"Global Route-Planning Algorithms (GRPA) are required to compute paths between several points located on Earth's surface. A geodesic algorithm is employed as an auxiliary tool, increasing the precision of distance calculations. This work presents a novel simulator for GRPA, which compares and evaluates three GRPAs implemented to solve the shortest path problem for points located at different cities: A*, LPA*, and D*Lite. The performance of each algorithm is investigated with a set of experiments, which are executed to check the answers provided by the algorithms and to compare their execution t","authors_text":"Iury V. de Bessa, Lucas C. Cordeiro, William C. da Rosa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-14T19:39:10Z","title":"Application of Global Route-Planning Algorithms with Geodesy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04597","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:bb10cb1ff497b2f042e34e2e70beef18b8e5d73c463bdff5bf884562f0975230","target":"record","created_at":"2026-05-18T01:02:14Z","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":"6a2ad170df5433789e78ed6fc3b5729cc271d26f669f7a39e940ca57ac0815a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-14T19:39:10Z","title_canon_sha256":"0249f0b460417585bbd390644fbbb5677433860db2d7ca1602b2b76ad0605a48"},"schema_version":"1.0","source":{"id":"1610.04597","kind":"arxiv","version":1}},"canonical_sha256":"2cff495d1c274b5e54fe6f9791ec8bcc677314bc6b26819721618873f1b31eff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cff495d1c274b5e54fe6f9791ec8bcc677314bc6b26819721618873f1b31eff","first_computed_at":"2026-05-18T01:02:14.640940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:14.640940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"chTyCenwFDE99wrunBrP2IAv9ETKvX5aq7oPCnU1AEYVBCM5tUY2cVm/70M2CC0yeiuDyWvJuAIyFKTK0Zo/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:14.641552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb10cb1ff497b2f042e34e2e70beef18b8e5d73c463bdff5bf884562f0975230","sha256:1f91210a3ed1ad5f767d78fa921254c7455c22ddbb020072a0503a00fedc0b02"],"state_sha256":"ee5f40f5943d1b01ed0ec36d457546de4ff1646a113e19953589a908f3a4a5cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fuEEeve+Kx7DmZ27ObSvb4BHmWHxvNML+F5etduElG7dRYLapEYHAeF+fanwtfB1tDpfuvM1NkOUIieHNUZZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:46:10.455102Z","bundle_sha256":"7e9fa575690e18fe686ebc2e3b23fc862bf309d380a5fabd29cb1d006e3e41cb"}}