{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DTM2FOKVBVRHQB7KC3POHDA3Z4","short_pith_number":"pith:DTM2FOKV","canonical_record":{"source":{"id":"2411.00357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-11-01T04:46:11Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"bc5df9493369c8920a82256cab20caa51207b65ea83cb6d07fba669a0503910b","abstract_canon_sha256":"97a96bdc6881a79e95e87ee500e7ebcfac0d8bce6d36315e5363221d3e85d389"},"schema_version":"1.0"},"canonical_sha256":"1cd9a2b9550d627807ea16dee38c1bcf1f8729ef2bf04d6bf4cb09b54be17dc3","source":{"kind":"arxiv","id":"2411.00357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.00357","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"arxiv_version","alias_value":"2411.00357v1","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00357","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"pith_short_12","alias_value":"DTM2FOKVBVRH","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"pith_short_16","alias_value":"DTM2FOKVBVRHQB7K","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"pith_short_8","alias_value":"DTM2FOKV","created_at":"2026-07-05T09:29:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DTM2FOKVBVRHQB7KC3POHDA3Z4","target":"record","payload":{"canonical_record":{"source":{"id":"2411.00357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-11-01T04:46:11Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"bc5df9493369c8920a82256cab20caa51207b65ea83cb6d07fba669a0503910b","abstract_canon_sha256":"97a96bdc6881a79e95e87ee500e7ebcfac0d8bce6d36315e5363221d3e85d389"},"schema_version":"1.0"},"canonical_sha256":"1cd9a2b9550d627807ea16dee38c1bcf1f8729ef2bf04d6bf4cb09b54be17dc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:41.327493Z","signature_b64":"Z8wOai0Nw1tIQ7BWpbSviO9biOt7rdFAiCaOpHQRaf4RjSgfUth8ukON/tZMKbDnLdwCm3ZKMIEwXdcPrFohDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd9a2b9550d627807ea16dee38c1bcf1f8729ef2bf04d6bf4cb09b54be17dc3","last_reissued_at":"2026-07-05T09:29:41.327125Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:41.327125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.00357","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-05T09:29:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVqkJwEU18kgwGI0zoI93f4RmKCQULH4UiYzopJwr0qw9XXc0TDPKmGWGO/XOGe9k9kUFmVCk2ts8gtfSflgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:11:32.023979Z"},"content_sha256":"e2abd225d451efa3a911be0b60b20c8bc250ed99ab6a27f0206031c0e3664d60","schema_version":"1.0","event_id":"sha256:e2abd225d451efa3a911be0b60b20c8bc250ed99ab6a27f0206031c0e3664d60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DTM2FOKVBVRHQB7KC3POHDA3Z4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Rapidly Exploring Random Tree Algorithm for Path Planning in Configuration Spaces with Narrow Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Akshay Chawla, Mathew Mithra Noel","submitted_at":"2024-11-01T04:46:11Z","abstract_excerpt":"Rapidly-exploring Random Tree (RRT) algorithms have been applied successfully to challenging robot motion planning and under-actuated nonlinear control problems. However a fundamental limitation of the RRT approach is the slow convergence in configuration spaces with narrow channels because of the small probability of generating test points inside narrow channels. This paper presents an improved RRT algorithm that takes advantage of narrow channels between the initial and goal states to find shorter paths by improving the exploration of narrow regions in the configuration space. The proposed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00357","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/2411.00357/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-05T09:29:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Luil0BlH6QR5/ueb8i2wGSphFBcbQ+yqs9PgyIHVUdnfcaCZdi8P+HSWMhkDxWXYEIkV0qx1cWpv1tFk8QM3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:11:32.024366Z"},"content_sha256":"de8c401cef855e8e4ea1228292256eb34b0f62bee55e6e9c590a98d4e8de1965","schema_version":"1.0","event_id":"sha256:de8c401cef855e8e4ea1228292256eb34b0f62bee55e6e9c590a98d4e8de1965"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTM2FOKVBVRHQB7KC3POHDA3Z4/bundle.json","state_url":"https://pith.science/pith/DTM2FOKVBVRHQB7KC3POHDA3Z4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTM2FOKVBVRHQB7KC3POHDA3Z4/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-07-09T03:11:32Z","links":{"resolver":"https://pith.science/pith/DTM2FOKVBVRHQB7KC3POHDA3Z4","bundle":"https://pith.science/pith/DTM2FOKVBVRHQB7KC3POHDA3Z4/bundle.json","state":"https://pith.science/pith/DTM2FOKVBVRHQB7KC3POHDA3Z4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTM2FOKVBVRHQB7KC3POHDA3Z4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DTM2FOKVBVRHQB7KC3POHDA3Z4","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":"97a96bdc6881a79e95e87ee500e7ebcfac0d8bce6d36315e5363221d3e85d389","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-11-01T04:46:11Z","title_canon_sha256":"bc5df9493369c8920a82256cab20caa51207b65ea83cb6d07fba669a0503910b"},"schema_version":"1.0","source":{"id":"2411.00357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.00357","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"arxiv_version","alias_value":"2411.00357v1","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00357","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"pith_short_12","alias_value":"DTM2FOKVBVRH","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"pith_short_16","alias_value":"DTM2FOKVBVRHQB7K","created_at":"2026-07-05T09:29:41Z"},{"alias_kind":"pith_short_8","alias_value":"DTM2FOKV","created_at":"2026-07-05T09:29:41Z"}],"graph_snapshots":[{"event_id":"sha256:de8c401cef855e8e4ea1228292256eb34b0f62bee55e6e9c590a98d4e8de1965","target":"graph","created_at":"2026-07-05T09:29:41Z","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/2411.00357/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Rapidly-exploring Random Tree (RRT) algorithms have been applied successfully to challenging robot motion planning and under-actuated nonlinear control problems. However a fundamental limitation of the RRT approach is the slow convergence in configuration spaces with narrow channels because of the small probability of generating test points inside narrow channels. This paper presents an improved RRT algorithm that takes advantage of narrow channels between the initial and goal states to find shorter paths by improving the exploration of narrow regions in the configuration space. The proposed a","authors_text":"Akshay Chawla, Mathew Mithra Noel","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-11-01T04:46:11Z","title":"An Improved Rapidly Exploring Random Tree Algorithm for Path Planning in Configuration Spaces with Narrow Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00357","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:e2abd225d451efa3a911be0b60b20c8bc250ed99ab6a27f0206031c0e3664d60","target":"record","created_at":"2026-07-05T09:29:41Z","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":"97a96bdc6881a79e95e87ee500e7ebcfac0d8bce6d36315e5363221d3e85d389","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-11-01T04:46:11Z","title_canon_sha256":"bc5df9493369c8920a82256cab20caa51207b65ea83cb6d07fba669a0503910b"},"schema_version":"1.0","source":{"id":"2411.00357","kind":"arxiv","version":1}},"canonical_sha256":"1cd9a2b9550d627807ea16dee38c1bcf1f8729ef2bf04d6bf4cb09b54be17dc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cd9a2b9550d627807ea16dee38c1bcf1f8729ef2bf04d6bf4cb09b54be17dc3","first_computed_at":"2026-07-05T09:29:41.327125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:29:41.327125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z8wOai0Nw1tIQ7BWpbSviO9biOt7rdFAiCaOpHQRaf4RjSgfUth8ukON/tZMKbDnLdwCm3ZKMIEwXdcPrFohDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:29:41.327493Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.00357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2abd225d451efa3a911be0b60b20c8bc250ed99ab6a27f0206031c0e3664d60","sha256:de8c401cef855e8e4ea1228292256eb34b0f62bee55e6e9c590a98d4e8de1965"],"state_sha256":"87baeea54f7cd98622566023dbc556b4aeba664966d2041786441bfffb03079a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6eHhZzMGrsjI1sX0RM0Oph9SB1KJHrugEC14iYYy94F4yadzfaWBzcruNTk4/YYKIT2BaRCYERO68mxK8dnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:11:32.026341Z","bundle_sha256":"531889879dc036645bcceb6402dc70c8314d5185514945fe2b6a5c83b0d9d315"}}