{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NUHFNXQDIGS7V2CFAVYJKC4AAG","short_pith_number":"pith:NUHFNXQD","schema_version":"1.0","canonical_sha256":"6d0e56de0341a5fae8450570950b80018ac994b0e3fd926507d2d7af93666bcb","source":{"kind":"arxiv","id":"2002.06589","version":1},"attestation_state":"computed","paper":{"title":"Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathan D. Gammell, Marlin P. Strub","submitted_at":"2020-02-16T15:06:34Z","abstract_excerpt":"Path planning is an active area of research essential for many applications in robotics. Popular techniques include graph-based searches and sampling-based planners. These approaches are powerful but have limitations. This paper continues work to combine their strengths and mitigate their limitations using a unified planning paradigm. It does this by viewing the path planning problem as the two subproblems of search and approximation and using advanced graph-search techniques on a sampling-based approximation. This perspective leads to Advanced BIT*. ABIT* combines truncated anytime graph-base"},"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":"2002.06589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-02-16T15:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"b0704727e525cc349ca8c44be16e2303926c4cae62ce4c9c3e3d906caddbd904","abstract_canon_sha256":"8967a7617ae7486ba39e15a157aeb1713f678381af94c878c54bb16c15cfb0e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:08.346226Z","signature_b64":"CGc2WYVKoYIbsAIj9nVucfbDlNCtA6335IvQeExVztvwMSU/nicL9TxhILgyJ4Ni5VKZzOsfzSjDzZDcqTSdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0e56de0341a5fae8450570950b80018ac994b0e3fd926507d2d7af93666bcb","last_reissued_at":"2026-07-05T01:58:08.345810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:08.345810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathan D. Gammell, Marlin P. Strub","submitted_at":"2020-02-16T15:06:34Z","abstract_excerpt":"Path planning is an active area of research essential for many applications in robotics. Popular techniques include graph-based searches and sampling-based planners. These approaches are powerful but have limitations. This paper continues work to combine their strengths and mitigate their limitations using a unified planning paradigm. It does this by viewing the path planning problem as the two subproblems of search and approximation and using advanced graph-search techniques on a sampling-based approximation. This perspective leads to Advanced BIT*. ABIT* combines truncated anytime graph-base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06589","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/2002.06589/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":"2002.06589","created_at":"2026-07-05T01:58:08.345879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.06589v1","created_at":"2026-07-05T01:58:08.345879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06589","created_at":"2026-07-05T01:58:08.345879+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUHFNXQDIGS7","created_at":"2026-07-05T01:58:08.345879+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUHFNXQDIGS7V2CF","created_at":"2026-07-05T01:58:08.345879+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUHFNXQD","created_at":"2026-07-05T01:58:08.345879+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/NUHFNXQDIGS7V2CFAVYJKC4AAG","json":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG.json","graph_json":"https://pith.science/api/pith-number/NUHFNXQDIGS7V2CFAVYJKC4AAG/graph.json","events_json":"https://pith.science/api/pith-number/NUHFNXQDIGS7V2CFAVYJKC4AAG/events.json","paper":"https://pith.science/paper/NUHFNXQD"},"agent_actions":{"view_html":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG","download_json":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG.json","view_paper":"https://pith.science/paper/NUHFNXQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.06589&json=true","fetch_graph":"https://pith.science/api/pith-number/NUHFNXQDIGS7V2CFAVYJKC4AAG/graph.json","fetch_events":"https://pith.science/api/pith-number/NUHFNXQDIGS7V2CFAVYJKC4AAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG/action/storage_attestation","attest_author":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG/action/author_attestation","sign_citation":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG/action/citation_signature","submit_replication":"https://pith.science/pith/NUHFNXQDIGS7V2CFAVYJKC4AAG/action/replication_record"}},"created_at":"2026-07-05T01:58:08.345879+00:00","updated_at":"2026-07-05T01:58:08.345879+00:00"}