{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:A5SALG2QGNX7CTKFHPFPMQ6EVZ","short_pith_number":"pith:A5SALG2Q","schema_version":"1.0","canonical_sha256":"0764059b50336ff14d453bcaf643c4ae670e389eba6988423a683468579cd760","source":{"kind":"arxiv","id":"2403.18695","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Risk-aware Branch MPC for Automated Driving that is Robust to Uncertain Vehicle Behaviors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"George Pantazis, Luyao Zhang, Sergio Grammatico, Shaohang Han","submitted_at":"2024-03-27T15:44:25Z","abstract_excerpt":"One of the critical challenges in automated driving is ensuring safety of automated vehicles despite the unknown behavior of the other vehicles. Although motion prediction modules are able to generate a probability distribution associated with various behavior modes, their probabilistic estimates are often inaccurate, thus leading to a possibly unsafe trajectory. To overcome this challenge, we propose a risk-aware motion planning framework that appropriately accounts for the ambiguity in the estimated probability distribution. We formulate the risk-aware motion planning problem as a min-max op"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.18695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-03-27T15:44:25Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"f044f7ab4085a7636bd925db0c216df9bf663c123037c41b1fb387f951c05598","abstract_canon_sha256":"9421fb647e8197c5b3217f90758e3c14b5d0f26fe51d4977626bffe1c6399b3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:25.861514Z","signature_b64":"ztvWpOL+QTfWv7JJhHkA9aluo5RSqp+J0FDNW9fVYUIHt5DwfUiA+fyb4f0uA68SCJRyoj6y5ThFjGk5H92ZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0764059b50336ff14d453bcaf643c4ae670e389eba6988423a683468579cd760","last_reissued_at":"2026-07-05T08:01:25.861070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:25.861070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Risk-aware Branch MPC for Automated Driving that is Robust to Uncertain Vehicle Behaviors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"eess.SY","authors_text":"George Pantazis, Luyao Zhang, Sergio Grammatico, Shaohang Han","submitted_at":"2024-03-27T15:44:25Z","abstract_excerpt":"One of the critical challenges in automated driving is ensuring safety of automated vehicles despite the unknown behavior of the other vehicles. Although motion prediction modules are able to generate a probability distribution associated with various behavior modes, their probabilistic estimates are often inaccurate, thus leading to a possibly unsafe trajectory. To overcome this challenge, we propose a risk-aware motion planning framework that appropriately accounts for the ambiguity in the estimated probability distribution. We formulate the risk-aware motion planning problem as a min-max op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18695","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/2403.18695/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.18695","created_at":"2026-07-05T08:01:25.861130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18695v1","created_at":"2026-07-05T08:01:25.861130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18695","created_at":"2026-07-05T08:01:25.861130+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5SALG2QGNX7","created_at":"2026-07-05T08:01:25.861130+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5SALG2QGNX7CTKF","created_at":"2026-07-05T08:01:25.861130+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5SALG2Q","created_at":"2026-07-05T08:01:25.861130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12327","citing_title":"Robust Planning for Autonomous Driving via Mixed Adversarial Diffusion Predictions","ref_index":65,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ","json":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ.json","graph_json":"https://pith.science/api/pith-number/A5SALG2QGNX7CTKFHPFPMQ6EVZ/graph.json","events_json":"https://pith.science/api/pith-number/A5SALG2QGNX7CTKFHPFPMQ6EVZ/events.json","paper":"https://pith.science/paper/A5SALG2Q"},"agent_actions":{"view_html":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ","download_json":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ.json","view_paper":"https://pith.science/paper/A5SALG2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18695&json=true","fetch_graph":"https://pith.science/api/pith-number/A5SALG2QGNX7CTKFHPFPMQ6EVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/A5SALG2QGNX7CTKFHPFPMQ6EVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ/action/storage_attestation","attest_author":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ/action/author_attestation","sign_citation":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ/action/citation_signature","submit_replication":"https://pith.science/pith/A5SALG2QGNX7CTKFHPFPMQ6EVZ/action/replication_record"}},"created_at":"2026-07-05T08:01:25.861130+00:00","updated_at":"2026-07-05T08:01:25.861130+00:00"}