{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GCO2SZ73RSVTEN77WOMNKEVTZE","short_pith_number":"pith:GCO2SZ73","canonical_record":{"source":{"id":"2205.06940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-14T01:32:45Z","cross_cats_sorted":[],"title_canon_sha256":"eb8d5656ba28be753c04de35f99b12821a3e788211a13a5bee59aa3211a64546","abstract_canon_sha256":"9151305f6a20f613d8fc1b884b7b5cf8a02455a10adc2dd2c35cb0a4c8536731"},"schema_version":"1.0"},"canonical_sha256":"309da967fb8cab3237ffb398d512b3c93de1457e8f95ce793d5f00146b5adb33","source":{"kind":"arxiv","id":"2205.06940","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.06940","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"2205.06940v2","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.06940","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"GCO2SZ73RSVT","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"pith_short_16","alias_value":"GCO2SZ73RSVTEN77","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"pith_short_8","alias_value":"GCO2SZ73","created_at":"2026-07-05T06:13:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GCO2SZ73RSVTEN77WOMNKEVTZE","target":"record","payload":{"canonical_record":{"source":{"id":"2205.06940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-14T01:32:45Z","cross_cats_sorted":[],"title_canon_sha256":"eb8d5656ba28be753c04de35f99b12821a3e788211a13a5bee59aa3211a64546","abstract_canon_sha256":"9151305f6a20f613d8fc1b884b7b5cf8a02455a10adc2dd2c35cb0a4c8536731"},"schema_version":"1.0"},"canonical_sha256":"309da967fb8cab3237ffb398d512b3c93de1457e8f95ce793d5f00146b5adb33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:36.353242Z","signature_b64":"tZeUbwOrNMMyMtdA+MMrGZL1wduLTof0CY+eN43mw75/N3AK9its5apB2BJ2K43q+4yHTYDOKO+p11d9/8J0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309da967fb8cab3237ffb398d512b3c93de1457e8f95ce793d5f00146b5adb33","last_reissued_at":"2026-07-05T06:13:36.352587Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:36.352587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.06940","source_version":2,"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-05T06:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6yf7U6lLR6+A8PyFpL+kQwof9YqmBwU+bJnTArxBokBO8Njk6H928kFFydL4dNUB5jRt3nrch21iEthTAGFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T11:03:35.675247Z"},"content_sha256":"0a4f5db627bac9d11cc1f162112220a8c8e02b7fc04141c1eeadfdc9406998ce","schema_version":"1.0","event_id":"sha256:0a4f5db627bac9d11cc1f162112220a8c8e02b7fc04141c1eeadfdc9406998ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GCO2SZ73RSVTEN77WOMNKEVTZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BiAIT*: Symmetrical Bidirectional Optimal Path Planning with Adaptive Heuristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chenming Li, Han Ma, Jiankun Wang, Max Q.-H. Meng, Peng Xu","submitted_at":"2022-05-14T01:32:45Z","abstract_excerpt":"Adaptively Informed Trees (AIT*) is an algorithm that uses the problem-specific heuristic to avoid unnecessary searches, which significantly improves its performance, especially when collision checking is expensive. However, the heuristic estimation in AIT* consumes lots of computational resources, and its asymmetric bidirectional searching strategy cannot fully exploit the potential of the bidirectional method. In this article, we propose an extension of AIT* called BiAIT*. Unlike AIT*, BiAIT* uses symmetrical bidirectional search for both the heuristic and space searching. The proposed metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.06940","kind":"arxiv","version":2},"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/2205.06940/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-05T06:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQaWphZVkmpn2I9fx0H7i7AZmSrX8wKl5xAObwyW4nT0kbc/D4A2H1dPWLBW9pq7klTw4QXFzk2CjsEGUwWBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T11:03:35.675628Z"},"content_sha256":"8c8c80150204a807aa86b15d42cc7b1ea4f28b86560a7cf95cfde14b072b0043","schema_version":"1.0","event_id":"sha256:8c8c80150204a807aa86b15d42cc7b1ea4f28b86560a7cf95cfde14b072b0043"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCO2SZ73RSVTEN77WOMNKEVTZE/bundle.json","state_url":"https://pith.science/pith/GCO2SZ73RSVTEN77WOMNKEVTZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCO2SZ73RSVTEN77WOMNKEVTZE/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-07-14T11:03:35Z","links":{"resolver":"https://pith.science/pith/GCO2SZ73RSVTEN77WOMNKEVTZE","bundle":"https://pith.science/pith/GCO2SZ73RSVTEN77WOMNKEVTZE/bundle.json","state":"https://pith.science/pith/GCO2SZ73RSVTEN77WOMNKEVTZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCO2SZ73RSVTEN77WOMNKEVTZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GCO2SZ73RSVTEN77WOMNKEVTZE","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":"9151305f6a20f613d8fc1b884b7b5cf8a02455a10adc2dd2c35cb0a4c8536731","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-14T01:32:45Z","title_canon_sha256":"eb8d5656ba28be753c04de35f99b12821a3e788211a13a5bee59aa3211a64546"},"schema_version":"1.0","source":{"id":"2205.06940","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.06940","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"2205.06940v2","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.06940","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"GCO2SZ73RSVT","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"pith_short_16","alias_value":"GCO2SZ73RSVTEN77","created_at":"2026-07-05T06:13:36Z"},{"alias_kind":"pith_short_8","alias_value":"GCO2SZ73","created_at":"2026-07-05T06:13:36Z"}],"graph_snapshots":[{"event_id":"sha256:8c8c80150204a807aa86b15d42cc7b1ea4f28b86560a7cf95cfde14b072b0043","target":"graph","created_at":"2026-07-05T06:13:36Z","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/2205.06940/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Adaptively Informed Trees (AIT*) is an algorithm that uses the problem-specific heuristic to avoid unnecessary searches, which significantly improves its performance, especially when collision checking is expensive. However, the heuristic estimation in AIT* consumes lots of computational resources, and its asymmetric bidirectional searching strategy cannot fully exploit the potential of the bidirectional method. In this article, we propose an extension of AIT* called BiAIT*. Unlike AIT*, BiAIT* uses symmetrical bidirectional search for both the heuristic and space searching. The proposed metho","authors_text":"Chenming Li, Han Ma, Jiankun Wang, Max Q.-H. Meng, Peng Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-14T01:32:45Z","title":"BiAIT*: Symmetrical Bidirectional Optimal Path Planning with Adaptive Heuristic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.06940","kind":"arxiv","version":2},"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:0a4f5db627bac9d11cc1f162112220a8c8e02b7fc04141c1eeadfdc9406998ce","target":"record","created_at":"2026-07-05T06:13:36Z","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":"9151305f6a20f613d8fc1b884b7b5cf8a02455a10adc2dd2c35cb0a4c8536731","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-14T01:32:45Z","title_canon_sha256":"eb8d5656ba28be753c04de35f99b12821a3e788211a13a5bee59aa3211a64546"},"schema_version":"1.0","source":{"id":"2205.06940","kind":"arxiv","version":2}},"canonical_sha256":"309da967fb8cab3237ffb398d512b3c93de1457e8f95ce793d5f00146b5adb33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"309da967fb8cab3237ffb398d512b3c93de1457e8f95ce793d5f00146b5adb33","first_computed_at":"2026-07-05T06:13:36.352587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:13:36.352587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tZeUbwOrNMMyMtdA+MMrGZL1wduLTof0CY+eN43mw75/N3AK9its5apB2BJ2K43q+4yHTYDOKO+p11d9/8J0DA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:13:36.353242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.06940","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a4f5db627bac9d11cc1f162112220a8c8e02b7fc04141c1eeadfdc9406998ce","sha256:8c8c80150204a807aa86b15d42cc7b1ea4f28b86560a7cf95cfde14b072b0043"],"state_sha256":"c27c420bf9597d09f2a555b00fa82b93696035d6f3d94a4e197c1642984777a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ev/BPOXJV3Qi7VVqcTNsBlMjsg0vRNIbUn8VWa3JtY/EQh16eMRdtf8cVJ+5JIA2zjPvhoZDl/SXhbSnEhIPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T11:03:35.677736Z","bundle_sha256":"213a8a263f316e33848e023ec6a7b2fbb4487f1737a71b97dd27b37139eb7deb"}}