{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YITRH4J5C4SG6HLR4NSRKSTETY","short_pith_number":"pith:YITRH4J5","schema_version":"1.0","canonical_sha256":"c22713f13d17246f1d71e365154a649e0ec02965b90d2a1e143e25ee852a9454","source":{"kind":"arxiv","id":"1805.08137","version":3},"attestation_state":"computed","paper":{"title":"Robot Path Planning Algorithms: A Review of Theory and Experiment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hadi Jahanshahi, Naeimeh Najafizadeh Sari","submitted_at":"2018-05-21T15:44:56Z","abstract_excerpt":"The aim of this book is to introduce different robot path planning algorithms and suggest some of the most appropriate ones which are capable of running on a variety of robots and are resistant to disturbances. Being real-time, being autonomous, and the ability to identify high-risk areas and risk management are the other features that will be mentioned throughout these methods."},"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":"1805.08137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-05-21T15:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"372c139cf789ccefdae9e5a17c2c448de99ba1e3586a95ab7c5d57f395d8a4ed","abstract_canon_sha256":"21a81eae5b8b3267af3d64c2199c8ef4bfa3fe18237e5549191cf0987088c63d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:55.748636Z","signature_b64":"aCeUDqgVd6jjoTmVta3k8omv6Cmfw5JPcXaai6KymZ+3d0iSnfk5MvW2fJy/smuuP6SIkKV/1YqEP8ql+3uEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c22713f13d17246f1d71e365154a649e0ec02965b90d2a1e143e25ee852a9454","last_reissued_at":"2026-05-18T00:00:55.748015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:55.748015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robot Path Planning Algorithms: A Review of Theory and Experiment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hadi Jahanshahi, Naeimeh Najafizadeh Sari","submitted_at":"2018-05-21T15:44:56Z","abstract_excerpt":"The aim of this book is to introduce different robot path planning algorithms and suggest some of the most appropriate ones which are capable of running on a variety of robots and are resistant to disturbances. Being real-time, being autonomous, and the ability to identify high-risk areas and risk management are the other features that will be mentioned throughout these methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08137","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.08137","created_at":"2026-05-18T00:00:55.748106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08137v3","created_at":"2026-05-18T00:00:55.748106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08137","created_at":"2026-05-18T00:00:55.748106+00:00"},{"alias_kind":"pith_short_12","alias_value":"YITRH4J5C4SG","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YITRH4J5C4SG6HLR","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YITRH4J5","created_at":"2026-05-18T12:33:04.347982+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/YITRH4J5C4SG6HLR4NSRKSTETY","json":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY.json","graph_json":"https://pith.science/api/pith-number/YITRH4J5C4SG6HLR4NSRKSTETY/graph.json","events_json":"https://pith.science/api/pith-number/YITRH4J5C4SG6HLR4NSRKSTETY/events.json","paper":"https://pith.science/paper/YITRH4J5"},"agent_actions":{"view_html":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY","download_json":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY.json","view_paper":"https://pith.science/paper/YITRH4J5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08137&json=true","fetch_graph":"https://pith.science/api/pith-number/YITRH4J5C4SG6HLR4NSRKSTETY/graph.json","fetch_events":"https://pith.science/api/pith-number/YITRH4J5C4SG6HLR4NSRKSTETY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY/action/storage_attestation","attest_author":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY/action/author_attestation","sign_citation":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY/action/citation_signature","submit_replication":"https://pith.science/pith/YITRH4J5C4SG6HLR4NSRKSTETY/action/replication_record"}},"created_at":"2026-05-18T00:00:55.748106+00:00","updated_at":"2026-05-18T00:00:55.748106+00:00"}