{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WIVNEEZHWMI6DSVGZKBFOTSF6L","short_pith_number":"pith:WIVNEEZH","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"},"canonical_sha256":"b22ad21327b311e1caa6ca82574e45f2fcb8c6889bd53b4258040328d5303f2e","source":{"kind":"arxiv","id":"2508.19776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.19776","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"2508.19776v1","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19776","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"WIVNEEZHWMI6","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"pith_short_16","alias_value":"WIVNEEZHWMI6DSVG","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"pith_short_8","alias_value":"WIVNEEZH","created_at":"2026-07-05T12:00:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WIVNEEZHWMI6DSVGZKBFOTSF6L","target":"record","payload":{"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"},"canonical_sha256":"b22ad21327b311e1caa6ca82574e45f2fcb8c6889bd53b4258040328d5303f2e","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"},"source_kind":"arxiv","source_id":"2508.19776","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:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aUx4NcdpKHpeAbXpVFM0egg93KL+lI/LAOACoMq3HixjNZ7cDqcchTMyLj4Um+AdSUXyRzzi+njxG6ncB9vCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:13:05.389842Z"},"content_sha256":"1ef6170f76a4e13dab526e14e2b2fb671e2fd2cd078fec1d2d5ce4d02549bcdf","schema_version":"1.0","event_id":"sha256:1ef6170f76a4e13dab526e14e2b2fb671e2fd2cd078fec1d2d5ce4d02549bcdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WIVNEEZHWMI6DSVGZKBFOTSF6L","target":"graph","payload":{"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"},"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:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gu8QuHkIkII1ROIHNnDsLO2x8LafgTs2I8p4JaJmtJX4TGia4qYUyxluY+zel+9Nq7ZgJAzehzr+AbUXd5RsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:13:05.390431Z"},"content_sha256":"3c86c93524dbab133d741cb86a7d2bdfb189098720d2c913d48a5369ef7e1ea2","schema_version":"1.0","event_id":"sha256:3c86c93524dbab133d741cb86a7d2bdfb189098720d2c913d48a5369ef7e1ea2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/bundle.json","state_url":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/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-06T06:13:05Z","links":{"resolver":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L","bundle":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/bundle.json","state":"https://pith.science/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIVNEEZHWMI6DSVGZKBFOTSF6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WIVNEEZHWMI6DSVGZKBFOTSF6L","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":"1e7d087da9f42530a1c9d5bd3d96572d4e6b6011e12337db308d9d71ebfaf3b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T11:00:25Z","title_canon_sha256":"5ef71323a217b01ff3a72c6f04c08a81d3d719d7ac2791c5c1be8d31be14c2bd"},"schema_version":"1.0","source":{"id":"2508.19776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.19776","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"2508.19776v1","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19776","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"WIVNEEZHWMI6","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"pith_short_16","alias_value":"WIVNEEZHWMI6DSVG","created_at":"2026-07-05T12:00:17Z"},{"alias_kind":"pith_short_8","alias_value":"WIVNEEZH","created_at":"2026-07-05T12:00:17Z"}],"graph_snapshots":[{"event_id":"sha256:3c86c93524dbab133d741cb86a7d2bdfb189098720d2c913d48a5369ef7e1ea2","target":"graph","created_at":"2026-07-05T12:00:17Z","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/2508.19776/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alois Knoll, Fan Wu, Liding Zhang, Sami Haddadin, Yao Ling, Zhenshan Bing","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19776","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:1ef6170f76a4e13dab526e14e2b2fb671e2fd2cd078fec1d2d5ce4d02549bcdf","target":"record","created_at":"2026-07-05T12:00:17Z","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":"1e7d087da9f42530a1c9d5bd3d96572d4e6b6011e12337db308d9d71ebfaf3b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-27T11:00:25Z","title_canon_sha256":"5ef71323a217b01ff3a72c6f04c08a81d3d719d7ac2791c5c1be8d31be14c2bd"},"schema_version":"1.0","source":{"id":"2508.19776","kind":"arxiv","version":1}},"canonical_sha256":"b22ad21327b311e1caa6ca82574e45f2fcb8c6889bd53b4258040328d5303f2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b22ad21327b311e1caa6ca82574e45f2fcb8c6889bd53b4258040328d5303f2e","first_computed_at":"2026-07-05T12:00:17.610513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:00:17.610513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m0RzLIyO1kx3lS+XmgrxV7IP4gWt9qOibcXPfMnq/vOA3gZqjekpEP0D4pBX/av6D6SZhiCSWRRYV26azH2dCw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:00:17.610945Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.19776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ef6170f76a4e13dab526e14e2b2fb671e2fd2cd078fec1d2d5ce4d02549bcdf","sha256:3c86c93524dbab133d741cb86a7d2bdfb189098720d2c913d48a5369ef7e1ea2"],"state_sha256":"68eec5324f72405f2fbfceccd501e4a47770ac9d029f6991a728dcf027ab39f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcz6n2X5RSP+zH+IiUZjkHBKnaPZWOAzWrzKJ8w9xeztu1wOYb8NjoWit+bqK1dRU27ZVWZFvydMEXQgfdXaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T06:13:05.395837Z","bundle_sha256":"abb174b46f329313e1bec463da07a53a52e5b76788e867a451dd06f008975756"}}