{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PB6UMIBTQZQH4RURAD4FIXYQVX","short_pith_number":"pith:PB6UMIBT","canonical_record":{"source":{"id":"1807.02931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T03:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"388916a2b40e9245cba3a1525cc4a201a756c94c8ff3f0c8930a8d4051b8b153","abstract_canon_sha256":"907cccca8305f73aa0ca6d70c9a5d78e2b45967f78dfbdb89b1b8cedd95ab1be"},"schema_version":"1.0"},"canonical_sha256":"787d46203386607e469100f8545f10add85f92911fb9df8c00612eda0dd8491c","source":{"kind":"arxiv","id":"1807.02931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02931","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02931v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02931","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"PB6UMIBTQZQH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PB6UMIBTQZQH4RUR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PB6UMIBT","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PB6UMIBTQZQH4RURAD4FIXYQVX","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T03:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"388916a2b40e9245cba3a1525cc4a201a756c94c8ff3f0c8930a8d4051b8b153","abstract_canon_sha256":"907cccca8305f73aa0ca6d70c9a5d78e2b45967f78dfbdb89b1b8cedd95ab1be"},"schema_version":"1.0"},"canonical_sha256":"787d46203386607e469100f8545f10add85f92911fb9df8c00612eda0dd8491c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:13.324864Z","signature_b64":"NdA1kV1U1flEZKW+QqlPz9hoIYQe6U6gwf8VaEXvyDH5Skz+De1N+MV5wyfKwyJvcM9rIYWcb0q8mbXBZshBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787d46203386607e469100f8545f10add85f92911fb9df8c00612eda0dd8491c","last_reissued_at":"2026-05-18T00:11:13.324203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:13.324203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02931","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:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3eAs0k+qJqL0DSx6chcsD3XJtC/J0fgk7hmuD2+To7bC7Ojt8BDSLbGCXwJbTdTnI4mUACqYLS8I6j7bz8fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:01:47.230322Z"},"content_sha256":"289ab3bc34e91ce8e5c75fabc443cf5b3146eee22a20171af29472a15e94dafd","schema_version":"1.0","event_id":"sha256:289ab3bc34e91ce8e5c75fabc443cf5b3146eee22a20171af29472a15e94dafd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PB6UMIBTQZQH4RURAD4FIXYQVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Trajectory-Planning of UAVs via B-Splines and Disjunctive Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Babaei, Amirhossein Karimi","submitted_at":"2018-07-09T03:40:17Z","abstract_excerpt":"This paper investigates an efficient algorithm for trajectory planning problem of autonomous unmanned aerial vehicles which fly over three-dimensional terrains. The proposed algorithm combines convex optimization with disjunctive programming and receding horizon concept, which has many advantages, such as a high computational speed. Disjunctive programming is applied in order to relax the non-convex constraints of the problem. Moreover, the B-spline curves are employed to represent the trajectories which should be generated in the optimization process."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02931","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:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9ZEwBVgh5MO62pcTtvaWdmdwFGyz252OpbjerS+rEKfjDrf+qlqojz1TcwqaLrbc4K0nDZlzMjWcM1RjgH4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:01:47.230919Z"},"content_sha256":"063bb9ed6b0be99a85b887ae57acf518c9d889045435967e5e2e116e1b91ebd6","schema_version":"1.0","event_id":"sha256:063bb9ed6b0be99a85b887ae57acf518c9d889045435967e5e2e116e1b91ebd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/bundle.json","state_url":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/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-28T14:01:47Z","links":{"resolver":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX","bundle":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/bundle.json","state":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PB6UMIBTQZQH4RURAD4FIXYQVX","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":"907cccca8305f73aa0ca6d70c9a5d78e2b45967f78dfbdb89b1b8cedd95ab1be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T03:40:17Z","title_canon_sha256":"388916a2b40e9245cba3a1525cc4a201a756c94c8ff3f0c8930a8d4051b8b153"},"schema_version":"1.0","source":{"id":"1807.02931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02931","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02931v1","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02931","created_at":"2026-05-18T00:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"PB6UMIBTQZQH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PB6UMIBTQZQH4RUR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PB6UMIBT","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:063bb9ed6b0be99a85b887ae57acf518c9d889045435967e5e2e116e1b91ebd6","target":"graph","created_at":"2026-05-18T00:11:13Z","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 investigates an efficient algorithm for trajectory planning problem of autonomous unmanned aerial vehicles which fly over three-dimensional terrains. The proposed algorithm combines convex optimization with disjunctive programming and receding horizon concept, which has many advantages, such as a high computational speed. Disjunctive programming is applied in order to relax the non-convex constraints of the problem. Moreover, the B-spline curves are employed to represent the trajectories which should be generated in the optimization process.","authors_text":"Alireza Babaei, Amirhossein Karimi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T03:40:17Z","title":"Optimal Trajectory-Planning of UAVs via B-Splines and Disjunctive Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02931","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:289ab3bc34e91ce8e5c75fabc443cf5b3146eee22a20171af29472a15e94dafd","target":"record","created_at":"2026-05-18T00:11:13Z","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":"907cccca8305f73aa0ca6d70c9a5d78e2b45967f78dfbdb89b1b8cedd95ab1be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T03:40:17Z","title_canon_sha256":"388916a2b40e9245cba3a1525cc4a201a756c94c8ff3f0c8930a8d4051b8b153"},"schema_version":"1.0","source":{"id":"1807.02931","kind":"arxiv","version":1}},"canonical_sha256":"787d46203386607e469100f8545f10add85f92911fb9df8c00612eda0dd8491c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"787d46203386607e469100f8545f10add85f92911fb9df8c00612eda0dd8491c","first_computed_at":"2026-05-18T00:11:13.324203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:13.324203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NdA1kV1U1flEZKW+QqlPz9hoIYQe6U6gwf8VaEXvyDH5Skz+De1N+MV5wyfKwyJvcM9rIYWcb0q8mbXBZshBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:13.324864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:289ab3bc34e91ce8e5c75fabc443cf5b3146eee22a20171af29472a15e94dafd","sha256:063bb9ed6b0be99a85b887ae57acf518c9d889045435967e5e2e116e1b91ebd6"],"state_sha256":"8048a16e74d3ecefe0121182696f104c3a59b5f8433b822e24e03c4f85182a23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXCJzJHB0SRToRZorOOBy6wBg+ZHWBYIV2aoj+CepAFBe+6/jbSxYeiyPbRbGOhB7njJUJbOvqlQhGjBD0KiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:01:47.233878Z","bundle_sha256":"0721c4b53a633cadac1927fba32cb77c3fe6103869f8e7cb4b60a59b80e7c33a"}}