{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GDHOJGCZGYLGVWQMYYCTGPKYKH","short_pith_number":"pith:GDHOJGCZ","schema_version":"1.0","canonical_sha256":"30cee4985936166ada0cc605333d5851e15f68b6806eb5b52e9cfa73802a15d8","source":{"kind":"arxiv","id":"1705.02403","version":1},"attestation_state":"computed","paper":{"title":"Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brian Ichter, Edward Schmerling, Marco Pavone","submitted_at":"2017-05-05T21:43:59Z","abstract_excerpt":"This paper presents a novel approach, named the Group Marching Tree (GMT*) algorithm, to planning on GPUs at rates amenable to application within control loops, allowing planning in real-world settings via repeated computation of near-optimal plans. GMT*, like the Fast Marching Tree (FMT) algorithm, explores the state space with a \"lazy\" dynamic programming recursion on a set of samples to grow a tree of near-optimal paths. GMT*, however, alters the approach of FMT with approximate dynamic programming by expanding, in parallel, the group of all active samples with cost below an increasing thre"},"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":"1705.02403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-05T21:43:59Z","cross_cats_sorted":[],"title_canon_sha256":"70ef7dc19f7467e74b2cbcfcdb8aab619522687875ec78ef58431750258f600a","abstract_canon_sha256":"299a641ea423cb933f79bc35122ad39e5ba2c6a9afa75891c76ea3c74c712364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:56.677532Z","signature_b64":"yQEyzskfQS2LJM7aYyqebBQ2z1VSKSR2N+X2/BOvaP44WwJNKItKma+kLQSydXseSlTJQamm986YgIepaLowAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30cee4985936166ada0cc605333d5851e15f68b6806eb5b52e9cfa73802a15d8","last_reissued_at":"2026-05-18T00:44:56.676852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:56.676852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brian Ichter, Edward Schmerling, Marco Pavone","submitted_at":"2017-05-05T21:43:59Z","abstract_excerpt":"This paper presents a novel approach, named the Group Marching Tree (GMT*) algorithm, to planning on GPUs at rates amenable to application within control loops, allowing planning in real-world settings via repeated computation of near-optimal plans. GMT*, like the Fast Marching Tree (FMT) algorithm, explores the state space with a \"lazy\" dynamic programming recursion on a set of samples to grow a tree of near-optimal paths. GMT*, however, alters the approach of FMT with approximate dynamic programming by expanding, in parallel, the group of all active samples with cost below an increasing thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02403","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":""},"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":"1705.02403","created_at":"2026-05-18T00:44:56.676965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02403v1","created_at":"2026-05-18T00:44:56.676965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02403","created_at":"2026-05-18T00:44:56.676965+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDHOJGCZGYLG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDHOJGCZGYLGVWQM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDHOJGCZ","created_at":"2026-05-18T12:31:15.632608+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/GDHOJGCZGYLGVWQMYYCTGPKYKH","json":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH.json","graph_json":"https://pith.science/api/pith-number/GDHOJGCZGYLGVWQMYYCTGPKYKH/graph.json","events_json":"https://pith.science/api/pith-number/GDHOJGCZGYLGVWQMYYCTGPKYKH/events.json","paper":"https://pith.science/paper/GDHOJGCZ"},"agent_actions":{"view_html":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH","download_json":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH.json","view_paper":"https://pith.science/paper/GDHOJGCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02403&json=true","fetch_graph":"https://pith.science/api/pith-number/GDHOJGCZGYLGVWQMYYCTGPKYKH/graph.json","fetch_events":"https://pith.science/api/pith-number/GDHOJGCZGYLGVWQMYYCTGPKYKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH/action/storage_attestation","attest_author":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH/action/author_attestation","sign_citation":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH/action/citation_signature","submit_replication":"https://pith.science/pith/GDHOJGCZGYLGVWQMYYCTGPKYKH/action/replication_record"}},"created_at":"2026-05-18T00:44:56.676965+00:00","updated_at":"2026-05-18T00:44:56.676965+00:00"}