{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EKJL4LTPM2Y32PETL42LVHMTCS","short_pith_number":"pith:EKJL4LTP","schema_version":"1.0","canonical_sha256":"2292be2e6f66b1bd3c935f34ba9d9314abd9241d25807b5b32f468d8243dda81","source":{"kind":"arxiv","id":"2302.07933","version":3},"attestation_state":"computed","paper":{"title":"RADIUS: Risk-Aware, Real-Time, Reachability-Based Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Challen Enninful Adu, Jinsun Liu, Lena Trang, Lucas Lymburner, Ram Vasudevan, Vishrut Kaushik","submitted_at":"2023-02-15T20:29:15Z","abstract_excerpt":"Deterministic methods for motion planning guarantee safety amidst uncertainty in obstacle locations by trying to restrict the robot from operating in any possible location that an obstacle could be in. Unfortunately, this can result in overly conservative behavior. Chance-constrained optimization can be applied to improve the performance of motion planning algorithms by allowing for a user-specified amount of bounded constraint violation. However, state-of-the-art methods rely either on moment-based inequalities, which can be overly conservative, or make it difficult to satisfy assumptions abo"},"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":"2302.07933","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-15T20:29:15Z","cross_cats_sorted":[],"title_canon_sha256":"a77295fda637de9308c438b67fea6994cfe5995cf40d2b5a90de7c74978ab2c2","abstract_canon_sha256":"fd1972d82a8f98338f89d30a71b42aa336400495b6882c22921589d9f8b87750"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:21:59.855894Z","signature_b64":"LYSqKeIaqITGcnOkpyxHta2v3XKnApb/oFSPjGrjeypm61vuo3H50HImUggwZ/+BmctNtDSxyB8/7bThSsgLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2292be2e6f66b1bd3c935f34ba9d9314abd9241d25807b5b32f468d8243dda81","last_reissued_at":"2026-07-05T06:21:59.855469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:21:59.855469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RADIUS: Risk-Aware, Real-Time, Reachability-Based Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Challen Enninful Adu, Jinsun Liu, Lena Trang, Lucas Lymburner, Ram Vasudevan, Vishrut Kaushik","submitted_at":"2023-02-15T20:29:15Z","abstract_excerpt":"Deterministic methods for motion planning guarantee safety amidst uncertainty in obstacle locations by trying to restrict the robot from operating in any possible location that an obstacle could be in. Unfortunately, this can result in overly conservative behavior. Chance-constrained optimization can be applied to improve the performance of motion planning algorithms by allowing for a user-specified amount of bounded constraint violation. However, state-of-the-art methods rely either on moment-based inequalities, which can be overly conservative, or make it difficult to satisfy assumptions abo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07933","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/2302.07933/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":"2302.07933","created_at":"2026-07-05T06:21:59.855526+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.07933v3","created_at":"2026-07-05T06:21:59.855526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07933","created_at":"2026-07-05T06:21:59.855526+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKJL4LTPM2Y3","created_at":"2026-07-05T06:21:59.855526+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKJL4LTPM2Y32PET","created_at":"2026-07-05T06:21:59.855526+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKJL4LTP","created_at":"2026-07-05T06:21:59.855526+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/EKJL4LTPM2Y32PETL42LVHMTCS","json":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS.json","graph_json":"https://pith.science/api/pith-number/EKJL4LTPM2Y32PETL42LVHMTCS/graph.json","events_json":"https://pith.science/api/pith-number/EKJL4LTPM2Y32PETL42LVHMTCS/events.json","paper":"https://pith.science/paper/EKJL4LTP"},"agent_actions":{"view_html":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS","download_json":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS.json","view_paper":"https://pith.science/paper/EKJL4LTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.07933&json=true","fetch_graph":"https://pith.science/api/pith-number/EKJL4LTPM2Y32PETL42LVHMTCS/graph.json","fetch_events":"https://pith.science/api/pith-number/EKJL4LTPM2Y32PETL42LVHMTCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/action/storage_attestation","attest_author":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/action/author_attestation","sign_citation":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/action/citation_signature","submit_replication":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/action/replication_record"}},"created_at":"2026-07-05T06:21:59.855526+00:00","updated_at":"2026-07-05T06:21:59.855526+00:00"}