{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GU7IMIDR62TLKF3G4N7E6HV3W7","short_pith_number":"pith:GU7IMIDR","schema_version":"1.0","canonical_sha256":"353e862071f6a6b51766e37e4f1ebbb7cd91c71b893398867843e632ec33ecae","source":{"kind":"arxiv","id":"1306.3532","version":4},"attestation_state":"computed","paper":{"title":"Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ashley Clark, Edward Schmerling, Lucas Janson, Marco Pavone","submitted_at":"2013-06-15T00:10:05Z","abstract_excerpt":"In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT*). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art counterparts, chiefly PRM* and RRT*. The FMT* algorithm performs a \"lazy\" dynamic programming recursion on a predetermined number of probabilistically-drawn samples to grow a tree of paths, which moves stead"},"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":"1306.3532","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-06-15T00:10:05Z","cross_cats_sorted":[],"title_canon_sha256":"fe95066cbe0743b2201fc23baf8bf5ff9c9376dd93116110bb3d8ca97e5f3e0d","abstract_canon_sha256":"636165d6d1cd40be393b7c3522e4723d8c2e17115a4afcb2e3c4604cdbdbd6b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:51.311703Z","signature_b64":"C+Jr9DOqGPSWoLeCXRPct8VenklGqVcYKCgCds+tR9S5RrEreJuEamAUu7a6/mK8uxGloBUm8OQrx6tcCE9CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"353e862071f6a6b51766e37e4f1ebbb7cd91c71b893398867843e632ec33ecae","last_reissued_at":"2026-05-18T02:27:51.311282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:51.311282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ashley Clark, Edward Schmerling, Lucas Janson, Marco Pavone","submitted_at":"2013-06-15T00:10:05Z","abstract_excerpt":"In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT*). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art counterparts, chiefly PRM* and RRT*. The FMT* algorithm performs a \"lazy\" dynamic programming recursion on a predetermined number of probabilistically-drawn samples to grow a tree of paths, which moves stead"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3532","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1306.3532","created_at":"2026-05-18T02:27:51.311351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3532v4","created_at":"2026-05-18T02:27:51.311351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3532","created_at":"2026-05-18T02:27:51.311351+00:00"},{"alias_kind":"pith_short_12","alias_value":"GU7IMIDR62TL","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GU7IMIDR62TLKF3G","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GU7IMIDR","created_at":"2026-05-18T12:27:45.050594+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/GU7IMIDR62TLKF3G4N7E6HV3W7","json":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7.json","graph_json":"https://pith.science/api/pith-number/GU7IMIDR62TLKF3G4N7E6HV3W7/graph.json","events_json":"https://pith.science/api/pith-number/GU7IMIDR62TLKF3G4N7E6HV3W7/events.json","paper":"https://pith.science/paper/GU7IMIDR"},"agent_actions":{"view_html":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7","download_json":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7.json","view_paper":"https://pith.science/paper/GU7IMIDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3532&json=true","fetch_graph":"https://pith.science/api/pith-number/GU7IMIDR62TLKF3G4N7E6HV3W7/graph.json","fetch_events":"https://pith.science/api/pith-number/GU7IMIDR62TLKF3G4N7E6HV3W7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7/action/storage_attestation","attest_author":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7/action/author_attestation","sign_citation":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7/action/citation_signature","submit_replication":"https://pith.science/pith/GU7IMIDR62TLKF3G4N7E6HV3W7/action/replication_record"}},"created_at":"2026-05-18T02:27:51.311351+00:00","updated_at":"2026-05-18T02:27:51.311351+00:00"}