{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CLORXR3N4DAQA3UKCLDMRKFGDY","short_pith_number":"pith:CLORXR3N","canonical_record":{"source":{"id":"2509.08521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-09-10T11:57:56Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"7d21ea5a5df6d3e2005d142e0e95e68df6e63409a31332dfaf96f45e5a64da4f","abstract_canon_sha256":"9e0f5e92e096fb751aba90e1364c807b03c9ab6c5048397454f178ac2f5be22c"},"schema_version":"1.0"},"canonical_sha256":"12dd1bc76de0c1006e8a12c6c8a8a61e209f513586338949230e6c8d236b9aa0","source":{"kind":"arxiv","id":"2509.08521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08521","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08521v1","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08521","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"CLORXR3N4DAQ","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_16","alias_value":"CLORXR3N4DAQA3UK","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_8","alias_value":"CLORXR3N","created_at":"2026-07-05T12:08:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CLORXR3N4DAQA3UKCLDMRKFGDY","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-09-10T11:57:56Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"7d21ea5a5df6d3e2005d142e0e95e68df6e63409a31332dfaf96f45e5a64da4f","abstract_canon_sha256":"9e0f5e92e096fb751aba90e1364c807b03c9ab6c5048397454f178ac2f5be22c"},"schema_version":"1.0"},"canonical_sha256":"12dd1bc76de0c1006e8a12c6c8a8a61e209f513586338949230e6c8d236b9aa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:31.674267Z","signature_b64":"IbaVz9R97qeSlO+d6JfcxYYqYAW/2I5XMflT/cd2PjjDPTGQUxqZFLkNUV2jBVgcecBq5MG1hYecVE5Tj9wDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12dd1bc76de0c1006e8a12c6c8a8a61e209f513586338949230e6c8d236b9aa0","last_reissued_at":"2026-07-05T12:08:31.673748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:31.673748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08521","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-05T12:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WppJcJDwu1f8rrkbK/V2CrhzetLODmqS92zK2S64redQNRIjl1Xct3ttIyXAi6vxzIoGctkUqUAT8lspk4WoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:01:22.357894Z"},"content_sha256":"10ba46d3e3ae4c52b1ffc696b6edb77e06bd7afa65ab6009c889b363dfdf0bf5","schema_version":"1.0","event_id":"sha256:10ba46d3e3ae4c52b1ffc696b6edb77e06bd7afa65ab6009c889b363dfdf0bf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CLORXR3N4DAQA3UKCLDMRKFGDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Soheil Espahbodini Nia","submitted_at":"2025-09-10T11:57:56Z","abstract_excerpt":"Path planning in dynamic environments remains a core challenge in robotics, especially as autonomous systems are deployed in unpredictable spaces such as warehouses and public roads. While algorithms like Fast Marching Tree (FMT$^{*}$) offer asymptotically optimal solutions in static settings, their single-pass design prevents path revisions which are essential for real-time adaptation. On the other hand, full replanning is often too computationally expensive. This paper introduces FMT$^{x}$, an extension of the Fast Marching Tree algorithm that enables efficient and consistent replanning in d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08521","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/2509.08521/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-05T12:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZyjWhgVny+5xfzv7ikYT1PIXDR2BD7VVIZk/DUQU28nSYlKIlZTjZ9MAxZFYRRQ7Cb3ttwXQDxMlVR50ZCKpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:01:22.358645Z"},"content_sha256":"7930d4ded8bfeed477980accb0d0460f080550623e7ab2d9975499ed32e49a6d","schema_version":"1.0","event_id":"sha256:7930d4ded8bfeed477980accb0d0460f080550623e7ab2d9975499ed32e49a6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/bundle.json","state_url":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/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-20T21:01:22Z","links":{"resolver":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY","bundle":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/bundle.json","state":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CLORXR3N4DAQA3UKCLDMRKFGDY","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":"9e0f5e92e096fb751aba90e1364c807b03c9ab6c5048397454f178ac2f5be22c","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-09-10T11:57:56Z","title_canon_sha256":"7d21ea5a5df6d3e2005d142e0e95e68df6e63409a31332dfaf96f45e5a64da4f"},"schema_version":"1.0","source":{"id":"2509.08521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08521","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08521v1","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08521","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"CLORXR3N4DAQ","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_16","alias_value":"CLORXR3N4DAQA3UK","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_8","alias_value":"CLORXR3N","created_at":"2026-07-05T12:08:31Z"}],"graph_snapshots":[{"event_id":"sha256:7930d4ded8bfeed477980accb0d0460f080550623e7ab2d9975499ed32e49a6d","target":"graph","created_at":"2026-07-05T12:08:31Z","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/2509.08521/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Path planning in dynamic environments remains a core challenge in robotics, especially as autonomous systems are deployed in unpredictable spaces such as warehouses and public roads. While algorithms like Fast Marching Tree (FMT$^{*}$) offer asymptotically optimal solutions in static settings, their single-pass design prevents path revisions which are essential for real-time adaptation. On the other hand, full replanning is often too computationally expensive. This paper introduces FMT$^{x}$, an extension of the Fast Marching Tree algorithm that enables efficient and consistent replanning in d","authors_text":"Soheil Espahbodini Nia","cross_cats":["cs.AI","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08521","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:10ba46d3e3ae4c52b1ffc696b6edb77e06bd7afa65ab6009c889b363dfdf0bf5","target":"record","created_at":"2026-07-05T12:08:31Z","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":"9e0f5e92e096fb751aba90e1364c807b03c9ab6c5048397454f178ac2f5be22c","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-09-10T11:57:56Z","title_canon_sha256":"7d21ea5a5df6d3e2005d142e0e95e68df6e63409a31332dfaf96f45e5a64da4f"},"schema_version":"1.0","source":{"id":"2509.08521","kind":"arxiv","version":1}},"canonical_sha256":"12dd1bc76de0c1006e8a12c6c8a8a61e209f513586338949230e6c8d236b9aa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12dd1bc76de0c1006e8a12c6c8a8a61e209f513586338949230e6c8d236b9aa0","first_computed_at":"2026-07-05T12:08:31.673748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:08:31.673748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IbaVz9R97qeSlO+d6JfcxYYqYAW/2I5XMflT/cd2PjjDPTGQUxqZFLkNUV2jBVgcecBq5MG1hYecVE5Tj9wDBA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:08:31.674267Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10ba46d3e3ae4c52b1ffc696b6edb77e06bd7afa65ab6009c889b363dfdf0bf5","sha256:7930d4ded8bfeed477980accb0d0460f080550623e7ab2d9975499ed32e49a6d"],"state_sha256":"58081d9d3cc4156111a0df802fef22347f8cb4c27764bab9e2a94e5a69b866ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZDvGgTAk20ejCJUDR2PL6KYkp0HozOSLwwP/gYoPA+0LWDfqwAsv5zbRX8qIpqULlzW4aIq8jwbb2T83zbnCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T21:01:22.364172Z","bundle_sha256":"e2a2a7c00d145e1cc80281c19f5cdbddea82cdaee223e43e1b0b55b4cab6c757"}}