{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P6AJS32R7OIRUSZUDY5DU3GYN3","short_pith_number":"pith:P6AJS32R","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"},"canonical_sha256":"7f80996f51fb911a4b341e3a3a6cd86ecc8791b4342146001d86db206f77c464","source":{"kind":"arxiv","id":"1401.7860","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7860","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7860v2","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7860","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"P6AJS32R7OIR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6AJS32R7OIRUSZU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6AJS32R","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P6AJS32R7OIRUSZUDY5DU3GYN3","target":"record","payload":{"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"},"canonical_sha256":"7f80996f51fb911a4b341e3a3a6cd86ecc8791b4342146001d86db206f77c464","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"},"source_kind":"arxiv","source_id":"1401.7860","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AspL+Q6BJWULZRkyRT+4B+ylIx+oheOul/wq+cyYT5Drb3p8la8EmYJE9OM2qS458ds7fj3NWUoB7R/a8SyCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:16:16.578614Z"},"content_sha256":"4c2d219676e761bad3067322de6f276ebe477f665b732be15c4048b0962235b1","schema_version":"1.0","event_id":"sha256:4c2d219676e761bad3067322de6f276ebe477f665b732be15c4048b0962235b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P6AJS32R7OIRUSZUDY5DU3GYN3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pr9xjp/qEUUIsWBJ7oGUBI9RM4cU8wyz7J4gN65UkTT66rnDDMoZR2O+oXKghY4y7zRTc0OO198cTepEJGPtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:16:16.579493Z"},"content_sha256":"0c051cd3e710a86934c54049bd095967966a91a2e7fbe1315b9a619c3c1db256","schema_version":"1.0","event_id":"sha256:0c051cd3e710a86934c54049bd095967966a91a2e7fbe1315b9a619c3c1db256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/bundle.json","state_url":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T17:16:16Z","links":{"resolver":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3","bundle":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/bundle.json","state":"https://pith.science/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6AJS32R7OIRUSZUDY5DU3GYN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P6AJS32R7OIRUSZUDY5DU3GYN3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3105a714cde76ee76e0e18a2a558c465298ce74726d615fd19ee35ed8555cc8e","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-01-30T14:35:43Z","title_canon_sha256":"154fce862da5800873c9fd206f9fdb78bb398c6ae4801cbd8bc2490ea6d2a6e0"},"schema_version":"1.0","source":{"id":"1401.7860","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7860","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7860v2","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7860","created_at":"2026-05-18T00:19:19Z"},{"alias_kind":"pith_short_12","alias_value":"P6AJS32R7OIR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6AJS32R7OIRUSZU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6AJS32R","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:0c051cd3e710a86934c54049bd095967966a91a2e7fbe1315b9a619c3c1db256","target":"graph","created_at":"2026-05-18T00:19:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dirk Siersma, Gaiane Panina","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-01-30T14:35:43Z","title":"Motion planning and control of a planar polygonal linkage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7860","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4c2d219676e761bad3067322de6f276ebe477f665b732be15c4048b0962235b1","target":"record","created_at":"2026-05-18T00:19:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3105a714cde76ee76e0e18a2a558c465298ce74726d615fd19ee35ed8555cc8e","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-01-30T14:35:43Z","title_canon_sha256":"154fce862da5800873c9fd206f9fdb78bb398c6ae4801cbd8bc2490ea6d2a6e0"},"schema_version":"1.0","source":{"id":"1401.7860","kind":"arxiv","version":2}},"canonical_sha256":"7f80996f51fb911a4b341e3a3a6cd86ecc8791b4342146001d86db206f77c464","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f80996f51fb911a4b341e3a3a6cd86ecc8791b4342146001d86db206f77c464","first_computed_at":"2026-05-18T00:19:19.926702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:19.926702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3cKxlkYCcCKD5TZU8mcZXE7uxWs7TjcciyRLfXcQDi197xOl8nNzJWXtM2hnRplISSknSMLjV+XVI350wUCVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:19.927219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7860","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c2d219676e761bad3067322de6f276ebe477f665b732be15c4048b0962235b1","sha256:0c051cd3e710a86934c54049bd095967966a91a2e7fbe1315b9a619c3c1db256"],"state_sha256":"05a9a742009aa557476b5463ea356c59089ca89116d15387195f6effc0db7a61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+R9GiNkdHB++kGb5MIB60j5Uj0aZPAphqH+NP25tb4jspxC8NRgcDNfickJhsw9D0MlsxTUbw9aiu9+2HduDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:16:16.583905Z","bundle_sha256":"0a72fb216d1dc0bb3d21a17f9c2d82f95b1e90dff9ba64b29392734c2cf60505"}}