{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JQ7EDBZPJR2JMTIKMNDONOWE2Y","short_pith_number":"pith:JQ7EDBZP","canonical_record":{"source":{"id":"1805.09994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T06:18:01Z","cross_cats_sorted":["cs.RO","stat.ML"],"title_canon_sha256":"ba9e00b532a5b13973cee80d8615ea5735aa2d5a86e2f23c0b2dce61b8f4b433","abstract_canon_sha256":"7c523f7991bf57ec322c21e7c39eb2b936cbed759a55aab653977add6b6a3e5f"},"schema_version":"1.0"},"canonical_sha256":"4c3e41872f4c74964d0a6346e6bac4d60f0fef4cde2cb422d9e3bca910bdbe07","source":{"kind":"arxiv","id":"1805.09994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09994","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09994v2","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09994","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"JQ7EDBZPJR2J","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JQ7EDBZPJR2JMTIK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JQ7EDBZP","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JQ7EDBZPJR2JMTIKMNDONOWE2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T06:18:01Z","cross_cats_sorted":["cs.RO","stat.ML"],"title_canon_sha256":"ba9e00b532a5b13973cee80d8615ea5735aa2d5a86e2f23c0b2dce61b8f4b433","abstract_canon_sha256":"7c523f7991bf57ec322c21e7c39eb2b936cbed759a55aab653977add6b6a3e5f"},"schema_version":"1.0"},"canonical_sha256":"4c3e41872f4c74964d0a6346e6bac4d60f0fef4cde2cb422d9e3bca910bdbe07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:21.306331Z","signature_b64":"RKYlYNunKAXzELqh4RvYraAMbcWIt+HY3H/MbH9yA8Cp8h9NEhAaGYegHMnswzVJ1O+T81yq1HA7kGBEbBfSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c3e41872f4c74964d0a6346e6bac4d60f0fef4cde2cb422d9e3bca910bdbe07","last_reissued_at":"2026-05-18T00:13:21.305797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:21.305797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09994","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-18T00:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0e3k0FEJLb1dWK8Qkal0w4NNG2ieBT0vxlJDZjApI6zbThDAaJ8RNtcHaq6xeSYSqOdG5aYPFHiwOBi/inR7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:12:45.168654Z"},"content_sha256":"e25bbcb64c4797dbdf07028556cfa746e934a333c9c81663a1fb867533e483ff","schema_version":"1.0","event_id":"sha256:e25bbcb64c4797dbdf07028556cfa746e934a333c9c81663a1fb867533e483ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JQ7EDBZPJR2JMTIKMNDONOWE2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe learning-based optimal motion planning for automated driving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bakir Lacevic, Daniel Watzenig, Georg Stettinger, Martin Horn, Zlatan Ajanovic","submitted_at":"2018-05-25T06:18:01Z","abstract_excerpt":"This paper presents preliminary work on learning the search heuristic for the optimal motion planning for automated driving in urban traffic. Previous work considered search-based optimal motion planning framework (SBOMP) that utilized numerical or model-based heuristics that did not consider dynamic obstacles. Optimal solution was still guaranteed since dynamic obstacles can only increase the cost. However, significant variations in the search efficiency are observed depending whether dynamic obstacles are present or not. This paper introduces machine learning (ML) based heuristic that takes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09994","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-18T00:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"diGOfZ7+yFhi9qXvuwcqf3xmdTMxnUbEVXhdz+3j0HNsnfMX+nN+rRVZ89SznVFxk0W+MVRdGFsY/MueT1BkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:12:45.169003Z"},"content_sha256":"0fc75f5ad1454129c4df8963814fe00181bdaa97c9ec30c69cf55689a89a735a","schema_version":"1.0","event_id":"sha256:0fc75f5ad1454129c4df8963814fe00181bdaa97c9ec30c69cf55689a89a735a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQ7EDBZPJR2JMTIKMNDONOWE2Y/bundle.json","state_url":"https://pith.science/pith/JQ7EDBZPJR2JMTIKMNDONOWE2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQ7EDBZPJR2JMTIKMNDONOWE2Y/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-26T16:12:45Z","links":{"resolver":"https://pith.science/pith/JQ7EDBZPJR2JMTIKMNDONOWE2Y","bundle":"https://pith.science/pith/JQ7EDBZPJR2JMTIKMNDONOWE2Y/bundle.json","state":"https://pith.science/pith/JQ7EDBZPJR2JMTIKMNDONOWE2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQ7EDBZPJR2JMTIKMNDONOWE2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JQ7EDBZPJR2JMTIKMNDONOWE2Y","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":"7c523f7991bf57ec322c21e7c39eb2b936cbed759a55aab653977add6b6a3e5f","cross_cats_sorted":["cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T06:18:01Z","title_canon_sha256":"ba9e00b532a5b13973cee80d8615ea5735aa2d5a86e2f23c0b2dce61b8f4b433"},"schema_version":"1.0","source":{"id":"1805.09994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09994","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09994v2","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09994","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"JQ7EDBZPJR2J","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JQ7EDBZPJR2JMTIK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JQ7EDBZP","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:0fc75f5ad1454129c4df8963814fe00181bdaa97c9ec30c69cf55689a89a735a","target":"graph","created_at":"2026-05-18T00:13:21Z","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 preliminary work on learning the search heuristic for the optimal motion planning for automated driving in urban traffic. Previous work considered search-based optimal motion planning framework (SBOMP) that utilized numerical or model-based heuristics that did not consider dynamic obstacles. Optimal solution was still guaranteed since dynamic obstacles can only increase the cost. However, significant variations in the search efficiency are observed depending whether dynamic obstacles are present or not. This paper introduces machine learning (ML) based heuristic that takes ","authors_text":"Bakir Lacevic, Daniel Watzenig, Georg Stettinger, Martin Horn, Zlatan Ajanovic","cross_cats":["cs.RO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T06:18:01Z","title":"Safe learning-based optimal motion planning for automated driving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09994","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:e25bbcb64c4797dbdf07028556cfa746e934a333c9c81663a1fb867533e483ff","target":"record","created_at":"2026-05-18T00:13:21Z","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":"7c523f7991bf57ec322c21e7c39eb2b936cbed759a55aab653977add6b6a3e5f","cross_cats_sorted":["cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T06:18:01Z","title_canon_sha256":"ba9e00b532a5b13973cee80d8615ea5735aa2d5a86e2f23c0b2dce61b8f4b433"},"schema_version":"1.0","source":{"id":"1805.09994","kind":"arxiv","version":2}},"canonical_sha256":"4c3e41872f4c74964d0a6346e6bac4d60f0fef4cde2cb422d9e3bca910bdbe07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c3e41872f4c74964d0a6346e6bac4d60f0fef4cde2cb422d9e3bca910bdbe07","first_computed_at":"2026-05-18T00:13:21.305797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:21.305797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKYlYNunKAXzELqh4RvYraAMbcWIt+HY3H/MbH9yA8Cp8h9NEhAaGYegHMnswzVJ1O+T81yq1HA7kGBEbBfSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:21.306331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e25bbcb64c4797dbdf07028556cfa746e934a333c9c81663a1fb867533e483ff","sha256:0fc75f5ad1454129c4df8963814fe00181bdaa97c9ec30c69cf55689a89a735a"],"state_sha256":"857c524b26905afa899ac50074a8a773eb54ce549f148d8293d0a9e53f927231"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08xTsLk5YR2Te+EihS9rwWyh989lkI01r6cvwGALoKisHbZZARi1WhG007u6IjzCMYvw5oG482csDMFfmo4GCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:12:45.171008Z","bundle_sha256":"161c46b8799c78721973b94840aea945dd91737ae5a124b193481ec6ddf85977"}}