{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YIBA4AOSGFIQILIIIGPWSSS2EE","short_pith_number":"pith:YIBA4AOS","canonical_record":{"source":{"id":"1709.05401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2017-09-15T20:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"5490ebba5c62948519b4f1c0d85bbfb64cad4b1be0516bf681500ac2e2587640","abstract_canon_sha256":"c0fbfeac4e35ebf11e1d873fa77f093db224d5df47e717369f58b78ece713967"},"schema_version":"1.0"},"canonical_sha256":"c2020e01d23151042d08419f694a5a211f37df6b6258888b3faec83357ba866d","source":{"kind":"arxiv","id":"1709.05401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05401","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05401v1","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05401","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"YIBA4AOSGFIQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YIBA4AOSGFIQILII","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YIBA4AOS","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YIBA4AOSGFIQILIIIGPWSSS2EE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2017-09-15T20:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"5490ebba5c62948519b4f1c0d85bbfb64cad4b1be0516bf681500ac2e2587640","abstract_canon_sha256":"c0fbfeac4e35ebf11e1d873fa77f093db224d5df47e717369f58b78ece713967"},"schema_version":"1.0"},"canonical_sha256":"c2020e01d23151042d08419f694a5a211f37df6b6258888b3faec83357ba866d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:00.881412Z","signature_b64":"uQzR4Zu8K+qiAwxUxO9hq1vwAHjlJnlHRD9gFaxTHSNnJ4tB/oUUtV5wHHDU/K3gjKeRQxMbAKmn2Ep7bW/qDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2020e01d23151042d08419f694a5a211f37df6b6258888b3faec83357ba866d","last_reissued_at":"2026-05-18T00:35:00.880720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:00.880720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05401","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-18T00:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gIt+40K1Pglf/227g+jniXhKDtlhAET1acj1bJHGYAeAwUoNxSrPPF3xq8Fi/2RYc5/b2Y/A6XCF1BVjJH0mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:29:56.136473Z"},"content_sha256":"218edde960924a47a4c73167e2f9858b11c407b55b45f3ea1e2d26bc4dbc9f5c","schema_version":"1.0","event_id":"sha256:218edde960924a47a4c73167e2f9858b11c407b55b45f3ea1e2d26bc4dbc9f5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YIBA4AOSGFIQILIIIGPWSSS2EE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search-based Motion Planning for Quadrotors using Linear Quadratic Minimum Time Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Kartik Mohta, Nikolay Atanasov, Sikang Liu, Vijay Kumar","submitted_at":"2017-09-15T20:54:52Z","abstract_excerpt":"In this work, we propose a search-based planning method to compute dynamically feasible trajectories for a quadrotor flying in an obstacle-cluttered environment. Our approach searches for smooth, minimum-time trajectories by exploring the map using a set of short-duration motion primitives. The primitives are generated by solving an optimal control problem and induce a finite lattice discretization on the state space which can be explored using a graph-search algorithm. The proposed approach is able to generate resolution-complete (i.e., optimal in the discretized space), safe, dynamically fea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05401","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-18T00:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4PkxmtslBZQI/tExC7xPfbDOm0ILkj9RpGcR1uYh65CMkjlGjg9L/Sl2sQkytHFuRBC7L2ZB10ElDY+UeXRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:29:56.137056Z"},"content_sha256":"7f6b689b49bcf66b3eb0bc0ae0f1f27f1bb6862d49d52b573a8aa2b6577d7f7f","schema_version":"1.0","event_id":"sha256:7f6b689b49bcf66b3eb0bc0ae0f1f27f1bb6862d49d52b573a8aa2b6577d7f7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIBA4AOSGFIQILIIIGPWSSS2EE/bundle.json","state_url":"https://pith.science/pith/YIBA4AOSGFIQILIIIGPWSSS2EE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIBA4AOSGFIQILIIIGPWSSS2EE/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-25T07:29:56Z","links":{"resolver":"https://pith.science/pith/YIBA4AOSGFIQILIIIGPWSSS2EE","bundle":"https://pith.science/pith/YIBA4AOSGFIQILIIIGPWSSS2EE/bundle.json","state":"https://pith.science/pith/YIBA4AOSGFIQILIIIGPWSSS2EE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIBA4AOSGFIQILIIIGPWSSS2EE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YIBA4AOSGFIQILIIIGPWSSS2EE","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":"c0fbfeac4e35ebf11e1d873fa77f093db224d5df47e717369f58b78ece713967","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2017-09-15T20:54:52Z","title_canon_sha256":"5490ebba5c62948519b4f1c0d85bbfb64cad4b1be0516bf681500ac2e2587640"},"schema_version":"1.0","source":{"id":"1709.05401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05401","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05401v1","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05401","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"YIBA4AOSGFIQ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YIBA4AOSGFIQILII","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YIBA4AOS","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:7f6b689b49bcf66b3eb0bc0ae0f1f27f1bb6862d49d52b573a8aa2b6577d7f7f","target":"graph","created_at":"2026-05-18T00:35:00Z","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":"In this work, we propose a search-based planning method to compute dynamically feasible trajectories for a quadrotor flying in an obstacle-cluttered environment. Our approach searches for smooth, minimum-time trajectories by exploring the map using a set of short-duration motion primitives. The primitives are generated by solving an optimal control problem and induce a finite lattice discretization on the state space which can be explored using a graph-search algorithm. The proposed approach is able to generate resolution-complete (i.e., optimal in the discretized space), safe, dynamically fea","authors_text":"Kartik Mohta, Nikolay Atanasov, Sikang Liu, Vijay Kumar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2017-09-15T20:54:52Z","title":"Search-based Motion Planning for Quadrotors using Linear Quadratic Minimum Time Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05401","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:218edde960924a47a4c73167e2f9858b11c407b55b45f3ea1e2d26bc4dbc9f5c","target":"record","created_at":"2026-05-18T00:35:00Z","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":"c0fbfeac4e35ebf11e1d873fa77f093db224d5df47e717369f58b78ece713967","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2017-09-15T20:54:52Z","title_canon_sha256":"5490ebba5c62948519b4f1c0d85bbfb64cad4b1be0516bf681500ac2e2587640"},"schema_version":"1.0","source":{"id":"1709.05401","kind":"arxiv","version":1}},"canonical_sha256":"c2020e01d23151042d08419f694a5a211f37df6b6258888b3faec83357ba866d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2020e01d23151042d08419f694a5a211f37df6b6258888b3faec83357ba866d","first_computed_at":"2026-05-18T00:35:00.880720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:00.880720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uQzR4Zu8K+qiAwxUxO9hq1vwAHjlJnlHRD9gFaxTHSNnJ4tB/oUUtV5wHHDU/K3gjKeRQxMbAKmn2Ep7bW/qDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:00.881412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:218edde960924a47a4c73167e2f9858b11c407b55b45f3ea1e2d26bc4dbc9f5c","sha256:7f6b689b49bcf66b3eb0bc0ae0f1f27f1bb6862d49d52b573a8aa2b6577d7f7f"],"state_sha256":"83b327fa1c0007904cf78f81e0ab160b667a61eadbe1153fe463b02dedf1db6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gfBzhZegWbVfCwnI6yhUahMEC4LAfdSJxh++RyXrYGEpgJJ58M+DDkIN8Ga2+y3JfGmRhiQliEFsRVscN0oDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:29:56.139970Z","bundle_sha256":"512ecdc46df8607b26b0570a4616a7a8ec8243b40b0f410871c6bfe90e17276b"}}