{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HRWVWF72SQD46V5OS4AOV3HNFJ","short_pith_number":"pith:HRWVWF72","schema_version":"1.0","canonical_sha256":"3c6d5b17fa9407cf57ae9700eaeced2a677c3aa3cb01b420ba4b0cf96a914830","source":{"kind":"arxiv","id":"2408.08668","version":1},"attestation_state":"computed","paper":{"title":"Robust Stochastic Shortest-Path Planning via Risk-Sensitive Incremental Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Brian M. Sadler, Clinton Enwerem, Erfaun Noorani, John S. Baras","submitted_at":"2024-08-16T11:21:52Z","abstract_excerpt":"With the pervasiveness of Stochastic Shortest-Path (SSP) problems in high-risk industries, such as last-mile autonomous delivery and supply chain management, robust planning algorithms are crucial for ensuring successful task completion while mitigating hazardous outcomes. Mainstream chance-constrained incremental sampling techniques for solving SSP problems tend to be overly conservative and typically do not consider the likelihood of undesirable tail events. We propose an alternative risk-aware approach inspired by the asymptotically-optimal Rapidly-Exploring Random Trees (RRT*) planning alg"},"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":"2408.08668","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-16T11:21:52Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"949b3ec3ba6a8f09296c3d0d2b2c55eac8d5374fce08be764d46588c0c66379d","abstract_canon_sha256":"b7cdb7fca5248e1cb88fca203b927eac9e1f7432616b649138e6385e2c74779b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:07.497633Z","signature_b64":"OHbiQrKX8uiV1ZwNplXhnBHUg0VPqJC4e7tZMeG2q8zqA/Ksn6UBQf9BFtpWFbveVNOIbDtlV+2Z6DLVMJmFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c6d5b17fa9407cf57ae9700eaeced2a677c3aa3cb01b420ba4b0cf96a914830","last_reissued_at":"2026-07-05T08:56:07.497185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:07.497185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Stochastic Shortest-Path Planning via Risk-Sensitive Incremental Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"cs.AI","authors_text":"Brian M. Sadler, Clinton Enwerem, Erfaun Noorani, John S. Baras","submitted_at":"2024-08-16T11:21:52Z","abstract_excerpt":"With the pervasiveness of Stochastic Shortest-Path (SSP) problems in high-risk industries, such as last-mile autonomous delivery and supply chain management, robust planning algorithms are crucial for ensuring successful task completion while mitigating hazardous outcomes. Mainstream chance-constrained incremental sampling techniques for solving SSP problems tend to be overly conservative and typically do not consider the likelihood of undesirable tail events. We propose an alternative risk-aware approach inspired by the asymptotically-optimal Rapidly-Exploring Random Trees (RRT*) planning alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08668","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/2408.08668/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":"2408.08668","created_at":"2026-07-05T08:56:07.497241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.08668v1","created_at":"2026-07-05T08:56:07.497241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08668","created_at":"2026-07-05T08:56:07.497241+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRWVWF72SQD4","created_at":"2026-07-05T08:56:07.497241+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRWVWF72SQD46V5O","created_at":"2026-07-05T08:56:07.497241+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRWVWF72","created_at":"2026-07-05T08:56:07.497241+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06727","citing_title":"IDDMBSE: Integrating Data-Driven and Model-Based Systems Engineering for Trusted Autonomous Cyber-Physical Systems","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ","json":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ.json","graph_json":"https://pith.science/api/pith-number/HRWVWF72SQD46V5OS4AOV3HNFJ/graph.json","events_json":"https://pith.science/api/pith-number/HRWVWF72SQD46V5OS4AOV3HNFJ/events.json","paper":"https://pith.science/paper/HRWVWF72"},"agent_actions":{"view_html":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ","download_json":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ.json","view_paper":"https://pith.science/paper/HRWVWF72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.08668&json=true","fetch_graph":"https://pith.science/api/pith-number/HRWVWF72SQD46V5OS4AOV3HNFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HRWVWF72SQD46V5OS4AOV3HNFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/action/storage_attestation","attest_author":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/action/author_attestation","sign_citation":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/action/citation_signature","submit_replication":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/action/replication_record"}},"created_at":"2026-07-05T08:56:07.497241+00:00","updated_at":"2026-07-05T08:56:07.497241+00:00"}