{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JC5RKTR3EJJDZAZU4LERDWFOPM","short_pith_number":"pith:JC5RKTR3","canonical_record":{"source":{"id":"1508.02608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-08-11T14:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"ab3620e4b6ebf203ded6463b4e344212299541bace246469878633457849044d","abstract_canon_sha256":"9be4e05be88308065d70ec30ef1af1f15c6170b1f8ce757836b66aec9a681acc"},"schema_version":"1.0"},"canonical_sha256":"48bb154e3b22523c8334e2c911d8ae7b0c00ad7c84de77ebbfb40a716d80d11c","source":{"kind":"arxiv","id":"1508.02608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02608","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02608v1","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02608","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"pith_short_12","alias_value":"JC5RKTR3EJJD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JC5RKTR3EJJDZAZU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JC5RKTR3","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JC5RKTR3EJJDZAZU4LERDWFOPM","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-08-11T14:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"ab3620e4b6ebf203ded6463b4e344212299541bace246469878633457849044d","abstract_canon_sha256":"9be4e05be88308065d70ec30ef1af1f15c6170b1f8ce757836b66aec9a681acc"},"schema_version":"1.0"},"canonical_sha256":"48bb154e3b22523c8334e2c911d8ae7b0c00ad7c84de77ebbfb40a716d80d11c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:28.736028Z","signature_b64":"xFwpU3iGMuYtqhMDTRY2DX1op+fm4cA4HCSw5dw3OdTb0ZQQzn5pGnaQolFSRlGTb3GTr/R3gACej0ZRlepwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48bb154e3b22523c8334e2c911d8ae7b0c00ad7c84de77ebbfb40a716d80d11c","last_reissued_at":"2026-05-18T01:35:28.735446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:28.735446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02608","source_version":1,"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-18T01:35:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ht0jm3subnQr4XPVlP7/libAa57lHrC0jbbCjiCUZ5/sVsKU2mvXlLDSl8TR8L42PNjoiWiLp22ixaBeJ/OaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:53:14.657648Z"},"content_sha256":"c72a86637f80178872cac6d5f39da44dd8a0099b974b1d624122618c21397028","schema_version":"1.0","event_id":"sha256:c72a86637f80178872cac6d5f39da44dd8a0099b974b1d624122618c21397028"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JC5RKTR3EJJDZAZU4LERDWFOPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Path Interpolation and Speed Profile Computation for Nonholonomic Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bernard Boigelot, St\\'ephane Lens","submitted_at":"2015-08-11T14:24:40Z","abstract_excerpt":"This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of straight line segments, such as those produced by some planning algorithms, into smooth curves that can be followed without stopping. Our solution has the advantage of being simpler than other existing approaches, and has a low computational cost that allows a real-time implementation. It produces discretized paths on which curvature and variation of curvature are bounded at all points, and preserves obstacle clearance. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02608","kind":"arxiv","version":1},"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-18T01:35:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BstTPaFD8yfriHY5PdN0lkbU+Fx0C8lT0ooBTPk6CPCeHeKybbfXNwsrlLYNugffLwSDS9Vxgol+AtfCZ2bHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:53:14.657993Z"},"content_sha256":"bbde13e3fd312afa08aa8318fedff0370e830a70e3ae65514ab6d4b2b2d2c27a","schema_version":"1.0","event_id":"sha256:bbde13e3fd312afa08aa8318fedff0370e830a70e3ae65514ab6d4b2b2d2c27a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JC5RKTR3EJJDZAZU4LERDWFOPM/bundle.json","state_url":"https://pith.science/pith/JC5RKTR3EJJDZAZU4LERDWFOPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JC5RKTR3EJJDZAZU4LERDWFOPM/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-07-02T07:53:14Z","links":{"resolver":"https://pith.science/pith/JC5RKTR3EJJDZAZU4LERDWFOPM","bundle":"https://pith.science/pith/JC5RKTR3EJJDZAZU4LERDWFOPM/bundle.json","state":"https://pith.science/pith/JC5RKTR3EJJDZAZU4LERDWFOPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JC5RKTR3EJJDZAZU4LERDWFOPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JC5RKTR3EJJDZAZU4LERDWFOPM","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":"9be4e05be88308065d70ec30ef1af1f15c6170b1f8ce757836b66aec9a681acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-08-11T14:24:40Z","title_canon_sha256":"ab3620e4b6ebf203ded6463b4e344212299541bace246469878633457849044d"},"schema_version":"1.0","source":{"id":"1508.02608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02608","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02608v1","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02608","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"pith_short_12","alias_value":"JC5RKTR3EJJD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JC5RKTR3EJJDZAZU","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JC5RKTR3","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:bbde13e3fd312afa08aa8318fedff0370e830a70e3ae65514ab6d4b2b2d2c27a","target":"graph","created_at":"2026-05-18T01:35:28Z","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":"This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of straight line segments, such as those produced by some planning algorithms, into smooth curves that can be followed without stopping. Our solution has the advantage of being simpler than other existing approaches, and has a low computational cost that allows a real-time implementation. It produces discretized paths on which curvature and variation of curvature are bounded at all points, and preserves obstacle clearance. ","authors_text":"Bernard Boigelot, St\\'ephane Lens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-08-11T14:24:40Z","title":"Efficient Path Interpolation and Speed Profile Computation for Nonholonomic Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02608","kind":"arxiv","version":1},"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:c72a86637f80178872cac6d5f39da44dd8a0099b974b1d624122618c21397028","target":"record","created_at":"2026-05-18T01:35:28Z","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":"9be4e05be88308065d70ec30ef1af1f15c6170b1f8ce757836b66aec9a681acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-08-11T14:24:40Z","title_canon_sha256":"ab3620e4b6ebf203ded6463b4e344212299541bace246469878633457849044d"},"schema_version":"1.0","source":{"id":"1508.02608","kind":"arxiv","version":1}},"canonical_sha256":"48bb154e3b22523c8334e2c911d8ae7b0c00ad7c84de77ebbfb40a716d80d11c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48bb154e3b22523c8334e2c911d8ae7b0c00ad7c84de77ebbfb40a716d80d11c","first_computed_at":"2026-05-18T01:35:28.735446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:28.735446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xFwpU3iGMuYtqhMDTRY2DX1op+fm4cA4HCSw5dw3OdTb0ZQQzn5pGnaQolFSRlGTb3GTr/R3gACej0ZRlepwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:28.736028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c72a86637f80178872cac6d5f39da44dd8a0099b974b1d624122618c21397028","sha256:bbde13e3fd312afa08aa8318fedff0370e830a70e3ae65514ab6d4b2b2d2c27a"],"state_sha256":"93f54e333e15c4bd25247e085cf686c5b6d2a80ec039730227d6d7f586d00ac7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RUTVHr4x0DWlzTqzujwZYi1FEl5iOe55s7HaNpPOn9g9Nh2u/qvhWiYsSB0YvW3WJbiTF46rAolGlu+Ui1eAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T07:53:14.660026Z","bundle_sha256":"3728e5aca967bf1831f52adac71d27f2e8272e1d3a291f8e3b6a82cd8005f4d3"}}