{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZJ5RJUZYRPDP3QAZPNRGVYVNMP","short_pith_number":"pith:ZJ5RJUZY","schema_version":"1.0","canonical_sha256":"ca7b14d3388bc6fdc0197b626ae2ad63eaef8a099854dd69e28438d0d0158ebe","source":{"kind":"arxiv","id":"2502.02550","version":1},"attestation_state":"computed","paper":{"title":"Reachability-Based Contingency Planning against Multi-Modal Predictions with Branch MPC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Bojan Derajic, Daniel Goehring, Joerg Reichardt, Mohamed-Khalil Bouzidi","submitted_at":"2025-02-04T18:20:31Z","abstract_excerpt":"This paper presents a novel contingency planning framework that integrates learning-based multi-modal predictions of traffic participants into Branch Model Predictive Control (MPC). Leveraging reachability analysis, we address the computational challenges associated with Branch MPC by organizing the multitude of predictions into driving corridors. Analyzing the overlap between these corridors, their number can be reduced through pruning and clustering while ensuring safety since all prediction modes are preserved. These processed corridors directly correspond to the distinct branches of the sc"},"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":"2502.02550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2025-02-04T18:20:31Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e6cb6c22a50f9f348b2007b6b5791926e6af2de592c1126552267b38d7c45b57","abstract_canon_sha256":"60e3cc48bd178f54ee27bc96acdf758c675b34744d28eede16c6a1de88f0ede4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:30.026271Z","signature_b64":"q0ysAYFDxj2L0GDoDFgqUiYKg5DlnXOkuEIMKf1YLhfGtXpwUCOs1LP+p5N9UC6U5RYeC22xedGQyIdcGAmPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7b14d3388bc6fdc0197b626ae2ad63eaef8a099854dd69e28438d0d0158ebe","last_reissued_at":"2026-07-05T10:09:30.025861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:30.025861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability-Based Contingency Planning against Multi-Modal Predictions with Branch MPC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Bojan Derajic, Daniel Goehring, Joerg Reichardt, Mohamed-Khalil Bouzidi","submitted_at":"2025-02-04T18:20:31Z","abstract_excerpt":"This paper presents a novel contingency planning framework that integrates learning-based multi-modal predictions of traffic participants into Branch Model Predictive Control (MPC). Leveraging reachability analysis, we address the computational challenges associated with Branch MPC by organizing the multitude of predictions into driving corridors. Analyzing the overlap between these corridors, their number can be reduced through pruning and clustering while ensuring safety since all prediction modes are preserved. These processed corridors directly correspond to the distinct branches of the sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02550","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/2502.02550/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":"2502.02550","created_at":"2026-07-05T10:09:30.025917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02550v1","created_at":"2026-07-05T10:09:30.025917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02550","created_at":"2026-07-05T10:09:30.025917+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJ5RJUZYRPDP","created_at":"2026-07-05T10:09:30.025917+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJ5RJUZYRPDP3QAZ","created_at":"2026-07-05T10:09:30.025917+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJ5RJUZY","created_at":"2026-07-05T10:09:30.025917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.10310","citing_title":"Safe and Real-Time Consistent Planning for Autonomous Vehicles in Partially Observed Environments via Parallel Consensus Optimization","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP","json":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP.json","graph_json":"https://pith.science/api/pith-number/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/graph.json","events_json":"https://pith.science/api/pith-number/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/events.json","paper":"https://pith.science/paper/ZJ5RJUZY"},"agent_actions":{"view_html":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP","download_json":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP.json","view_paper":"https://pith.science/paper/ZJ5RJUZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02550&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/action/storage_attestation","attest_author":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/action/author_attestation","sign_citation":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/action/citation_signature","submit_replication":"https://pith.science/pith/ZJ5RJUZYRPDP3QAZPNRGVYVNMP/action/replication_record"}},"created_at":"2026-07-05T10:09:30.025917+00:00","updated_at":"2026-07-05T10:09:30.025917+00:00"}