{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZUXIHXPVISSXLLIMLCUKOXUJJY","short_pith_number":"pith:ZUXIHXPV","schema_version":"1.0","canonical_sha256":"cd2e83ddf544a575ad0c58a8a75e894e25d14730a228bd8afb4f11507180ed5b","source":{"kind":"arxiv","id":"2501.18505","version":2},"attestation_state":"computed","paper":{"title":"Path Planning and Optimization for Cuspidal 6R Manipulators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander J. Elias, John T. Wen","submitted_at":"2025-01-30T17:15:11Z","abstract_excerpt":"A cuspidal robot can move from one inverse kinematics (IK) solution to another without crossing a singularity. Multiple industrial robots are cuspidal. They tend to have a beautiful mechanical design, but they pose path planning challenges. A task-space path may have a valid IK solution for each point along the path, but a continuous joint-space path may depend on the choice of the IK solution or even be infeasible. This paper presents new analysis, path planning, and optimization methods to enhance the utility of cuspidal robots. We first demonstrate an efficient method to identify cuspidal r"},"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":"2501.18505","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-01-30T17:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"43b6e8bc66a4da00928b574624ad285340a4e0739024473e688c85f26c0550a5","abstract_canon_sha256":"232cccb5e821b7d74d354965159812cb784626297358bd090677ca19fab68a78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:54.514369Z","signature_b64":"04UJTACL9fIdvj2tKPQHMulLcfBNd1ycOQzv/A/Jf8B3J0t+qqHIGQA/51Ys8/X+PLQ5uShXLbcLkRZQVQajCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd2e83ddf544a575ad0c58a8a75e894e25d14730a228bd8afb4f11507180ed5b","last_reissued_at":"2026-07-05T10:55:54.513897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:54.513897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Planning and Optimization for Cuspidal 6R Manipulators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander J. Elias, John T. Wen","submitted_at":"2025-01-30T17:15:11Z","abstract_excerpt":"A cuspidal robot can move from one inverse kinematics (IK) solution to another without crossing a singularity. Multiple industrial robots are cuspidal. They tend to have a beautiful mechanical design, but they pose path planning challenges. A task-space path may have a valid IK solution for each point along the path, but a continuous joint-space path may depend on the choice of the IK solution or even be infeasible. This paper presents new analysis, path planning, and optimization methods to enhance the utility of cuspidal robots. We first demonstrate an efficient method to identify cuspidal r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18505","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/2501.18505/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":"2501.18505","created_at":"2026-07-05T10:55:54.513953+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18505v2","created_at":"2026-07-05T10:55:54.513953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18505","created_at":"2026-07-05T10:55:54.513953+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUXIHXPVISSX","created_at":"2026-07-05T10:55:54.513953+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUXIHXPVISSXLLIM","created_at":"2026-07-05T10:55:54.513953+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUXIHXPV","created_at":"2026-07-05T10:55:54.513953+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23111","citing_title":"Redundancy Parameterization of the ABB YuMi Robot Arm","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY","json":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY.json","graph_json":"https://pith.science/api/pith-number/ZUXIHXPVISSXLLIMLCUKOXUJJY/graph.json","events_json":"https://pith.science/api/pith-number/ZUXIHXPVISSXLLIMLCUKOXUJJY/events.json","paper":"https://pith.science/paper/ZUXIHXPV"},"agent_actions":{"view_html":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY","download_json":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY.json","view_paper":"https://pith.science/paper/ZUXIHXPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18505&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUXIHXPVISSXLLIMLCUKOXUJJY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUXIHXPVISSXLLIMLCUKOXUJJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY/action/storage_attestation","attest_author":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY/action/author_attestation","sign_citation":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY/action/citation_signature","submit_replication":"https://pith.science/pith/ZUXIHXPVISSXLLIMLCUKOXUJJY/action/replication_record"}},"created_at":"2026-07-05T10:55:54.513953+00:00","updated_at":"2026-07-05T10:55:54.513953+00:00"}