{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AQEGM5HTQU34EJORXUS7CF5YDI","short_pith_number":"pith:AQEGM5HT","schema_version":"1.0","canonical_sha256":"04086674f38537c225d1bd25f117b81a21d2abcc49300f51e531a3e47a1f9a76","source":{"kind":"arxiv","id":"2504.05921","version":2},"attestation_state":"computed","paper":{"title":"Accelerated Reeds-Shepp and Under-Specified Reeds-Shepp Algorithms for Mobile Robot Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Ibrahim Ibrahim, Jan Swevers, Wilm Decr\\'e","submitted_at":"2025-04-08T11:22:50Z","abstract_excerpt":"In this study, we present a simple and intuitive method for accelerating optimal Reeds-Shepp path computation. Our approach uses geometrical reasoning to analyze the behavior of optimal paths, resulting in a new partitioning of the state space and a further reduction in the minimal set of viable paths. We revisit and reimplement classic methodologies from the literature, which lack contemporary open-source implementations, to serve as benchmarks for evaluating our method. Additionally, we address the under-specified Reeds-Shepp planning problem where the final orientation is unspecified. We pe"},"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":"2504.05921","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-08T11:22:50Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b8634d0dcb5308225d3590f91c228df8a6e9370aa37f0a64f939c0af7610a9ee","abstract_canon_sha256":"74cfef2c0a56801d46b7ca578f2dbd836cb47e885fcd7b7f91ffa71e01560d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:00.990026Z","signature_b64":"MhhcyNnt8Wkau9WuET8r87wyrfnAGZt3Kl6gMwMwQ/mPd8nsW6b3jRMOxodf7cDsPSDhLu67IaU8SPMEMn4HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04086674f38537c225d1bd25f117b81a21d2abcc49300f51e531a3e47a1f9a76","last_reissued_at":"2026-07-05T11:53:00.989538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:00.989538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Reeds-Shepp and Under-Specified Reeds-Shepp Algorithms for Mobile Robot Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Ibrahim Ibrahim, Jan Swevers, Wilm Decr\\'e","submitted_at":"2025-04-08T11:22:50Z","abstract_excerpt":"In this study, we present a simple and intuitive method for accelerating optimal Reeds-Shepp path computation. Our approach uses geometrical reasoning to analyze the behavior of optimal paths, resulting in a new partitioning of the state space and a further reduction in the minimal set of viable paths. We revisit and reimplement classic methodologies from the literature, which lack contemporary open-source implementations, to serve as benchmarks for evaluating our method. Additionally, we address the under-specified Reeds-Shepp planning problem where the final orientation is unspecified. We pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05921","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.05921/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.05921","created_at":"2026-07-05T11:53:00.989616+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.05921v2","created_at":"2026-07-05T11:53:00.989616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05921","created_at":"2026-07-05T11:53:00.989616+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQEGM5HTQU34","created_at":"2026-07-05T11:53:00.989616+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQEGM5HTQU34EJOR","created_at":"2026-07-05T11:53:00.989616+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQEGM5HT","created_at":"2026-07-05T11:53:00.989616+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/AQEGM5HTQU34EJORXUS7CF5YDI","json":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI.json","graph_json":"https://pith.science/api/pith-number/AQEGM5HTQU34EJORXUS7CF5YDI/graph.json","events_json":"https://pith.science/api/pith-number/AQEGM5HTQU34EJORXUS7CF5YDI/events.json","paper":"https://pith.science/paper/AQEGM5HT"},"agent_actions":{"view_html":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI","download_json":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI.json","view_paper":"https://pith.science/paper/AQEGM5HT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.05921&json=true","fetch_graph":"https://pith.science/api/pith-number/AQEGM5HTQU34EJORXUS7CF5YDI/graph.json","fetch_events":"https://pith.science/api/pith-number/AQEGM5HTQU34EJORXUS7CF5YDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI/action/storage_attestation","attest_author":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI/action/author_attestation","sign_citation":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI/action/citation_signature","submit_replication":"https://pith.science/pith/AQEGM5HTQU34EJORXUS7CF5YDI/action/replication_record"}},"created_at":"2026-07-05T11:53:00.989616+00:00","updated_at":"2026-07-05T11:53:00.989616+00:00"}