{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CORZZKMJCXCTFLWED7SC57NLMW","short_pith_number":"pith:CORZZKMJ","canonical_record":{"source":{"id":"1809.07051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-19T08:17:10Z","cross_cats_sorted":[],"title_canon_sha256":"9818785a90b7b1c7db4e0483ec11988297ab49731aedd239e6793234c82b6a73","abstract_canon_sha256":"f1af16b21d1b812865bd244163c6ee7218b435f0adf8a192538fb4f978c14047"},"schema_version":"1.0"},"canonical_sha256":"13a39ca98915c532aec41fe42efdab65b452aa00e0328a006437208287900b5f","source":{"kind":"arxiv","id":"1809.07051","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07051","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07051v2","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07051","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"pith_short_12","alias_value":"CORZZKMJCXCT","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"pith_short_16","alias_value":"CORZZKMJCXCTFLWE","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"pith_short_8","alias_value":"CORZZKMJ","created_at":"2026-07-05T04:27:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CORZZKMJCXCTFLWED7SC57NLMW","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-19T08:17:10Z","cross_cats_sorted":[],"title_canon_sha256":"9818785a90b7b1c7db4e0483ec11988297ab49731aedd239e6793234c82b6a73","abstract_canon_sha256":"f1af16b21d1b812865bd244163c6ee7218b435f0adf8a192538fb4f978c14047"},"schema_version":"1.0"},"canonical_sha256":"13a39ca98915c532aec41fe42efdab65b452aa00e0328a006437208287900b5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:26.696459Z","signature_b64":"qvnF0yYOSlSwMWiLsiDovHuGRjFDhhOm6nJd5YlFJWJdCZlHwbxMBkX6MQhXPyN3xUPAPIUf4T/4v58OV0zKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13a39ca98915c532aec41fe42efdab65b452aa00e0328a006437208287900b5f","last_reissued_at":"2026-07-05T04:27:26.696008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:26.696008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07051","source_version":2,"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-05T04:27:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6zVGvCE5nDimUmuEKKcIy3XSXW09qyMoilHCRB621CmzjaAjstxIe/bkjLrnRReG8qHzIiZ3CVrFlttbSoPUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:37:30.234183Z"},"content_sha256":"b532f83ae067d6d980a39fe6a4c5167cd305dd77e53bd2ad2f3e769d978c0b66","schema_version":"1.0","event_id":"sha256:b532f83ae067d6d980a39fe6a4c5167cd305dd77e53bd2ad2f3e769d978c0b66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CORZZKMJCXCTFLWED7SC57NLMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Kiril Solovey, Kostas E. Bekris, Michal Kleinbort, Zakary Littlefield","submitted_at":"2018-09-19T08:17:10Z","abstract_excerpt":"The Rapidly-exploring Random Tree (RRT) algorithm has been one of the most prevalent and popular motion-planning techniques for two decades now. Surprisingly, in spite of its centrality, there has been an active debate under which conditions RRT is probabilistically complete. We provide two new proofs of probabilistic completeness (PC) of RRT with a reduced set of assumptions. The first one for the purely geometric setting, where we only require that the solution path has a certain clearance from the obstacles. For the kinodynamic case with forward propagation of random controls and duration, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07051","kind":"arxiv","version":2},"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/1809.07051/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-05T04:27:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkojoGpo+MwKscUqF/wLHvO46tOLTaexNUHsdJb4zdj+aVN2MExUIl3MnwF2AP7tgd5/NkBEC3qqFRdh3DR6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:37:30.235041Z"},"content_sha256":"ff1f53093220136da19ff93b9af997b2ea498e31e83eeffeba4c22144280e36d","schema_version":"1.0","event_id":"sha256:ff1f53093220136da19ff93b9af997b2ea498e31e83eeffeba4c22144280e36d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CORZZKMJCXCTFLWED7SC57NLMW/bundle.json","state_url":"https://pith.science/pith/CORZZKMJCXCTFLWED7SC57NLMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CORZZKMJCXCTFLWED7SC57NLMW/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-04T12:37:30Z","links":{"resolver":"https://pith.science/pith/CORZZKMJCXCTFLWED7SC57NLMW","bundle":"https://pith.science/pith/CORZZKMJCXCTFLWED7SC57NLMW/bundle.json","state":"https://pith.science/pith/CORZZKMJCXCTFLWED7SC57NLMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CORZZKMJCXCTFLWED7SC57NLMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CORZZKMJCXCTFLWED7SC57NLMW","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":"f1af16b21d1b812865bd244163c6ee7218b435f0adf8a192538fb4f978c14047","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-19T08:17:10Z","title_canon_sha256":"9818785a90b7b1c7db4e0483ec11988297ab49731aedd239e6793234c82b6a73"},"schema_version":"1.0","source":{"id":"1809.07051","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07051","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07051v2","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07051","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"pith_short_12","alias_value":"CORZZKMJCXCT","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"pith_short_16","alias_value":"CORZZKMJCXCTFLWE","created_at":"2026-07-05T04:27:26Z"},{"alias_kind":"pith_short_8","alias_value":"CORZZKMJ","created_at":"2026-07-05T04:27:26Z"}],"graph_snapshots":[{"event_id":"sha256:ff1f53093220136da19ff93b9af997b2ea498e31e83eeffeba4c22144280e36d","target":"graph","created_at":"2026-07-05T04:27:26Z","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/1809.07051/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Rapidly-exploring Random Tree (RRT) algorithm has been one of the most prevalent and popular motion-planning techniques for two decades now. Surprisingly, in spite of its centrality, there has been an active debate under which conditions RRT is probabilistically complete. We provide two new proofs of probabilistic completeness (PC) of RRT with a reduced set of assumptions. The first one for the purely geometric setting, where we only require that the solution path has a certain clearance from the obstacles. For the kinodynamic case with forward propagation of random controls and duration, ","authors_text":"Dan Halperin, Kiril Solovey, Kostas E. Bekris, Michal Kleinbort, Zakary Littlefield","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-19T08:17:10Z","title":"Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07051","kind":"arxiv","version":2},"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:b532f83ae067d6d980a39fe6a4c5167cd305dd77e53bd2ad2f3e769d978c0b66","target":"record","created_at":"2026-07-05T04:27:26Z","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":"f1af16b21d1b812865bd244163c6ee7218b435f0adf8a192538fb4f978c14047","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-19T08:17:10Z","title_canon_sha256":"9818785a90b7b1c7db4e0483ec11988297ab49731aedd239e6793234c82b6a73"},"schema_version":"1.0","source":{"id":"1809.07051","kind":"arxiv","version":2}},"canonical_sha256":"13a39ca98915c532aec41fe42efdab65b452aa00e0328a006437208287900b5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13a39ca98915c532aec41fe42efdab65b452aa00e0328a006437208287900b5f","first_computed_at":"2026-07-05T04:27:26.696008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:26.696008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qvnF0yYOSlSwMWiLsiDovHuGRjFDhhOm6nJd5YlFJWJdCZlHwbxMBkX6MQhXPyN3xUPAPIUf4T/4v58OV0zKBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:26.696459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07051","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b532f83ae067d6d980a39fe6a4c5167cd305dd77e53bd2ad2f3e769d978c0b66","sha256:ff1f53093220136da19ff93b9af997b2ea498e31e83eeffeba4c22144280e36d"],"state_sha256":"ad6cf287f2cb3f72f739bb7e9655c75fd88cdaccd572af6b45ac7de569505707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/sliBQAgtnAZnK/zTBGo86YILoRFHCAAFb0Qu+ROUegfhwuMUAjXdJHTNWSVs1/mvhAtgMMJhhsfPNsiK53AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:37:30.241085Z","bundle_sha256":"8ff27a6e3f44daf440daaee0afc62efa941627742c693c825af79b5ead005307"}}