{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:COY2QUJSPHV4P6FYDEFNBP25AQ","short_pith_number":"pith:COY2QUJS","schema_version":"1.0","canonical_sha256":"13b1a8513279ebc7f8b8190ad0bf5d041a85c157029bca74e94b8eaedf66ac26","source":{"kind":"arxiv","id":"2307.01070","version":1},"attestation_state":"computed","paper":{"title":"Scenario-Based Motion Planning with Bounded Probability of Collision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dariu Gavrila, Javier Alonso-Mora, Laura Ferranti, Oscar de Groot","submitted_at":"2023-07-03T14:53:41Z","abstract_excerpt":"Robots will increasingly operate near humans that introduce uncertainties in the motion planning problem due to their complex nature. Typically, chance constraints are introduced in the planner to optimize performance while guaranteeing probabilistic safety. However, existing methods do not consider the actual probability of collision for the planned trajectory, but rather its marginalization, that is, the independent collision probabilities for each planning step and/or dynamic obstacle, resulting in conservative trajectories. To address this issue, we introduce a novel real-time capable meth"},"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":"2307.01070","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-07-03T14:53:41Z","cross_cats_sorted":[],"title_canon_sha256":"6a602ffc32953d331dce53d11b1bce213c20770bb474ad4858f7277c612aa738","abstract_canon_sha256":"7223720adce65cbf2e0541d657a9c1ea5da4ec186721ccf2bfb10d23e06ab507"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:03.832385Z","signature_b64":"oggPyGhi419MHBV0Je4EANwLSnLHWC2yIEqjbBR45ANa9Vn3bZp73acRVCkWxJoyA26UZbghel1yXYgGglhvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b1a8513279ebc7f8b8190ad0bf5d041a85c157029bca74e94b8eaedf66ac26","last_reissued_at":"2026-07-05T06:27:03.831918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:03.831918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scenario-Based Motion Planning with Bounded Probability of Collision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dariu Gavrila, Javier Alonso-Mora, Laura Ferranti, Oscar de Groot","submitted_at":"2023-07-03T14:53:41Z","abstract_excerpt":"Robots will increasingly operate near humans that introduce uncertainties in the motion planning problem due to their complex nature. Typically, chance constraints are introduced in the planner to optimize performance while guaranteeing probabilistic safety. However, existing methods do not consider the actual probability of collision for the planned trajectory, but rather its marginalization, that is, the independent collision probabilities for each planning step and/or dynamic obstacle, resulting in conservative trajectories. To address this issue, we introduce a novel real-time capable meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01070","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/2307.01070/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":"2307.01070","created_at":"2026-07-05T06:27:03.831974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01070v1","created_at":"2026-07-05T06:27:03.831974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01070","created_at":"2026-07-05T06:27:03.831974+00:00"},{"alias_kind":"pith_short_12","alias_value":"COY2QUJSPHV4","created_at":"2026-07-05T06:27:03.831974+00:00"},{"alias_kind":"pith_short_16","alias_value":"COY2QUJSPHV4P6FY","created_at":"2026-07-05T06:27:03.831974+00:00"},{"alias_kind":"pith_short_8","alias_value":"COY2QUJS","created_at":"2026-07-05T06:27:03.831974+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.01370","citing_title":"CC-VPSTO: Chance-Constrained Via-Point-Based Stochastic Trajectory Optimisation for Online Robot Motion Planning under Uncertainty","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ","json":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ.json","graph_json":"https://pith.science/api/pith-number/COY2QUJSPHV4P6FYDEFNBP25AQ/graph.json","events_json":"https://pith.science/api/pith-number/COY2QUJSPHV4P6FYDEFNBP25AQ/events.json","paper":"https://pith.science/paper/COY2QUJS"},"agent_actions":{"view_html":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ","download_json":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ.json","view_paper":"https://pith.science/paper/COY2QUJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01070&json=true","fetch_graph":"https://pith.science/api/pith-number/COY2QUJSPHV4P6FYDEFNBP25AQ/graph.json","fetch_events":"https://pith.science/api/pith-number/COY2QUJSPHV4P6FYDEFNBP25AQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ/action/storage_attestation","attest_author":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ/action/author_attestation","sign_citation":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ/action/citation_signature","submit_replication":"https://pith.science/pith/COY2QUJSPHV4P6FYDEFNBP25AQ/action/replication_record"}},"created_at":"2026-07-05T06:27:03.831974+00:00","updated_at":"2026-07-05T06:27:03.831974+00:00"}