{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:P6AJS32R7OIRUSZUDY5DU3GYN3","short_pith_number":"pith:P6AJS32R","schema_version":"1.0","canonical_sha256":"7f80996f51fb911a4b341e3a3a6cd86ecc8791b4342146001d86db206f77c464","source":{"kind":"arxiv","id":"1401.7860","version":2},"attestation_state":"computed","paper":{"title":"Motion planning and control of a planar polygonal linkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.MG","authors_text":"Dirk Siersma, Gaiane Panina","submitted_at":"2014-01-30T14:35:43Z","abstract_excerpt":"For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The algorithm has three aspects: (1) the number of navigation steps does not exceed 15 (independent of the linkage), (2) each step is a disguised flex of a quadrilateral from one triangular configuration to another, which is a well understood type of flex, and (3) each step can be performed explicitly by adding some extra bars and obtaining a mechanism with one degr"},"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":"1401.7860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-01-30T14:35:43Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"154fce862da5800873c9fd206f9fdb78bb398c6ae4801cbd8bc2490ea6d2a6e0","abstract_canon_sha256":"3105a714cde76ee76e0e18a2a558c465298ce74726d615fd19ee35ed8555cc8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:19.927219Z","signature_b64":"3cKxlkYCcCKD5TZU8mcZXE7uxWs7TjcciyRLfXcQDi197xOl8nNzJWXtM2hnRplISSknSMLjV+XVI350wUCVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f80996f51fb911a4b341e3a3a6cd86ecc8791b4342146001d86db206f77c464","last_reissued_at":"2026-05-18T00:19:19.926702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:19.926702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motion planning and control of a planar polygonal linkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.MG","authors_text":"Dirk Siersma, Gaiane Panina","submitted_at":"2014-01-30T14:35:43Z","abstract_excerpt":"For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The algorithm has three aspects: (1) the number of navigation steps does not exceed 15 (independent of the linkage), (2) each step is a disguised flex of a quadrilateral from one triangular configuration to another, which is a well understood type of flex, and (3) each step can be performed explicitly by adding some extra bars and obtaining a mechanism with one degr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7860","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":""},"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":"1401.7860","created_at":"2026-05-18T00:19:19.926786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7860v2","created_at":"2026-05-18T00:19:19.926786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7860","created_at":"2026-05-18T00:19:19.926786+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6AJS32R7OIR","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6AJS32R7OIRUSZU","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6AJS32R","created_at":"2026-05-18T12:28:43.426989+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/P6AJS32R7OIRUSZUDY5DU3GYN3","json":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3.json","graph_json":"https://pith.science/api/pith-number/P6AJS32R7OIRUSZUDY5DU3GYN3/graph.json","events_json":"https://pith.science/api/pith-number/P6AJS32R7OIRUSZUDY5DU3GYN3/events.json","paper":"https://pith.science/paper/P6AJS32R"},"agent_actions":{"view_html":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3","download_json":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3.json","view_paper":"https://pith.science/paper/P6AJS32R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7860&json=true","fetch_graph":"https://pith.science/api/pith-number/P6AJS32R7OIRUSZUDY5DU3GYN3/graph.json","fetch_events":"https://pith.science/api/pith-number/P6AJS32R7OIRUSZUDY5DU3GYN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/action/storage_attestation","attest_author":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/action/author_attestation","sign_citation":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/action/citation_signature","submit_replication":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/action/replication_record"}},"created_at":"2026-05-18T00:19:19.926786+00:00","updated_at":"2026-05-18T00:19:19.926786+00:00"}