{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OL45MSUCKOFD4KZ2G4TH3BVCVX","short_pith_number":"pith:OL45MSUC","schema_version":"1.0","canonical_sha256":"72f9d64a82538a3e2b3a37267d86a2ade53223a27294266e47b2f46f8cbcfe8d","source":{"kind":"arxiv","id":"2412.08855","version":3},"attestation_state":"computed","paper":{"title":"{\\alpha}-RACER: Real-Time Algorithm for Game-Theoretic Motion Planning and Control in Autonomous Racing using Near-Potential Function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.RO","authors_text":"Chinmay Maheshwari, Dvij Kalaria, Shankar Sastry","submitted_at":"2024-12-12T01:29:01Z","abstract_excerpt":"Autonomous racing extends beyond the challenge of controlling a racecar at its physical limits. Professional racers employ strategic maneuvers to outwit other competing opponents to secure victory. While modern control algorithms can achieve human-level performance by computing offline racing lines for single-car scenarios, research on real-time algorithms for multi-car autonomous racing is limited. To bridge this gap, we develop game-theoretic modeling framework that incorporates the competitive aspect of autonomous racing like overtaking and blocking through a novel policy parametrization, w"},"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":"2412.08855","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-12-12T01:29:01Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"2c6f9bfc40044b982130ff14fb981a93b45cafdc292aad9abdc9b14db2c9f99d","abstract_canon_sha256":"1d2d602266d8630966e48eab1fae77a9bcbcfcf6ea243229e552d577af475a31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:49.965508Z","signature_b64":"tV77U5uk4enMnA7ts14kXS/YJzxK7HRB7VaL0cxQd12KYnvedkJbctVAzwlJuk8L70d2vAGrsqJKuhoeVn53Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72f9d64a82538a3e2b3a37267d86a2ade53223a27294266e47b2f46f8cbcfe8d","last_reissued_at":"2026-07-05T10:53:49.964981Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:49.964981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"{\\alpha}-RACER: Real-Time Algorithm for Game-Theoretic Motion Planning and Control in Autonomous Racing using Near-Potential Function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.RO","authors_text":"Chinmay Maheshwari, Dvij Kalaria, Shankar Sastry","submitted_at":"2024-12-12T01:29:01Z","abstract_excerpt":"Autonomous racing extends beyond the challenge of controlling a racecar at its physical limits. Professional racers employ strategic maneuvers to outwit other competing opponents to secure victory. While modern control algorithms can achieve human-level performance by computing offline racing lines for single-car scenarios, research on real-time algorithms for multi-car autonomous racing is limited. To bridge this gap, we develop game-theoretic modeling framework that incorporates the competitive aspect of autonomous racing like overtaking and blocking through a novel policy parametrization, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08855","kind":"arxiv","version":3},"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/2412.08855/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":"2412.08855","created_at":"2026-07-05T10:53:49.965045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08855v3","created_at":"2026-07-05T10:53:49.965045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08855","created_at":"2026-07-05T10:53:49.965045+00:00"},{"alias_kind":"pith_short_12","alias_value":"OL45MSUCKOFD","created_at":"2026-07-05T10:53:49.965045+00:00"},{"alias_kind":"pith_short_16","alias_value":"OL45MSUCKOFD4KZ2","created_at":"2026-07-05T10:53:49.965045+00:00"},{"alias_kind":"pith_short_8","alias_value":"OL45MSUC","created_at":"2026-07-05T10:53:49.965045+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.01929","citing_title":"Distributed games with jumps: An $\\alpha$-potential game approach","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX","json":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX.json","graph_json":"https://pith.science/api/pith-number/OL45MSUCKOFD4KZ2G4TH3BVCVX/graph.json","events_json":"https://pith.science/api/pith-number/OL45MSUCKOFD4KZ2G4TH3BVCVX/events.json","paper":"https://pith.science/paper/OL45MSUC"},"agent_actions":{"view_html":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX","download_json":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX.json","view_paper":"https://pith.science/paper/OL45MSUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08855&json=true","fetch_graph":"https://pith.science/api/pith-number/OL45MSUCKOFD4KZ2G4TH3BVCVX/graph.json","fetch_events":"https://pith.science/api/pith-number/OL45MSUCKOFD4KZ2G4TH3BVCVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX/action/storage_attestation","attest_author":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX/action/author_attestation","sign_citation":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX/action/citation_signature","submit_replication":"https://pith.science/pith/OL45MSUCKOFD4KZ2G4TH3BVCVX/action/replication_record"}},"created_at":"2026-07-05T10:53:49.965045+00:00","updated_at":"2026-07-05T10:53:49.965045+00:00"}