{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CWC7U53R3NQLEKBZHZ3QYHYXJL","short_pith_number":"pith:CWC7U53R","canonical_record":{"source":{"id":"1811.10753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2018-11-27T00:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"db6e522eea8cc9b007b0f36d251403828f0d05db86f9876ca95ee083ba00604b","abstract_canon_sha256":"a8feef5b6d743dc8c82f479f91d64abfa653aaa1ffe351e3db5d9d89a29b10a4"},"schema_version":"1.0"},"canonical_sha256":"1585fa7771db60b228393e770c1f174ad12bc759267d08325069ad4d77c39137","source":{"kind":"arxiv","id":"1811.10753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10753","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10753v2","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10753","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"CWC7U53R3NQL","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"pith_short_16","alias_value":"CWC7U53R3NQLEKBZ","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"pith_short_8","alias_value":"CWC7U53R","created_at":"2026-07-05T02:34:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CWC7U53R3NQLEKBZHZ3QYHYXJL","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2018-11-27T00:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"db6e522eea8cc9b007b0f36d251403828f0d05db86f9876ca95ee083ba00604b","abstract_canon_sha256":"a8feef5b6d743dc8c82f479f91d64abfa653aaa1ffe351e3db5d9d89a29b10a4"},"schema_version":"1.0"},"canonical_sha256":"1585fa7771db60b228393e770c1f174ad12bc759267d08325069ad4d77c39137","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:59.913965Z","signature_b64":"d5oGLaX3qOtEC0ecLEZUGvYoflRZfyiqWZV4lcxOYoAY8xMsAQuBrUIlhFYyTyDirDgqOzRyBTb5/Swp4ONBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1585fa7771db60b228393e770c1f174ad12bc759267d08325069ad4d77c39137","last_reissued_at":"2026-07-05T02:34:59.913607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:59.913607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10753","source_version":2,"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-07-05T02:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vu/9IuFPLRSgr2MTNsuUBMim2zpO/bgk5krXH/NhBVqGkAenmoZ8oOiTOP1vxdFZS7tGyEFOuIv4nBGUHvcgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:58:18.594698Z"},"content_sha256":"f6376d0ce55fc84f916195199c69e6b7c5b169550fe23c5e4d4444b19aee73a5","schema_version":"1.0","event_id":"sha256:f6376d0ce55fc84f916195199c69e6b7c5b169550fe23c5e4d4444b19aee73a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CWC7U53R3NQLEKBZHZ3QYHYXJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast UAV Trajectory Optimization using Bilevel Optimization with Analytical Gradients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gao Tang, Kris Hauser, Weidong Sun","submitted_at":"2018-11-27T00:18:18Z","abstract_excerpt":"We present an efficient optimization framework that solves trajectory optimization problems by decoupling state variables from timing variables, thereby decomposing a challenging nonlinear programming (NLP) problem into two easier subproblems. With timing fixed, the state variables can be optimized efficiently using convex optimization, and the timing variables can be optimized in a separate NLP, which forms a bilevel optimization problem. The challenge of obtaining the gradient of the timing variables is solved by sensitivity analysis of parametric NLPs. The exact analytic gradient is compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10753","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.10753/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dObZUCVqeMfkih03epKVSaYiblOlM+gtVviBljB0YEjB1EOiqGu5QLtKX9Zx4/nPuv8Z4no1UaufIlG/M+6WAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:58:18.595841Z"},"content_sha256":"2e6c014b36feba150cc4238f0489c619f3184a6e4fd83c6177eafe84fe29ca47","schema_version":"1.0","event_id":"sha256:2e6c014b36feba150cc4238f0489c619f3184a6e4fd83c6177eafe84fe29ca47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/bundle.json","state_url":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/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-08-05T12:58:18Z","links":{"resolver":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL","bundle":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/bundle.json","state":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CWC7U53R3NQLEKBZHZ3QYHYXJL","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":"a8feef5b6d743dc8c82f479f91d64abfa653aaa1ffe351e3db5d9d89a29b10a4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2018-11-27T00:18:18Z","title_canon_sha256":"db6e522eea8cc9b007b0f36d251403828f0d05db86f9876ca95ee083ba00604b"},"schema_version":"1.0","source":{"id":"1811.10753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10753","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10753v2","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10753","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"CWC7U53R3NQL","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"pith_short_16","alias_value":"CWC7U53R3NQLEKBZ","created_at":"2026-07-05T02:34:59Z"},{"alias_kind":"pith_short_8","alias_value":"CWC7U53R","created_at":"2026-07-05T02:34:59Z"}],"graph_snapshots":[{"event_id":"sha256:2e6c014b36feba150cc4238f0489c619f3184a6e4fd83c6177eafe84fe29ca47","target":"graph","created_at":"2026-07-05T02:34:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1811.10753/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an efficient optimization framework that solves trajectory optimization problems by decoupling state variables from timing variables, thereby decomposing a challenging nonlinear programming (NLP) problem into two easier subproblems. With timing fixed, the state variables can be optimized efficiently using convex optimization, and the timing variables can be optimized in a separate NLP, which forms a bilevel optimization problem. The challenge of obtaining the gradient of the timing variables is solved by sensitivity analysis of parametric NLPs. The exact analytic gradient is compute","authors_text":"Gao Tang, Kris Hauser, Weidong Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2018-11-27T00:18:18Z","title":"Fast UAV Trajectory Optimization using Bilevel Optimization with Analytical Gradients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10753","kind":"arxiv","version":2},"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:f6376d0ce55fc84f916195199c69e6b7c5b169550fe23c5e4d4444b19aee73a5","target":"record","created_at":"2026-07-05T02:34:59Z","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":"a8feef5b6d743dc8c82f479f91d64abfa653aaa1ffe351e3db5d9d89a29b10a4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2018-11-27T00:18:18Z","title_canon_sha256":"db6e522eea8cc9b007b0f36d251403828f0d05db86f9876ca95ee083ba00604b"},"schema_version":"1.0","source":{"id":"1811.10753","kind":"arxiv","version":2}},"canonical_sha256":"1585fa7771db60b228393e770c1f174ad12bc759267d08325069ad4d77c39137","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1585fa7771db60b228393e770c1f174ad12bc759267d08325069ad4d77c39137","first_computed_at":"2026-07-05T02:34:59.913607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:34:59.913607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d5oGLaX3qOtEC0ecLEZUGvYoflRZfyiqWZV4lcxOYoAY8xMsAQuBrUIlhFYyTyDirDgqOzRyBTb5/Swp4ONBBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:34:59.913965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6376d0ce55fc84f916195199c69e6b7c5b169550fe23c5e4d4444b19aee73a5","sha256:2e6c014b36feba150cc4238f0489c619f3184a6e4fd83c6177eafe84fe29ca47"],"state_sha256":"cf9d5f4261c8cc8a8f67cb652bd6ad9c0ac7e5e43d60ac5ca16c1181193cbbc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGBdEQP8dzLdeevDiXyMpbuntDQOsyQb8h75vq4FAGncz9fsBctfke3TkByOtyTetiemFbRSYxdh807IzIEXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:58:18.603809Z","bundle_sha256":"432c98bea8f56ff142157d37049e4a6f008c5f6f59e9696172f8ac6f470f5d28"}}