{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:EKJL4LTPM2Y32PETL42LVHMTCS","short_pith_number":"pith:EKJL4LTP","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"},"canonical_sha256":"2292be2e6f66b1bd3c935f34ba9d9314abd9241d25807b5b32f468d8243dda81","source":{"kind":"arxiv","id":"2302.07933","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.07933","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"2302.07933v3","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07933","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"EKJL4LTPM2Y3","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"pith_short_16","alias_value":"EKJL4LTPM2Y32PET","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"pith_short_8","alias_value":"EKJL4LTP","created_at":"2026-07-05T06:21:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:EKJL4LTPM2Y32PETL42LVHMTCS","target":"record","payload":{"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"},"canonical_sha256":"2292be2e6f66b1bd3c935f34ba9d9314abd9241d25807b5b32f468d8243dda81","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"},"source_kind":"arxiv","source_id":"2302.07933","source_version":3,"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-05T06:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsq699YtKnAR1xIVVWMTxk7JEtfur6Udexqy2+ORltJJ8YVB+kHQux0kooE0vjeDSPXQkagU4TLae/P+ttBKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:40:11.044330Z"},"content_sha256":"fd26164760c69b757ae7054a01e92488cb674027a7deeef44a6c68d2789fd074","schema_version":"1.0","event_id":"sha256:fd26164760c69b757ae7054a01e92488cb674027a7deeef44a6c68d2789fd074"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:EKJL4LTPM2Y32PETL42LVHMTCS","target":"graph","payload":{"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"},"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-05T06:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJstwTLdAEKoOgivvbWp4JrqeIwZeMcsL9NFA6Oi6ard0Kqa5VHWKu9Ha1BWdktzNpeZYti+TmseA1OP4pJZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:40:11.045084Z"},"content_sha256":"ffd259082014a98be96039485fa14159058c82924d410ad075c8f96ad4168836","schema_version":"1.0","event_id":"sha256:ffd259082014a98be96039485fa14159058c82924d410ad075c8f96ad4168836"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/bundle.json","state_url":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKJL4LTPM2Y32PETL42LVHMTCS/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-18T16:40:11Z","links":{"resolver":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS","bundle":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/bundle.json","state":"https://pith.science/pith/EKJL4LTPM2Y32PETL42LVHMTCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKJL4LTPM2Y32PETL42LVHMTCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EKJL4LTPM2Y32PETL42LVHMTCS","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":"fd1972d82a8f98338f89d30a71b42aa336400495b6882c22921589d9f8b87750","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-15T20:29:15Z","title_canon_sha256":"a77295fda637de9308c438b67fea6994cfe5995cf40d2b5a90de7c74978ab2c2"},"schema_version":"1.0","source":{"id":"2302.07933","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.07933","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"2302.07933v3","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07933","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"EKJL4LTPM2Y3","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"pith_short_16","alias_value":"EKJL4LTPM2Y32PET","created_at":"2026-07-05T06:21:59Z"},{"alias_kind":"pith_short_8","alias_value":"EKJL4LTP","created_at":"2026-07-05T06:21:59Z"}],"graph_snapshots":[{"event_id":"sha256:ffd259082014a98be96039485fa14159058c82924d410ad075c8f96ad4168836","target":"graph","created_at":"2026-07-05T06:21:59Z","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/2302.07933/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Challen Enninful Adu, Jinsun Liu, Lena Trang, Lucas Lymburner, Ram Vasudevan, Vishrut Kaushik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-15T20:29:15Z","title":"RADIUS: Risk-Aware, Real-Time, Reachability-Based Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07933","kind":"arxiv","version":3},"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:fd26164760c69b757ae7054a01e92488cb674027a7deeef44a6c68d2789fd074","target":"record","created_at":"2026-07-05T06:21:59Z","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":"fd1972d82a8f98338f89d30a71b42aa336400495b6882c22921589d9f8b87750","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-02-15T20:29:15Z","title_canon_sha256":"a77295fda637de9308c438b67fea6994cfe5995cf40d2b5a90de7c74978ab2c2"},"schema_version":"1.0","source":{"id":"2302.07933","kind":"arxiv","version":3}},"canonical_sha256":"2292be2e6f66b1bd3c935f34ba9d9314abd9241d25807b5b32f468d8243dda81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2292be2e6f66b1bd3c935f34ba9d9314abd9241d25807b5b32f468d8243dda81","first_computed_at":"2026-07-05T06:21:59.855469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:21:59.855469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LYSqKeIaqITGcnOkpyxHta2v3XKnApb/oFSPjGrjeypm61vuo3H50HImUggwZ/+BmctNtDSxyB8/7bThSsgLDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:21:59.855894Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.07933","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd26164760c69b757ae7054a01e92488cb674027a7deeef44a6c68d2789fd074","sha256:ffd259082014a98be96039485fa14159058c82924d410ad075c8f96ad4168836"],"state_sha256":"4f912fafc4ad8bb32cbc56c3d5870cbc6ac128156c44b3a0e18bce7495b32b61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JE+IMwCdvT6swaa7S480KYiHmpXHaJjSQcNbOqNnP/zsaOjiZaBlO1UfWQauzg1jBBoQZCFGP4C8hHsU+wusDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:40:11.049911Z","bundle_sha256":"5d37e3373d465af76e929456858ec88f9f23d05c7b58f22c15492cec629104fb"}}