{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GJFAGLPXBRYJDM3DR5TVL5WDUQ","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":"3ceba2eb2baebc5d38fcad54bf19c3abd2f80b9ae85a2ac0fb75fa035a8426e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-24T03:00:32Z","title_canon_sha256":"46fbd2e7db1f3a6dbc4d3222abce7f51ebf7cf6fd6fd032be4f90c15a07905e4"},"schema_version":"1.0","source":{"id":"1707.07383","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07383","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07383v3","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07383","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"GJFAGLPXBRYJ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GJFAGLPXBRYJDM3D","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GJFAGLPX","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:98e672b4c3d8d9b6741623c0f05e1ac894d1d2b9b7b0bef31786eee440caa070","target":"graph","created_at":"2026-05-18T00:00: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":"We introduce a novel formulation of motion planning, for continuous-time trajectories, as probabilistic inference. We first show how smooth continuous-time trajectories can be represented by a small number of states using sparse Gaussian process (GP) models. We next develop an efficient gradient-based optimization algorithm that exploits this sparsity and GP interpolation. We call this algorithm the Gaussian Process Motion Planner (GPMP). We then detail how motion planning problems can be formulated as probabilistic inference on a factor graph. This forms the basis for GPMP2, a very efficient ","authors_text":"Byron Boots, Frank Dellaert, Jing Dong, Mustafa Mukadam, Xinyan Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-24T03:00:32Z","title":"Continuous-Time Gaussian Process Motion Planning via Probabilistic Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07383","kind":"arxiv","version":3},"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:87580bee61ecc2ef68eea4e861c8112a9f9408374f91d43fba0261c820ae2727","target":"record","created_at":"2026-05-18T00:00: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":"3ceba2eb2baebc5d38fcad54bf19c3abd2f80b9ae85a2ac0fb75fa035a8426e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-24T03:00:32Z","title_canon_sha256":"46fbd2e7db1f3a6dbc4d3222abce7f51ebf7cf6fd6fd032be4f90c15a07905e4"},"schema_version":"1.0","source":{"id":"1707.07383","kind":"arxiv","version":3}},"canonical_sha256":"324a032df70c7091b3638f6755f6c3a42ba35a0301684968263b0a023eb1ef86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"324a032df70c7091b3638f6755f6c3a42ba35a0301684968263b0a023eb1ef86","first_computed_at":"2026-05-18T00:00:09.172800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.172800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KakoPmdfNcuoA4CuvCzQbl4EInE9Jl79t1IehY+/aECSU0kjEk/hxzTLdnUmq65gTtC+OnAFGa0Own3vVKR+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.173307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07383","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87580bee61ecc2ef68eea4e861c8112a9f9408374f91d43fba0261c820ae2727","sha256:98e672b4c3d8d9b6741623c0f05e1ac894d1d2b9b7b0bef31786eee440caa070"],"state_sha256":"87cef52c49edad768f4cdccc61398e9b3f1b9a8c6ad3e7a07dfb74cfacd3979f"}