{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HQ6ZCBJ53H5D3BR663RIPQ75WU","short_pith_number":"pith:HQ6ZCBJ5","canonical_record":{"source":{"id":"1903.07900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-19T09:35:20Z","cross_cats_sorted":[],"title_canon_sha256":"1152ad6e078b95078eb7806abd0a046364b3c66795b1a2d896eb213343e3cd9b","abstract_canon_sha256":"bef67c3549fdc8a2cceb48faf03aada252206dc99eb6ba6a90e952aca0601f6c"},"schema_version":"1.0"},"canonical_sha256":"3c3d91053dd9fa3d863ef6e287c3fdb5293e350bab29fcb06efac772ab3e7ce2","source":{"kind":"arxiv","id":"1903.07900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07900","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07900v2","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07900","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"HQ6ZCBJ53H5D","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HQ6ZCBJ53H5D3BR6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HQ6ZCBJ5","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HQ6ZCBJ53H5D3BR663RIPQ75WU","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-19T09:35:20Z","cross_cats_sorted":[],"title_canon_sha256":"1152ad6e078b95078eb7806abd0a046364b3c66795b1a2d896eb213343e3cd9b","abstract_canon_sha256":"bef67c3549fdc8a2cceb48faf03aada252206dc99eb6ba6a90e952aca0601f6c"},"schema_version":"1.0"},"canonical_sha256":"3c3d91053dd9fa3d863ef6e287c3fdb5293e350bab29fcb06efac772ab3e7ce2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:33.100276Z","signature_b64":"68Fnw85skcfRnFT7wMvijUiJL1axcR7n6zqCjguXG/ljKZBWtGb4q7AX9VeE3MdHAGPAgXAb8fGre/FK3OktBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3d91053dd9fa3d863ef6e287c3fdb5293e350bab29fcb06efac772ab3e7ce2","last_reissued_at":"2026-05-17T23:50:33.099721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:33.099721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07900","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-05-17T23:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6sOPmkAK0euvibgtIeEFJnJRc0Iwo3EbYq/O9N6o/vtIaopaaizTgf/qgS9oU5zA+0k5wpvfUmImo7f/4F1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:56:42.947037Z"},"content_sha256":"aecb244c274ddb3c7c96a47d33034d67cb0c58d7d337ab62738565c27b654cc8","schema_version":"1.0","event_id":"sha256:aecb244c274ddb3c7c96a47d33034d67cb0c58d7d337ab62738565c27b654cc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HQ6ZCBJ53H5D3BR663RIPQ75WU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Path Planning by Tightly Combining Lattice-based Path Planning and Numerical Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Kristoffer Bergman, Oskar Ljungqvist","submitted_at":"2019-03-19T09:35:20Z","abstract_excerpt":"This paper presents a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems. The approach is motivated by first showing that a lattice-based path planner can be cast and analyzed as a bilevel optimization problem. This information is then used to tightly integrate a lattice-based path planner and numerical optimal control in a novel way. The lattice-based path planner is applied to the problem in a first step using a discretized search space, where system dynamics and objective function are chosen to coincide with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07900","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":""},"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-17T23:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2B7wpYKN6JYcQH7CfK12Q5wL/OdzDAscjq17qrnZOv2LnE4J4CEO63jy++q43Ho9PXPA3uLVrLAziYCh3/PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:56:42.947791Z"},"content_sha256":"506ec62a6f504a9d84e5d3d2173c9491804c07a81ca54e08956febf66b55b4b2","schema_version":"1.0","event_id":"sha256:506ec62a6f504a9d84e5d3d2173c9491804c07a81ca54e08956febf66b55b4b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/bundle.json","state_url":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/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-08T15:56:42Z","links":{"resolver":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU","bundle":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/bundle.json","state":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HQ6ZCBJ53H5D3BR663RIPQ75WU","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":"bef67c3549fdc8a2cceb48faf03aada252206dc99eb6ba6a90e952aca0601f6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-19T09:35:20Z","title_canon_sha256":"1152ad6e078b95078eb7806abd0a046364b3c66795b1a2d896eb213343e3cd9b"},"schema_version":"1.0","source":{"id":"1903.07900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07900","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07900v2","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07900","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"HQ6ZCBJ53H5D","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HQ6ZCBJ53H5D3BR6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HQ6ZCBJ5","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:506ec62a6f504a9d84e5d3d2173c9491804c07a81ca54e08956febf66b55b4b2","target":"graph","created_at":"2026-05-17T23:50:33Z","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 presents a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems. The approach is motivated by first showing that a lattice-based path planner can be cast and analyzed as a bilevel optimization problem. This information is then used to tightly integrate a lattice-based path planner and numerical optimal control in a novel way. The lattice-based path planner is applied to the problem in a first step using a discretized search space, where system dynamics and objective function are chosen to coincide with ","authors_text":"Daniel Axehill, Kristoffer Bergman, Oskar Ljungqvist","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-19T09:35:20Z","title":"Improved Path Planning by Tightly Combining Lattice-based Path Planning and Numerical Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07900","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:aecb244c274ddb3c7c96a47d33034d67cb0c58d7d337ab62738565c27b654cc8","target":"record","created_at":"2026-05-17T23:50:33Z","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":"bef67c3549fdc8a2cceb48faf03aada252206dc99eb6ba6a90e952aca0601f6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-19T09:35:20Z","title_canon_sha256":"1152ad6e078b95078eb7806abd0a046364b3c66795b1a2d896eb213343e3cd9b"},"schema_version":"1.0","source":{"id":"1903.07900","kind":"arxiv","version":2}},"canonical_sha256":"3c3d91053dd9fa3d863ef6e287c3fdb5293e350bab29fcb06efac772ab3e7ce2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c3d91053dd9fa3d863ef6e287c3fdb5293e350bab29fcb06efac772ab3e7ce2","first_computed_at":"2026-05-17T23:50:33.099721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:33.099721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"68Fnw85skcfRnFT7wMvijUiJL1axcR7n6zqCjguXG/ljKZBWtGb4q7AX9VeE3MdHAGPAgXAb8fGre/FK3OktBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:33.100276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aecb244c274ddb3c7c96a47d33034d67cb0c58d7d337ab62738565c27b654cc8","sha256:506ec62a6f504a9d84e5d3d2173c9491804c07a81ca54e08956febf66b55b4b2"],"state_sha256":"bb93bae8905aa4ee2331c46268327fc959335c19cc124602575182773f67dcf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DyoJKhM0ESEiO7ZuvqCLdgiOieAuj/crmVA4wwGoGC3bjrEVs/WRrDPVa1HHENDPGdRkTYc8f1VDrxb6SSL2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:56:42.951885Z","bundle_sha256":"dd9f6f32694f28f32163715eb3c5d96f39990dcd5d3bbb1721397760e5ac40a8"}}