{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HRWVWF72SQD46V5OS4AOV3HNFJ","short_pith_number":"pith:HRWVWF72","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"},"canonical_sha256":"3c6d5b17fa9407cf57ae9700eaeced2a677c3aa3cb01b420ba4b0cf96a914830","source":{"kind":"arxiv","id":"2408.08668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08668","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08668v1","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08668","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"pith_short_12","alias_value":"HRWVWF72SQD4","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"pith_short_16","alias_value":"HRWVWF72SQD46V5O","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"pith_short_8","alias_value":"HRWVWF72","created_at":"2026-07-05T08:56:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HRWVWF72SQD46V5OS4AOV3HNFJ","target":"record","payload":{"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"},"canonical_sha256":"3c6d5b17fa9407cf57ae9700eaeced2a677c3aa3cb01b420ba4b0cf96a914830","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"},"source_kind":"arxiv","source_id":"2408.08668","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:56:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sNyNa0vtPmdj81tc8Y2jwE+/2fcVuXyY+CjA/htNCOPaz4eR/SyUjzTd7UJiQhqViez5VxpfCJ0HG0QbDkIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:15:29.521454Z"},"content_sha256":"7543212127920b4463d50b288cec45af5b2adaa3b162394e47b9b4d12f567633","schema_version":"1.0","event_id":"sha256:7543212127920b4463d50b288cec45af5b2adaa3b162394e47b9b4d12f567633"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HRWVWF72SQD46V5OS4AOV3HNFJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:56:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzQCzbh+LLTFOA47pSTZwmvlGrBFda782sbCcvbDSSBoHryUPAMtlPb0fr1EPWWsoKBvY62SluB1ZoK+e1f7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:15:29.521978Z"},"content_sha256":"b63c2f51b77e80b2ddf81cc9cf79bd697d62da7b2de80edfe8401b3bcb19b1a6","schema_version":"1.0","event_id":"sha256:b63c2f51b77e80b2ddf81cc9cf79bd697d62da7b2de80edfe8401b3bcb19b1a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/bundle.json","state_url":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T08:15:29Z","links":{"resolver":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ","bundle":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/bundle.json","state":"https://pith.science/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRWVWF72SQD46V5OS4AOV3HNFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HRWVWF72SQD46V5OS4AOV3HNFJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b7cdb7fca5248e1cb88fca203b927eac9e1f7432616b649138e6385e2c74779b","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-16T11:21:52Z","title_canon_sha256":"949b3ec3ba6a8f09296c3d0d2b2c55eac8d5374fce08be764d46588c0c66379d"},"schema_version":"1.0","source":{"id":"2408.08668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08668","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08668v1","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08668","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"pith_short_12","alias_value":"HRWVWF72SQD4","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"pith_short_16","alias_value":"HRWVWF72SQD46V5O","created_at":"2026-07-05T08:56:07Z"},{"alias_kind":"pith_short_8","alias_value":"HRWVWF72","created_at":"2026-07-05T08:56:07Z"}],"graph_snapshots":[{"event_id":"sha256:b63c2f51b77e80b2ddf81cc9cf79bd697d62da7b2de80edfe8401b3bcb19b1a6","target":"graph","created_at":"2026-07-05T08:56:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.08668/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Brian M. Sadler, Clinton Enwerem, Erfaun Noorani, John S. Baras","cross_cats":["cs.RO","cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-16T11:21:52Z","title":"Robust Stochastic Shortest-Path Planning via Risk-Sensitive Incremental Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08668","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7543212127920b4463d50b288cec45af5b2adaa3b162394e47b9b4d12f567633","target":"record","created_at":"2026-07-05T08:56:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b7cdb7fca5248e1cb88fca203b927eac9e1f7432616b649138e6385e2c74779b","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-16T11:21:52Z","title_canon_sha256":"949b3ec3ba6a8f09296c3d0d2b2c55eac8d5374fce08be764d46588c0c66379d"},"schema_version":"1.0","source":{"id":"2408.08668","kind":"arxiv","version":1}},"canonical_sha256":"3c6d5b17fa9407cf57ae9700eaeced2a677c3aa3cb01b420ba4b0cf96a914830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c6d5b17fa9407cf57ae9700eaeced2a677c3aa3cb01b420ba4b0cf96a914830","first_computed_at":"2026-07-05T08:56:07.497185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:56:07.497185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OHbiQrKX8uiV1ZwNplXhnBHUg0VPqJC4e7tZMeG2q8zqA/Ksn6UBQf9BFtpWFbveVNOIbDtlV+2Z6DLVMJmFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:56:07.497633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.08668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7543212127920b4463d50b288cec45af5b2adaa3b162394e47b9b4d12f567633","sha256:b63c2f51b77e80b2ddf81cc9cf79bd697d62da7b2de80edfe8401b3bcb19b1a6"],"state_sha256":"ad023f1dc1c67db62d5b8318887ca2e49d0691321cf920f8fbc1f96a86055155"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nfLEfIFOI8Y/ZLfbblp8uw38QE6SAzWUkYTvXGfNoHzPZOI8JWNfd8OKFhPmtEJVOCLw/I3rEV5qORUgi29AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:15:29.527356Z","bundle_sha256":"48bb518abc76d96ffda0698dc71a83455b8711df1c36948aa7f56881cdd62923"}}