{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GDCOQKWJW5M2EWZEJQOKLIMAHL","short_pith_number":"pith:GDCOQKWJ","canonical_record":{"source":{"id":"2011.03664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-07T02:39:02Z","cross_cats_sorted":[],"title_canon_sha256":"8808cef7dda8d8b795291d3ec8a880b8ec4ad556091e5a932131926dae8e0075","abstract_canon_sha256":"ca0ace971280bf9f113ca62cabfeb2ffdf5139c0379bf7bac01041b9a09ec289"},"schema_version":"1.0"},"canonical_sha256":"30c4e82ac9b759a25b244c1ca5a1803af705ca77dabd3ccc9e133dc8dc5f5dfe","source":{"kind":"arxiv","id":"2011.03664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03664","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03664v1","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03664","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"GDCOQKWJW5M2","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"pith_short_16","alias_value":"GDCOQKWJW5M2EWZE","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"pith_short_8","alias_value":"GDCOQKWJ","created_at":"2026-07-05T01:49:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GDCOQKWJW5M2EWZEJQOKLIMAHL","target":"record","payload":{"canonical_record":{"source":{"id":"2011.03664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-07T02:39:02Z","cross_cats_sorted":[],"title_canon_sha256":"8808cef7dda8d8b795291d3ec8a880b8ec4ad556091e5a932131926dae8e0075","abstract_canon_sha256":"ca0ace971280bf9f113ca62cabfeb2ffdf5139c0379bf7bac01041b9a09ec289"},"schema_version":"1.0"},"canonical_sha256":"30c4e82ac9b759a25b244c1ca5a1803af705ca77dabd3ccc9e133dc8dc5f5dfe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:58.123219Z","signature_b64":"zfCm7opawxVDrvgIyioWcDUK7mJb5yEHFJEWMx4k57KMkZVcsNUP4MCjo3sT3bgoCkdjNlRJcUb9DsyWphGTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c4e82ac9b759a25b244c1ca5a1803af705ca77dabd3ccc9e133dc8dc5f5dfe","last_reissued_at":"2026-07-05T01:49:58.121880Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:58.121880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.03664","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-07-05T01:49:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zY9mFLC6LQspjC2Mvl5lfJR/j/olKjmmXPuJqYvtROv13jOsRSi2kx1AjkYeFc+W6GcQEtK047DmyPB5DqWpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:31:03.112789Z"},"content_sha256":"149affd236a3ea955ae911bd57710b8e81276ceaf00c094b66b271420c28b088","schema_version":"1.0","event_id":"sha256:149affd236a3ea955ae911bd57710b8e81276ceaf00c094b66b271420c28b088"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GDCOQKWJW5M2EWZEJQOKLIMAHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search-Based Online Trajectory Planning for Car-like Robots in Highly Dynamic Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Delong Zhu, Jiahui Lin, Jianbang Liu, Max Q.-H. Meng, Tong Zhou","submitted_at":"2020-11-07T02:39:02Z","abstract_excerpt":"This paper presents a search-based partial motion planner to generate dynamically feasible trajectories for car-like robots in highly dynamic environments. The planner searches for smooth, safe, and near-time-optimal trajectories by exploring a state graph built on motion primitives, which are generated by discretizing the time dimension and the control space. To enable fast online planning, we first propose an efficient path searching algorithm based on the aggregation and pruning of motion primitives. We then propose a fast collision checking algorithm that takes into account the motions of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03664","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.03664/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-05T01:49:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWIy6tSFDtgr4jkqtndYhypwAnSJlWYhSJDwFV4wUixL3zxQkEYIAVJkOZJcn+/vBYwzdLnySiekPQnFKuhhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:31:03.114684Z"},"content_sha256":"842c280e9499c5e48e7e2f3658e098980082d912b8b2c9a576e04899a604ae70","schema_version":"1.0","event_id":"sha256:842c280e9499c5e48e7e2f3658e098980082d912b8b2c9a576e04899a604ae70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDCOQKWJW5M2EWZEJQOKLIMAHL/bundle.json","state_url":"https://pith.science/pith/GDCOQKWJW5M2EWZEJQOKLIMAHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDCOQKWJW5M2EWZEJQOKLIMAHL/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-06T11:31:03Z","links":{"resolver":"https://pith.science/pith/GDCOQKWJW5M2EWZEJQOKLIMAHL","bundle":"https://pith.science/pith/GDCOQKWJW5M2EWZEJQOKLIMAHL/bundle.json","state":"https://pith.science/pith/GDCOQKWJW5M2EWZEJQOKLIMAHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDCOQKWJW5M2EWZEJQOKLIMAHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GDCOQKWJW5M2EWZEJQOKLIMAHL","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":"ca0ace971280bf9f113ca62cabfeb2ffdf5139c0379bf7bac01041b9a09ec289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-07T02:39:02Z","title_canon_sha256":"8808cef7dda8d8b795291d3ec8a880b8ec4ad556091e5a932131926dae8e0075"},"schema_version":"1.0","source":{"id":"2011.03664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03664","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03664v1","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03664","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"GDCOQKWJW5M2","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"pith_short_16","alias_value":"GDCOQKWJW5M2EWZE","created_at":"2026-07-05T01:49:58Z"},{"alias_kind":"pith_short_8","alias_value":"GDCOQKWJ","created_at":"2026-07-05T01:49:58Z"}],"graph_snapshots":[{"event_id":"sha256:842c280e9499c5e48e7e2f3658e098980082d912b8b2c9a576e04899a604ae70","target":"graph","created_at":"2026-07-05T01:49:58Z","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/2011.03664/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a search-based partial motion planner to generate dynamically feasible trajectories for car-like robots in highly dynamic environments. The planner searches for smooth, safe, and near-time-optimal trajectories by exploring a state graph built on motion primitives, which are generated by discretizing the time dimension and the control space. To enable fast online planning, we first propose an efficient path searching algorithm based on the aggregation and pruning of motion primitives. We then propose a fast collision checking algorithm that takes into account the motions of ","authors_text":"Delong Zhu, Jiahui Lin, Jianbang Liu, Max Q.-H. Meng, Tong Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-07T02:39:02Z","title":"Search-Based Online Trajectory Planning for Car-like Robots in Highly Dynamic Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03664","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:149affd236a3ea955ae911bd57710b8e81276ceaf00c094b66b271420c28b088","target":"record","created_at":"2026-07-05T01:49:58Z","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":"ca0ace971280bf9f113ca62cabfeb2ffdf5139c0379bf7bac01041b9a09ec289","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-07T02:39:02Z","title_canon_sha256":"8808cef7dda8d8b795291d3ec8a880b8ec4ad556091e5a932131926dae8e0075"},"schema_version":"1.0","source":{"id":"2011.03664","kind":"arxiv","version":1}},"canonical_sha256":"30c4e82ac9b759a25b244c1ca5a1803af705ca77dabd3ccc9e133dc8dc5f5dfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c4e82ac9b759a25b244c1ca5a1803af705ca77dabd3ccc9e133dc8dc5f5dfe","first_computed_at":"2026-07-05T01:49:58.121880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:49:58.121880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfCm7opawxVDrvgIyioWcDUK7mJb5yEHFJEWMx4k57KMkZVcsNUP4MCjo3sT3bgoCkdjNlRJcUb9DsyWphGTCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:49:58.123219Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.03664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:149affd236a3ea955ae911bd57710b8e81276ceaf00c094b66b271420c28b088","sha256:842c280e9499c5e48e7e2f3658e098980082d912b8b2c9a576e04899a604ae70"],"state_sha256":"a3abcfc000b6e5a8c17928c742c94b1ec870aeb5d191d8fe91ad2ceb86e27ddc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXLAjVbIszEF9t2GPpF7KMaSFalAbS/3yHyV2Ba9cr8aywQBjbz+TM/wX0CGw4SABK16qMF0fUUheIWBN2aiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:31:03.118562Z","bundle_sha256":"07d86cd0ad541a0d8e224f6d4d69a0415054a6251a905566b107e7eb06e9fc2b"}}