{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RXO2AETHWOQ5YISX2OH6VPCP63","short_pith_number":"pith:RXO2AETH","schema_version":"1.0","canonical_sha256":"8ddda01267b3a1dc2257d38feabc4ff6de33cd0c8616d18bc8f32465e13445a6","source":{"kind":"arxiv","id":"2407.05135","version":3},"attestation_state":"computed","paper":{"title":"Theory and Explicit Design of a Path Planner for an SE(3) Robot","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Chee Yap, Yi-Jen Chiang, Zhaoqi Zhang","submitted_at":"2024-07-06T17:19:53Z","abstract_excerpt":"We consider path planning for a rigid spatial robot with 6 degrees of freedom (6 DOFs), moving amidst polyhedral obstacles. A correct, complete and practical path planner for such a robot has never been achieved, although this is widely recognized as a key challenge in robotics. This paper provides a complete \"explicit\" design, down to explicit geometric primitives that are easily implementable.\n  Our design is within an algorithmic framework for path planners, called Soft Subdivision Search (SSS). The framework is based on the twin foundations of $\\epsilon$-exactness and soft predicates, whic"},"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":"2407.05135","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-06T17:19:53Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6c222a9058cb34c90e38e3ebafda15ae8a94650bf02c5af777a6305db0c36634","abstract_canon_sha256":"ebe593954eea1926c0b11e771ba211273ef3dc14b8e168eaf23d65e7931b8227"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:45.438118Z","signature_b64":"GbrMXZNe6/qp3qiCdAimFUBGNXOpYXlxVGj38487Y8BLq+2fzPvHPMeUIVGz30Tp+Mbtwj5vx9p/7tOrDdU0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ddda01267b3a1dc2257d38feabc4ff6de33cd0c8616d18bc8f32465e13445a6","last_reissued_at":"2026-07-05T09:54:45.437689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:45.437689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Theory and Explicit Design of a Path Planner for an SE(3) Robot","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Chee Yap, Yi-Jen Chiang, Zhaoqi Zhang","submitted_at":"2024-07-06T17:19:53Z","abstract_excerpt":"We consider path planning for a rigid spatial robot with 6 degrees of freedom (6 DOFs), moving amidst polyhedral obstacles. A correct, complete and practical path planner for such a robot has never been achieved, although this is widely recognized as a key challenge in robotics. This paper provides a complete \"explicit\" design, down to explicit geometric primitives that are easily implementable.\n  Our design is within an algorithmic framework for path planners, called Soft Subdivision Search (SSS). The framework is based on the twin foundations of $\\epsilon$-exactness and soft predicates, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05135","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.05135/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":"2407.05135","created_at":"2026-07-05T09:54:45.437744+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05135v3","created_at":"2026-07-05T09:54:45.437744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05135","created_at":"2026-07-05T09:54:45.437744+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXO2AETHWOQ5","created_at":"2026-07-05T09:54:45.437744+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXO2AETHWOQ5YISX","created_at":"2026-07-05T09:54:45.437744+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXO2AETH","created_at":"2026-07-05T09:54:45.437744+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/RXO2AETHWOQ5YISX2OH6VPCP63","json":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63.json","graph_json":"https://pith.science/api/pith-number/RXO2AETHWOQ5YISX2OH6VPCP63/graph.json","events_json":"https://pith.science/api/pith-number/RXO2AETHWOQ5YISX2OH6VPCP63/events.json","paper":"https://pith.science/paper/RXO2AETH"},"agent_actions":{"view_html":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63","download_json":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63.json","view_paper":"https://pith.science/paper/RXO2AETH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05135&json=true","fetch_graph":"https://pith.science/api/pith-number/RXO2AETHWOQ5YISX2OH6VPCP63/graph.json","fetch_events":"https://pith.science/api/pith-number/RXO2AETHWOQ5YISX2OH6VPCP63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63/action/storage_attestation","attest_author":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63/action/author_attestation","sign_citation":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63/action/citation_signature","submit_replication":"https://pith.science/pith/RXO2AETHWOQ5YISX2OH6VPCP63/action/replication_record"}},"created_at":"2026-07-05T09:54:45.437744+00:00","updated_at":"2026-07-05T09:54:45.437744+00:00"}