{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Y5ELEWSV4YMSX3YRIOPNEAC2PV","short_pith_number":"pith:Y5ELEWSV","canonical_record":{"source":{"id":"1611.07608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-23T02:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"aefc546104c5c7ecd70ec861aa3f77fe5b6a8314e41db6a88daaab0de7bce572","abstract_canon_sha256":"0f15482cd51f2d9a8ffdb3797e71d1f34d24e4af050cdb3963c578973c3a1b60"},"schema_version":"1.0"},"canonical_sha256":"c748b25a55e6192bef11439ed2005a7d5fa3b9a8ad5b5a38be7b49e4f6aec2ef","source":{"kind":"arxiv","id":"1611.07608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07608","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07608v1","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07608","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"Y5ELEWSV4YMS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y5ELEWSV4YMSX3YR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y5ELEWSV","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Y5ELEWSV4YMSX3YRIOPNEAC2PV","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-23T02:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"aefc546104c5c7ecd70ec861aa3f77fe5b6a8314e41db6a88daaab0de7bce572","abstract_canon_sha256":"0f15482cd51f2d9a8ffdb3797e71d1f34d24e4af050cdb3963c578973c3a1b60"},"schema_version":"1.0"},"canonical_sha256":"c748b25a55e6192bef11439ed2005a7d5fa3b9a8ad5b5a38be7b49e4f6aec2ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:00.325399Z","signature_b64":"h6VOWXox16BHgd4dbL85cUZEf2/OrCXCSpS8ed2dWystMIIjK1kSDm5iukTP7Sw8F23K+r8S1chPZb4ic/9zCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c748b25a55e6192bef11439ed2005a7d5fa3b9a8ad5b5a38be7b49e4f6aec2ef","last_reissued_at":"2026-05-18T00:57:00.324776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:00.324776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07608","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:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/ZTWf4zrkyJOQWGNVTDBc1HzUZLmwze9JwGW/jXiN9dXibP2uuMSQLC5n9mrWM/xw6s0gcbgiOnpm/DHVH8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:52:04.544925Z"},"content_sha256":"3e6621ef185e97b26f1a439da95ec3bb6271913e03d4d2d6672787df5008cebf","schema_version":"1.0","event_id":"sha256:3e6621ef185e97b26f1a439da95ec3bb6271913e03d4d2d6672787df5008cebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Y5ELEWSV4YMSX3YRIOPNEAC2PV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Collision-Tolerant Optimal Trajectory Planning of Autonomous Vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Eric Feron, Juan-Pablo Afman, Mark L. Mote","submitted_at":"2016-11-23T02:34:15Z","abstract_excerpt":"Collision-tolerant trajectory planning is the consideration that collisions, if they are planned appropriately, enable more effective path planning for robots capable of handling them. A mixed integer programming (MIP) optimization formulation demonstrates the computational practicality of optimizing trajectories that comprise planned collisions. A damage quantification function is proposed, and the influence of damage functions constraints on the trajectory are studied in simulation. Using a simple example, an increase in performance is achieved under this schema as compared to collision-free"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07608","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:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGaLmvYV9Q/G6z+PasBpv8XzLFt8qVXlrj4Trlvvrpf9Bdy1rlEVdj6RGUevaR4XYzPRAMu1yIy6iKjSPPxmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:52:04.545251Z"},"content_sha256":"9ec028c0d5d3d5c8ee4fff659a30df5436a135667c7eb6ab537b1e2bd78392aa","schema_version":"1.0","event_id":"sha256:9ec028c0d5d3d5c8ee4fff659a30df5436a135667c7eb6ab537b1e2bd78392aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5ELEWSV4YMSX3YRIOPNEAC2PV/bundle.json","state_url":"https://pith.science/pith/Y5ELEWSV4YMSX3YRIOPNEAC2PV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5ELEWSV4YMSX3YRIOPNEAC2PV/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-23T12:52:04Z","links":{"resolver":"https://pith.science/pith/Y5ELEWSV4YMSX3YRIOPNEAC2PV","bundle":"https://pith.science/pith/Y5ELEWSV4YMSX3YRIOPNEAC2PV/bundle.json","state":"https://pith.science/pith/Y5ELEWSV4YMSX3YRIOPNEAC2PV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5ELEWSV4YMSX3YRIOPNEAC2PV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y5ELEWSV4YMSX3YRIOPNEAC2PV","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":"0f15482cd51f2d9a8ffdb3797e71d1f34d24e4af050cdb3963c578973c3a1b60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-23T02:34:15Z","title_canon_sha256":"aefc546104c5c7ecd70ec861aa3f77fe5b6a8314e41db6a88daaab0de7bce572"},"schema_version":"1.0","source":{"id":"1611.07608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07608","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07608v1","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07608","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"Y5ELEWSV4YMS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y5ELEWSV4YMSX3YR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y5ELEWSV","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9ec028c0d5d3d5c8ee4fff659a30df5436a135667c7eb6ab537b1e2bd78392aa","target":"graph","created_at":"2026-05-18T00:57:00Z","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":"Collision-tolerant trajectory planning is the consideration that collisions, if they are planned appropriately, enable more effective path planning for robots capable of handling them. A mixed integer programming (MIP) optimization formulation demonstrates the computational practicality of optimizing trajectories that comprise planned collisions. A damage quantification function is proposed, and the influence of damage functions constraints on the trajectory are studied in simulation. Using a simple example, an increase in performance is achieved under this schema as compared to collision-free","authors_text":"Eric Feron, Juan-Pablo Afman, Mark L. Mote","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-23T02:34:15Z","title":"A Framework for Collision-Tolerant Optimal Trajectory Planning of Autonomous Vehicles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07608","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:3e6621ef185e97b26f1a439da95ec3bb6271913e03d4d2d6672787df5008cebf","target":"record","created_at":"2026-05-18T00:57:00Z","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":"0f15482cd51f2d9a8ffdb3797e71d1f34d24e4af050cdb3963c578973c3a1b60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-23T02:34:15Z","title_canon_sha256":"aefc546104c5c7ecd70ec861aa3f77fe5b6a8314e41db6a88daaab0de7bce572"},"schema_version":"1.0","source":{"id":"1611.07608","kind":"arxiv","version":1}},"canonical_sha256":"c748b25a55e6192bef11439ed2005a7d5fa3b9a8ad5b5a38be7b49e4f6aec2ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c748b25a55e6192bef11439ed2005a7d5fa3b9a8ad5b5a38be7b49e4f6aec2ef","first_computed_at":"2026-05-18T00:57:00.324776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:00.324776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6VOWXox16BHgd4dbL85cUZEf2/OrCXCSpS8ed2dWystMIIjK1kSDm5iukTP7Sw8F23K+r8S1chPZb4ic/9zCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:00.325399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e6621ef185e97b26f1a439da95ec3bb6271913e03d4d2d6672787df5008cebf","sha256:9ec028c0d5d3d5c8ee4fff659a30df5436a135667c7eb6ab537b1e2bd78392aa"],"state_sha256":"77c4e1f010d2354e7aaf2107892d2136cbf348b65794229938a76ae199f7c9bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"203I+ZWbxGQvKFv2xYknxwyVknFE3zYhQ5ZB6NrKERZfZ9k+Ax3qd39vdNsa2dTSzkI8XhhkG9oxF9CS1U5vAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:52:04.547070Z","bundle_sha256":"caffa34d23d91de0e06b2586155bc6c4e31bb6f83b3dd7886d82201b8702555a"}}