{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F2SPUFQPI4527HCV2B6HKCWKLT","short_pith_number":"pith:F2SPUFQP","schema_version":"1.0","canonical_sha256":"2ea4fa160f473baf9c55d07c750aca5cce63ae4ff831d9921ae24ede65ddb79e","source":{"kind":"arxiv","id":"2503.06075","version":2},"attestation_state":"computed","paper":{"title":"FSDP: Fast and Safe Data-Driven Overtaking Trajectory Planning for Head-to-Head Autonomous Racing Competitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Cheng Hu, Haotong Qin, Jihao Huang, Lei Xie, Michele Magno, Nicolas Baumann, Wule Mao, Xuemin Chi, Yonghao Fu, Zhitao Liu","submitted_at":"2025-03-08T05:51:17Z","abstract_excerpt":"Generating overtaking trajectories in autonomous racing is a challenging task, as the trajectory must satisfy the vehicle's dynamics and ensure safety and real-time performance running on resource-constrained hardware. This work proposes the Fast and Safe Data-Driven Planner to address this challenge. Sparse Gaussian predictions are introduced to improve both the computational efficiency and accuracy of opponent predictions. Furthermore, the proposed approach employs a bi-level quadratic programming framework to generate an overtaking trajectory leveraging the opponent predictions. The first l"},"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":"2503.06075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-08T05:51:17Z","cross_cats_sorted":[],"title_canon_sha256":"b2d996d88d12daf6142e61d6ce1a373f7d6ad789f7ddfff83b205bfa61a302b4","abstract_canon_sha256":"4afa5fb235aa85275f9cdb525ef0eeaf42b9ec88150e715bb441e68dce3ff205"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:45.019305Z","signature_b64":"KcH2nQZsbA4UcdEUMWgKeUsTywbTqQgNLN3A90iyRmgHZHLAYCng8YwRk1v6b0VeUFezBQm7x4fZ3pp8W5CTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea4fa160f473baf9c55d07c750aca5cce63ae4ff831d9921ae24ede65ddb79e","last_reissued_at":"2026-07-05T11:54:45.018883Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:45.018883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FSDP: Fast and Safe Data-Driven Overtaking Trajectory Planning for Head-to-Head Autonomous Racing Competitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Cheng Hu, Haotong Qin, Jihao Huang, Lei Xie, Michele Magno, Nicolas Baumann, Wule Mao, Xuemin Chi, Yonghao Fu, Zhitao Liu","submitted_at":"2025-03-08T05:51:17Z","abstract_excerpt":"Generating overtaking trajectories in autonomous racing is a challenging task, as the trajectory must satisfy the vehicle's dynamics and ensure safety and real-time performance running on resource-constrained hardware. This work proposes the Fast and Safe Data-Driven Planner to address this challenge. Sparse Gaussian predictions are introduced to improve both the computational efficiency and accuracy of opponent predictions. Furthermore, the proposed approach employs a bi-level quadratic programming framework to generate an overtaking trajectory leveraging the opponent predictions. The first l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.06075","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.06075/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":"2503.06075","created_at":"2026-07-05T11:54:45.018941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.06075v2","created_at":"2026-07-05T11:54:45.018941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.06075","created_at":"2026-07-05T11:54:45.018941+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2SPUFQPI452","created_at":"2026-07-05T11:54:45.018941+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2SPUFQPI4527HCV","created_at":"2026-07-05T11:54:45.018941+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2SPUFQP","created_at":"2026-07-05T11:54:45.018941+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT","json":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT.json","graph_json":"https://pith.science/api/pith-number/F2SPUFQPI4527HCV2B6HKCWKLT/graph.json","events_json":"https://pith.science/api/pith-number/F2SPUFQPI4527HCV2B6HKCWKLT/events.json","paper":"https://pith.science/paper/F2SPUFQP"},"agent_actions":{"view_html":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT","download_json":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT.json","view_paper":"https://pith.science/paper/F2SPUFQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.06075&json=true","fetch_graph":"https://pith.science/api/pith-number/F2SPUFQPI4527HCV2B6HKCWKLT/graph.json","fetch_events":"https://pith.science/api/pith-number/F2SPUFQPI4527HCV2B6HKCWKLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT/action/storage_attestation","attest_author":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT/action/author_attestation","sign_citation":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT/action/citation_signature","submit_replication":"https://pith.science/pith/F2SPUFQPI4527HCV2B6HKCWKLT/action/replication_record"}},"created_at":"2026-07-05T11:54:45.018941+00:00","updated_at":"2026-07-05T11:54:45.018941+00:00"}