{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WIVNEEZHWMI6DSVGZKBFOTSF6L","short_pith_number":"pith:WIVNEEZH","schema_version":"1.0","canonical_sha256":"b22ad21327b311e1caa6ca82574e45f2fcb8c6889bd53b4258040328d5303f2e","source":{"kind":"arxiv","id":"2508.19776","version":1},"attestation_state":"computed","paper":{"title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alois Knoll, Fan Wu, Liding Zhang, Sami Haddadin, Yao Ling, Zhenshan Bing","submitted_at":"2025-08-27T11:00:25Z","abstract_excerpt":"Bidirectional motion planning often reduces planning time compared to its unidirectional counterparts. It requires connecting the forward and reverse search trees to form a continuous path. However, this process could fail and restart the asymmetric bidirectional search due to the limitations of lazy-reverse search. To address this challenge, we propose Greedy GuILD Grafting Trees (G3T*), a novel path planner that grafts invalid edge connections at both ends to re-establish tree-based connectivity, enabling rapid path convergence. G3T* employs a greedy approach using the minimum Lebesgue measu"},"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":"2508.19776","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T11:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"5ef71323a217b01ff3a72c6f04c08a81d3d719d7ac2791c5c1be8d31be14c2bd","abstract_canon_sha256":"1e7d087da9f42530a1c9d5bd3d96572d4e6b6011e12337db308d9d71ebfaf3b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:17.610945Z","signature_b64":"m0RzLIyO1kx3lS+XmgrxV7IP4gWt9qOibcXPfMnq/vOA3gZqjekpEP0D4pBX/av6D6SZhiCSWRRYV26azH2dCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22ad21327b311e1caa6ca82574e45f2fcb8c6889bd53b4258040328d5303f2e","last_reissued_at":"2026-07-05T12:00:17.610513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:17.610513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alois Knoll, Fan Wu, Liding Zhang, Sami Haddadin, Yao Ling, Zhenshan Bing","submitted_at":"2025-08-27T11:00:25Z","abstract_excerpt":"Bidirectional motion planning often reduces planning time compared to its unidirectional counterparts. It requires connecting the forward and reverse search trees to form a continuous path. However, this process could fail and restart the asymmetric bidirectional search due to the limitations of lazy-reverse search. To address this challenge, we propose Greedy GuILD Grafting Trees (G3T*), a novel path planner that grafts invalid edge connections at both ends to re-establish tree-based connectivity, enabling rapid path convergence. G3T* employs a greedy approach using the minimum Lebesgue measu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19776","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/2508.19776/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":"2508.19776","created_at":"2026-07-05T12:00:17.610571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.19776v1","created_at":"2026-07-05T12:00:17.610571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19776","created_at":"2026-07-05T12:00:17.610571+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIVNEEZHWMI6","created_at":"2026-07-05T12:00:17.610571+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIVNEEZHWMI6DSVG","created_at":"2026-07-05T12:00:17.610571+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIVNEEZH","created_at":"2026-07-05T12:00:17.610571+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/WIVNEEZHWMI6DSVGZKBFOTSF6L","json":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L.json","graph_json":"https://pith.science/api/pith-number/WIVNEEZHWMI6DSVGZKBFOTSF6L/graph.json","events_json":"https://pith.science/api/pith-number/WIVNEEZHWMI6DSVGZKBFOTSF6L/events.json","paper":"https://pith.science/paper/WIVNEEZH"},"agent_actions":{"view_html":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L","download_json":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L.json","view_paper":"https://pith.science/paper/WIVNEEZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.19776&json=true","fetch_graph":"https://pith.science/api/pith-number/WIVNEEZHWMI6DSVGZKBFOTSF6L/graph.json","fetch_events":"https://pith.science/api/pith-number/WIVNEEZHWMI6DSVGZKBFOTSF6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/action/storage_attestation","attest_author":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/action/author_attestation","sign_citation":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/action/citation_signature","submit_replication":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/action/replication_record"}},"created_at":"2026-07-05T12:00:17.610571+00:00","updated_at":"2026-07-05T12:00:17.610571+00:00"}