{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LEL7FYL54ALI35HRMNKKFJK2VM","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":"f30a1000609d39c2ae1c4cd64587e94a1a4e129be2f0f49433d4a44e7de86747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-17T01:53:10Z","title_canon_sha256":"99d6bd6fe0aa2f882d928bdf74080d84f18bd2fd9ec70687a0044375b781a1bb"},"schema_version":"1.0","source":{"id":"2603.16059","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.16059","created_at":"2026-07-31T01:10:31Z"},{"alias_kind":"arxiv_version","alias_value":"2603.16059v3","created_at":"2026-07-31T01:10:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.16059","created_at":"2026-07-31T01:10:31Z"},{"alias_kind":"pith_short_12","alias_value":"LEL7FYL54ALI","created_at":"2026-07-31T01:10:31Z"},{"alias_kind":"pith_short_16","alias_value":"LEL7FYL54ALI35HR","created_at":"2026-07-31T01:10:31Z"},{"alias_kind":"pith_short_8","alias_value":"LEL7FYL5","created_at":"2026-07-31T01:10:31Z"}],"graph_snapshots":[{"event_id":"sha256:d109d36cc7ee35c79a1fed9c247192c14e386c9caea1c149960b2e2177e44cb6","target":"graph","created_at":"2026-07-31T01:10:31Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our framework is fast, exact, and compatible with any sampling-based motion planner, while offering theoretical guarantees on probabilistic exhaustibility and asymptotic optimality based on the closed-form BVP solutions."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The target robot systems must be differentially flat so that an analytical time-parameterized solution of the two-point boundary-value problem exists in the flat output space."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FLASK uses differential flatness for closed-form BVP solutions in sampling-based kinodynamic planning, delivering microsecond-scale times with theoretical guarantees for flat systems like manipulators and vehicles."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"FLASK solves kinodynamic planning for flat robots by turning boundary problems into analytical flat-output trajectories."}],"snapshot_sha256":"9bb4f6aef09cede5e604ee39e09bb5d4b35948046daba7c602080f4f9d715bcf"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.16059/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motion planning under dynamics constraints, i.e, kinodynamic planning, enables safe robot operation by generating dynamically feasible trajectories that the robot can accurately track. For high-DOF robots such as manipulators, sampling-based motion planners are commonly used, especially for complex tasks in cluttered environments. However, enforcing constraints on robot dynamics in such planners requires solving either challenging two-point boundary value problems (BVPs) or propagating robot dynamics, both of which cause computational bottlenecks that drastically increase planning times. Meanw","authors_text":"Clayton W. Ramsey, Lydia E. Kavraki, Thai Duong, Wil Thomason, Zachary Kingston","cross_cats":[],"headline":"FLASK solves kinodynamic planning for flat robots by turning boundary problems into analytical flat-output trajectories.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-17T01:53:10Z","title":"Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.16059","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-15T10:45:11.296621Z","id":"f00fcaf6-9e21-42df-b763-aa04afeb128b","model_set":{"reader":"grok-4.3"},"one_line_summary":"FLASK uses differential flatness for closed-form BVP solutions in sampling-based kinodynamic planning, delivering microsecond-scale times with theoretical guarantees for flat systems like manipulators and vehicles.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"FLASK solves kinodynamic planning for flat robots by turning boundary problems into analytical flat-output trajectories.","strongest_claim":"Our framework is fast, exact, and compatible with any sampling-based motion planner, while offering theoretical guarantees on probabilistic exhaustibility and asymptotic optimality based on the closed-form BVP solutions.","weakest_assumption":"The target robot systems must be differentially flat so that an analytical time-parameterized solution of the two-point boundary-value problem exists in the flat output space."}},"verdict_id":"f00fcaf6-9e21-42df-b763-aa04afeb128b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:01f0881144565ac8e98f4bac2313f23c3830770f85189d7d514abe918cc99cd9","target":"record","created_at":"2026-07-31T01:10:31Z","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":"f30a1000609d39c2ae1c4cd64587e94a1a4e129be2f0f49433d4a44e7de86747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-17T01:53:10Z","title_canon_sha256":"99d6bd6fe0aa2f882d928bdf74080d84f18bd2fd9ec70687a0044375b781a1bb"},"schema_version":"1.0","source":{"id":"2603.16059","kind":"arxiv","version":3}},"canonical_sha256":"5917f2e17de0168df4f16354a2a55aab28df0d5f51a4dcd31e1c79027827a6a7","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5917f2e17de0168df4f16354a2a55aab28df0d5f51a4dcd31e1c79027827a6a7","first_computed_at":"2026-07-31T01:10:31.538678Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:10:31.538678Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2603.16059","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01f0881144565ac8e98f4bac2313f23c3830770f85189d7d514abe918cc99cd9","sha256:d109d36cc7ee35c79a1fed9c247192c14e386c9caea1c149960b2e2177e44cb6"],"state_sha256":"9a8c8edc2a19cbdfe4261147742193922244af77a67181b783f987d0e059c11a"}