{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AT5O26ZH3CFIN5W6TJX4SB2ZZL","short_pith_number":"pith:AT5O26ZH","canonical_record":{"source":{"id":"1603.04112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T02:23:10Z","cross_cats_sorted":[],"title_canon_sha256":"71fcffce405c3adf58d74ada78a798ddc33649b18d7fc045843435cc20575c0e","abstract_canon_sha256":"8fbfb6adf306670c3376cb44b6cbe9639001061c37b38ab82ce6eaca0bfcb0b1"},"schema_version":"1.0"},"canonical_sha256":"04faed7b27d88a86f6de9a6fc90759cad43bca4df011ada859aa235842b7cda9","source":{"kind":"arxiv","id":"1603.04112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04112","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04112v1","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04112","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"AT5O26ZH3CFI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AT5O26ZH3CFIN5W6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AT5O26ZH","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AT5O26ZH3CFIN5W6TJX4SB2ZZL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T02:23:10Z","cross_cats_sorted":[],"title_canon_sha256":"71fcffce405c3adf58d74ada78a798ddc33649b18d7fc045843435cc20575c0e","abstract_canon_sha256":"8fbfb6adf306670c3376cb44b6cbe9639001061c37b38ab82ce6eaca0bfcb0b1"},"schema_version":"1.0"},"canonical_sha256":"04faed7b27d88a86f6de9a6fc90759cad43bca4df011ada859aa235842b7cda9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:09.405340Z","signature_b64":"EUOCXFD/JherMiW9x7B+5iLbMWX9d8Tqe8EjMDKX64n7CtSG+y9o0XR8ytfCDjxGjrRcywr+xUFVhzpRrHRrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04faed7b27d88a86f6de9a6fc90759cad43bca4df011ada859aa235842b7cda9","last_reissued_at":"2026-05-18T01:19:09.404863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:09.404863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04112","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:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acEwtOrprlEWaHdu1QJtgm5/9R43k6xHV8fQa+GJxKgjCTFBL9TYx0zgdQtdpmmMMjr+zXtqYJVniy80I6lYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:03:03.171035Z"},"content_sha256":"a8133904684679c1bdca57fa9ecbd143bb5a6b026fbd3d195b77863ad3079bf9","schema_version":"1.0","event_id":"sha256:a8133904684679c1bdca57fa9ecbd143bb5a6b026fbd3d195b77863ad3079bf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AT5O26ZH3CFIN5W6TJX4SB2ZZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Methods for Efficient Sampling-Based Optimal Motion Planning of Nonlinear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Han-Lim Choi, Jeong hwan Jeon, Jung-Su Ha","submitted_at":"2016-03-14T02:23:10Z","abstract_excerpt":"This paper extends the RRT* algorithm, a recently developed but widely-used sampling-based optimal motion planner, in order to effectively handle nonlinear kinodynamic constraints. Nonlinearity in kinodynamic differential constraints often leads to difficulties in choosing appropriate distance metric and in computing optimized trajectory segments in tree construction. To tackle these two difficulties, this work adopts the affine quadratic regulator-based pseudo metric as the distance measure and utilizes iterative two-point boundary value problem solvers for computing the optimized segments. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04112","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:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbAcaN5h7toMVZY2IZNXTRxfUOD3r7y7hKe25bjTMtBWIkILPDbsNoijF4iynKFdyqyma5Qmtz5yro119btTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:03:03.171600Z"},"content_sha256":"fbb4d2b10fbd13852043d75c67856202c2ca01337086a795f68a9a0237d31f70","schema_version":"1.0","event_id":"sha256:fbb4d2b10fbd13852043d75c67856202c2ca01337086a795f68a9a0237d31f70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AT5O26ZH3CFIN5W6TJX4SB2ZZL/bundle.json","state_url":"https://pith.science/pith/AT5O26ZH3CFIN5W6TJX4SB2ZZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AT5O26ZH3CFIN5W6TJX4SB2ZZL/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-06-08T04:03:03Z","links":{"resolver":"https://pith.science/pith/AT5O26ZH3CFIN5W6TJX4SB2ZZL","bundle":"https://pith.science/pith/AT5O26ZH3CFIN5W6TJX4SB2ZZL/bundle.json","state":"https://pith.science/pith/AT5O26ZH3CFIN5W6TJX4SB2ZZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AT5O26ZH3CFIN5W6TJX4SB2ZZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AT5O26ZH3CFIN5W6TJX4SB2ZZL","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":"8fbfb6adf306670c3376cb44b6cbe9639001061c37b38ab82ce6eaca0bfcb0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T02:23:10Z","title_canon_sha256":"71fcffce405c3adf58d74ada78a798ddc33649b18d7fc045843435cc20575c0e"},"schema_version":"1.0","source":{"id":"1603.04112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04112","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04112v1","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04112","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"AT5O26ZH3CFI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AT5O26ZH3CFIN5W6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AT5O26ZH","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:fbb4d2b10fbd13852043d75c67856202c2ca01337086a795f68a9a0237d31f70","target":"graph","created_at":"2026-05-18T01:19:09Z","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 extends the RRT* algorithm, a recently developed but widely-used sampling-based optimal motion planner, in order to effectively handle nonlinear kinodynamic constraints. Nonlinearity in kinodynamic differential constraints often leads to difficulties in choosing appropriate distance metric and in computing optimized trajectory segments in tree construction. To tackle these two difficulties, this work adopts the affine quadratic regulator-based pseudo metric as the distance measure and utilizes iterative two-point boundary value problem solvers for computing the optimized segments. T","authors_text":"Han-Lim Choi, Jeong hwan Jeon, Jung-Su Ha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T02:23:10Z","title":"Iterative Methods for Efficient Sampling-Based Optimal Motion Planning of Nonlinear Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04112","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:a8133904684679c1bdca57fa9ecbd143bb5a6b026fbd3d195b77863ad3079bf9","target":"record","created_at":"2026-05-18T01:19:09Z","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":"8fbfb6adf306670c3376cb44b6cbe9639001061c37b38ab82ce6eaca0bfcb0b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T02:23:10Z","title_canon_sha256":"71fcffce405c3adf58d74ada78a798ddc33649b18d7fc045843435cc20575c0e"},"schema_version":"1.0","source":{"id":"1603.04112","kind":"arxiv","version":1}},"canonical_sha256":"04faed7b27d88a86f6de9a6fc90759cad43bca4df011ada859aa235842b7cda9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04faed7b27d88a86f6de9a6fc90759cad43bca4df011ada859aa235842b7cda9","first_computed_at":"2026-05-18T01:19:09.404863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:09.404863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EUOCXFD/JherMiW9x7B+5iLbMWX9d8Tqe8EjMDKX64n7CtSG+y9o0XR8ytfCDjxGjrRcywr+xUFVhzpRrHRrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:09.405340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8133904684679c1bdca57fa9ecbd143bb5a6b026fbd3d195b77863ad3079bf9","sha256:fbb4d2b10fbd13852043d75c67856202c2ca01337086a795f68a9a0237d31f70"],"state_sha256":"16635e4770abe2b00f2ee83bbc7dc1a9d9340051e1f69f52d0ceec00ba26b2ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xN7u5R0G1kbQOo/91uF6v7mKrXuHR8+hiSVLoQaeygkCQpSsHR4s5E3cH8vWco6kGLzW12o3GGgUnuNOrBxBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:03:03.175898Z","bundle_sha256":"ce400b480164abffdc0bfa33b1dcd291f825c06a188053cdcc2e56558ab4705a"}}