{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FT7USXI4E5FV4VH6N6LZD3ELZR","short_pith_number":"pith:FT7USXI4","schema_version":"1.0","canonical_sha256":"2cff495d1c274b5e54fe6f9791ec8bcc677314bc6b26819721618873f1b31eff","source":{"kind":"arxiv","id":"1610.04597","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.04597","created_at":"2026-05-18T01:02:14.641015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04597v1","created_at":"2026-05-18T01:02:14.641015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04597","created_at":"2026-05-18T01:02:14.641015+00:00"},{"alias_kind":"pith_short_12","alias_value":"FT7USXI4E5FV","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FT7USXI4E5FV4VH6","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FT7USXI4","created_at":"2026-05-18T12:30:15.759754+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/FT7USXI4E5FV4VH6N6LZD3ELZR","json":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR.json","graph_json":"https://pith.science/api/pith-number/FT7USXI4E5FV4VH6N6LZD3ELZR/graph.json","events_json":"https://pith.science/api/pith-number/FT7USXI4E5FV4VH6N6LZD3ELZR/events.json","paper":"https://pith.science/paper/FT7USXI4"},"agent_actions":{"view_html":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR","download_json":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR.json","view_paper":"https://pith.science/paper/FT7USXI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04597&json=true","fetch_graph":"https://pith.science/api/pith-number/FT7USXI4E5FV4VH6N6LZD3ELZR/graph.json","fetch_events":"https://pith.science/api/pith-number/FT7USXI4E5FV4VH6N6LZD3ELZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/action/storage_attestation","attest_author":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/action/author_attestation","sign_citation":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/action/citation_signature","submit_replication":"https://pith.science/pith/FT7USXI4E5FV4VH6N6LZD3ELZR/action/replication_record"}},"created_at":"2026-05-18T01:02:14.641015+00:00","updated_at":"2026-05-18T01:02:14.641015+00:00"}