{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VJ3YN373B3EWEL2UCGPBNUV3JZ","short_pith_number":"pith:VJ3YN373","schema_version":"1.0","canonical_sha256":"aa7786effb0ec9622f54119e16d2bb4e5072cb868227c5a07c9d7dd47b002855","source":{"kind":"arxiv","id":"2508.21549","version":1},"attestation_state":"computed","paper":{"title":"Estimated Informed Anytime Search for Sampling-Based Planning via Adaptive Sampler","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alois Knoll, Chaoqun Wang, Fan Wu, Kuanqi Cai, Liding Zhang, Sami Haddadin, Yu Zhang, Zhenshan Bing","submitted_at":"2025-08-29T12:05:01Z","abstract_excerpt":"Path planning in robotics often involves solving continuously valued, high-dimensional problems. Popular informed approaches include graph-based searches, such as A*, and sampling-based methods, such as Informed RRT*, which utilize informed set and anytime strategies to expedite path optimization incrementally. Informed sampling-based planners define informed sets as subsets of the problem domain based on the current best solution cost. However, when no solution is found, these planners re-sample and explore the entire configuration space, which is time-consuming and computationally expensive."},"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.21549","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-08-29T12:05:01Z","cross_cats_sorted":[],"title_canon_sha256":"f49904427531f14a72655accf3b4e1073e27bbbd96416ffc0456187eda1707eb","abstract_canon_sha256":"82f9b065ed7537ab94ceca668c8826bdefa0e6caacdfdcde94dac3b2f47910d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:36.526185Z","signature_b64":"EF5CRdN7+ug0FJdDCtg9i5ghFAZ8YKKqoQGIHi5/INk1swr0CcR5EL6ijHJx8DF+3zwyMMjComqkmS3h2UG1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7786effb0ec9622f54119e16d2bb4e5072cb868227c5a07c9d7dd47b002855","last_reissued_at":"2026-07-05T12:01:36.525608Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:36.525608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimated Informed Anytime Search for Sampling-Based Planning via Adaptive Sampler","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alois Knoll, Chaoqun Wang, Fan Wu, Kuanqi Cai, Liding Zhang, Sami Haddadin, Yu Zhang, Zhenshan Bing","submitted_at":"2025-08-29T12:05:01Z","abstract_excerpt":"Path planning in robotics often involves solving continuously valued, high-dimensional problems. Popular informed approaches include graph-based searches, such as A*, and sampling-based methods, such as Informed RRT*, which utilize informed set and anytime strategies to expedite path optimization incrementally. Informed sampling-based planners define informed sets as subsets of the problem domain based on the current best solution cost. However, when no solution is found, these planners re-sample and explore the entire configuration space, which is time-consuming and computationally expensive."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21549","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.21549/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.21549","created_at":"2026-07-05T12:01:36.525674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.21549v1","created_at":"2026-07-05T12:01:36.525674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21549","created_at":"2026-07-05T12:01:36.525674+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJ3YN373B3EW","created_at":"2026-07-05T12:01:36.525674+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJ3YN373B3EWEL2U","created_at":"2026-07-05T12:01:36.525674+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJ3YN373","created_at":"2026-07-05T12:01:36.525674+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/VJ3YN373B3EWEL2UCGPBNUV3JZ","json":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ.json","graph_json":"https://pith.science/api/pith-number/VJ3YN373B3EWEL2UCGPBNUV3JZ/graph.json","events_json":"https://pith.science/api/pith-number/VJ3YN373B3EWEL2UCGPBNUV3JZ/events.json","paper":"https://pith.science/paper/VJ3YN373"},"agent_actions":{"view_html":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ","download_json":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ.json","view_paper":"https://pith.science/paper/VJ3YN373","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.21549&json=true","fetch_graph":"https://pith.science/api/pith-number/VJ3YN373B3EWEL2UCGPBNUV3JZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VJ3YN373B3EWEL2UCGPBNUV3JZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ/action/storage_attestation","attest_author":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ/action/author_attestation","sign_citation":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ/action/citation_signature","submit_replication":"https://pith.science/pith/VJ3YN373B3EWEL2UCGPBNUV3JZ/action/replication_record"}},"created_at":"2026-07-05T12:01:36.525674+00:00","updated_at":"2026-07-05T12:01:36.525674+00:00"}