{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CLORXR3N4DAQA3UKCLDMRKFGDY","short_pith_number":"pith:CLORXR3N","schema_version":"1.0","canonical_sha256":"12dd1bc76de0c1006e8a12c6c8a8a61e209f513586338949230e6c8d236b9aa0","source":{"kind":"arxiv","id":"2509.08521","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.08521","created_at":"2026-07-05T12:08:31.673815+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08521v1","created_at":"2026-07-05T12:08:31.673815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08521","created_at":"2026-07-05T12:08:31.673815+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLORXR3N4DAQ","created_at":"2026-07-05T12:08:31.673815+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLORXR3N4DAQA3UK","created_at":"2026-07-05T12:08:31.673815+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLORXR3N","created_at":"2026-07-05T12:08:31.673815+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY","json":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY.json","graph_json":"https://pith.science/api/pith-number/CLORXR3N4DAQA3UKCLDMRKFGDY/graph.json","events_json":"https://pith.science/api/pith-number/CLORXR3N4DAQA3UKCLDMRKFGDY/events.json","paper":"https://pith.science/paper/CLORXR3N"},"agent_actions":{"view_html":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY","download_json":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY.json","view_paper":"https://pith.science/paper/CLORXR3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08521&json=true","fetch_graph":"https://pith.science/api/pith-number/CLORXR3N4DAQA3UKCLDMRKFGDY/graph.json","fetch_events":"https://pith.science/api/pith-number/CLORXR3N4DAQA3UKCLDMRKFGDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/action/storage_attestation","attest_author":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/action/author_attestation","sign_citation":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/action/citation_signature","submit_replication":"https://pith.science/pith/CLORXR3N4DAQA3UKCLDMRKFGDY/action/replication_record"}},"created_at":"2026-07-05T12:08:31.673815+00:00","updated_at":"2026-07-05T12:08:31.673815+00:00"}