{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FOEICHWPESFS3LAONMVWUEZG4F","short_pith_number":"pith:FOEICHWP","schema_version":"1.0","canonical_sha256":"2b88811ecf248b2dac0e6b2b6a1326e162cbce749b3c64c0ec4bd7a263a8ff18","source":{"kind":"arxiv","id":"2506.06664","version":1},"attestation_state":"computed","paper":{"title":"Generalized Trajectory Scoring for End-to-end Multimodal Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Jose M. Alvarez, Joshua Chen, Maying Shen, Nadine Chang, Shiyi Lan, Wenhao Yao, Xinglong Sun, Zhenxin Li, Zi Wang, Zuxuan Wu","submitted_at":"2025-06-07T05:06:05Z","abstract_excerpt":"End-to-end multi-modal planning is a promising paradigm in autonomous driving, enabling decision-making with diverse trajectory candidates. A key component is a robust trajectory scorer capable of selecting the optimal trajectory from these candidates. While recent trajectory scorers focus on scoring either large sets of static trajectories or small sets of dynamically generated ones, both approaches face significant limitations in generalization. Static vocabularies provide effective coarse discretization but struggle to make fine-grained adaptation, while dynamic proposals offer detailed pre"},"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":"2506.06664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-07T05:06:05Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"d7be17e478880595eb3d6d9efc5d03e78f1e8fa389ed098cd02576875788ca66","abstract_canon_sha256":"70b4128be402dfcd086fa6299da1c189abd9d7a0dfc7a097807d37dd31f2f966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:53.663322Z","signature_b64":"1x0Tobezdk7sdjMCOMNNmWpPhXXmu8SqiIGu5JxG5DpUkfb4fW0eBy2PFK8c2iXAHRc0TnKpgm2Rw6mj7OAmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b88811ecf248b2dac0e6b2b6a1326e162cbce749b3c64c0ec4bd7a263a8ff18","last_reissued_at":"2026-07-05T11:17:53.662795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:53.662795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Trajectory Scoring for End-to-end Multimodal Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Jose M. Alvarez, Joshua Chen, Maying Shen, Nadine Chang, Shiyi Lan, Wenhao Yao, Xinglong Sun, Zhenxin Li, Zi Wang, Zuxuan Wu","submitted_at":"2025-06-07T05:06:05Z","abstract_excerpt":"End-to-end multi-modal planning is a promising paradigm in autonomous driving, enabling decision-making with diverse trajectory candidates. A key component is a robust trajectory scorer capable of selecting the optimal trajectory from these candidates. While recent trajectory scorers focus on scoring either large sets of static trajectories or small sets of dynamically generated ones, both approaches face significant limitations in generalization. Static vocabularies provide effective coarse discretization but struggle to make fine-grained adaptation, while dynamic proposals offer detailed pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06664","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/2506.06664/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":"2506.06664","created_at":"2026-07-05T11:17:53.662866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.06664v1","created_at":"2026-07-05T11:17:53.662866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06664","created_at":"2026-07-05T11:17:53.662866+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOEICHWPESFS","created_at":"2026-07-05T11:17:53.662866+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOEICHWPESFS3LAO","created_at":"2026-07-05T11:17:53.662866+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOEICHWP","created_at":"2026-07-05T11:17:53.662866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":15,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24231","citing_title":"FlowR2A: Learning Reward-to-Action Distribution for Multimodal Driving Planning","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2606.17362","citing_title":"DriveJudge: Rethinking Autonomous Driving Evaluation with Vision-Language Models","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08525","citing_title":"DriveReward: A Comprehensive Dataset and Generative Vision-Language Reward Model for Autonomous Driving","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07170","citing_title":"Test-Time Trajectory Optimization for Autonomous Driving","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06219","citing_title":"CLEAR: Cognition and Latent Evaluation for Adaptive Routing in End-to-End Autonomous Driving","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31476","citing_title":"IDOL: Inverse-Dynamics-Guided Future Prediction for End-to-End Autonomous Driving","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30807","citing_title":"Off the Rails: Hijacking the Scoring Head in Generative End-to-End Driving Planners with Safety-Violating Adversarial Perturbations","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31830","citing_title":"PriorEye: Geospatial Visual Priors for End-to-End Autonomous Driving","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15120","citing_title":"CLOVER: Closed-Loop Value Estimation and Ranking for End-to-End Autonomous Driving Planning","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2507.17596","citing_title":"PRIX: Learning to Plan from Raw Pixels for End-to-End Autonomous Driving","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2511.23369","citing_title":"SimScale: Learning to Drive via Real-World Simulation at Scale","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09701","citing_title":"DriveFuture: Future-Aware Latent World Models for Autonomous Driving","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04470","citing_title":"CRAFT: Counterfactual-to-Interactive Reinforcement Fine-Tuning for Driving Policies","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15308","citing_title":"RAD-2: Scaling Reinforcement Learning in a Generator-Discriminator Framework","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17841","citing_title":"Driving risk emerges from the required two-dimensional joint evasive acceleration","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F","json":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F.json","graph_json":"https://pith.science/api/pith-number/FOEICHWPESFS3LAONMVWUEZG4F/graph.json","events_json":"https://pith.science/api/pith-number/FOEICHWPESFS3LAONMVWUEZG4F/events.json","paper":"https://pith.science/paper/FOEICHWP"},"agent_actions":{"view_html":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F","download_json":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F.json","view_paper":"https://pith.science/paper/FOEICHWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.06664&json=true","fetch_graph":"https://pith.science/api/pith-number/FOEICHWPESFS3LAONMVWUEZG4F/graph.json","fetch_events":"https://pith.science/api/pith-number/FOEICHWPESFS3LAONMVWUEZG4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F/action/storage_attestation","attest_author":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F/action/author_attestation","sign_citation":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F/action/citation_signature","submit_replication":"https://pith.science/pith/FOEICHWPESFS3LAONMVWUEZG4F/action/replication_record"}},"created_at":"2026-07-05T11:17:53.662866+00:00","updated_at":"2026-07-05T11:17:53.662866+00:00"}