{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CQY74NPTBSEXFOOWCP7MWTUKIN","short_pith_number":"pith:CQY74NPT","schema_version":"1.0","canonical_sha256":"1431fe35f30c8972b9d613fecb4e8a434dc0cb6dadbf5be0dd3d5e56243141f2","source":{"kind":"arxiv","id":"1905.12197","version":1},"attestation_state":"computed","paper":{"title":"LeTS-Drive: Driving in a Crowd by Learning from Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Aseem Saxena, David Hsu, Panpan Cai, Wee Sun Lee, Yuanfu Luo","submitted_at":"2019-05-29T03:27:01Z","abstract_excerpt":"Autonomous driving in a crowded environment, e.g., a busy traffic intersection, is an unsolved challenge for robotics. The robot vehicle must contend with a dynamic and partially observable environment, noisy sensors, and many agents. A principled approach is to formalize it as a Partially Observable Markov Decision Process (POMDP) and solve it through online belief-tree search. To handle a large crowd and achieve real-time performance in this very challenging setting, we propose LeTS-Drive, which integrates online POMDP planning and deep learning. It consists of two phases. In the offline pha"},"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":"1905.12197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-29T03:27:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"655567b4cc7b598251eb9c71d12f4dbd55eb6ab108376643656d9a4d8e541b6d","abstract_canon_sha256":"85aa6e098cacd8cc4a41e602b5300f7b4959e3ecb3d987e3508db86c933eee07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:46.839433Z","signature_b64":"R/4FeXbLefexODqoPKwfa8WweY5osCOCtcLIdR5GyWV6Wl8dHxS9mxO06UcH8WJ4xHOlcCZRihWGbEZc26n0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1431fe35f30c8972b9d613fecb4e8a434dc0cb6dadbf5be0dd3d5e56243141f2","last_reissued_at":"2026-05-17T23:44:46.838919Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:46.838919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LeTS-Drive: Driving in a Crowd by Learning from Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Aseem Saxena, David Hsu, Panpan Cai, Wee Sun Lee, Yuanfu Luo","submitted_at":"2019-05-29T03:27:01Z","abstract_excerpt":"Autonomous driving in a crowded environment, e.g., a busy traffic intersection, is an unsolved challenge for robotics. The robot vehicle must contend with a dynamic and partially observable environment, noisy sensors, and many agents. A principled approach is to formalize it as a Partially Observable Markov Decision Process (POMDP) and solve it through online belief-tree search. To handle a large crowd and achieve real-time performance in this very challenging setting, we propose LeTS-Drive, which integrates online POMDP planning and deep learning. It consists of two phases. In the offline pha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12197","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":""},"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":"1905.12197","created_at":"2026-05-17T23:44:46.838988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12197v1","created_at":"2026-05-17T23:44:46.838988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12197","created_at":"2026-05-17T23:44:46.838988+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQY74NPTBSEX","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQY74NPTBSEXFOOW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQY74NPT","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04732","citing_title":"Using Common Random Numbers for Simulation-based Planning with Rollouts","ref_index":100,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN","json":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN.json","graph_json":"https://pith.science/api/pith-number/CQY74NPTBSEXFOOWCP7MWTUKIN/graph.json","events_json":"https://pith.science/api/pith-number/CQY74NPTBSEXFOOWCP7MWTUKIN/events.json","paper":"https://pith.science/paper/CQY74NPT"},"agent_actions":{"view_html":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN","download_json":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN.json","view_paper":"https://pith.science/paper/CQY74NPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12197&json=true","fetch_graph":"https://pith.science/api/pith-number/CQY74NPTBSEXFOOWCP7MWTUKIN/graph.json","fetch_events":"https://pith.science/api/pith-number/CQY74NPTBSEXFOOWCP7MWTUKIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN/action/storage_attestation","attest_author":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN/action/author_attestation","sign_citation":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN/action/citation_signature","submit_replication":"https://pith.science/pith/CQY74NPTBSEXFOOWCP7MWTUKIN/action/replication_record"}},"created_at":"2026-05-17T23:44:46.838988+00:00","updated_at":"2026-05-17T23:44:46.838988+00:00"}